/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-73.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-15 21:41:38,465 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-15 21:41:38,527 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-15 21:41:38,530 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-15 21:41:38,530 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-15 21:41:38,568 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-15 21:41:38,568 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-15 21:41:38,569 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-15 21:41:38,569 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-15 21:41:38,569 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-15 21:41:38,570 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-15 21:41:38,570 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-15 21:41:38,570 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-15 21:41:38,570 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-15 21:41:38,571 INFO L153 SettingsManager]: * Use SBE=true [2023-12-15 21:41:38,571 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-15 21:41:38,571 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-15 21:41:38,571 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-15 21:41:38,572 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-15 21:41:38,572 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-15 21:41:38,572 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-15 21:41:38,584 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-15 21:41:38,584 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-15 21:41:38,584 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-15 21:41:38,585 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-15 21:41:38,585 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-15 21:41:38,585 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-15 21:41:38,585 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-15 21:41:38,585 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-15 21:41:38,585 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-15 21:41:38,586 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-15 21:41:38,586 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-15 21:41:38,586 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-15 21:41:38,586 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-15 21:41:38,586 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-15 21:41:38,586 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-15 21:41:38,586 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-15 21:41:38,587 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-15 21:41:38,587 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-15 21:41:38,587 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-15 21:41:38,587 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-15 21:41:38,587 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-15 21:41:38,587 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-15 21:41:38,587 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-15 21:41:38,753 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-15 21:41:38,773 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-15 21:41:38,775 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-15 21:41:38,776 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-15 21:41:38,776 INFO L274 PluginConnector]: CDTParser initialized [2023-12-15 21:41:38,777 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-73.i [2023-12-15 21:41:39,829 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-15 21:41:39,966 INFO L384 CDTParser]: Found 1 translation units. [2023-12-15 21:41:39,966 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-73.i [2023-12-15 21:41:39,971 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7e15a6670/79f74ca878c8424797122d4a20c6233e/FLAG67d6ba212 [2023-12-15 21:41:39,981 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7e15a6670/79f74ca878c8424797122d4a20c6233e [2023-12-15 21:41:39,983 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-15 21:41:39,984 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-15 21:41:39,984 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-15 21:41:39,984 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-15 21:41:39,988 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-15 21:41:39,988 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 09:41:39" (1/1) ... [2023-12-15 21:41:39,989 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e834f45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:41:39, skipping insertion in model container [2023-12-15 21:41:39,989 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 09:41:39" (1/1) ... [2023-12-15 21:41:40,007 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-15 21:41:40,117 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-73.i[916,929] [2023-12-15 21:41:40,156 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-15 21:41:40,169 INFO L202 MainTranslator]: Completed pre-run [2023-12-15 21:41:40,178 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-73.i[916,929] [2023-12-15 21:41:40,210 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-15 21:41:40,223 INFO L206 MainTranslator]: Completed translation [2023-12-15 21:41:40,223 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:41:40 WrapperNode [2023-12-15 21:41:40,223 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-15 21:41:40,224 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-15 21:41:40,224 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-15 21:41:40,224 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-15 21:41:40,228 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:41:40" (1/1) ... [2023-12-15 21:41:40,241 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:41:40" (1/1) ... [2023-12-15 21:41:40,270 INFO L138 Inliner]: procedures = 29, calls = 161, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 490 [2023-12-15 21:41:40,271 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-15 21:41:40,282 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-15 21:41:40,282 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-15 21:41:40,282 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-15 21:41:40,290 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:41:40" (1/1) ... [2023-12-15 21:41:40,290 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:41:40" (1/1) ... [2023-12-15 21:41:40,295 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:41:40" (1/1) ... [2023-12-15 21:41:40,313 INFO L175 MemorySlicer]: Split 134 memory accesses to 2 slices as follows [2, 132]. 99 percent of accesses are in the largest equivalence class. The 16 initializations are split as follows [2, 14]. The 19 writes are split as follows [0, 19]. [2023-12-15 21:41:40,314 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:41:40" (1/1) ... [2023-12-15 21:41:40,314 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:41:40" (1/1) ... [2023-12-15 21:41:40,327 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:41:40" (1/1) ... [2023-12-15 21:41:40,330 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:41:40" (1/1) ... [2023-12-15 21:41:40,332 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:41:40" (1/1) ... [2023-12-15 21:41:40,334 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:41:40" (1/1) ... [2023-12-15 21:41:40,338 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-15 21:41:40,338 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-15 21:41:40,338 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-15 21:41:40,338 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-15 21:41:40,339 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:41:40" (1/1) ... [2023-12-15 21:41:40,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-15 21:41:40,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 21:41:40,409 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-15 21:41:40,456 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-15 21:41:40,461 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-15 21:41:40,461 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2023-12-15 21:41:40,461 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2023-12-15 21:41:40,461 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-12-15 21:41:40,462 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-12-15 21:41:40,462 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2023-12-15 21:41:40,462 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2023-12-15 21:41:40,462 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-12-15 21:41:40,462 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-12-15 21:41:40,462 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2023-12-15 21:41:40,462 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2023-12-15 21:41:40,462 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-15 21:41:40,462 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-15 21:41:40,462 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-15 21:41:40,462 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-12-15 21:41:40,462 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-15 21:41:40,463 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-15 21:41:40,543 INFO L241 CfgBuilder]: Building ICFG [2023-12-15 21:41:40,545 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-15 21:41:40,878 INFO L282 CfgBuilder]: Performing block encoding [2023-12-15 21:41:40,907 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-15 21:41:40,907 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-15 21:41:40,907 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 09:41:40 BoogieIcfgContainer [2023-12-15 21:41:40,907 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-15 21:41:40,909 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-15 21:41:40,909 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-15 21:41:40,911 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-15 21:41:40,911 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.12 09:41:39" (1/3) ... [2023-12-15 21:41:40,911 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1778e4c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 09:41:40, skipping insertion in model container [2023-12-15 21:41:40,911 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:41:40" (2/3) ... [2023-12-15 21:41:40,912 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1778e4c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 09:41:40, skipping insertion in model container [2023-12-15 21:41:40,912 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 09:41:40" (3/3) ... [2023-12-15 21:41:40,913 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-73.i [2023-12-15 21:41:40,924 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-15 21:41:40,925 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-15 21:41:40,957 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-15 21:41:40,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;@11858dc0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-15 21:41:40,962 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-15 21:41:40,967 INFO L276 IsEmpty]: Start isEmpty. Operand has 102 states, 84 states have (on average 1.4761904761904763) internal successors, (124), 85 states have internal predecessors, (124), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-12-15 21:41:40,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2023-12-15 21:41:40,976 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:41:40,976 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 21:41:40,977 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:41:40,980 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:41:40,980 INFO L85 PathProgramCache]: Analyzing trace with hash -1173027293, now seen corresponding path program 1 times [2023-12-15 21:41:40,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:41:40,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820190094] [2023-12-15 21:41:40,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:41:40,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:41:41,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:41:41,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:41:41,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:41:41,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:41:41,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:41:41,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-15 21:41:41,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:41:41,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-15 21:41:41,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:41:41,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 21:41:41,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:41:41,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 21:41:41,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:41:41,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-15 21:41:41,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:41:41,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-15 21:41:41,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:41:41,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-15 21:41:41,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:41:41,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 21:41:41,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:41:41,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 21:41:41,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:41:41,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-15 21:41:41,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:41:41,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-15 21:41:41,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:41:41,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-15 21:41:41,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:41:41,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-15 21:41:41,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:41:41,291 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-15 21:41:41,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:41:41,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820190094] [2023-12-15 21:41:41,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820190094] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:41:41,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:41:41,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-15 21:41:41,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955990802] [2023-12-15 21:41:41,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:41:41,297 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-15 21:41:41,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:41:41,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-15 21:41:41,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-15 21:41:41,324 INFO L87 Difference]: Start difference. First operand has 102 states, 84 states have (on average 1.4761904761904763) internal successors, (124), 85 states have internal predecessors, (124), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2023-12-15 21:41:41,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:41:41,372 INFO L93 Difference]: Finished difference Result 201 states and 321 transitions. [2023-12-15 21:41:41,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-15 21:41:41,374 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 123 [2023-12-15 21:41:41,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:41:41,381 INFO L225 Difference]: With dead ends: 201 [2023-12-15 21:41:41,381 INFO L226 Difference]: Without dead ends: 100 [2023-12-15 21:41:41,384 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 47 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-15 21:41:41,388 INFO L413 NwaCegarLoop]: 144 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 21:41:41,389 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 144 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 21:41:41,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2023-12-15 21:41:41,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2023-12-15 21:41:41,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 83 states have (on average 1.4337349397590362) internal successors, (119), 83 states have internal predecessors, (119), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-12-15 21:41:41,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 149 transitions. [2023-12-15 21:41:41,424 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 149 transitions. Word has length 123 [2023-12-15 21:41:41,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:41:41,425 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 149 transitions. [2023-12-15 21:41:41,425 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2023-12-15 21:41:41,425 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 149 transitions. [2023-12-15 21:41:41,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2023-12-15 21:41:41,427 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:41:41,427 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 21:41:41,427 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-15 21:41:41,427 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:41:41,428 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:41:41,428 INFO L85 PathProgramCache]: Analyzing trace with hash 1520614689, now seen corresponding path program 1 times [2023-12-15 21:41:41,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:41:41,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131701775] [2023-12-15 21:41:41,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:41:41,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:41:41,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:41:41,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:41:41,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:41:41,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:41:41,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:41:41,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-15 21:41:41,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:41:41,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-15 21:41:41,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:41:41,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 21:41:41,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:41:41,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 21:41:41,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:41:41,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-15 21:41:41,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:41:41,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-15 21:41:41,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:41:41,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-15 21:41:41,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:41:41,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 21:41:41,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:41:41,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 21:41:41,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:41:41,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-15 21:41:41,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:41:41,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-15 21:41:41,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:41:41,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-15 21:41:41,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:41:41,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-15 21:41:41,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:41:41,698 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-15 21:41:41,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:41:41,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131701775] [2023-12-15 21:41:41,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [131701775] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:41:41,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:41:41,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-15 21:41:41,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593616857] [2023-12-15 21:41:41,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:41:41,700 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-15 21:41:41,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:41:41,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-15 21:41:41,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-15 21:41:41,714 INFO L87 Difference]: Start difference. First operand 100 states and 149 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2023-12-15 21:41:41,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:41:41,767 INFO L93 Difference]: Finished difference Result 205 states and 306 transitions. [2023-12-15 21:41:41,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-15 21:41:41,768 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 123 [2023-12-15 21:41:41,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:41:41,772 INFO L225 Difference]: With dead ends: 205 [2023-12-15 21:41:41,772 INFO L226 Difference]: Without dead ends: 106 [2023-12-15 21:41:41,773 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 32 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-15 21:41:41,774 INFO L413 NwaCegarLoop]: 145 mSDtfsCounter, 10 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 424 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 21:41:41,775 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 424 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 21:41:41,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2023-12-15 21:41:41,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 102. [2023-12-15 21:41:41,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 85 states have (on average 1.423529411764706) internal successors, (121), 85 states have internal predecessors, (121), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-12-15 21:41:41,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 151 transitions. [2023-12-15 21:41:41,783 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 151 transitions. Word has length 123 [2023-12-15 21:41:41,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:41:41,783 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 151 transitions. [2023-12-15 21:41:41,783 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2023-12-15 21:41:41,783 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 151 transitions. [2023-12-15 21:41:41,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2023-12-15 21:41:41,788 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:41:41,788 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 21:41:41,788 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-15 21:41:41,788 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:41:41,789 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:41:41,789 INFO L85 PathProgramCache]: Analyzing trace with hash -1735768033, now seen corresponding path program 1 times [2023-12-15 21:41:41,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:41:41,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463322795] [2023-12-15 21:41:41,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:41:41,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:41:41,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:41:41,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:41:41,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:41:41,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:41:42,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:41:42,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-15 21:41:42,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:41:42,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-15 21:41:42,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:41:42,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 21:41:42,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:41:42,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 21:41:42,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:41:42,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-15 21:41:42,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:41:42,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-15 21:41:42,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:41:42,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-15 21:41:42,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:41:42,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 21:41:42,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:41:42,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 21:41:42,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:41:42,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-15 21:41:42,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:41:42,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-15 21:41:42,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:41:42,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-15 21:41:42,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:41:42,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-15 21:41:42,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:41:42,033 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-15 21:41:42,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:41:42,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463322795] [2023-12-15 21:41:42,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463322795] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:41:42,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:41:42,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-15 21:41:42,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579976569] [2023-12-15 21:41:42,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:41:42,036 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-15 21:41:42,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:41:42,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-15 21:41:42,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-15 21:41:42,039 INFO L87 Difference]: Start difference. First operand 102 states and 151 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-15 21:41:42,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:41:42,090 INFO L93 Difference]: Finished difference Result 227 states and 337 transitions. [2023-12-15 21:41:42,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-15 21:41:42,091 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 123 [2023-12-15 21:41:42,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:41:42,092 INFO L225 Difference]: With dead ends: 227 [2023-12-15 21:41:42,092 INFO L226 Difference]: Without dead ends: 126 [2023-12-15 21:41:42,093 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 33 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-15 21:41:42,096 INFO L413 NwaCegarLoop]: 162 mSDtfsCounter, 57 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 450 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 21:41:42,097 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 450 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 21:41:42,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2023-12-15 21:41:42,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 104. [2023-12-15 21:41:42,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 87 states have (on average 1.4137931034482758) internal successors, (123), 87 states have internal predecessors, (123), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-12-15 21:41:42,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 153 transitions. [2023-12-15 21:41:42,113 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 153 transitions. Word has length 123 [2023-12-15 21:41:42,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:41:42,113 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 153 transitions. [2023-12-15 21:41:42,113 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-15 21:41:42,113 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 153 transitions. [2023-12-15 21:41:42,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2023-12-15 21:41:42,115 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:41:42,115 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 21:41:42,115 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-15 21:41:42,115 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:41:42,115 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:41:42,115 INFO L85 PathProgramCache]: Analyzing trace with hash 319707748, now seen corresponding path program 1 times [2023-12-15 21:41:42,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:41:42,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332814346] [2023-12-15 21:41:42,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:41:42,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:41:42,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:41:42,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:41:42,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:41:42,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:41:42,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:41:42,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-15 21:41:42,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:41:42,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-15 21:41:42,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:41:42,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 21:41:42,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:41:42,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 21:41:42,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:41:42,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-15 21:41:42,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:41:42,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-15 21:41:42,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:41:42,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-15 21:41:42,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:41:42,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 21:41:42,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:41:42,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 21:41:42,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:41:42,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-15 21:41:42,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:41:42,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-15 21:41:42,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:41:42,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-15 21:41:42,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:41:42,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-15 21:41:42,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:41:42,237 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-15 21:41:42,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:41:42,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332814346] [2023-12-15 21:41:42,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1332814346] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:41:42,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:41:42,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-15 21:41:42,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668032177] [2023-12-15 21:41:42,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:41:42,238 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-15 21:41:42,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:41:42,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-15 21:41:42,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-15 21:41:42,239 INFO L87 Difference]: Start difference. First operand 104 states and 153 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-15 21:41:42,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:41:42,269 INFO L93 Difference]: Finished difference Result 215 states and 316 transitions. [2023-12-15 21:41:42,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-15 21:41:42,270 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 125 [2023-12-15 21:41:42,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:41:42,272 INFO L225 Difference]: With dead ends: 215 [2023-12-15 21:41:42,272 INFO L226 Difference]: Without dead ends: 112 [2023-12-15 21:41:42,274 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 32 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-15 21:41:42,279 INFO L413 NwaCegarLoop]: 141 mSDtfsCounter, 12 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 422 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-15 21:41:42,279 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 422 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 21:41:42,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2023-12-15 21:41:42,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 106. [2023-12-15 21:41:42,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 89 states have (on average 1.404494382022472) internal successors, (125), 89 states have internal predecessors, (125), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-12-15 21:41:42,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 155 transitions. [2023-12-15 21:41:42,290 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 155 transitions. Word has length 125 [2023-12-15 21:41:42,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:41:42,290 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 155 transitions. [2023-12-15 21:41:42,290 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-15 21:41:42,290 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 155 transitions. [2023-12-15 21:41:42,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2023-12-15 21:41:42,291 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:41:42,291 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 21:41:42,292 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-15 21:41:42,292 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:41:42,292 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:41:42,292 INFO L85 PathProgramCache]: Analyzing trace with hash 376966050, now seen corresponding path program 1 times [2023-12-15 21:41:42,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:41:42,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820058142] [2023-12-15 21:41:42,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:41:42,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:41:42,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:41:43,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:41:43,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:41:43,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:41:43,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:41:43,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-15 21:41:43,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:41:43,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-15 21:41:43,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:41:43,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 21:41:43,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:41:43,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 21:41:43,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:41:43,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-15 21:41:43,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:41:43,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-15 21:41:43,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:41:43,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-15 21:41:43,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:41:43,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 21:41:43,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:41:43,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 21:41:43,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:41:43,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-15 21:41:43,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:41:43,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-15 21:41:43,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:41:43,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-15 21:41:43,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:41:43,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-15 21:41:43,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:41:43,270 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-15 21:41:43,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:41:43,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820058142] [2023-12-15 21:41:43,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820058142] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:41:43,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:41:43,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-15 21:41:43,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666539091] [2023-12-15 21:41:43,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:41:43,271 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-15 21:41:43,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:41:43,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-15 21:41:43,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-15 21:41:43,272 INFO L87 Difference]: Start difference. First operand 106 states and 155 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-15 21:41:43,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:41:43,605 INFO L93 Difference]: Finished difference Result 318 states and 466 transitions. [2023-12-15 21:41:43,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-15 21:41:43,606 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 125 [2023-12-15 21:41:43,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:41:43,608 INFO L225 Difference]: With dead ends: 318 [2023-12-15 21:41:43,608 INFO L226 Difference]: Without dead ends: 213 [2023-12-15 21:41:43,608 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-12-15 21:41:43,609 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 99 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 430 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-15 21:41:43,609 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 309 Invalid, 436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 430 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-15 21:41:43,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2023-12-15 21:41:43,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 207. [2023-12-15 21:41:43,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 174 states have (on average 1.4022988505747127) internal successors, (244), 174 states have internal predecessors, (244), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2023-12-15 21:41:43,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 304 transitions. [2023-12-15 21:41:43,628 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 304 transitions. Word has length 125 [2023-12-15 21:41:43,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:41:43,629 INFO L495 AbstractCegarLoop]: Abstraction has 207 states and 304 transitions. [2023-12-15 21:41:43,629 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-15 21:41:43,629 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 304 transitions. [2023-12-15 21:41:43,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2023-12-15 21:41:43,635 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:41:43,635 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 21:41:43,636 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-15 21:41:43,636 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:41:43,636 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:41:43,636 INFO L85 PathProgramCache]: Analyzing trace with hash -1311977692, now seen corresponding path program 1 times [2023-12-15 21:41:43,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:41:43,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839886973] [2023-12-15 21:41:43,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:41:43,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:41:43,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:41:44,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:41:44,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:41:44,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:41:44,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:41:44,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-15 21:41:44,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:41:44,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-15 21:41:44,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:41:44,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 21:41:44,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:41:44,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 21:41:44,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:41:44,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-15 21:41:44,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:41:44,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-15 21:41:44,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:41:44,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-15 21:41:44,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:41:44,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 21:41:44,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:41:44,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 21:41:44,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:41:44,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-15 21:41:44,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:41:44,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-15 21:41:44,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:41:44,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-15 21:41:44,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:41:44,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-15 21:41:44,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:41:44,482 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-15 21:41:44,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:41:44,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839886973] [2023-12-15 21:41:44,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1839886973] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:41:44,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:41:44,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-15 21:41:44,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799238035] [2023-12-15 21:41:44,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:41:44,483 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-15 21:41:44,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:41:44,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-15 21:41:44,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-12-15 21:41:44,484 INFO L87 Difference]: Start difference. First operand 207 states and 304 transitions. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-15 21:41:44,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:41:44,992 INFO L93 Difference]: Finished difference Result 478 states and 700 transitions. [2023-12-15 21:41:44,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-15 21:41:44,992 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 125 [2023-12-15 21:41:44,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:41:44,994 INFO L225 Difference]: With dead ends: 478 [2023-12-15 21:41:44,994 INFO L226 Difference]: Without dead ends: 272 [2023-12-15 21:41:44,995 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2023-12-15 21:41:44,996 INFO L413 NwaCegarLoop]: 169 mSDtfsCounter, 223 mSDsluCounter, 390 mSDsCounter, 0 mSdLazyCounter, 666 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 559 SdHoareTripleChecker+Invalid, 687 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 666 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-15 21:41:44,997 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 559 Invalid, 687 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 666 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-15 21:41:44,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2023-12-15 21:41:45,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 205. [2023-12-15 21:41:45,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 172 states have (on average 1.4011627906976745) internal successors, (241), 172 states have internal predecessors, (241), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2023-12-15 21:41:45,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 301 transitions. [2023-12-15 21:41:45,009 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 301 transitions. Word has length 125 [2023-12-15 21:41:45,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:41:45,009 INFO L495 AbstractCegarLoop]: Abstraction has 205 states and 301 transitions. [2023-12-15 21:41:45,009 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-15 21:41:45,009 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 301 transitions. [2023-12-15 21:41:45,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2023-12-15 21:41:45,011 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:41:45,011 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 21:41:45,011 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-15 21:41:45,011 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:41:45,012 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:41:45,012 INFO L85 PathProgramCache]: Analyzing trace with hash 2120549576, now seen corresponding path program 1 times [2023-12-15 21:41:45,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:41:45,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856273727] [2023-12-15 21:41:45,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:41:45,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:41:45,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:41:45,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:41:45,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:41:45,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:41:45,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:41:45,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-15 21:41:45,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:41:45,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-15 21:41:45,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:41:45,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 21:41:45,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:41:45,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 21:41:45,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:41:45,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-15 21:41:45,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:41:45,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-15 21:41:45,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:41:45,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-15 21:41:45,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:41:45,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 21:41:45,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:41:45,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 21:41:45,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:41:45,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-15 21:41:45,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:41:45,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-15 21:41:45,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:41:45,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-15 21:41:45,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:41:45,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-15 21:41:45,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:41:45,261 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-15 21:41:45,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:41:45,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856273727] [2023-12-15 21:41:45,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [856273727] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:41:45,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:41:45,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-15 21:41:45,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136594005] [2023-12-15 21:41:45,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:41:45,262 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-15 21:41:45,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:41:45,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-15 21:41:45,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-15 21:41:45,263 INFO L87 Difference]: Start difference. First operand 205 states and 301 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-15 21:41:45,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:41:45,418 INFO L93 Difference]: Finished difference Result 469 states and 688 transitions. [2023-12-15 21:41:45,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-15 21:41:45,418 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 126 [2023-12-15 21:41:45,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:41:45,420 INFO L225 Difference]: With dead ends: 469 [2023-12-15 21:41:45,420 INFO L226 Difference]: Without dead ends: 265 [2023-12-15 21:41:45,421 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 33 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-15 21:41:45,421 INFO L413 NwaCegarLoop]: 156 mSDtfsCounter, 129 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 21:41:45,422 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 361 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 21:41:45,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2023-12-15 21:41:45,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 205. [2023-12-15 21:41:45,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 172 states have (on average 1.3895348837209303) internal successors, (239), 172 states have internal predecessors, (239), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2023-12-15 21:41:45,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 299 transitions. [2023-12-15 21:41:45,433 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 299 transitions. Word has length 126 [2023-12-15 21:41:45,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:41:45,433 INFO L495 AbstractCegarLoop]: Abstraction has 205 states and 299 transitions. [2023-12-15 21:41:45,433 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-15 21:41:45,433 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 299 transitions. [2023-12-15 21:41:45,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2023-12-15 21:41:45,434 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:41:45,434 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 21:41:45,434 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-15 21:41:45,434 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:41:45,434 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:41:45,434 INFO L85 PathProgramCache]: Analyzing trace with hash 431605834, now seen corresponding path program 1 times [2023-12-15 21:41:45,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:41:45,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592601793] [2023-12-15 21:41:45,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:41:45,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:41:45,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:41:45,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:41:45,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:41:45,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:41:45,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:41:45,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-15 21:41:45,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:41:45,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-15 21:41:45,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:41:45,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 21:41:45,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:41:45,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 21:41:45,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:41:45,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-15 21:41:45,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:41:45,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-15 21:41:45,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:41:45,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-15 21:41:45,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:41:45,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 21:41:45,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:41:45,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 21:41:45,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:41:45,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-15 21:41:45,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:41:45,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-15 21:41:45,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:41:45,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-15 21:41:45,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:41:45,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-15 21:41:45,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:41:45,876 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-15 21:41:45,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:41:45,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592601793] [2023-12-15 21:41:45,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [592601793] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:41:45,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:41:45,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-15 21:41:45,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115594810] [2023-12-15 21:41:45,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:41:45,877 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-15 21:41:45,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:41:45,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-15 21:41:45,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-12-15 21:41:45,878 INFO L87 Difference]: Start difference. First operand 205 states and 299 transitions. Second operand has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-15 21:41:46,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:41:46,425 INFO L93 Difference]: Finished difference Result 475 states and 692 transitions. [2023-12-15 21:41:46,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-15 21:41:46,425 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 126 [2023-12-15 21:41:46,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:41:46,427 INFO L225 Difference]: With dead ends: 475 [2023-12-15 21:41:46,427 INFO L226 Difference]: Without dead ends: 370 [2023-12-15 21:41:46,427 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2023-12-15 21:41:46,428 INFO L413 NwaCegarLoop]: 123 mSDtfsCounter, 199 mSDsluCounter, 469 mSDsCounter, 0 mSdLazyCounter, 772 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 592 SdHoareTripleChecker+Invalid, 800 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 772 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-15 21:41:46,428 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 592 Invalid, 800 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 772 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-15 21:41:46,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2023-12-15 21:41:46,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 205. [2023-12-15 21:41:46,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 172 states have (on average 1.3895348837209303) internal successors, (239), 172 states have internal predecessors, (239), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2023-12-15 21:41:46,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 299 transitions. [2023-12-15 21:41:46,439 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 299 transitions. Word has length 126 [2023-12-15 21:41:46,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:41:46,439 INFO L495 AbstractCegarLoop]: Abstraction has 205 states and 299 transitions. [2023-12-15 21:41:46,439 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-15 21:41:46,439 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 299 transitions. [2023-12-15 21:41:46,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2023-12-15 21:41:46,441 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:41:46,441 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 21:41:46,441 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-15 21:41:46,441 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:41:46,441 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:41:46,441 INFO L85 PathProgramCache]: Analyzing trace with hash -1623960206, now seen corresponding path program 1 times [2023-12-15 21:41:46,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:41:46,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968272741] [2023-12-15 21:41:46,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:41:46,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:41:46,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-15 21:41:46,510 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-15 21:41:46,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-15 21:41:46,591 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-15 21:41:46,591 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-15 21:41:46,592 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-15 21:41:46,593 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-15 21:41:46,596 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:41:46,598 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-15 21:41:46,647 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.12 09:41:46 BoogieIcfgContainer [2023-12-15 21:41:46,647 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-15 21:41:46,648 INFO L158 Benchmark]: Toolchain (without parser) took 6664.15ms. Allocated memory was 227.5MB in the beginning and 370.1MB in the end (delta: 142.6MB). Free memory was 179.3MB in the beginning and 194.0MB in the end (delta: -14.7MB). Peak memory consumption was 128.7MB. Max. memory is 8.0GB. [2023-12-15 21:41:46,648 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 182.5MB. Free memory is still 136.6MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-15 21:41:46,648 INFO L158 Benchmark]: CACSL2BoogieTranslator took 239.05ms. Allocated memory is still 227.5MB. Free memory was 179.0MB in the beginning and 162.4MB in the end (delta: 16.6MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2023-12-15 21:41:46,648 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.13ms. Allocated memory is still 227.5MB. Free memory was 162.4MB in the beginning and 158.0MB in the end (delta: 4.4MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2023-12-15 21:41:46,648 INFO L158 Benchmark]: Boogie Preprocessor took 56.20ms. Allocated memory is still 227.5MB. Free memory was 158.0MB in the beginning and 153.5MB in the end (delta: 4.6MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. [2023-12-15 21:41:46,648 INFO L158 Benchmark]: RCFGBuilder took 569.20ms. Allocated memory is still 227.5MB. Free memory was 153.1MB in the beginning and 187.3MB in the end (delta: -34.1MB). Peak memory consumption was 30.5MB. Max. memory is 8.0GB. [2023-12-15 21:41:46,649 INFO L158 Benchmark]: TraceAbstraction took 5738.59ms. Allocated memory was 227.5MB in the beginning and 370.1MB in the end (delta: 142.6MB). Free memory was 186.7MB in the beginning and 194.0MB in the end (delta: -7.2MB). Peak memory consumption was 134.9MB. Max. memory is 8.0GB. [2023-12-15 21:41:46,649 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 182.5MB. Free memory is still 136.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 239.05ms. Allocated memory is still 227.5MB. Free memory was 179.0MB in the beginning and 162.4MB in the end (delta: 16.6MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 57.13ms. Allocated memory is still 227.5MB. Free memory was 162.4MB in the beginning and 158.0MB in the end (delta: 4.4MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 56.20ms. Allocated memory is still 227.5MB. Free memory was 158.0MB in the beginning and 153.5MB in the end (delta: 4.6MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. * RCFGBuilder took 569.20ms. Allocated memory is still 227.5MB. Free memory was 153.1MB in the beginning and 187.3MB in the end (delta: -34.1MB). Peak memory consumption was 30.5MB. Max. memory is 8.0GB. * TraceAbstraction took 5738.59ms. Allocated memory was 227.5MB in the beginning and 370.1MB in the end (delta: 142.6MB). Free memory was 186.7MB in the beginning and 194.0MB in the end (delta: -7.2MB). Peak memory consumption was 134.9MB. 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 someBinaryDOUBLEComparisonOperation at line 120, overapproximation of someBinaryFLOATComparisonOperation at line 111, overapproximation of someUnaryDOUBLEoperation at line 42. Possible FailurePath: [L38] unsigned char isInitial = 0; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 5.5, 1, -0.41, 25, 100, 1, 15.75, 1.6, 0, 0, 16.5, 10, -10, -16 }; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 5.5, 1, -0.41, 25, 100, 1, 15.75, 1.6, 0, 0, 16.5, 10, -10, -16 }; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 5.5, 1, -0.41, 25, 100, 1, 15.75, 1.6, 0, 0, 16.5, 10, -10, -16 }; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 5.5, 1, -0.41, 25, 100, 1, 15.75, 1.6, 0, 0, 16.5, 10, -10, -16 }; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 5.5, 1, -0.41, 25, 100, 1, 15.75, 1.6, 0, 0, 16.5, 10, -10, -16 }; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 5.5, 1, -0.41, 25, 100, 1, 15.75, 1.6, 0, 0, 16.5, 10, -10, -16 }; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 5.5, 1, -0.41, 25, 100, 1, 15.75, 1.6, 0, 0, 16.5, 10, -10, -16 }; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 5.5, 1, -0.41, 25, 100, 1, 15.75, 1.6, 0, 0, 16.5, 10, -10, -16 }; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 5.5, 1, -0.41, 25, 100, 1, 15.75, 1.6, 0, 0, 16.5, 10, -10, -16 }; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 5.5, 1, -0.41, 25, 100, 1, 15.75, 1.6, 0, 0, 16.5, 10, -10, -16 }; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 5.5, 1, -0.41, 25, 100, 1, 15.75, 1.6, 0, 0, 16.5, 10, -10, -16 }; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 5.5, 1, -0.41, 25, 100, 1, 15.75, 1.6, 0, 0, 16.5, 10, -10, -16 }; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 5.5, 1, -0.41, 25, 100, 1, 15.75, 1.6, 0, 0, 16.5, 10, -10, -16 }; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 5.5, 1, -0.41, 25, 100, 1, 15.75, 1.6, 0, 0, 16.5, 10, -10, -16 }; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 5.5, 1, -0.41, 25, 100, 1, 15.75, 1.6, 0, 0, 16.5, 10, -10, -16 }; [L55] float last_1_WrapperStruct00_var_1_12 = 15.75; [L124] isInitial = 1 [L125] FCALL initially() [L126] COND TRUE 1 [L127] CALL updateLastVariables() [L117] EXPR WrapperStruct00.var_1_12 [L117] last_1_WrapperStruct00_var_1_12 = WrapperStruct00.var_1_12 [L127] RET updateLastVariables() [L128] CALL updateVariables() [L91] WrapperStruct00.var_1_6 = __VERIFIER_nondet_uchar() [L92] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L92] CALL assume_abort_if_not(WrapperStruct00.var_1_6 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L92] RET assume_abort_if_not(WrapperStruct00.var_1_6 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L93] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L93] CALL assume_abort_if_not(WrapperStruct00.var_1_6 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L93] RET assume_abort_if_not(WrapperStruct00.var_1_6 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L94] WrapperStruct00.var_1_7 = __VERIFIER_nondet_double() [L95] EXPR WrapperStruct00.var_1_7 [L95] EXPR WrapperStruct00.var_1_7 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_7 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L95] EXPR WrapperStruct00.var_1_7 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_7 <= -1.0e-20F [L95] EXPR WrapperStruct00.var_1_7 [L95] EXPR WrapperStruct00.var_1_7 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_7 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L95] EXPR (WrapperStruct00.var_1_7 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_7 <= -1.0e-20F) || (WrapperStruct00.var_1_7 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_7 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L95] EXPR (WrapperStruct00.var_1_7 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_7 <= -1.0e-20F) || (WrapperStruct00.var_1_7 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_7 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L95] CALL assume_abort_if_not((WrapperStruct00.var_1_7 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_7 <= -1.0e-20F) || (WrapperStruct00.var_1_7 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_7 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L95] RET assume_abort_if_not((WrapperStruct00.var_1_7 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_7 <= -1.0e-20F) || (WrapperStruct00.var_1_7 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_7 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [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=63/4] [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=63/4] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L97] RET assume_abort_if_not(WrapperStruct00.var_1_9 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L98] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [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=63/4] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L98] RET assume_abort_if_not(WrapperStruct00.var_1_9 <= 254) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [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=63/4] [L100] CALL assume_abort_if_not(WrapperStruct00.var_1_10 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L100] RET assume_abort_if_not(WrapperStruct00.var_1_10 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L101] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [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=63/4] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L101] RET assume_abort_if_not(WrapperStruct00.var_1_10 <= 254) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L102] WrapperStruct00.var_1_13 = __VERIFIER_nondet_float() [L103] EXPR WrapperStruct00.var_1_13 [L103] EXPR WrapperStruct00.var_1_13 >= 0.0F && WrapperStruct00.var_1_13 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L103] EXPR WrapperStruct00.var_1_13 >= 0.0F && WrapperStruct00.var_1_13 <= -1.0e-20F [L103] EXPR WrapperStruct00.var_1_13 [L103] EXPR WrapperStruct00.var_1_13 >= 0.0F && WrapperStruct00.var_1_13 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L103] EXPR (WrapperStruct00.var_1_13 >= 0.0F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L103] EXPR (WrapperStruct00.var_1_13 >= 0.0F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L103] CALL assume_abort_if_not((WrapperStruct00.var_1_13 >= 0.0F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L103] RET assume_abort_if_not((WrapperStruct00.var_1_13 >= 0.0F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L104] WrapperStruct00.var_1_14 = __VERIFIER_nondet_uchar() [L105] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L105] 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=63/4] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L105] RET assume_abort_if_not(WrapperStruct00.var_1_14 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L106] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L106] CALL assume_abort_if_not(WrapperStruct00.var_1_14 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L106] RET assume_abort_if_not(WrapperStruct00.var_1_14 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L107] WrapperStruct00.var_1_15 = __VERIFIER_nondet_uchar() [L108] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L108] 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=63/4] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L108] RET assume_abort_if_not(WrapperStruct00.var_1_15 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L109] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L109] CALL assume_abort_if_not(WrapperStruct00.var_1_15 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L109] RET assume_abort_if_not(WrapperStruct00.var_1_15 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L110] WrapperStruct00.var_1_16 = __VERIFIER_nondet_float() [L111] EXPR WrapperStruct00.var_1_16 [L111] EXPR WrapperStruct00.var_1_16 >= 0.0F && WrapperStruct00.var_1_16 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L111] EXPR WrapperStruct00.var_1_16 >= 0.0F && WrapperStruct00.var_1_16 <= -1.0e-20F [L111] EXPR WrapperStruct00.var_1_16 [L111] EXPR WrapperStruct00.var_1_16 >= 0.0F && WrapperStruct00.var_1_16 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L111] EXPR (WrapperStruct00.var_1_16 >= 0.0F && WrapperStruct00.var_1_16 <= -1.0e-20F) || (WrapperStruct00.var_1_16 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_16 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L111] EXPR (WrapperStruct00.var_1_16 >= 0.0F && WrapperStruct00.var_1_16 <= -1.0e-20F) || (WrapperStruct00.var_1_16 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_16 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L111] CALL assume_abort_if_not((WrapperStruct00.var_1_16 >= 0.0F && WrapperStruct00.var_1_16 <= -1.0e-20F) || (WrapperStruct00.var_1_16 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_16 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L111] RET assume_abort_if_not((WrapperStruct00.var_1_16 >= 0.0F && WrapperStruct00.var_1_16 <= -1.0e-20F) || (WrapperStruct00.var_1_16 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_16 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L112] WrapperStruct00.var_1_18 = __VERIFIER_nondet_char() [L113] EXPR WrapperStruct00.var_1_18 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L113] CALL assume_abort_if_not(WrapperStruct00.var_1_18 >= -127) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L113] RET assume_abort_if_not(WrapperStruct00.var_1_18 >= -127) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L114] EXPR WrapperStruct00.var_1_18 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L114] CALL assume_abort_if_not(WrapperStruct00.var_1_18 <= 126) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L114] RET assume_abort_if_not(WrapperStruct00.var_1_18 <= 126) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L128] RET updateVariables() [L129] CALL step() [L59] WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L59] COND FALSE !(WrapperStruct00.var_1_6) [L62] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L62] COND FALSE !(last_1_WrapperStruct00_var_1_12 < (last_1_WrapperStruct00_var_1_12 + WrapperStruct00.var_1_7)) [L66] EXPR WrapperStruct00.var_1_8 [L66] WrapperStruct00.var_1_19 = WrapperStruct00.var_1_8 [L67] EXPR WrapperStruct00.var_1_19 [L67] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L67] COND FALSE !(WrapperStruct00.var_1_19 > WrapperStruct00.var_1_9) [L78] EXPR WrapperStruct00.var_1_13 [L78] WrapperStruct00.var_1_12 = WrapperStruct00.var_1_13 [L80] EXPR WrapperStruct00.var_1_8 [L80] EXPR WrapperStruct00.var_1_8 [L80] EXPR WrapperStruct00.var_1_19 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L80] EXPR ((WrapperStruct00.var_1_8) > ((WrapperStruct00.var_1_8 + WrapperStruct00.var_1_19))) ? (WrapperStruct00.var_1_8) : ((WrapperStruct00.var_1_8 + WrapperStruct00.var_1_19)) [L80] EXPR WrapperStruct00.var_1_8 [L80] EXPR WrapperStruct00.var_1_19 [L80] EXPR ((WrapperStruct00.var_1_8) > ((WrapperStruct00.var_1_8 + WrapperStruct00.var_1_19))) ? (WrapperStruct00.var_1_8) : ((WrapperStruct00.var_1_8 + WrapperStruct00.var_1_19)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L80] signed long int stepLocal_0 = (((WrapperStruct00.var_1_8) > ((WrapperStruct00.var_1_8 + WrapperStruct00.var_1_19))) ? (WrapperStruct00.var_1_8) : ((WrapperStruct00.var_1_8 + WrapperStruct00.var_1_19))); [L81] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L81] COND TRUE WrapperStruct00.var_1_8 <= stepLocal_0 [L82] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L82] COND TRUE ! WrapperStruct00.var_1_6 [L83] EXPR WrapperStruct00.var_1_7 [L83] WrapperStruct00.var_1_1 = WrapperStruct00.var_1_7 [L88] EXPR WrapperStruct00.var_1_18 [L88] WrapperStruct00.var_1_17 = WrapperStruct00.var_1_18 [L129] RET step() [L130] CALL, EXPR property() [L120] EXPR WrapperStruct00.var_1_8 [L120] EXPR WrapperStruct00.var_1_8 [L120] EXPR WrapperStruct00.var_1_8 [L120] EXPR WrapperStruct00.var_1_19 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L120] EXPR ((WrapperStruct00.var_1_8) > ((WrapperStruct00.var_1_8 + WrapperStruct00.var_1_19))) ? (WrapperStruct00.var_1_8) : ((WrapperStruct00.var_1_8 + WrapperStruct00.var_1_19)) [L120] EXPR WrapperStruct00.var_1_8 [L120] EXPR WrapperStruct00.var_1_19 [L120] EXPR ((WrapperStruct00.var_1_8) > ((WrapperStruct00.var_1_8 + WrapperStruct00.var_1_19))) ? (WrapperStruct00.var_1_8) : ((WrapperStruct00.var_1_8 + WrapperStruct00.var_1_19)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L120] EXPR (WrapperStruct00.var_1_8 <= ((((WrapperStruct00.var_1_8) > ((WrapperStruct00.var_1_8 + WrapperStruct00.var_1_19))) ? (WrapperStruct00.var_1_8) : ((WrapperStruct00.var_1_8 + WrapperStruct00.var_1_19))))) ? ((! WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_1 == ((double) WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_1 == ((double) WrapperStruct00.var_1_7))) : 1 [L120] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L120] EXPR (! WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_1 == ((double) WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_1 == ((double) WrapperStruct00.var_1_7)) [L120] EXPR WrapperStruct00.var_1_1 [L120] EXPR WrapperStruct00.var_1_7 [L120] EXPR (! WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_1 == ((double) WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_1 == ((double) WrapperStruct00.var_1_7)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L120] EXPR (WrapperStruct00.var_1_8 <= ((((WrapperStruct00.var_1_8) > ((WrapperStruct00.var_1_8 + WrapperStruct00.var_1_19))) ? (WrapperStruct00.var_1_8) : ((WrapperStruct00.var_1_8 + WrapperStruct00.var_1_19))))) ? ((! WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_1 == ((double) WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_1 == ((double) WrapperStruct00.var_1_7))) : 1 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L120] EXPR ((WrapperStruct00.var_1_8 <= ((((WrapperStruct00.var_1_8) > ((WrapperStruct00.var_1_8 + WrapperStruct00.var_1_19))) ? (WrapperStruct00.var_1_8) : ((WrapperStruct00.var_1_8 + WrapperStruct00.var_1_19))))) ? ((! WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_1 == ((double) WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_1 == ((double) WrapperStruct00.var_1_7))) : 1) && (WrapperStruct00.var_1_6 ? (WrapperStruct00.var_1_8 == ((unsigned char) ((((WrapperStruct00.var_1_9) > (WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_10))))) : ((last_1_WrapperStruct00_var_1_12 < (last_1_WrapperStruct00_var_1_12 + WrapperStruct00.var_1_7)) ? (WrapperStruct00.var_1_8 == ((unsigned char) ((((WrapperStruct00.var_1_9) < (WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_10))))) : 1)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L120] EXPR ((WrapperStruct00.var_1_8 <= ((((WrapperStruct00.var_1_8) > ((WrapperStruct00.var_1_8 + WrapperStruct00.var_1_19))) ? (WrapperStruct00.var_1_8) : ((WrapperStruct00.var_1_8 + WrapperStruct00.var_1_19))))) ? ((! WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_1 == ((double) WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_1 == ((double) WrapperStruct00.var_1_7))) : 1) && (WrapperStruct00.var_1_6 ? (WrapperStruct00.var_1_8 == ((unsigned char) ((((WrapperStruct00.var_1_9) > (WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_10))))) : ((last_1_WrapperStruct00_var_1_12 < (last_1_WrapperStruct00_var_1_12 + WrapperStruct00.var_1_7)) ? (WrapperStruct00.var_1_8 == ((unsigned char) ((((WrapperStruct00.var_1_9) < (WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_10))))) : 1)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L120] EXPR (((WrapperStruct00.var_1_8 <= ((((WrapperStruct00.var_1_8) > ((WrapperStruct00.var_1_8 + WrapperStruct00.var_1_19))) ? (WrapperStruct00.var_1_8) : ((WrapperStruct00.var_1_8 + WrapperStruct00.var_1_19))))) ? ((! WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_1 == ((double) WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_1 == ((double) WrapperStruct00.var_1_7))) : 1) && (WrapperStruct00.var_1_6 ? (WrapperStruct00.var_1_8 == ((unsigned char) ((((WrapperStruct00.var_1_9) > (WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_10))))) : ((last_1_WrapperStruct00_var_1_12 < (last_1_WrapperStruct00_var_1_12 + WrapperStruct00.var_1_7)) ? (WrapperStruct00.var_1_8 == ((unsigned char) ((((WrapperStruct00.var_1_9) < (WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_10))))) : 1))) && ((WrapperStruct00.var_1_19 > WrapperStruct00.var_1_9) ? (WrapperStruct00.var_1_6 ? (WrapperStruct00.var_1_12 == ((float) (WrapperStruct00.var_1_13 - ((((99999.25f) < 0 ) ? -(99999.25f) : (99999.25f)))))) : ((WrapperStruct00.var_1_14 && WrapperStruct00.var_1_15) ? (WrapperStruct00.var_1_12 == ((float) (WrapperStruct00.var_1_13 - WrapperStruct00.var_1_16))) : (WrapperStruct00.var_1_12 == ((float) WrapperStruct00.var_1_16)))) : (WrapperStruct00.var_1_12 == ((float) WrapperStruct00.var_1_13))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L120] EXPR (((WrapperStruct00.var_1_8 <= ((((WrapperStruct00.var_1_8) > ((WrapperStruct00.var_1_8 + WrapperStruct00.var_1_19))) ? (WrapperStruct00.var_1_8) : ((WrapperStruct00.var_1_8 + WrapperStruct00.var_1_19))))) ? ((! WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_1 == ((double) WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_1 == ((double) WrapperStruct00.var_1_7))) : 1) && (WrapperStruct00.var_1_6 ? (WrapperStruct00.var_1_8 == ((unsigned char) ((((WrapperStruct00.var_1_9) > (WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_10))))) : ((last_1_WrapperStruct00_var_1_12 < (last_1_WrapperStruct00_var_1_12 + WrapperStruct00.var_1_7)) ? (WrapperStruct00.var_1_8 == ((unsigned char) ((((WrapperStruct00.var_1_9) < (WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_10))))) : 1))) && ((WrapperStruct00.var_1_19 > WrapperStruct00.var_1_9) ? (WrapperStruct00.var_1_6 ? (WrapperStruct00.var_1_12 == ((float) (WrapperStruct00.var_1_13 - ((((99999.25f) < 0 ) ? -(99999.25f) : (99999.25f)))))) : ((WrapperStruct00.var_1_14 && WrapperStruct00.var_1_15) ? (WrapperStruct00.var_1_12 == ((float) (WrapperStruct00.var_1_13 - WrapperStruct00.var_1_16))) : (WrapperStruct00.var_1_12 == ((float) WrapperStruct00.var_1_16)))) : (WrapperStruct00.var_1_12 == ((float) WrapperStruct00.var_1_13))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L120] EXPR ((((WrapperStruct00.var_1_8 <= ((((WrapperStruct00.var_1_8) > ((WrapperStruct00.var_1_8 + WrapperStruct00.var_1_19))) ? (WrapperStruct00.var_1_8) : ((WrapperStruct00.var_1_8 + WrapperStruct00.var_1_19))))) ? ((! WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_1 == ((double) WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_1 == ((double) WrapperStruct00.var_1_7))) : 1) && (WrapperStruct00.var_1_6 ? (WrapperStruct00.var_1_8 == ((unsigned char) ((((WrapperStruct00.var_1_9) > (WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_10))))) : ((last_1_WrapperStruct00_var_1_12 < (last_1_WrapperStruct00_var_1_12 + WrapperStruct00.var_1_7)) ? (WrapperStruct00.var_1_8 == ((unsigned char) ((((WrapperStruct00.var_1_9) < (WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_10))))) : 1))) && ((WrapperStruct00.var_1_19 > WrapperStruct00.var_1_9) ? (WrapperStruct00.var_1_6 ? (WrapperStruct00.var_1_12 == ((float) (WrapperStruct00.var_1_13 - ((((99999.25f) < 0 ) ? -(99999.25f) : (99999.25f)))))) : ((WrapperStruct00.var_1_14 && WrapperStruct00.var_1_15) ? (WrapperStruct00.var_1_12 == ((float) (WrapperStruct00.var_1_13 - WrapperStruct00.var_1_16))) : (WrapperStruct00.var_1_12 == ((float) WrapperStruct00.var_1_16)))) : (WrapperStruct00.var_1_12 == ((float) WrapperStruct00.var_1_13)))) && (WrapperStruct00.var_1_17 == ((signed char) WrapperStruct00.var_1_18)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L120] EXPR ((((WrapperStruct00.var_1_8 <= ((((WrapperStruct00.var_1_8) > ((WrapperStruct00.var_1_8 + WrapperStruct00.var_1_19))) ? (WrapperStruct00.var_1_8) : ((WrapperStruct00.var_1_8 + WrapperStruct00.var_1_19))))) ? ((! WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_1 == ((double) WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_1 == ((double) WrapperStruct00.var_1_7))) : 1) && (WrapperStruct00.var_1_6 ? (WrapperStruct00.var_1_8 == ((unsigned char) ((((WrapperStruct00.var_1_9) > (WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_10))))) : ((last_1_WrapperStruct00_var_1_12 < (last_1_WrapperStruct00_var_1_12 + WrapperStruct00.var_1_7)) ? (WrapperStruct00.var_1_8 == ((unsigned char) ((((WrapperStruct00.var_1_9) < (WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_10))))) : 1))) && ((WrapperStruct00.var_1_19 > WrapperStruct00.var_1_9) ? (WrapperStruct00.var_1_6 ? (WrapperStruct00.var_1_12 == ((float) (WrapperStruct00.var_1_13 - ((((99999.25f) < 0 ) ? -(99999.25f) : (99999.25f)))))) : ((WrapperStruct00.var_1_14 && WrapperStruct00.var_1_15) ? (WrapperStruct00.var_1_12 == ((float) (WrapperStruct00.var_1_13 - WrapperStruct00.var_1_16))) : (WrapperStruct00.var_1_12 == ((float) WrapperStruct00.var_1_16)))) : (WrapperStruct00.var_1_12 == ((float) WrapperStruct00.var_1_13)))) && (WrapperStruct00.var_1_17 == ((signed char) WrapperStruct00.var_1_18)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L120] EXPR (((((WrapperStruct00.var_1_8 <= ((((WrapperStruct00.var_1_8) > ((WrapperStruct00.var_1_8 + WrapperStruct00.var_1_19))) ? (WrapperStruct00.var_1_8) : ((WrapperStruct00.var_1_8 + WrapperStruct00.var_1_19))))) ? ((! WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_1 == ((double) WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_1 == ((double) WrapperStruct00.var_1_7))) : 1) && (WrapperStruct00.var_1_6 ? (WrapperStruct00.var_1_8 == ((unsigned char) ((((WrapperStruct00.var_1_9) > (WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_10))))) : ((last_1_WrapperStruct00_var_1_12 < (last_1_WrapperStruct00_var_1_12 + WrapperStruct00.var_1_7)) ? (WrapperStruct00.var_1_8 == ((unsigned char) ((((WrapperStruct00.var_1_9) < (WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_10))))) : 1))) && ((WrapperStruct00.var_1_19 > WrapperStruct00.var_1_9) ? (WrapperStruct00.var_1_6 ? (WrapperStruct00.var_1_12 == ((float) (WrapperStruct00.var_1_13 - ((((99999.25f) < 0 ) ? -(99999.25f) : (99999.25f)))))) : ((WrapperStruct00.var_1_14 && WrapperStruct00.var_1_15) ? (WrapperStruct00.var_1_12 == ((float) (WrapperStruct00.var_1_13 - WrapperStruct00.var_1_16))) : (WrapperStruct00.var_1_12 == ((float) WrapperStruct00.var_1_16)))) : (WrapperStruct00.var_1_12 == ((float) WrapperStruct00.var_1_13)))) && (WrapperStruct00.var_1_17 == ((signed char) WrapperStruct00.var_1_18))) && (WrapperStruct00.var_1_19 == ((signed long int) WrapperStruct00.var_1_8)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L120] EXPR (((((WrapperStruct00.var_1_8 <= ((((WrapperStruct00.var_1_8) > ((WrapperStruct00.var_1_8 + WrapperStruct00.var_1_19))) ? (WrapperStruct00.var_1_8) : ((WrapperStruct00.var_1_8 + WrapperStruct00.var_1_19))))) ? ((! WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_1 == ((double) WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_1 == ((double) WrapperStruct00.var_1_7))) : 1) && (WrapperStruct00.var_1_6 ? (WrapperStruct00.var_1_8 == ((unsigned char) ((((WrapperStruct00.var_1_9) > (WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_10))))) : ((last_1_WrapperStruct00_var_1_12 < (last_1_WrapperStruct00_var_1_12 + WrapperStruct00.var_1_7)) ? (WrapperStruct00.var_1_8 == ((unsigned char) ((((WrapperStruct00.var_1_9) < (WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_10))))) : 1))) && ((WrapperStruct00.var_1_19 > WrapperStruct00.var_1_9) ? (WrapperStruct00.var_1_6 ? (WrapperStruct00.var_1_12 == ((float) (WrapperStruct00.var_1_13 - ((((99999.25f) < 0 ) ? -(99999.25f) : (99999.25f)))))) : ((WrapperStruct00.var_1_14 && WrapperStruct00.var_1_15) ? (WrapperStruct00.var_1_12 == ((float) (WrapperStruct00.var_1_13 - WrapperStruct00.var_1_16))) : (WrapperStruct00.var_1_12 == ((float) WrapperStruct00.var_1_16)))) : (WrapperStruct00.var_1_12 == ((float) WrapperStruct00.var_1_13)))) && (WrapperStruct00.var_1_17 == ((signed char) WrapperStruct00.var_1_18))) && (WrapperStruct00.var_1_19 == ((signed long int) WrapperStruct00.var_1_8)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L120-L121] return (((((WrapperStruct00.var_1_8 <= ((((WrapperStruct00.var_1_8) > ((WrapperStruct00.var_1_8 + WrapperStruct00.var_1_19))) ? (WrapperStruct00.var_1_8) : ((WrapperStruct00.var_1_8 + WrapperStruct00.var_1_19))))) ? ((! WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_1 == ((double) WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_1 == ((double) WrapperStruct00.var_1_7))) : 1) && (WrapperStruct00.var_1_6 ? (WrapperStruct00.var_1_8 == ((unsigned char) ((((WrapperStruct00.var_1_9) > (WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_10))))) : ((last_1_WrapperStruct00_var_1_12 < (last_1_WrapperStruct00_var_1_12 + WrapperStruct00.var_1_7)) ? (WrapperStruct00.var_1_8 == ((unsigned char) ((((WrapperStruct00.var_1_9) < (WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_10))))) : 1))) && ((WrapperStruct00.var_1_19 > WrapperStruct00.var_1_9) ? (WrapperStruct00.var_1_6 ? (WrapperStruct00.var_1_12 == ((float) (WrapperStruct00.var_1_13 - ((((99999.25f) < 0 ) ? -(99999.25f) : (99999.25f)))))) : ((WrapperStruct00.var_1_14 && WrapperStruct00.var_1_15) ? (WrapperStruct00.var_1_12 == ((float) (WrapperStruct00.var_1_13 - WrapperStruct00.var_1_16))) : (WrapperStruct00.var_1_12 == ((float) WrapperStruct00.var_1_16)))) : (WrapperStruct00.var_1_12 == ((float) WrapperStruct00.var_1_13)))) && (WrapperStruct00.var_1_17 == ((signed char) WrapperStruct00.var_1_18))) && (WrapperStruct00.var_1_19 == ((signed long int) WrapperStruct00.var_1_8)) ; [L130] RET, EXPR property() [L130] 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=63/4] [L19] reach_error() VAL [WrapperStruct00={4:0}, \old(cond)=0, cond=0, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 102 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.7s, OverallIterations: 9, TraceHistogramMax: 15, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 730 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 729 mSDsluCounter, 3261 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2147 mSDsCounter, 75 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2138 IncrementalHoareTripleChecker+Invalid, 2213 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 75 mSolverCounterUnsat, 1114 mSDtfsCounter, 2138 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 328 GetRequests, 293 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=207occurred in iteration=5, InterpolantAutomatonStates: 44, 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, 8 MinimizatonAttempts, 330 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 1122 NumberOfCodeBlocks, 1122 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 988 ConstructedInterpolants, 0 QuantifiedInterpolants, 1982 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 3360/3360 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-15 21:41:46,681 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...