/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.use.bitabs.translation true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-82.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-19 15:54:09,459 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-19 15:54:09,533 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2023-12-19 15:54:09,537 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-19 15:54:09,538 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-19 15:54:09,560 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-19 15:54:09,560 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-19 15:54:09,560 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-19 15:54:09,561 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-19 15:54:09,564 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-19 15:54:09,564 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-19 15:54:09,564 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-19 15:54:09,565 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-19 15:54:09,566 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-19 15:54:09,566 INFO L153 SettingsManager]: * Use SBE=true [2023-12-19 15:54:09,566 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-19 15:54:09,566 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-19 15:54:09,566 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-19 15:54:09,567 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-19 15:54:09,567 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-19 15:54:09,567 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-19 15:54:09,567 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-19 15:54:09,567 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-19 15:54:09,567 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-19 15:54:09,568 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-19 15:54:09,568 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-19 15:54:09,568 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-19 15:54:09,568 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-19 15:54:09,568 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-19 15:54:09,569 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-19 15:54:09,569 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-19 15:54:09,569 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-19 15:54:09,569 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-19 15:54:09,570 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-19 15:54:09,570 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-19 15:54:09,570 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-19 15:54:09,570 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-19 15:54:09,570 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-19 15:54:09,570 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-19 15:54:09,570 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-19 15:54:09,570 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-19 15:54:09,571 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-19 15:54:09,571 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-19 15:54:09,571 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Use bitabs translation -> true [2023-12-19 15:54:09,752 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-19 15:54:09,775 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-19 15:54:09,777 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-19 15:54:09,778 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-19 15:54:09,778 INFO L274 PluginConnector]: CDTParser initialized [2023-12-19 15:54:09,779 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-82.i [2023-12-19 15:54:10,807 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-19 15:54:10,952 INFO L384 CDTParser]: Found 1 translation units. [2023-12-19 15:54:10,953 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-82.i [2023-12-19 15:54:10,958 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6823faa2a/7f50400bc525447a889508b0612768a6/FLAG538d6a869 [2023-12-19 15:54:10,967 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6823faa2a/7f50400bc525447a889508b0612768a6 [2023-12-19 15:54:10,969 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-19 15:54:10,970 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-19 15:54:10,971 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-19 15:54:10,971 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-19 15:54:10,978 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-19 15:54:10,979 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 03:54:10" (1/1) ... [2023-12-19 15:54:10,979 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50ea72ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:54:10, skipping insertion in model container [2023-12-19 15:54:10,980 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 03:54:10" (1/1) ... [2023-12-19 15:54:11,007 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-19 15:54:11,097 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-82.i[916,929] [2023-12-19 15:54:11,133 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-19 15:54:11,140 INFO L202 MainTranslator]: Completed pre-run [2023-12-19 15:54:11,147 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-82.i[916,929] [2023-12-19 15:54:11,171 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-19 15:54:11,183 INFO L206 MainTranslator]: Completed translation [2023-12-19 15:54:11,183 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:54:11 WrapperNode [2023-12-19 15:54:11,183 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-19 15:54:11,184 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-19 15:54:11,184 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-19 15:54:11,184 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-19 15:54:11,188 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:54:11" (1/1) ... [2023-12-19 15:54:11,203 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:54:11" (1/1) ... [2023-12-19 15:54:11,239 INFO L138 Inliner]: procedures = 29, calls = 159, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 512 [2023-12-19 15:54:11,239 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-19 15:54:11,240 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-19 15:54:11,240 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-19 15:54:11,240 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-19 15:54:11,254 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:54:11" (1/1) ... [2023-12-19 15:54:11,254 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:54:11" (1/1) ... [2023-12-19 15:54:11,258 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:54:11" (1/1) ... [2023-12-19 15:54:11,278 INFO L175 MemorySlicer]: Split 133 memory accesses to 2 slices as follows [2, 131]. 98 percent of accesses are in the largest equivalence class. The 16 initializations are split as follows [2, 14]. The 17 writes are split as follows [0, 17]. [2023-12-19 15:54:11,278 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:54:11" (1/1) ... [2023-12-19 15:54:11,278 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:54:11" (1/1) ... [2023-12-19 15:54:11,301 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:54:11" (1/1) ... [2023-12-19 15:54:11,304 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:54:11" (1/1) ... [2023-12-19 15:54:11,306 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:54:11" (1/1) ... [2023-12-19 15:54:11,308 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:54:11" (1/1) ... [2023-12-19 15:54:11,311 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-19 15:54:11,312 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-19 15:54:11,312 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-19 15:54:11,312 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-19 15:54:11,313 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:54:11" (1/1) ... [2023-12-19 15:54:11,316 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-19 15:54:11,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 15:54:11,358 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-19 15:54:11,365 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-19 15:54:11,379 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-19 15:54:11,380 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2023-12-19 15:54:11,380 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2023-12-19 15:54:11,380 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-12-19 15:54:11,380 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-12-19 15:54:11,380 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2023-12-19 15:54:11,381 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2023-12-19 15:54:11,381 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-12-19 15:54:11,382 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-12-19 15:54:11,382 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2023-12-19 15:54:11,382 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2023-12-19 15:54:11,382 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-19 15:54:11,382 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-19 15:54:11,382 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-19 15:54:11,382 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-12-19 15:54:11,382 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-19 15:54:11,382 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-19 15:54:11,485 INFO L241 CfgBuilder]: Building ICFG [2023-12-19 15:54:11,486 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-19 15:54:11,888 INFO L282 CfgBuilder]: Performing block encoding [2023-12-19 15:54:11,909 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-19 15:54:11,909 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-19 15:54:11,910 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 03:54:11 BoogieIcfgContainer [2023-12-19 15:54:11,910 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-19 15:54:11,911 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-19 15:54:11,911 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-19 15:54:11,913 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-19 15:54:11,913 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.12 03:54:10" (1/3) ... [2023-12-19 15:54:11,914 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f8d3604 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 03:54:11, skipping insertion in model container [2023-12-19 15:54:11,914 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:54:11" (2/3) ... [2023-12-19 15:54:11,914 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f8d3604 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 03:54:11, skipping insertion in model container [2023-12-19 15:54:11,914 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 03:54:11" (3/3) ... [2023-12-19 15:54:11,915 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-82.i [2023-12-19 15:54:11,926 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-19 15:54:11,926 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-19 15:54:11,955 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-19 15:54:11,962 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@6bf9f0a6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-19 15:54:11,962 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-19 15:54:11,965 INFO L276 IsEmpty]: Start isEmpty. Operand has 106 states, 89 states have (on average 1.4719101123595506) internal successors, (131), 90 states have internal predecessors, (131), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2023-12-19 15:54:11,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2023-12-19 15:54:11,974 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:54:11,975 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 15:54:11,975 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:54:11,978 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:54:11,978 INFO L85 PathProgramCache]: Analyzing trace with hash -430352731, now seen corresponding path program 1 times [2023-12-19 15:54:11,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:54:11,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777796850] [2023-12-19 15:54:11,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:54:11,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:54:12,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:12,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:54:12,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:12,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:54:12,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:12,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-19 15:54:12,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:12,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 15:54:12,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:12,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 15:54:12,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:12,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:54:12,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:12,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-19 15:54:12,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:12,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-19 15:54:12,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:12,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-19 15:54:12,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:12,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 15:54:12,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:12,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 15:54:12,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:12,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-19 15:54:12,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:12,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 15:54:12,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:12,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-19 15:54:12,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:12,321 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-12-19 15:54:12,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:54:12,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777796850] [2023-12-19 15:54:12,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777796850] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:54:12,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:54:12,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-19 15:54:12,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350542372] [2023-12-19 15:54:12,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:54:12,332 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-19 15:54:12,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:54:12,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-19 15:54:12,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-19 15:54:12,368 INFO L87 Difference]: Start difference. First operand has 106 states, 89 states have (on average 1.4719101123595506) internal successors, (131), 90 states have internal predecessors, (131), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2023-12-19 15:54:12,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:54:12,415 INFO L93 Difference]: Finished difference Result 209 states and 330 transitions. [2023-12-19 15:54:12,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-19 15:54:12,417 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 116 [2023-12-19 15:54:12,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:54:12,423 INFO L225 Difference]: With dead ends: 209 [2023-12-19 15:54:12,423 INFO L226 Difference]: Without dead ends: 104 [2023-12-19 15:54:12,427 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-19 15:54:12,429 INFO L413 NwaCegarLoop]: 146 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 15:54:12,430 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 146 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 15:54:12,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2023-12-19 15:54:12,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2023-12-19 15:54:12,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 88 states have (on average 1.3863636363636365) internal successors, (122), 88 states have internal predecessors, (122), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2023-12-19 15:54:12,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 150 transitions. [2023-12-19 15:54:12,473 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 150 transitions. Word has length 116 [2023-12-19 15:54:12,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:54:12,473 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 150 transitions. [2023-12-19 15:54:12,473 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2023-12-19 15:54:12,474 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 150 transitions. [2023-12-19 15:54:12,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2023-12-19 15:54:12,477 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:54:12,477 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 15:54:12,477 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-19 15:54:12,477 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:54:12,480 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:54:12,480 INFO L85 PathProgramCache]: Analyzing trace with hash 1565365327, now seen corresponding path program 1 times [2023-12-19 15:54:12,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:54:12,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974972694] [2023-12-19 15:54:12,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:54:12,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:54:12,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:12,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:54:12,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:12,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:54:12,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:12,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-19 15:54:12,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:12,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 15:54:12,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:12,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 15:54:12,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:12,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:54:12,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:12,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-19 15:54:12,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:12,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-19 15:54:12,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:12,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-19 15:54:12,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:12,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 15:54:12,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:12,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 15:54:12,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:12,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-19 15:54:12,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:12,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 15:54:12,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:12,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-19 15:54:12,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:12,688 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-12-19 15:54:12,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:54:12,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974972694] [2023-12-19 15:54:12,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974972694] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:54:12,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:54:12,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-19 15:54:12,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699108506] [2023-12-19 15:54:12,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:54:12,690 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-19 15:54:12,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:54:12,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-19 15:54:12,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-19 15:54:12,691 INFO L87 Difference]: Start difference. First operand 104 states and 150 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2023-12-19 15:54:12,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:54:12,742 INFO L93 Difference]: Finished difference Result 213 states and 308 transitions. [2023-12-19 15:54:12,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-19 15:54:12,743 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 116 [2023-12-19 15:54:12,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:54:12,744 INFO L225 Difference]: With dead ends: 213 [2023-12-19 15:54:12,744 INFO L226 Difference]: Without dead ends: 110 [2023-12-19 15:54:12,744 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-19 15:54:12,745 INFO L413 NwaCegarLoop]: 147 mSDtfsCounter, 10 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 15:54:12,745 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 430 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 15:54:12,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2023-12-19 15:54:12,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 106. [2023-12-19 15:54:12,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 90 states have (on average 1.3777777777777778) internal successors, (124), 90 states have internal predecessors, (124), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2023-12-19 15:54:12,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 152 transitions. [2023-12-19 15:54:12,753 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 152 transitions. Word has length 116 [2023-12-19 15:54:12,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:54:12,754 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 152 transitions. [2023-12-19 15:54:12,754 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2023-12-19 15:54:12,754 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 152 transitions. [2023-12-19 15:54:12,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2023-12-19 15:54:12,757 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:54:12,757 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 15:54:12,757 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-19 15:54:12,758 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:54:12,758 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:54:12,758 INFO L85 PathProgramCache]: Analyzing trace with hash -862893295, now seen corresponding path program 1 times [2023-12-19 15:54:12,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:54:12,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381225553] [2023-12-19 15:54:12,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:54:12,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:54:12,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:12,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:54:12,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:12,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:54:12,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:12,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-19 15:54:12,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:12,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 15:54:12,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:12,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 15:54:12,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:12,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:54:12,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:12,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-19 15:54:12,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:12,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-19 15:54:12,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:12,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-19 15:54:12,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:12,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 15:54:12,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:12,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 15:54:12,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:12,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-19 15:54:12,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:12,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 15:54:12,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:12,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-19 15:54:13,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:13,003 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-12-19 15:54:13,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:54:13,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381225553] [2023-12-19 15:54:13,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381225553] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:54:13,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:54:13,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-19 15:54:13,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189327990] [2023-12-19 15:54:13,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:54:13,004 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-19 15:54:13,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:54:13,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-19 15:54:13,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-19 15:54:13,005 INFO L87 Difference]: Start difference. First operand 106 states and 152 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-12-19 15:54:13,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:54:13,052 INFO L93 Difference]: Finished difference Result 240 states and 345 transitions. [2023-12-19 15:54:13,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-19 15:54:13,053 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 116 [2023-12-19 15:54:13,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:54:13,057 INFO L225 Difference]: With dead ends: 240 [2023-12-19 15:54:13,057 INFO L226 Difference]: Without dead ends: 135 [2023-12-19 15:54:13,059 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-19 15:54:13,060 INFO L413 NwaCegarLoop]: 171 mSDtfsCounter, 61 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 469 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 15:54:13,061 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 469 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 15:54:13,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2023-12-19 15:54:13,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 108. [2023-12-19 15:54:13,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 92 states have (on average 1.3695652173913044) internal successors, (126), 92 states have internal predecessors, (126), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2023-12-19 15:54:13,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 154 transitions. [2023-12-19 15:54:13,067 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 154 transitions. Word has length 116 [2023-12-19 15:54:13,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:54:13,068 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 154 transitions. [2023-12-19 15:54:13,068 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-12-19 15:54:13,068 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 154 transitions. [2023-12-19 15:54:13,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2023-12-19 15:54:13,070 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:54:13,070 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 15:54:13,070 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-19 15:54:13,071 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:54:13,071 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:54:13,071 INFO L85 PathProgramCache]: Analyzing trace with hash 1512579775, now seen corresponding path program 1 times [2023-12-19 15:54:13,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:54:13,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096287981] [2023-12-19 15:54:13,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:54:13,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:54:13,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:13,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:54:13,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:13,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:54:13,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:13,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-19 15:54:13,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:13,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 15:54:13,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:13,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 15:54:13,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:13,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:54:13,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:13,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-19 15:54:13,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:13,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-19 15:54:13,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:13,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-19 15:54:13,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:13,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 15:54:13,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:13,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 15:54:13,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:13,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-19 15:54:13,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:13,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 15:54:13,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:13,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-19 15:54:13,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:13,256 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-12-19 15:54:13,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:54:13,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096287981] [2023-12-19 15:54:13,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096287981] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:54:13,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:54:13,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-19 15:54:13,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224214450] [2023-12-19 15:54:13,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:54:13,258 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-19 15:54:13,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:54:13,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-19 15:54:13,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-19 15:54:13,259 INFO L87 Difference]: Start difference. First operand 108 states and 154 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-12-19 15:54:13,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:54:13,314 INFO L93 Difference]: Finished difference Result 272 states and 389 transitions. [2023-12-19 15:54:13,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-19 15:54:13,314 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 118 [2023-12-19 15:54:13,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:54:13,315 INFO L225 Difference]: With dead ends: 272 [2023-12-19 15:54:13,315 INFO L226 Difference]: Without dead ends: 165 [2023-12-19 15:54:13,319 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-12-19 15:54:13,324 INFO L413 NwaCegarLoop]: 208 mSDtfsCounter, 102 mSDsluCounter, 490 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 698 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 15:54:13,324 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 698 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 15:54:13,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2023-12-19 15:54:13,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 109. [2023-12-19 15:54:13,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 93 states have (on average 1.3655913978494623) internal successors, (127), 93 states have internal predecessors, (127), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2023-12-19 15:54:13,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 155 transitions. [2023-12-19 15:54:13,337 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 155 transitions. Word has length 118 [2023-12-19 15:54:13,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:54:13,338 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 155 transitions. [2023-12-19 15:54:13,338 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-12-19 15:54:13,338 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 155 transitions. [2023-12-19 15:54:13,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2023-12-19 15:54:13,340 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:54:13,340 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 15:54:13,340 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-19 15:54:13,340 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:54:13,341 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:54:13,341 INFO L85 PathProgramCache]: Analyzing trace with hash 1615270746, now seen corresponding path program 1 times [2023-12-19 15:54:13,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:54:13,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577365944] [2023-12-19 15:54:13,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:54:13,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:54:13,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:13,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:54:13,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:13,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:54:13,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:13,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-19 15:54:13,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:13,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 15:54:13,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:13,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 15:54:13,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:13,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:54:13,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:13,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-19 15:54:13,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:13,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-19 15:54:13,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:13,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-19 15:54:13,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:13,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 15:54:13,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:13,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 15:54:13,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:13,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-19 15:54:13,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:13,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 15:54:13,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:13,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-19 15:54:13,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:13,427 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-12-19 15:54:13,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:54:13,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577365944] [2023-12-19 15:54:13,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1577365944] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:54:13,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:54:13,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-19 15:54:13,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411553384] [2023-12-19 15:54:13,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:54:13,428 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-19 15:54:13,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:54:13,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-19 15:54:13,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-19 15:54:13,429 INFO L87 Difference]: Start difference. First operand 109 states and 155 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-12-19 15:54:13,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:54:13,457 INFO L93 Difference]: Finished difference Result 229 states and 326 transitions. [2023-12-19 15:54:13,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-19 15:54:13,458 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 120 [2023-12-19 15:54:13,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:54:13,460 INFO L225 Difference]: With dead ends: 229 [2023-12-19 15:54:13,460 INFO L226 Difference]: Without dead ends: 121 [2023-12-19 15:54:13,460 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-19 15:54:13,461 INFO L413 NwaCegarLoop]: 143 mSDtfsCounter, 21 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 429 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 15:54:13,461 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 429 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 15:54:13,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2023-12-19 15:54:13,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 111. [2023-12-19 15:54:13,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 95 states have (on average 1.3578947368421053) internal successors, (129), 95 states have internal predecessors, (129), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2023-12-19 15:54:13,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 157 transitions. [2023-12-19 15:54:13,466 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 157 transitions. Word has length 120 [2023-12-19 15:54:13,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:54:13,467 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 157 transitions. [2023-12-19 15:54:13,467 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-12-19 15:54:13,467 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 157 transitions. [2023-12-19 15:54:13,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2023-12-19 15:54:13,468 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:54:13,468 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 15:54:13,468 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-19 15:54:13,468 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:54:13,469 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:54:13,469 INFO L85 PathProgramCache]: Analyzing trace with hash 805924120, now seen corresponding path program 1 times [2023-12-19 15:54:13,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:54:13,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473980368] [2023-12-19 15:54:13,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:54:13,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:54:13,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:13,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:54:13,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:13,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:54:13,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:13,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-19 15:54:13,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:13,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 15:54:13,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:13,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 15:54:13,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:13,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:54:13,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:13,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-19 15:54:13,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:13,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-19 15:54:13,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:13,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-19 15:54:13,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:13,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 15:54:13,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:13,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 15:54:13,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:13,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-19 15:54:13,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:13,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 15:54:13,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:13,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-19 15:54:13,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:13,589 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-12-19 15:54:13,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:54:13,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473980368] [2023-12-19 15:54:13,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [473980368] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:54:13,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:54:13,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-19 15:54:13,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413354139] [2023-12-19 15:54:13,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:54:13,590 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-19 15:54:13,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:54:13,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-19 15:54:13,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-19 15:54:13,591 INFO L87 Difference]: Start difference. First operand 111 states and 157 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-12-19 15:54:13,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:54:13,618 INFO L93 Difference]: Finished difference Result 229 states and 324 transitions. [2023-12-19 15:54:13,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-19 15:54:13,618 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 120 [2023-12-19 15:54:13,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:54:13,620 INFO L225 Difference]: With dead ends: 229 [2023-12-19 15:54:13,620 INFO L226 Difference]: Without dead ends: 119 [2023-12-19 15:54:13,620 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-19 15:54:13,621 INFO L413 NwaCegarLoop]: 143 mSDtfsCounter, 12 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 427 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 15:54:13,621 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 427 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 15:54:13,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2023-12-19 15:54:13,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 113. [2023-12-19 15:54:13,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 97 states have (on average 1.3505154639175259) internal successors, (131), 97 states have internal predecessors, (131), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2023-12-19 15:54:13,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 159 transitions. [2023-12-19 15:54:13,635 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 159 transitions. Word has length 120 [2023-12-19 15:54:13,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:54:13,635 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 159 transitions. [2023-12-19 15:54:13,635 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-12-19 15:54:13,636 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 159 transitions. [2023-12-19 15:54:13,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2023-12-19 15:54:13,637 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:54:13,638 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 15:54:13,638 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-19 15:54:13,638 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:54:13,638 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:54:13,638 INFO L85 PathProgramCache]: Analyzing trace with hash 863182422, now seen corresponding path program 1 times [2023-12-19 15:54:13,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:54:13,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480231323] [2023-12-19 15:54:13,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:54:13,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:54:13,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:13,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:54:13,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:13,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:54:13,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:13,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-19 15:54:13,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:13,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 15:54:13,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:13,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 15:54:13,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:13,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:54:13,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:13,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-19 15:54:13,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:13,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-19 15:54:13,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:13,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-19 15:54:13,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:13,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 15:54:13,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:13,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 15:54:13,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:13,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-19 15:54:13,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:13,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 15:54:13,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:13,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-19 15:54:13,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:13,742 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-12-19 15:54:13,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:54:13,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480231323] [2023-12-19 15:54:13,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480231323] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:54:13,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:54:13,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-19 15:54:13,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051425435] [2023-12-19 15:54:13,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:54:13,744 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-19 15:54:13,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:54:13,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-19 15:54:13,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-19 15:54:13,745 INFO L87 Difference]: Start difference. First operand 113 states and 159 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-12-19 15:54:13,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:54:13,772 INFO L93 Difference]: Finished difference Result 229 states and 322 transitions. [2023-12-19 15:54:13,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-19 15:54:13,772 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 120 [2023-12-19 15:54:13,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:54:13,773 INFO L225 Difference]: With dead ends: 229 [2023-12-19 15:54:13,773 INFO L226 Difference]: Without dead ends: 117 [2023-12-19 15:54:13,773 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-19 15:54:13,774 INFO L413 NwaCegarLoop]: 144 mSDtfsCounter, 3 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 427 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 15:54:13,774 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 427 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 15:54:13,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2023-12-19 15:54:13,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 115. [2023-12-19 15:54:13,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 99 states have (on average 1.3434343434343434) internal successors, (133), 99 states have internal predecessors, (133), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2023-12-19 15:54:13,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 161 transitions. [2023-12-19 15:54:13,786 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 161 transitions. Word has length 120 [2023-12-19 15:54:13,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:54:13,787 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 161 transitions. [2023-12-19 15:54:13,787 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-12-19 15:54:13,787 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 161 transitions. [2023-12-19 15:54:13,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2023-12-19 15:54:13,789 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:54:13,789 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 15:54:13,789 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-19 15:54:13,789 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:54:13,789 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:54:13,789 INFO L85 PathProgramCache]: Analyzing trace with hash 863242004, now seen corresponding path program 1 times [2023-12-19 15:54:13,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:54:13,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746475944] [2023-12-19 15:54:13,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:54:13,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:54:13,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:13,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:54:13,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:13,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:54:13,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:13,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-19 15:54:13,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:13,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 15:54:13,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:13,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 15:54:13,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:13,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:54:13,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:13,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-19 15:54:13,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:13,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-19 15:54:13,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:13,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-19 15:54:13,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:13,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 15:54:13,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:13,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 15:54:13,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:13,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-19 15:54:13,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:13,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 15:54:13,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:13,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-19 15:54:13,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:13,985 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-12-19 15:54:13,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:54:13,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746475944] [2023-12-19 15:54:13,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1746475944] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:54:13,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:54:13,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-19 15:54:13,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943754926] [2023-12-19 15:54:13,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:54:13,985 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-19 15:54:13,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:54:13,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-19 15:54:13,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-19 15:54:13,987 INFO L87 Difference]: Start difference. First operand 115 states and 161 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-12-19 15:54:14,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:54:14,103 INFO L93 Difference]: Finished difference Result 259 states and 361 transitions. [2023-12-19 15:54:14,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-19 15:54:14,103 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 120 [2023-12-19 15:54:14,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:54:14,104 INFO L225 Difference]: With dead ends: 259 [2023-12-19 15:54:14,104 INFO L226 Difference]: Without dead ends: 145 [2023-12-19 15:54:14,105 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-19 15:54:14,106 INFO L413 NwaCegarLoop]: 142 mSDtfsCounter, 86 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-19 15:54:14,106 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 313 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-19 15:54:14,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2023-12-19 15:54:14,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 110. [2023-12-19 15:54:14,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 94 states have (on average 1.3297872340425532) internal successors, (125), 94 states have internal predecessors, (125), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2023-12-19 15:54:14,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 153 transitions. [2023-12-19 15:54:14,111 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 153 transitions. Word has length 120 [2023-12-19 15:54:14,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:54:14,111 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 153 transitions. [2023-12-19 15:54:14,111 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-12-19 15:54:14,111 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 153 transitions. [2023-12-19 15:54:14,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2023-12-19 15:54:14,112 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:54:14,112 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 15:54:14,112 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-19 15:54:14,112 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:54:14,113 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:54:14,113 INFO L85 PathProgramCache]: Analyzing trace with hash -985732013, now seen corresponding path program 1 times [2023-12-19 15:54:14,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:54:14,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099124600] [2023-12-19 15:54:14,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:54:14,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:54:14,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:15,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:54:15,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:15,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:54:15,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:15,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-19 15:54:15,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:15,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 15:54:15,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:15,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 15:54:15,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:15,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:54:15,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:15,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-19 15:54:15,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:15,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-19 15:54:15,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:15,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-19 15:54:15,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:15,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 15:54:15,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:15,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 15:54:15,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:15,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-19 15:54:15,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:15,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 15:54:15,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:15,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-19 15:54:15,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:15,484 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-12-19 15:54:15,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:54:15,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099124600] [2023-12-19 15:54:15,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2099124600] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:54:15,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:54:15,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-12-19 15:54:15,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263561478] [2023-12-19 15:54:15,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:54:15,508 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-19 15:54:15,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:54:15,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-19 15:54:15,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2023-12-19 15:54:15,509 INFO L87 Difference]: Start difference. First operand 110 states and 153 transitions. Second operand has 12 states, 10 states have (on average 5.4) internal successors, (54), 12 states have internal predecessors, (54), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 3 states have call successors, (14) [2023-12-19 15:54:16,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:54:16,264 INFO L93 Difference]: Finished difference Result 328 states and 455 transitions. [2023-12-19 15:54:16,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-19 15:54:16,265 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 5.4) internal successors, (54), 12 states have internal predecessors, (54), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 3 states have call successors, (14) Word has length 121 [2023-12-19 15:54:16,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:54:16,266 INFO L225 Difference]: With dead ends: 328 [2023-12-19 15:54:16,266 INFO L226 Difference]: Without dead ends: 219 [2023-12-19 15:54:16,266 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=272, Unknown=0, NotChecked=0, Total=342 [2023-12-19 15:54:16,267 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 287 mSDsluCounter, 997 mSDsCounter, 0 mSdLazyCounter, 863 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 289 SdHoareTripleChecker+Valid, 1124 SdHoareTripleChecker+Invalid, 874 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 863 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-19 15:54:16,267 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [289 Valid, 1124 Invalid, 874 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 863 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-19 15:54:16,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2023-12-19 15:54:16,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 195. [2023-12-19 15:54:16,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 172 states have (on average 1.3430232558139534) internal successors, (231), 173 states have internal predecessors, (231), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2023-12-19 15:54:16,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 271 transitions. [2023-12-19 15:54:16,274 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 271 transitions. Word has length 121 [2023-12-19 15:54:16,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:54:16,275 INFO L495 AbstractCegarLoop]: Abstraction has 195 states and 271 transitions. [2023-12-19 15:54:16,275 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 5.4) internal successors, (54), 12 states have internal predecessors, (54), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 3 states have call successors, (14) [2023-12-19 15:54:16,275 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 271 transitions. [2023-12-19 15:54:16,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2023-12-19 15:54:16,276 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:54:16,276 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 15:54:16,276 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-19 15:54:16,276 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:54:16,276 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:54:16,276 INFO L85 PathProgramCache]: Analyzing trace with hash 1226890986, now seen corresponding path program 1 times [2023-12-19 15:54:16,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:54:16,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295202605] [2023-12-19 15:54:16,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:54:16,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:54:16,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:16,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:54:16,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:16,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:54:16,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:16,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-19 15:54:16,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:16,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 15:54:16,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:16,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 15:54:16,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:16,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:54:16,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:16,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-19 15:54:16,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:16,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-19 15:54:16,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:16,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-19 15:54:16,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:16,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 15:54:16,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:16,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 15:54:16,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:16,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-19 15:54:16,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:16,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 15:54:16,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:16,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-19 15:54:16,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:16,376 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-12-19 15:54:16,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:54:16,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295202605] [2023-12-19 15:54:16,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [295202605] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:54:16,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:54:16,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-19 15:54:16,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274617711] [2023-12-19 15:54:16,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:54:16,377 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-19 15:54:16,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:54:16,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-19 15:54:16,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-19 15:54:16,378 INFO L87 Difference]: Start difference. First operand 195 states and 271 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-12-19 15:54:16,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:54:16,448 INFO L93 Difference]: Finished difference Result 566 states and 787 transitions. [2023-12-19 15:54:16,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-19 15:54:16,449 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 121 [2023-12-19 15:54:16,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:54:16,451 INFO L225 Difference]: With dead ends: 566 [2023-12-19 15:54:16,451 INFO L226 Difference]: Without dead ends: 372 [2023-12-19 15:54:16,451 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-12-19 15:54:16,452 INFO L413 NwaCegarLoop]: 147 mSDtfsCounter, 184 mSDsluCounter, 565 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 712 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 15:54:16,452 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 712 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 15:54:16,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2023-12-19 15:54:16,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 247. [2023-12-19 15:54:16,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 224 states have (on average 1.3705357142857142) internal successors, (307), 225 states have internal predecessors, (307), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2023-12-19 15:54:16,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 347 transitions. [2023-12-19 15:54:16,459 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 347 transitions. Word has length 121 [2023-12-19 15:54:16,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:54:16,460 INFO L495 AbstractCegarLoop]: Abstraction has 247 states and 347 transitions. [2023-12-19 15:54:16,460 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-12-19 15:54:16,460 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 347 transitions. [2023-12-19 15:54:16,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2023-12-19 15:54:16,460 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:54:16,461 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 15:54:16,461 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-19 15:54:16,461 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:54:16,461 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:54:16,461 INFO L85 PathProgramCache]: Analyzing trace with hash 185513066, now seen corresponding path program 1 times [2023-12-19 15:54:16,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:54:16,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630583847] [2023-12-19 15:54:16,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:54:16,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:54:16,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:16,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:54:16,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:16,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:54:16,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:16,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-19 15:54:16,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:16,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 15:54:16,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:16,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 15:54:16,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:16,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:54:16,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:16,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-19 15:54:16,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:16,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-19 15:54:16,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:16,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-19 15:54:16,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:16,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 15:54:16,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:16,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 15:54:16,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:16,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-19 15:54:16,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:16,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 15:54:16,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:16,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-19 15:54:16,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:16,557 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-12-19 15:54:16,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:54:16,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630583847] [2023-12-19 15:54:16,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630583847] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:54:16,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:54:16,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-19 15:54:16,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715215959] [2023-12-19 15:54:16,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:54:16,557 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-19 15:54:16,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:54:16,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-19 15:54:16,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-19 15:54:16,558 INFO L87 Difference]: Start difference. First operand 247 states and 347 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-12-19 15:54:16,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:54:16,628 INFO L93 Difference]: Finished difference Result 545 states and 762 transitions. [2023-12-19 15:54:16,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-19 15:54:16,628 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 121 [2023-12-19 15:54:16,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:54:16,629 INFO L225 Difference]: With dead ends: 545 [2023-12-19 15:54:16,629 INFO L226 Difference]: Without dead ends: 298 [2023-12-19 15:54:16,630 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-12-19 15:54:16,630 INFO L413 NwaCegarLoop]: 188 mSDtfsCounter, 180 mSDsluCounter, 637 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 825 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 15:54:16,630 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 825 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 15:54:16,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2023-12-19 15:54:16,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 248. [2023-12-19 15:54:16,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 225 states have (on average 1.3555555555555556) internal successors, (305), 226 states have internal predecessors, (305), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2023-12-19 15:54:16,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 345 transitions. [2023-12-19 15:54:16,637 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 345 transitions. Word has length 121 [2023-12-19 15:54:16,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:54:16,637 INFO L495 AbstractCegarLoop]: Abstraction has 248 states and 345 transitions. [2023-12-19 15:54:16,637 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-12-19 15:54:16,637 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 345 transitions. [2023-12-19 15:54:16,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2023-12-19 15:54:16,638 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:54:16,638 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 15:54:16,638 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-12-19 15:54:16,638 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:54:16,638 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:54:16,639 INFO L85 PathProgramCache]: Analyzing trace with hash -1896831231, now seen corresponding path program 1 times [2023-12-19 15:54:16,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:54:16,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576319044] [2023-12-19 15:54:16,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:54:16,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:54:16,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:16,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:54:16,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:16,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:54:16,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:16,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-19 15:54:16,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:16,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 15:54:16,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:16,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 15:54:16,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:16,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:54:16,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:16,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-19 15:54:16,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:16,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-19 15:54:16,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:16,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-19 15:54:16,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:16,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 15:54:16,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:16,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 15:54:16,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:16,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-19 15:54:16,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:16,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 15:54:16,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:16,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-19 15:54:16,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:54:16,816 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-12-19 15:54:16,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:54:16,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576319044] [2023-12-19 15:54:16,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576319044] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:54:16,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:54:16,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-19 15:54:16,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006566205] [2023-12-19 15:54:16,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:54:16,817 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-19 15:54:16,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:54:16,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-19 15:54:16,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-19 15:54:16,818 INFO L87 Difference]: Start difference. First operand 248 states and 345 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-12-19 15:54:17,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:54:17,107 INFO L93 Difference]: Finished difference Result 668 states and 926 transitions. [2023-12-19 15:54:17,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-19 15:54:17,108 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 121 [2023-12-19 15:54:17,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:54:17,112 INFO L225 Difference]: With dead ends: 668 [2023-12-19 15:54:17,112 INFO L226 Difference]: Without dead ends: 421 [2023-12-19 15:54:17,113 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-12-19 15:54:17,113 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 176 mSDsluCounter, 399 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 516 SdHoareTripleChecker+Invalid, 399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-19 15:54:17,114 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 516 Invalid, 399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 342 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-19 15:54:17,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2023-12-19 15:54:17,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 385. [2023-12-19 15:54:17,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 385 states, 340 states have (on average 1.3352941176470587) internal successors, (454), 342 states have internal predecessors, (454), 40 states have call successors, (40), 4 states have call predecessors, (40), 4 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2023-12-19 15:54:17,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 534 transitions. [2023-12-19 15:54:17,130 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 534 transitions. Word has length 121 [2023-12-19 15:54:17,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:54:17,130 INFO L495 AbstractCegarLoop]: Abstraction has 385 states and 534 transitions. [2023-12-19 15:54:17,130 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-12-19 15:54:17,131 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 534 transitions. [2023-12-19 15:54:17,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2023-12-19 15:54:17,131 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:54:17,131 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 15:54:17,131 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-12-19 15:54:17,131 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:54:17,132 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:54:17,132 INFO L85 PathProgramCache]: Analyzing trace with hash 117419420, now seen corresponding path program 1 times [2023-12-19 15:54:17,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:54:17,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879852566] [2023-12-19 15:54:17,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:54:17,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:54:17,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-19 15:54:17,230 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-19 15:54:17,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-19 15:54:17,353 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-19 15:54:17,353 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-19 15:54:17,354 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-19 15:54:17,355 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-12-19 15:54:17,357 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 15:54:17,359 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-19 15:54:17,425 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.12 03:54:17 BoogieIcfgContainer [2023-12-19 15:54:17,425 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-19 15:54:17,425 INFO L158 Benchmark]: Toolchain (without parser) took 6455.48ms. Allocated memory was 240.1MB in the beginning and 412.1MB in the end (delta: 172.0MB). Free memory was 191.4MB in the beginning and 221.2MB in the end (delta: -29.8MB). Peak memory consumption was 143.0MB. Max. memory is 8.0GB. [2023-12-19 15:54:17,426 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 180.4MB. Free memory was 133.7MB in the beginning and 133.5MB in the end (delta: 155.2kB). There was no memory consumed. Max. memory is 8.0GB. [2023-12-19 15:54:17,426 INFO L158 Benchmark]: CACSL2BoogieTranslator took 212.64ms. Allocated memory is still 240.1MB. Free memory was 191.4MB in the beginning and 174.5MB in the end (delta: 16.9MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2023-12-19 15:54:17,426 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.28ms. Allocated memory is still 240.1MB. Free memory was 174.5MB in the beginning and 169.3MB in the end (delta: 5.1MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. [2023-12-19 15:54:17,426 INFO L158 Benchmark]: Boogie Preprocessor took 71.81ms. Allocated memory is still 240.1MB. Free memory was 169.3MB in the beginning and 163.6MB in the end (delta: 5.8MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. [2023-12-19 15:54:17,427 INFO L158 Benchmark]: RCFGBuilder took 597.71ms. Allocated memory is still 240.1MB. Free memory was 163.6MB in the beginning and 128.4MB in the end (delta: 35.1MB). Peak memory consumption was 35.7MB. Max. memory is 8.0GB. [2023-12-19 15:54:17,428 INFO L158 Benchmark]: TraceAbstraction took 5514.12ms. Allocated memory was 240.1MB in the beginning and 412.1MB in the end (delta: 172.0MB). Free memory was 127.9MB in the beginning and 221.2MB in the end (delta: -93.3MB). Peak memory consumption was 80.1MB. Max. memory is 8.0GB. [2023-12-19 15:54:17,429 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 180.4MB. Free memory was 133.7MB in the beginning and 133.5MB in the end (delta: 155.2kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 212.64ms. Allocated memory is still 240.1MB. Free memory was 191.4MB in the beginning and 174.5MB in the end (delta: 16.9MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 55.28ms. Allocated memory is still 240.1MB. Free memory was 174.5MB in the beginning and 169.3MB in the end (delta: 5.1MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 71.81ms. Allocated memory is still 240.1MB. Free memory was 169.3MB in the beginning and 163.6MB in the end (delta: 5.8MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. * RCFGBuilder took 597.71ms. Allocated memory is still 240.1MB. Free memory was 163.6MB in the beginning and 128.4MB in the end (delta: 35.1MB). Peak memory consumption was 35.7MB. Max. memory is 8.0GB. * TraceAbstraction took 5514.12ms. Allocated memory was 240.1MB in the beginning and 412.1MB in the end (delta: 172.0MB). Free memory was 127.9MB in the beginning and 221.2MB in the end (delta: -93.3MB). Peak memory consumption was 80.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 95, overapproximation of someBinaryDOUBLEComparisonOperation at line 118. Possible FailurePath: [L38] unsigned char isInitial = 0; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 128.75, 1, 63.5, 255.5, 32, 25, 128, 16, 2, 5, 10, 3.75, 0, 255.5 }; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 128.75, 1, 63.5, 255.5, 32, 25, 128, 16, 2, 5, 10, 3.75, 0, 255.5 }; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 128.75, 1, 63.5, 255.5, 32, 25, 128, 16, 2, 5, 10, 3.75, 0, 255.5 }; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 128.75, 1, 63.5, 255.5, 32, 25, 128, 16, 2, 5, 10, 3.75, 0, 255.5 }; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 128.75, 1, 63.5, 255.5, 32, 25, 128, 16, 2, 5, 10, 3.75, 0, 255.5 }; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 128.75, 1, 63.5, 255.5, 32, 25, 128, 16, 2, 5, 10, 3.75, 0, 255.5 }; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 128.75, 1, 63.5, 255.5, 32, 25, 128, 16, 2, 5, 10, 3.75, 0, 255.5 }; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 128.75, 1, 63.5, 255.5, 32, 25, 128, 16, 2, 5, 10, 3.75, 0, 255.5 }; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 128.75, 1, 63.5, 255.5, 32, 25, 128, 16, 2, 5, 10, 3.75, 0, 255.5 }; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 128.75, 1, 63.5, 255.5, 32, 25, 128, 16, 2, 5, 10, 3.75, 0, 255.5 }; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 128.75, 1, 63.5, 255.5, 32, 25, 128, 16, 2, 5, 10, 3.75, 0, 255.5 }; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 128.75, 1, 63.5, 255.5, 32, 25, 128, 16, 2, 5, 10, 3.75, 0, 255.5 }; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 128.75, 1, 63.5, 255.5, 32, 25, 128, 16, 2, 5, 10, 3.75, 0, 255.5 }; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 128.75, 1, 63.5, 255.5, 32, 25, 128, 16, 2, 5, 10, 3.75, 0, 255.5 }; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 128.75, 1, 63.5, 255.5, 32, 25, 128, 16, 2, 5, 10, 3.75, 0, 255.5 }; [L55] unsigned char last_1_WrapperStruct00_var_1_5 = 32; [L56] unsigned char last_1_WrapperStruct00_var_1_12 = 2; [L57] unsigned char last_1_WrapperStruct00_var_1_17 = 0; [L122] isInitial = 1 [L123] FCALL initially() [L124] COND TRUE 1 [L125] CALL updateLastVariables() [L113] EXPR WrapperStruct00.var_1_5 [L113] last_1_WrapperStruct00_var_1_5 = WrapperStruct00.var_1_5 [L114] EXPR WrapperStruct00.var_1_12 [L114] last_1_WrapperStruct00_var_1_12 = WrapperStruct00.var_1_12 [L115] EXPR WrapperStruct00.var_1_17 [L115] last_1_WrapperStruct00_var_1_17 = WrapperStruct00.var_1_17 [L125] RET updateLastVariables() [L126] CALL updateVariables() [L89] WrapperStruct00.var_1_2 = __VERIFIER_nondet_uchar() [L90] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L90] CALL assume_abort_if_not(WrapperStruct00.var_1_2 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L90] RET assume_abort_if_not(WrapperStruct00.var_1_2 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L91] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L91] CALL assume_abort_if_not(WrapperStruct00.var_1_2 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L91] RET assume_abort_if_not(WrapperStruct00.var_1_2 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L92] WrapperStruct00.var_1_3 = __VERIFIER_nondet_float() [L93] EXPR WrapperStruct00.var_1_3 [L93] EXPR WrapperStruct00.var_1_3 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L93] EXPR WrapperStruct00.var_1_3 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F [L93] EXPR WrapperStruct00.var_1_3 [L93] EXPR WrapperStruct00.var_1_3 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L93] EXPR (WrapperStruct00.var_1_3 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F) || (WrapperStruct00.var_1_3 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_3 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L93] EXPR (WrapperStruct00.var_1_3 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F) || (WrapperStruct00.var_1_3 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_3 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L93] CALL assume_abort_if_not((WrapperStruct00.var_1_3 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F) || (WrapperStruct00.var_1_3 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_3 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L93] RET assume_abort_if_not((WrapperStruct00.var_1_3 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F) || (WrapperStruct00.var_1_3 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_3 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L94] WrapperStruct00.var_1_4 = __VERIFIER_nondet_float() [L95] EXPR WrapperStruct00.var_1_4 [L95] EXPR WrapperStruct00.var_1_4 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L95] EXPR WrapperStruct00.var_1_4 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F [L95] EXPR WrapperStruct00.var_1_4 [L95] EXPR WrapperStruct00.var_1_4 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L95] EXPR (WrapperStruct00.var_1_4 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F) || (WrapperStruct00.var_1_4 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_4 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L95] EXPR (WrapperStruct00.var_1_4 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F) || (WrapperStruct00.var_1_4 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_4 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L95] CALL assume_abort_if_not((WrapperStruct00.var_1_4 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F) || (WrapperStruct00.var_1_4 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_4 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L95] RET assume_abort_if_not((WrapperStruct00.var_1_4 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F) || (WrapperStruct00.var_1_4 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_4 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L96] WrapperStruct00.var_1_9 = __VERIFIER_nondet_uchar() [L97] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L97] CALL assume_abort_if_not(WrapperStruct00.var_1_9 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L97] RET assume_abort_if_not(WrapperStruct00.var_1_9 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L98] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L98] CALL assume_abort_if_not(WrapperStruct00.var_1_9 <= 254) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L98] RET assume_abort_if_not(WrapperStruct00.var_1_9 <= 254) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L99] WrapperStruct00.var_1_10 = __VERIFIER_nondet_uchar() [L100] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L100] CALL assume_abort_if_not(WrapperStruct00.var_1_10 >= 127) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L100] RET assume_abort_if_not(WrapperStruct00.var_1_10 >= 127) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L101] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L101] CALL assume_abort_if_not(WrapperStruct00.var_1_10 <= 254) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L101] RET assume_abort_if_not(WrapperStruct00.var_1_10 <= 254) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L102] WrapperStruct00.var_1_11 = __VERIFIER_nondet_uchar() [L103] EXPR WrapperStruct00.var_1_11 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L103] CALL assume_abort_if_not(WrapperStruct00.var_1_11 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L103] RET assume_abort_if_not(WrapperStruct00.var_1_11 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L104] EXPR WrapperStruct00.var_1_11 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L104] CALL assume_abort_if_not(WrapperStruct00.var_1_11 <= 127) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L104] RET assume_abort_if_not(WrapperStruct00.var_1_11 <= 127) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L105] WrapperStruct00.var_1_14 = __VERIFIER_nondet_uchar() [L106] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L106] CALL assume_abort_if_not(WrapperStruct00.var_1_14 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L106] RET assume_abort_if_not(WrapperStruct00.var_1_14 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L107] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L107] CALL assume_abort_if_not(WrapperStruct00.var_1_14 <= 254) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L107] RET assume_abort_if_not(WrapperStruct00.var_1_14 <= 254) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L108] WrapperStruct00.var_1_15 = __VERIFIER_nondet_uchar() [L109] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L109] CALL assume_abort_if_not(WrapperStruct00.var_1_15 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L109] RET assume_abort_if_not(WrapperStruct00.var_1_15 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L110] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L110] CALL assume_abort_if_not(WrapperStruct00.var_1_15 <= 127) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L110] RET assume_abort_if_not(WrapperStruct00.var_1_15 <= 127) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L126] RET updateVariables() [L127] CALL step() [L61] EXPR last_1_WrapperStruct00_var_1_17 | last_1_WrapperStruct00_var_1_12 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L61] signed long int stepLocal_0 = last_1_WrapperStruct00_var_1_17 | last_1_WrapperStruct00_var_1_12; [L62] COND FALSE !((last_1_WrapperStruct00_var_1_5 / -2) >= stepLocal_0) [L65] EXPR WrapperStruct00.var_1_10 [L65] EXPR WrapperStruct00.var_1_11 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L65] EXPR ((WrapperStruct00.var_1_11) < 0 ) ? -(WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_11) [L65] EXPR WrapperStruct00.var_1_11 [L65] EXPR ((WrapperStruct00.var_1_11) < 0 ) ? -(WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_11) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32, stepLocal_0=2] [L65] WrapperStruct00.var_1_5 = (WrapperStruct00.var_1_10 - ((((WrapperStruct00.var_1_11) < 0 ) ? -(WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_11)))) [L67] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L67] COND FALSE !(! WrapperStruct00.var_1_2) [L72] EXPR WrapperStruct00.var_1_4 [L72] WrapperStruct00.var_1_16 = WrapperStruct00.var_1_4 [L73] EXPR WrapperStruct00.var_1_9 [L73] WrapperStruct00.var_1_17 = WrapperStruct00.var_1_9 [L74] EXPR WrapperStruct00.var_1_3 [L74] WrapperStruct00.var_1_18 = WrapperStruct00.var_1_3 [L75] EXPR WrapperStruct00.var_1_9 [L75] unsigned char stepLocal_1 = WrapperStruct00.var_1_9; [L76] EXPR WrapperStruct00.var_1_5 [L76] EXPR WrapperStruct00.var_1_11 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L76] COND FALSE !((WrapperStruct00.var_1_5 + WrapperStruct00.var_1_11) >= stepLocal_1) [L85] EXPR WrapperStruct00.var_1_9 [L85] WrapperStruct00.var_1_12 = WrapperStruct00.var_1_9 [L127] RET step() [L128] CALL, EXPR property() [L118] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L118] EXPR (! WrapperStruct00.var_1_2) ? (WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_1 == ((float) ((((WrapperStruct00.var_1_3) > (WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_4))))) : 1) : 1 [L118] EXPR (! WrapperStruct00.var_1_2) ? (WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_1 == ((float) ((((WrapperStruct00.var_1_3) > (WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_4))))) : 1) : 1 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L118] EXPR ((! WrapperStruct00.var_1_2) ? (WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_1 == ((float) ((((WrapperStruct00.var_1_3) > (WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_4))))) : 1) : 1) && (((last_1_WrapperStruct00_var_1_5 / -2) >= (last_1_WrapperStruct00_var_1_17 | last_1_WrapperStruct00_var_1_12)) ? (WrapperStruct00.var_1_5 == ((unsigned char) ((((WrapperStruct00.var_1_9) < 0 ) ? -(WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_9))))) : (WrapperStruct00.var_1_5 == ((unsigned char) (WrapperStruct00.var_1_10 - ((((WrapperStruct00.var_1_11) < 0 ) ? -(WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_11))))))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L118] EXPR ((! WrapperStruct00.var_1_2) ? (WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_1 == ((float) ((((WrapperStruct00.var_1_3) > (WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_4))))) : 1) : 1) && (((last_1_WrapperStruct00_var_1_5 / -2) >= (last_1_WrapperStruct00_var_1_17 | last_1_WrapperStruct00_var_1_12)) ? (WrapperStruct00.var_1_5 == ((unsigned char) ((((WrapperStruct00.var_1_9) < 0 ) ? -(WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_9))))) : (WrapperStruct00.var_1_5 == ((unsigned char) (WrapperStruct00.var_1_10 - ((((WrapperStruct00.var_1_11) < 0 ) ? -(WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_11))))))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L118] EXPR last_1_WrapperStruct00_var_1_17 | last_1_WrapperStruct00_var_1_12 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L118] EXPR ((last_1_WrapperStruct00_var_1_5 / -2) >= (last_1_WrapperStruct00_var_1_17 | last_1_WrapperStruct00_var_1_12)) ? (WrapperStruct00.var_1_5 == ((unsigned char) ((((WrapperStruct00.var_1_9) < 0 ) ? -(WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_9))))) : (WrapperStruct00.var_1_5 == ((unsigned char) (WrapperStruct00.var_1_10 - ((((WrapperStruct00.var_1_11) < 0 ) ? -(WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_11)))))) [L118] EXPR WrapperStruct00.var_1_5 [L118] EXPR WrapperStruct00.var_1_10 [L118] EXPR WrapperStruct00.var_1_11 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L118] EXPR ((WrapperStruct00.var_1_11) < 0 ) ? -(WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_11) [L118] EXPR WrapperStruct00.var_1_11 [L118] EXPR ((WrapperStruct00.var_1_11) < 0 ) ? -(WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_11) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L118] EXPR ((last_1_WrapperStruct00_var_1_5 / -2) >= (last_1_WrapperStruct00_var_1_17 | last_1_WrapperStruct00_var_1_12)) ? (WrapperStruct00.var_1_5 == ((unsigned char) ((((WrapperStruct00.var_1_9) < 0 ) ? -(WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_9))))) : (WrapperStruct00.var_1_5 == ((unsigned char) (WrapperStruct00.var_1_10 - ((((WrapperStruct00.var_1_11) < 0 ) ? -(WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_11)))))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L118] EXPR ((! WrapperStruct00.var_1_2) ? (WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_1 == ((float) ((((WrapperStruct00.var_1_3) > (WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_4))))) : 1) : 1) && (((last_1_WrapperStruct00_var_1_5 / -2) >= (last_1_WrapperStruct00_var_1_17 | last_1_WrapperStruct00_var_1_12)) ? (WrapperStruct00.var_1_5 == ((unsigned char) ((((WrapperStruct00.var_1_9) < 0 ) ? -(WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_9))))) : (WrapperStruct00.var_1_5 == ((unsigned char) (WrapperStruct00.var_1_10 - ((((WrapperStruct00.var_1_11) < 0 ) ? -(WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_11))))))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L118] EXPR (((! WrapperStruct00.var_1_2) ? (WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_1 == ((float) ((((WrapperStruct00.var_1_3) > (WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_4))))) : 1) : 1) && (((last_1_WrapperStruct00_var_1_5 / -2) >= (last_1_WrapperStruct00_var_1_17 | last_1_WrapperStruct00_var_1_12)) ? (WrapperStruct00.var_1_5 == ((unsigned char) ((((WrapperStruct00.var_1_9) < 0 ) ? -(WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_9))))) : (WrapperStruct00.var_1_5 == ((unsigned char) (WrapperStruct00.var_1_10 - ((((WrapperStruct00.var_1_11) < 0 ) ? -(WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_11)))))))) && (((WrapperStruct00.var_1_5 + WrapperStruct00.var_1_11) >= WrapperStruct00.var_1_9) ? ((((((WrapperStruct00.var_1_4) > ((WrapperStruct00.var_1_1 * WrapperStruct00.var_1_3))) ? (WrapperStruct00.var_1_4) : ((WrapperStruct00.var_1_1 * WrapperStruct00.var_1_3)))) <= WrapperStruct00.var_1_1) ? (WrapperStruct00.var_1_12 == ((unsigned char) ((((WrapperStruct00.var_1_11) > (WrapperStruct00.var_1_14)) ? (WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_14))))) : (WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_12 == ((unsigned char) (WrapperStruct00.var_1_11 + WrapperStruct00.var_1_15))) : 1)) : (WrapperStruct00.var_1_12 == ((unsigned char) WrapperStruct00.var_1_9))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L118] EXPR (((! WrapperStruct00.var_1_2) ? (WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_1 == ((float) ((((WrapperStruct00.var_1_3) > (WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_4))))) : 1) : 1) && (((last_1_WrapperStruct00_var_1_5 / -2) >= (last_1_WrapperStruct00_var_1_17 | last_1_WrapperStruct00_var_1_12)) ? (WrapperStruct00.var_1_5 == ((unsigned char) ((((WrapperStruct00.var_1_9) < 0 ) ? -(WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_9))))) : (WrapperStruct00.var_1_5 == ((unsigned char) (WrapperStruct00.var_1_10 - ((((WrapperStruct00.var_1_11) < 0 ) ? -(WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_11)))))))) && (((WrapperStruct00.var_1_5 + WrapperStruct00.var_1_11) >= WrapperStruct00.var_1_9) ? ((((((WrapperStruct00.var_1_4) > ((WrapperStruct00.var_1_1 * WrapperStruct00.var_1_3))) ? (WrapperStruct00.var_1_4) : ((WrapperStruct00.var_1_1 * WrapperStruct00.var_1_3)))) <= WrapperStruct00.var_1_1) ? (WrapperStruct00.var_1_12 == ((unsigned char) ((((WrapperStruct00.var_1_11) > (WrapperStruct00.var_1_14)) ? (WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_14))))) : (WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_12 == ((unsigned char) (WrapperStruct00.var_1_11 + WrapperStruct00.var_1_15))) : 1)) : (WrapperStruct00.var_1_12 == ((unsigned char) WrapperStruct00.var_1_9))) [L118] EXPR WrapperStruct00.var_1_5 [L118] EXPR WrapperStruct00.var_1_11 [L118] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L118] EXPR ((WrapperStruct00.var_1_5 + WrapperStruct00.var_1_11) >= WrapperStruct00.var_1_9) ? ((((((WrapperStruct00.var_1_4) > ((WrapperStruct00.var_1_1 * WrapperStruct00.var_1_3))) ? (WrapperStruct00.var_1_4) : ((WrapperStruct00.var_1_1 * WrapperStruct00.var_1_3)))) <= WrapperStruct00.var_1_1) ? (WrapperStruct00.var_1_12 == ((unsigned char) ((((WrapperStruct00.var_1_11) > (WrapperStruct00.var_1_14)) ? (WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_14))))) : (WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_12 == ((unsigned char) (WrapperStruct00.var_1_11 + WrapperStruct00.var_1_15))) : 1)) : (WrapperStruct00.var_1_12 == ((unsigned char) WrapperStruct00.var_1_9)) [L118] EXPR WrapperStruct00.var_1_12 [L118] EXPR WrapperStruct00.var_1_9 [L118] EXPR ((WrapperStruct00.var_1_5 + WrapperStruct00.var_1_11) >= WrapperStruct00.var_1_9) ? ((((((WrapperStruct00.var_1_4) > ((WrapperStruct00.var_1_1 * WrapperStruct00.var_1_3))) ? (WrapperStruct00.var_1_4) : ((WrapperStruct00.var_1_1 * WrapperStruct00.var_1_3)))) <= WrapperStruct00.var_1_1) ? (WrapperStruct00.var_1_12 == ((unsigned char) ((((WrapperStruct00.var_1_11) > (WrapperStruct00.var_1_14)) ? (WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_14))))) : (WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_12 == ((unsigned char) (WrapperStruct00.var_1_11 + WrapperStruct00.var_1_15))) : 1)) : (WrapperStruct00.var_1_12 == ((unsigned char) WrapperStruct00.var_1_9)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L118] EXPR (((! WrapperStruct00.var_1_2) ? (WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_1 == ((float) ((((WrapperStruct00.var_1_3) > (WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_4))))) : 1) : 1) && (((last_1_WrapperStruct00_var_1_5 / -2) >= (last_1_WrapperStruct00_var_1_17 | last_1_WrapperStruct00_var_1_12)) ? (WrapperStruct00.var_1_5 == ((unsigned char) ((((WrapperStruct00.var_1_9) < 0 ) ? -(WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_9))))) : (WrapperStruct00.var_1_5 == ((unsigned char) (WrapperStruct00.var_1_10 - ((((WrapperStruct00.var_1_11) < 0 ) ? -(WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_11)))))))) && (((WrapperStruct00.var_1_5 + WrapperStruct00.var_1_11) >= WrapperStruct00.var_1_9) ? ((((((WrapperStruct00.var_1_4) > ((WrapperStruct00.var_1_1 * WrapperStruct00.var_1_3))) ? (WrapperStruct00.var_1_4) : ((WrapperStruct00.var_1_1 * WrapperStruct00.var_1_3)))) <= WrapperStruct00.var_1_1) ? (WrapperStruct00.var_1_12 == ((unsigned char) ((((WrapperStruct00.var_1_11) > (WrapperStruct00.var_1_14)) ? (WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_14))))) : (WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_12 == ((unsigned char) (WrapperStruct00.var_1_11 + WrapperStruct00.var_1_15))) : 1)) : (WrapperStruct00.var_1_12 == ((unsigned char) WrapperStruct00.var_1_9))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L118] EXPR ((((! WrapperStruct00.var_1_2) ? (WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_1 == ((float) ((((WrapperStruct00.var_1_3) > (WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_4))))) : 1) : 1) && (((last_1_WrapperStruct00_var_1_5 / -2) >= (last_1_WrapperStruct00_var_1_17 | last_1_WrapperStruct00_var_1_12)) ? (WrapperStruct00.var_1_5 == ((unsigned char) ((((WrapperStruct00.var_1_9) < 0 ) ? -(WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_9))))) : (WrapperStruct00.var_1_5 == ((unsigned char) (WrapperStruct00.var_1_10 - ((((WrapperStruct00.var_1_11) < 0 ) ? -(WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_11)))))))) && (((WrapperStruct00.var_1_5 + WrapperStruct00.var_1_11) >= WrapperStruct00.var_1_9) ? ((((((WrapperStruct00.var_1_4) > ((WrapperStruct00.var_1_1 * WrapperStruct00.var_1_3))) ? (WrapperStruct00.var_1_4) : ((WrapperStruct00.var_1_1 * WrapperStruct00.var_1_3)))) <= WrapperStruct00.var_1_1) ? (WrapperStruct00.var_1_12 == ((unsigned char) ((((WrapperStruct00.var_1_11) > (WrapperStruct00.var_1_14)) ? (WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_14))))) : (WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_12 == ((unsigned char) (WrapperStruct00.var_1_11 + WrapperStruct00.var_1_15))) : 1)) : (WrapperStruct00.var_1_12 == ((unsigned char) WrapperStruct00.var_1_9)))) && (WrapperStruct00.var_1_16 == ((double) WrapperStruct00.var_1_4)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L118] EXPR ((((! WrapperStruct00.var_1_2) ? (WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_1 == ((float) ((((WrapperStruct00.var_1_3) > (WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_4))))) : 1) : 1) && (((last_1_WrapperStruct00_var_1_5 / -2) >= (last_1_WrapperStruct00_var_1_17 | last_1_WrapperStruct00_var_1_12)) ? (WrapperStruct00.var_1_5 == ((unsigned char) ((((WrapperStruct00.var_1_9) < 0 ) ? -(WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_9))))) : (WrapperStruct00.var_1_5 == ((unsigned char) (WrapperStruct00.var_1_10 - ((((WrapperStruct00.var_1_11) < 0 ) ? -(WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_11)))))))) && (((WrapperStruct00.var_1_5 + WrapperStruct00.var_1_11) >= WrapperStruct00.var_1_9) ? ((((((WrapperStruct00.var_1_4) > ((WrapperStruct00.var_1_1 * WrapperStruct00.var_1_3))) ? (WrapperStruct00.var_1_4) : ((WrapperStruct00.var_1_1 * WrapperStruct00.var_1_3)))) <= WrapperStruct00.var_1_1) ? (WrapperStruct00.var_1_12 == ((unsigned char) ((((WrapperStruct00.var_1_11) > (WrapperStruct00.var_1_14)) ? (WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_14))))) : (WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_12 == ((unsigned char) (WrapperStruct00.var_1_11 + WrapperStruct00.var_1_15))) : 1)) : (WrapperStruct00.var_1_12 == ((unsigned char) WrapperStruct00.var_1_9)))) && (WrapperStruct00.var_1_16 == ((double) WrapperStruct00.var_1_4)) [L118] EXPR WrapperStruct00.var_1_16 [L118] EXPR WrapperStruct00.var_1_4 [L118] EXPR ((((! WrapperStruct00.var_1_2) ? (WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_1 == ((float) ((((WrapperStruct00.var_1_3) > (WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_4))))) : 1) : 1) && (((last_1_WrapperStruct00_var_1_5 / -2) >= (last_1_WrapperStruct00_var_1_17 | last_1_WrapperStruct00_var_1_12)) ? (WrapperStruct00.var_1_5 == ((unsigned char) ((((WrapperStruct00.var_1_9) < 0 ) ? -(WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_9))))) : (WrapperStruct00.var_1_5 == ((unsigned char) (WrapperStruct00.var_1_10 - ((((WrapperStruct00.var_1_11) < 0 ) ? -(WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_11)))))))) && (((WrapperStruct00.var_1_5 + WrapperStruct00.var_1_11) >= WrapperStruct00.var_1_9) ? ((((((WrapperStruct00.var_1_4) > ((WrapperStruct00.var_1_1 * WrapperStruct00.var_1_3))) ? (WrapperStruct00.var_1_4) : ((WrapperStruct00.var_1_1 * WrapperStruct00.var_1_3)))) <= WrapperStruct00.var_1_1) ? (WrapperStruct00.var_1_12 == ((unsigned char) ((((WrapperStruct00.var_1_11) > (WrapperStruct00.var_1_14)) ? (WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_14))))) : (WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_12 == ((unsigned char) (WrapperStruct00.var_1_11 + WrapperStruct00.var_1_15))) : 1)) : (WrapperStruct00.var_1_12 == ((unsigned char) WrapperStruct00.var_1_9)))) && (WrapperStruct00.var_1_16 == ((double) WrapperStruct00.var_1_4)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L118] EXPR (((((! WrapperStruct00.var_1_2) ? (WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_1 == ((float) ((((WrapperStruct00.var_1_3) > (WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_4))))) : 1) : 1) && (((last_1_WrapperStruct00_var_1_5 / -2) >= (last_1_WrapperStruct00_var_1_17 | last_1_WrapperStruct00_var_1_12)) ? (WrapperStruct00.var_1_5 == ((unsigned char) ((((WrapperStruct00.var_1_9) < 0 ) ? -(WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_9))))) : (WrapperStruct00.var_1_5 == ((unsigned char) (WrapperStruct00.var_1_10 - ((((WrapperStruct00.var_1_11) < 0 ) ? -(WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_11)))))))) && (((WrapperStruct00.var_1_5 + WrapperStruct00.var_1_11) >= WrapperStruct00.var_1_9) ? ((((((WrapperStruct00.var_1_4) > ((WrapperStruct00.var_1_1 * WrapperStruct00.var_1_3))) ? (WrapperStruct00.var_1_4) : ((WrapperStruct00.var_1_1 * WrapperStruct00.var_1_3)))) <= WrapperStruct00.var_1_1) ? (WrapperStruct00.var_1_12 == ((unsigned char) ((((WrapperStruct00.var_1_11) > (WrapperStruct00.var_1_14)) ? (WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_14))))) : (WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_12 == ((unsigned char) (WrapperStruct00.var_1_11 + WrapperStruct00.var_1_15))) : 1)) : (WrapperStruct00.var_1_12 == ((unsigned char) WrapperStruct00.var_1_9)))) && (WrapperStruct00.var_1_16 == ((double) WrapperStruct00.var_1_4))) && (WrapperStruct00.var_1_17 == ((unsigned char) WrapperStruct00.var_1_9)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L118] EXPR (((((! WrapperStruct00.var_1_2) ? (WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_1 == ((float) ((((WrapperStruct00.var_1_3) > (WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_4))))) : 1) : 1) && (((last_1_WrapperStruct00_var_1_5 / -2) >= (last_1_WrapperStruct00_var_1_17 | last_1_WrapperStruct00_var_1_12)) ? (WrapperStruct00.var_1_5 == ((unsigned char) ((((WrapperStruct00.var_1_9) < 0 ) ? -(WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_9))))) : (WrapperStruct00.var_1_5 == ((unsigned char) (WrapperStruct00.var_1_10 - ((((WrapperStruct00.var_1_11) < 0 ) ? -(WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_11)))))))) && (((WrapperStruct00.var_1_5 + WrapperStruct00.var_1_11) >= WrapperStruct00.var_1_9) ? ((((((WrapperStruct00.var_1_4) > ((WrapperStruct00.var_1_1 * WrapperStruct00.var_1_3))) ? (WrapperStruct00.var_1_4) : ((WrapperStruct00.var_1_1 * WrapperStruct00.var_1_3)))) <= WrapperStruct00.var_1_1) ? (WrapperStruct00.var_1_12 == ((unsigned char) ((((WrapperStruct00.var_1_11) > (WrapperStruct00.var_1_14)) ? (WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_14))))) : (WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_12 == ((unsigned char) (WrapperStruct00.var_1_11 + WrapperStruct00.var_1_15))) : 1)) : (WrapperStruct00.var_1_12 == ((unsigned char) WrapperStruct00.var_1_9)))) && (WrapperStruct00.var_1_16 == ((double) WrapperStruct00.var_1_4))) && (WrapperStruct00.var_1_17 == ((unsigned char) WrapperStruct00.var_1_9)) [L118] EXPR WrapperStruct00.var_1_17 [L118] EXPR WrapperStruct00.var_1_9 [L118] EXPR (((((! WrapperStruct00.var_1_2) ? (WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_1 == ((float) ((((WrapperStruct00.var_1_3) > (WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_4))))) : 1) : 1) && (((last_1_WrapperStruct00_var_1_5 / -2) >= (last_1_WrapperStruct00_var_1_17 | last_1_WrapperStruct00_var_1_12)) ? (WrapperStruct00.var_1_5 == ((unsigned char) ((((WrapperStruct00.var_1_9) < 0 ) ? -(WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_9))))) : (WrapperStruct00.var_1_5 == ((unsigned char) (WrapperStruct00.var_1_10 - ((((WrapperStruct00.var_1_11) < 0 ) ? -(WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_11)))))))) && (((WrapperStruct00.var_1_5 + WrapperStruct00.var_1_11) >= WrapperStruct00.var_1_9) ? ((((((WrapperStruct00.var_1_4) > ((WrapperStruct00.var_1_1 * WrapperStruct00.var_1_3))) ? (WrapperStruct00.var_1_4) : ((WrapperStruct00.var_1_1 * WrapperStruct00.var_1_3)))) <= WrapperStruct00.var_1_1) ? (WrapperStruct00.var_1_12 == ((unsigned char) ((((WrapperStruct00.var_1_11) > (WrapperStruct00.var_1_14)) ? (WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_14))))) : (WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_12 == ((unsigned char) (WrapperStruct00.var_1_11 + WrapperStruct00.var_1_15))) : 1)) : (WrapperStruct00.var_1_12 == ((unsigned char) WrapperStruct00.var_1_9)))) && (WrapperStruct00.var_1_16 == ((double) WrapperStruct00.var_1_4))) && (WrapperStruct00.var_1_17 == ((unsigned char) WrapperStruct00.var_1_9)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L118] EXPR ((((((! WrapperStruct00.var_1_2) ? (WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_1 == ((float) ((((WrapperStruct00.var_1_3) > (WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_4))))) : 1) : 1) && (((last_1_WrapperStruct00_var_1_5 / -2) >= (last_1_WrapperStruct00_var_1_17 | last_1_WrapperStruct00_var_1_12)) ? (WrapperStruct00.var_1_5 == ((unsigned char) ((((WrapperStruct00.var_1_9) < 0 ) ? -(WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_9))))) : (WrapperStruct00.var_1_5 == ((unsigned char) (WrapperStruct00.var_1_10 - ((((WrapperStruct00.var_1_11) < 0 ) ? -(WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_11)))))))) && (((WrapperStruct00.var_1_5 + WrapperStruct00.var_1_11) >= WrapperStruct00.var_1_9) ? ((((((WrapperStruct00.var_1_4) > ((WrapperStruct00.var_1_1 * WrapperStruct00.var_1_3))) ? (WrapperStruct00.var_1_4) : ((WrapperStruct00.var_1_1 * WrapperStruct00.var_1_3)))) <= WrapperStruct00.var_1_1) ? (WrapperStruct00.var_1_12 == ((unsigned char) ((((WrapperStruct00.var_1_11) > (WrapperStruct00.var_1_14)) ? (WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_14))))) : (WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_12 == ((unsigned char) (WrapperStruct00.var_1_11 + WrapperStruct00.var_1_15))) : 1)) : (WrapperStruct00.var_1_12 == ((unsigned char) WrapperStruct00.var_1_9)))) && (WrapperStruct00.var_1_16 == ((double) WrapperStruct00.var_1_4))) && (WrapperStruct00.var_1_17 == ((unsigned char) WrapperStruct00.var_1_9))) && (WrapperStruct00.var_1_18 == ((double) WrapperStruct00.var_1_3)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L118] EXPR ((((((! WrapperStruct00.var_1_2) ? (WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_1 == ((float) ((((WrapperStruct00.var_1_3) > (WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_4))))) : 1) : 1) && (((last_1_WrapperStruct00_var_1_5 / -2) >= (last_1_WrapperStruct00_var_1_17 | last_1_WrapperStruct00_var_1_12)) ? (WrapperStruct00.var_1_5 == ((unsigned char) ((((WrapperStruct00.var_1_9) < 0 ) ? -(WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_9))))) : (WrapperStruct00.var_1_5 == ((unsigned char) (WrapperStruct00.var_1_10 - ((((WrapperStruct00.var_1_11) < 0 ) ? -(WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_11)))))))) && (((WrapperStruct00.var_1_5 + WrapperStruct00.var_1_11) >= WrapperStruct00.var_1_9) ? ((((((WrapperStruct00.var_1_4) > ((WrapperStruct00.var_1_1 * WrapperStruct00.var_1_3))) ? (WrapperStruct00.var_1_4) : ((WrapperStruct00.var_1_1 * WrapperStruct00.var_1_3)))) <= WrapperStruct00.var_1_1) ? (WrapperStruct00.var_1_12 == ((unsigned char) ((((WrapperStruct00.var_1_11) > (WrapperStruct00.var_1_14)) ? (WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_14))))) : (WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_12 == ((unsigned char) (WrapperStruct00.var_1_11 + WrapperStruct00.var_1_15))) : 1)) : (WrapperStruct00.var_1_12 == ((unsigned char) WrapperStruct00.var_1_9)))) && (WrapperStruct00.var_1_16 == ((double) WrapperStruct00.var_1_4))) && (WrapperStruct00.var_1_17 == ((unsigned char) WrapperStruct00.var_1_9))) && (WrapperStruct00.var_1_18 == ((double) WrapperStruct00.var_1_3)) [L118] EXPR WrapperStruct00.var_1_18 [L118] EXPR WrapperStruct00.var_1_3 [L118] EXPR ((((((! WrapperStruct00.var_1_2) ? (WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_1 == ((float) ((((WrapperStruct00.var_1_3) > (WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_4))))) : 1) : 1) && (((last_1_WrapperStruct00_var_1_5 / -2) >= (last_1_WrapperStruct00_var_1_17 | last_1_WrapperStruct00_var_1_12)) ? (WrapperStruct00.var_1_5 == ((unsigned char) ((((WrapperStruct00.var_1_9) < 0 ) ? -(WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_9))))) : (WrapperStruct00.var_1_5 == ((unsigned char) (WrapperStruct00.var_1_10 - ((((WrapperStruct00.var_1_11) < 0 ) ? -(WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_11)))))))) && (((WrapperStruct00.var_1_5 + WrapperStruct00.var_1_11) >= WrapperStruct00.var_1_9) ? ((((((WrapperStruct00.var_1_4) > ((WrapperStruct00.var_1_1 * WrapperStruct00.var_1_3))) ? (WrapperStruct00.var_1_4) : ((WrapperStruct00.var_1_1 * WrapperStruct00.var_1_3)))) <= WrapperStruct00.var_1_1) ? (WrapperStruct00.var_1_12 == ((unsigned char) ((((WrapperStruct00.var_1_11) > (WrapperStruct00.var_1_14)) ? (WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_14))))) : (WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_12 == ((unsigned char) (WrapperStruct00.var_1_11 + WrapperStruct00.var_1_15))) : 1)) : (WrapperStruct00.var_1_12 == ((unsigned char) WrapperStruct00.var_1_9)))) && (WrapperStruct00.var_1_16 == ((double) WrapperStruct00.var_1_4))) && (WrapperStruct00.var_1_17 == ((unsigned char) WrapperStruct00.var_1_9))) && (WrapperStruct00.var_1_18 == ((double) WrapperStruct00.var_1_3)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L118-L119] return ((((((! WrapperStruct00.var_1_2) ? (WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_1 == ((float) ((((WrapperStruct00.var_1_3) > (WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_4))))) : 1) : 1) && (((last_1_WrapperStruct00_var_1_5 / -2) >= (last_1_WrapperStruct00_var_1_17 | last_1_WrapperStruct00_var_1_12)) ? (WrapperStruct00.var_1_5 == ((unsigned char) ((((WrapperStruct00.var_1_9) < 0 ) ? -(WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_9))))) : (WrapperStruct00.var_1_5 == ((unsigned char) (WrapperStruct00.var_1_10 - ((((WrapperStruct00.var_1_11) < 0 ) ? -(WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_11)))))))) && (((WrapperStruct00.var_1_5 + WrapperStruct00.var_1_11) >= WrapperStruct00.var_1_9) ? ((((((WrapperStruct00.var_1_4) > ((WrapperStruct00.var_1_1 * WrapperStruct00.var_1_3))) ? (WrapperStruct00.var_1_4) : ((WrapperStruct00.var_1_1 * WrapperStruct00.var_1_3)))) <= WrapperStruct00.var_1_1) ? (WrapperStruct00.var_1_12 == ((unsigned char) ((((WrapperStruct00.var_1_11) > (WrapperStruct00.var_1_14)) ? (WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_14))))) : (WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_12 == ((unsigned char) (WrapperStruct00.var_1_11 + WrapperStruct00.var_1_15))) : 1)) : (WrapperStruct00.var_1_12 == ((unsigned char) WrapperStruct00.var_1_9)))) && (WrapperStruct00.var_1_16 == ((double) WrapperStruct00.var_1_4))) && (WrapperStruct00.var_1_17 == ((unsigned char) WrapperStruct00.var_1_9))) && (WrapperStruct00.var_1_18 == ((double) WrapperStruct00.var_1_3)) ; [L128] RET, EXPR property() [L128] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, \old(cond)=0, cond=0, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L19] reach_error() VAL [WrapperStruct00={4:0}, \old(cond)=0, cond=0, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 106 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.4s, OverallIterations: 13, TraceHistogramMax: 14, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1125 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1122 mSDsluCounter, 6516 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4693 mSDsCounter, 88 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1662 IncrementalHoareTripleChecker+Invalid, 1750 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 88 mSolverCounterUnsat, 1823 mSDtfsCounter, 1662 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 444 GetRequests, 384 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=385occurred in iteration=12, InterpolantAutomatonStates: 77, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 12 MinimizatonAttempts, 375 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 1553 NumberOfCodeBlocks, 1553 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 1418 ConstructedInterpolants, 0 QuantifiedInterpolants, 2613 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 4368/4368 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-12-19 15:54:17,446 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...