/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_normal_file-88.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-15 21:28:54,205 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-15 21:28:54,272 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:28:54,275 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-15 21:28:54,275 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-15 21:28:54,302 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-15 21:28:54,303 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-15 21:28:54,303 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-15 21:28:54,304 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-15 21:28:54,306 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-15 21:28:54,307 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-15 21:28:54,307 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-15 21:28:54,308 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-15 21:28:54,309 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-15 21:28:54,309 INFO L153 SettingsManager]: * Use SBE=true [2023-12-15 21:28:54,309 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-15 21:28:54,309 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-15 21:28:54,309 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-15 21:28:54,310 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-15 21:28:54,310 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-15 21:28:54,310 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-15 21:28:54,311 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-15 21:28:54,311 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-15 21:28:54,311 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-15 21:28:54,311 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-15 21:28:54,311 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-15 21:28:54,312 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-15 21:28:54,312 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-15 21:28:54,312 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-15 21:28:54,312 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-15 21:28:54,313 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-15 21:28:54,313 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-15 21:28:54,313 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-15 21:28:54,313 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-15 21:28:54,314 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-15 21:28:54,314 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-15 21:28:54,314 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-15 21:28:54,314 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-15 21:28:54,314 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-15 21:28:54,314 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-15 21:28:54,314 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-15 21:28:54,315 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-15 21:28:54,315 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-15 21:28:54,315 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:28:54,516 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-15 21:28:54,530 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-15 21:28:54,532 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-15 21:28:54,533 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-15 21:28:54,533 INFO L274 PluginConnector]: CDTParser initialized [2023-12-15 21:28:54,534 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_normal_file-88.i [2023-12-15 21:28:55,538 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-15 21:28:55,678 INFO L384 CDTParser]: Found 1 translation units. [2023-12-15 21:28:55,679 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_normal_file-88.i [2023-12-15 21:28:55,684 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ad8719f9/d51f92c118c1498d92ecbc01abfb176b/FLAG7bf7d9f9a [2023-12-15 21:28:55,696 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ad8719f9/d51f92c118c1498d92ecbc01abfb176b [2023-12-15 21:28:55,698 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-15 21:28:55,698 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-15 21:28:55,699 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-15 21:28:55,699 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-15 21:28:55,703 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-15 21:28:55,703 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 09:28:55" (1/1) ... [2023-12-15 21:28:55,704 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@291a061a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:28:55, skipping insertion in model container [2023-12-15 21:28:55,704 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 09:28:55" (1/1) ... [2023-12-15 21:28:55,730 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-15 21:28:55,833 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_normal_file-88.i[913,926] [2023-12-15 21:28:55,857 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-15 21:28:55,868 INFO L202 MainTranslator]: Completed pre-run [2023-12-15 21:28:55,876 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_normal_file-88.i[913,926] [2023-12-15 21:28:55,890 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-15 21:28:55,900 INFO L206 MainTranslator]: Completed translation [2023-12-15 21:28:55,901 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:28:55 WrapperNode [2023-12-15 21:28:55,901 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-15 21:28:55,902 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-15 21:28:55,902 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-15 21:28:55,902 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-15 21:28:55,906 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:28:55" (1/1) ... [2023-12-15 21:28:55,915 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:28:55" (1/1) ... [2023-12-15 21:28:55,934 INFO L138 Inliner]: procedures = 26, calls = 30, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 136 [2023-12-15 21:28:55,934 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-15 21:28:55,935 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-15 21:28:55,935 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-15 21:28:55,935 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-15 21:28:55,942 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:28:55" (1/1) ... [2023-12-15 21:28:55,942 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:28:55" (1/1) ... [2023-12-15 21:28:55,944 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:28:55" (1/1) ... [2023-12-15 21:28:55,952 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2023-12-15 21:28:55,952 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:28:55" (1/1) ... [2023-12-15 21:28:55,962 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:28:55" (1/1) ... [2023-12-15 21:28:55,967 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:28:55" (1/1) ... [2023-12-15 21:28:55,969 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:28:55" (1/1) ... [2023-12-15 21:28:55,969 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:28:55" (1/1) ... [2023-12-15 21:28:55,970 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:28:55" (1/1) ... [2023-12-15 21:28:55,972 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-15 21:28:55,972 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-15 21:28:55,972 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-15 21:28:55,972 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-15 21:28:55,973 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:28:55" (1/1) ... [2023-12-15 21:28:55,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-15 21:28:55,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 21:28:56,007 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:28:56,009 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:28:56,035 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-15 21:28:56,035 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-15 21:28:56,035 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-15 21:28:56,035 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-15 21:28:56,035 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-15 21:28:56,035 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-15 21:28:56,090 INFO L241 CfgBuilder]: Building ICFG [2023-12-15 21:28:56,092 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-15 21:28:56,362 INFO L282 CfgBuilder]: Performing block encoding [2023-12-15 21:28:56,453 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-15 21:28:56,453 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-15 21:28:56,454 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 09:28:56 BoogieIcfgContainer [2023-12-15 21:28:56,454 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-15 21:28:56,457 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-15 21:28:56,457 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-15 21:28:56,460 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-15 21:28:56,460 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.12 09:28:55" (1/3) ... [2023-12-15 21:28:56,461 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29c4c735 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 09:28:56, skipping insertion in model container [2023-12-15 21:28:56,461 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:28:55" (2/3) ... [2023-12-15 21:28:56,461 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29c4c735 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 09:28:56, skipping insertion in model container [2023-12-15 21:28:56,461 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 09:28:56" (3/3) ... [2023-12-15 21:28:56,463 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-88.i [2023-12-15 21:28:56,475 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-15 21:28:56,475 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-15 21:28:56,509 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-15 21:28:56,514 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;@227d435d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-15 21:28:56,514 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-15 21:28:56,517 INFO L276 IsEmpty]: Start isEmpty. Operand has 50 states, 30 states have (on average 1.4666666666666666) internal successors, (44), 31 states have internal predecessors, (44), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2023-12-15 21:28:56,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2023-12-15 21:28:56,528 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:28:56,528 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28:56,528 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:28:56,535 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:28:56,535 INFO L85 PathProgramCache]: Analyzing trace with hash -400417403, now seen corresponding path program 1 times [2023-12-15 21:28:56,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:28:56,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264953013] [2023-12-15 21:28:56,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:28:56,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:28:56,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:28:56,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:28:56,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:28:56,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 21:28:56,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:28:56,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 21:28:56,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:28:56,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 21:28:56,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:28:56,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 21:28:56,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:28:56,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 21:28:56,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:28:56,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 21:28:56,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:28:56,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-15 21:28:56,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:28:56,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-15 21:28:56,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:28:56,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-15 21:28:56,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:28:56,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-15 21:28:56,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:28:56,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 21:28:56,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:28:56,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 21:28:56,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:28:56,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-15 21:28:56,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:28:56,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-15 21:28:56,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:28:56,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-12-15 21:28:56,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:28:56,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-15 21:28:56,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:28:56,830 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-12-15 21:28:56,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:28:56,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264953013] [2023-12-15 21:28:56,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [264953013] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:28:56,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:28:56,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-15 21:28:56,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328568784] [2023-12-15 21:28:56,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:28:56,838 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-15 21:28:56,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:28:56,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-15 21:28:56,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-15 21:28:56,864 INFO L87 Difference]: Start difference. First operand has 50 states, 30 states have (on average 1.4666666666666666) internal successors, (44), 31 states have internal predecessors, (44), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2023-12-15 21:28:56,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:28:56,912 INFO L93 Difference]: Finished difference Result 97 states and 171 transitions. [2023-12-15 21:28:56,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-15 21:28:56,914 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 107 [2023-12-15 21:28:56,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:28:56,919 INFO L225 Difference]: With dead ends: 97 [2023-12-15 21:28:56,919 INFO L226 Difference]: Without dead ends: 48 [2023-12-15 21:28:56,922 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 53 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:28:56,926 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 21:28:56,926 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 70 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 21:28:56,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2023-12-15 21:28:56,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2023-12-15 21:28:56,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 29 states have (on average 1.3448275862068966) internal successors, (39), 29 states have internal predecessors, (39), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2023-12-15 21:28:56,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 73 transitions. [2023-12-15 21:28:56,957 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 73 transitions. Word has length 107 [2023-12-15 21:28:56,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:28:56,957 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 73 transitions. [2023-12-15 21:28:56,957 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2023-12-15 21:28:56,957 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 73 transitions. [2023-12-15 21:28:56,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2023-12-15 21:28:56,959 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:28:56,959 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28:56,959 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-15 21:28:56,959 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:28:56,960 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:28:56,960 INFO L85 PathProgramCache]: Analyzing trace with hash 2099352515, now seen corresponding path program 1 times [2023-12-15 21:28:56,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:28:56,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591743324] [2023-12-15 21:28:56,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:28:56,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:28:57,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:28:58,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:28:58,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:28:58,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 21:28:58,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:28:58,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 21:28:58,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:28:58,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 21:28:58,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:28:58,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 21:28:58,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:28:58,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 21:28:58,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:28:58,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 21:28:58,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:28:58,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-15 21:28:58,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:28:58,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-15 21:28:58,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:28:58,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-15 21:28:58,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:28:58,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-15 21:28:58,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:28:58,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 21:28:58,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:28:58,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 21:28:58,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:28:58,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-15 21:28:58,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:28:58,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-15 21:28:58,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:28:58,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-12-15 21:28:58,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:28:58,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-15 21:28:58,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:28:58,458 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-12-15 21:28:58,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:28:58,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591743324] [2023-12-15 21:28:58,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [591743324] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:28:58,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:28:58,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-15 21:28:58,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613745929] [2023-12-15 21:28:58,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:28:58,468 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-15 21:28:58,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:28:58,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-15 21:28:58,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-15 21:28:58,472 INFO L87 Difference]: Start difference. First operand 48 states and 73 transitions. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2023-12-15 21:28:58,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:28:58,742 INFO L93 Difference]: Finished difference Result 121 states and 177 transitions. [2023-12-15 21:28:58,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-15 21:28:58,742 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 107 [2023-12-15 21:28:58,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:28:58,744 INFO L225 Difference]: With dead ends: 121 [2023-12-15 21:28:58,744 INFO L226 Difference]: Without dead ends: 74 [2023-12-15 21:28:58,744 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-12-15 21:28:58,745 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 83 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-15 21:28:58,745 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 139 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-15 21:28:58,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2023-12-15 21:28:58,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 55. [2023-12-15 21:28:58,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 35 states have (on average 1.3142857142857143) internal successors, (46), 35 states have internal predecessors, (46), 17 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2023-12-15 21:28:58,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 80 transitions. [2023-12-15 21:28:58,756 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 80 transitions. Word has length 107 [2023-12-15 21:28:58,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:28:58,756 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 80 transitions. [2023-12-15 21:28:58,756 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2023-12-15 21:28:58,756 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 80 transitions. [2023-12-15 21:28:58,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2023-12-15 21:28:58,757 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:28:58,758 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28:58,758 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-15 21:28:58,758 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:28:58,758 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:28:58,758 INFO L85 PathProgramCache]: Analyzing trace with hash -2138356479, now seen corresponding path program 1 times [2023-12-15 21:28:58,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:28:58,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367227193] [2023-12-15 21:28:58,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:28:58,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:28:58,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:28:58,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:28:58,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:28:58,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 21:28:59,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:28:59,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 21:28:59,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:28:59,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 21:28:59,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:28:59,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 21:28:59,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:28:59,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 21:28:59,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:28:59,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 21:28:59,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:28:59,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-15 21:28:59,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:28:59,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-15 21:28:59,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:28:59,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-15 21:28:59,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:28:59,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-15 21:28:59,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:28:59,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 21:28:59,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:28:59,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 21:28:59,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:28:59,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-15 21:28:59,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:28:59,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-15 21:28:59,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:28:59,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-12-15 21:28:59,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:28:59,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-15 21:28:59,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:28:59,091 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-12-15 21:28:59,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:28:59,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367227193] [2023-12-15 21:28:59,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367227193] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:28:59,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:28:59,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-15 21:28:59,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315275819] [2023-12-15 21:28:59,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:28:59,093 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-15 21:28:59,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:28:59,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-15 21:28:59,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-15 21:28:59,095 INFO L87 Difference]: Start difference. First operand 55 states and 80 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-12-15 21:28:59,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:28:59,225 INFO L93 Difference]: Finished difference Result 164 states and 239 transitions. [2023-12-15 21:28:59,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-15 21:28:59,226 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 107 [2023-12-15 21:28:59,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:28:59,232 INFO L225 Difference]: With dead ends: 164 [2023-12-15 21:28:59,232 INFO L226 Difference]: Without dead ends: 110 [2023-12-15 21:28:59,234 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 37 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:28:59,236 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 50 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 21:28:59,237 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 190 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 21:28:59,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2023-12-15 21:28:59,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 103. [2023-12-15 21:28:59,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 64 states have (on average 1.28125) internal successors, (82), 64 states have internal predecessors, (82), 34 states have call successors, (34), 4 states have call predecessors, (34), 4 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2023-12-15 21:28:59,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 150 transitions. [2023-12-15 21:28:59,271 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 150 transitions. Word has length 107 [2023-12-15 21:28:59,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:28:59,271 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 150 transitions. [2023-12-15 21:28:59,272 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-12-15 21:28:59,272 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 150 transitions. [2023-12-15 21:28:59,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2023-12-15 21:28:59,273 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:28:59,273 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28:59,273 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-15 21:28:59,273 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:28:59,273 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:28:59,273 INFO L85 PathProgramCache]: Analyzing trace with hash 593037170, now seen corresponding path program 1 times [2023-12-15 21:28:59,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:28:59,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832390978] [2023-12-15 21:28:59,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:28:59,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:28:59,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:28:59,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:28:59,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:28:59,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 21:28:59,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:28:59,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 21:28:59,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:28:59,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 21:28:59,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:28:59,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 21:28:59,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:28:59,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 21:28:59,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:28:59,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 21:28:59,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:28:59,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-15 21:28:59,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:28:59,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-15 21:28:59,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:28:59,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-15 21:28:59,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:28:59,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-15 21:28:59,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:28:59,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 21:28:59,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:28:59,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 21:28:59,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:28:59,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-15 21:28:59,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:28:59,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-15 21:28:59,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:28:59,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-12-15 21:28:59,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:28:59,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-15 21:28:59,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:28:59,428 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-12-15 21:28:59,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:28:59,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832390978] [2023-12-15 21:28:59,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [832390978] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:28:59,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:28:59,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-15 21:28:59,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441462178] [2023-12-15 21:28:59,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:28:59,430 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-15 21:28:59,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:28:59,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-15 21:28:59,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-15 21:28:59,431 INFO L87 Difference]: Start difference. First operand 103 states and 150 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-12-15 21:28:59,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:28:59,532 INFO L93 Difference]: Finished difference Result 175 states and 254 transitions. [2023-12-15 21:28:59,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-15 21:28:59,533 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 109 [2023-12-15 21:28:59,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:28:59,534 INFO L225 Difference]: With dead ends: 175 [2023-12-15 21:28:59,534 INFO L226 Difference]: Without dead ends: 110 [2023-12-15 21:28:59,534 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 38 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:28:59,535 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 47 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 21:28:59,535 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 194 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 21:28:59,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2023-12-15 21:28:59,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 104. [2023-12-15 21:28:59,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 65 states have (on average 1.2615384615384615) internal successors, (82), 65 states have internal predecessors, (82), 34 states have call successors, (34), 4 states have call predecessors, (34), 4 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2023-12-15 21:28:59,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 150 transitions. [2023-12-15 21:28:59,554 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 150 transitions. Word has length 109 [2023-12-15 21:28:59,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:28:59,554 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 150 transitions. [2023-12-15 21:28:59,554 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-12-15 21:28:59,555 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 150 transitions. [2023-12-15 21:28:59,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2023-12-15 21:28:59,556 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:28:59,556 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28:59,556 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-15 21:28:59,556 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:28:59,556 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:28:59,556 INFO L85 PathProgramCache]: Analyzing trace with hash 851262190, now seen corresponding path program 1 times [2023-12-15 21:28:59,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:28:59,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877098488] [2023-12-15 21:28:59,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:28:59,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:28:59,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:28:59,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:28:59,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:28:59,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 21:28:59,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:28:59,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 21:28:59,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:28:59,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 21:28:59,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:28:59,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 21:28:59,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:28:59,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 21:28:59,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:28:59,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 21:28:59,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:28:59,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-15 21:28:59,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:28:59,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-15 21:28:59,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:28:59,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-15 21:28:59,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:28:59,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-15 21:28:59,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:28:59,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 21:28:59,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:28:59,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 21:28:59,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:28:59,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-15 21:28:59,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:28:59,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-15 21:28:59,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:28:59,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-12-15 21:28:59,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:28:59,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-15 21:28:59,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:28:59,861 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-12-15 21:28:59,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:28:59,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877098488] [2023-12-15 21:28:59,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1877098488] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:28:59,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:28:59,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-15 21:28:59,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419395760] [2023-12-15 21:28:59,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:28:59,863 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-15 21:28:59,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:28:59,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-15 21:28:59,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-15 21:28:59,863 INFO L87 Difference]: Start difference. First operand 104 states and 150 transitions. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-12-15 21:29:00,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:29:00,067 INFO L93 Difference]: Finished difference Result 189 states and 264 transitions. [2023-12-15 21:29:00,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-15 21:29:00,067 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 109 [2023-12-15 21:29:00,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:29:00,069 INFO L225 Difference]: With dead ends: 189 [2023-12-15 21:29:00,069 INFO L226 Difference]: Without dead ends: 129 [2023-12-15 21:29:00,071 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-12-15 21:29:00,071 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 91 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 21:29:00,071 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 286 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 21:29:00,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2023-12-15 21:29:00,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 105. [2023-12-15 21:29:00,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 66 states have (on average 1.2575757575757576) internal successors, (83), 66 states have internal predecessors, (83), 34 states have call successors, (34), 4 states have call predecessors, (34), 4 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2023-12-15 21:29:00,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 151 transitions. [2023-12-15 21:29:00,096 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 151 transitions. Word has length 109 [2023-12-15 21:29:00,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:29:00,097 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 151 transitions. [2023-12-15 21:29:00,098 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-12-15 21:29:00,098 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 151 transitions. [2023-12-15 21:29:00,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2023-12-15 21:29:00,100 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:29:00,100 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29:00,100 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-15 21:29:00,101 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:29:00,101 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:29:00,101 INFO L85 PathProgramCache]: Analyzing trace with hash -1316772182, now seen corresponding path program 1 times [2023-12-15 21:29:00,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:29:00,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979437562] [2023-12-15 21:29:00,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:29:00,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:29:00,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-15 21:29:00,161 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-15 21:29:00,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-15 21:29:00,243 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-15 21:29:00,243 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-15 21:29:00,244 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-15 21:29:00,246 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-15 21:29:00,248 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2023-12-15 21:29:00,251 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-15 21:29:00,321 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.12 09:29:00 BoogieIcfgContainer [2023-12-15 21:29:00,321 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-15 21:29:00,322 INFO L158 Benchmark]: Toolchain (without parser) took 4623.33ms. Allocated memory was 219.2MB in the beginning and 362.8MB in the end (delta: 143.7MB). Free memory was 169.5MB in the beginning and 139.7MB in the end (delta: 29.8MB). Peak memory consumption was 174.3MB. Max. memory is 8.0GB. [2023-12-15 21:29:00,322 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 219.2MB. Free memory was 175.9MB in the beginning and 175.7MB in the end (delta: 146.8kB). There was no memory consumed. Max. memory is 8.0GB. [2023-12-15 21:29:00,322 INFO L158 Benchmark]: CACSL2BoogieTranslator took 201.77ms. Allocated memory is still 219.2MB. Free memory was 169.2MB in the beginning and 156.6MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2023-12-15 21:29:00,322 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.85ms. Allocated memory is still 219.2MB. Free memory was 156.6MB in the beginning and 154.2MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-15 21:29:00,322 INFO L158 Benchmark]: Boogie Preprocessor took 36.94ms. Allocated memory is still 219.2MB. Free memory was 154.2MB in the beginning and 151.7MB in the end (delta: 2.5MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-15 21:29:00,323 INFO L158 Benchmark]: RCFGBuilder took 481.65ms. Allocated memory is still 219.2MB. Free memory was 151.7MB in the beginning and 188.6MB in the end (delta: -36.9MB). Peak memory consumption was 22.6MB. Max. memory is 8.0GB. [2023-12-15 21:29:00,323 INFO L158 Benchmark]: TraceAbstraction took 3864.13ms. Allocated memory was 219.2MB in the beginning and 362.8MB in the end (delta: 143.7MB). Free memory was 188.1MB in the beginning and 139.7MB in the end (delta: 48.4MB). Peak memory consumption was 192.6MB. Max. memory is 8.0GB. [2023-12-15 21:29:00,324 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.11ms. Allocated memory is still 219.2MB. Free memory was 175.9MB in the beginning and 175.7MB in the end (delta: 146.8kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 201.77ms. Allocated memory is still 219.2MB. Free memory was 169.2MB in the beginning and 156.6MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 32.85ms. Allocated memory is still 219.2MB. Free memory was 156.6MB in the beginning and 154.2MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 36.94ms. Allocated memory is still 219.2MB. Free memory was 154.2MB in the beginning and 151.7MB in the end (delta: 2.5MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 481.65ms. Allocated memory is still 219.2MB. Free memory was 151.7MB in the beginning and 188.6MB in the end (delta: -36.9MB). Peak memory consumption was 22.6MB. Max. memory is 8.0GB. * TraceAbstraction took 3864.13ms. Allocated memory was 219.2MB in the beginning and 362.8MB in the end (delta: 143.7MB). Free memory was 188.1MB in the beginning and 139.7MB in the end (delta: 48.4MB). Peak memory consumption was 192.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 103, overapproximation of bitwiseOr at line 103. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed char var_1_1 = -8; [L23] unsigned char var_1_5 = 0; [L24] unsigned char var_1_6 = 1; [L25] signed char var_1_7 = -1; [L26] signed char var_1_8 = -50; [L27] signed char var_1_9 = 100; [L28] unsigned long int var_1_10 = 25; [L29] unsigned long int var_1_11 = 2568920345; [L30] unsigned long int var_1_12 = 1191097264; [L31] unsigned long int var_1_13 = 1801344522; [L32] signed long int var_1_14 = 64; [L33] signed short int var_1_15 = -16; [L34] float var_1_16 = 1000000.5; [L35] float var_1_17 = 4.5; [L36] unsigned char var_1_18 = 0; [L37] unsigned char var_1_19 = 128; [L38] unsigned long int last_1_var_1_10 = 25; [L39] signed short int last_1_var_1_15 = -16; [L40] unsigned char last_1_var_1_18 = 0; [L107] isInitial = 1 [L108] FCALL initially() [L109] COND TRUE 1 [L110] CALL updateLastVariables() [L98] last_1_var_1_10 = var_1_10 [L99] last_1_var_1_15 = var_1_15 [L100] last_1_var_1_18 = var_1_18 [L110] RET updateLastVariables() [L111] CALL updateVariables() [L70] var_1_5 = __VERIFIER_nondet_uchar() [L71] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=2568920345, var_1_12=1191097264, var_1_13=1801344522, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_17=9/2, var_1_18=0, var_1_19=128, var_1_1=-8, var_1_6=1, var_1_7=-1, var_1_8=-50, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=2568920345, var_1_12=1191097264, var_1_13=1801344522, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_17=9/2, var_1_18=0, var_1_19=128, var_1_1=-8, var_1_6=1, var_1_7=-1, var_1_8=-50, var_1_9=100] [L71] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=2568920345, var_1_12=1191097264, var_1_13=1801344522, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_17=9/2, var_1_18=0, var_1_19=128, var_1_1=-8, var_1_6=1, var_1_7=-1, var_1_8=-50, var_1_9=100] [L72] CALL assume_abort_if_not(var_1_5 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=2568920345, var_1_12=1191097264, var_1_13=1801344522, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_17=9/2, var_1_18=0, var_1_19=128, var_1_1=-8, var_1_5=0, var_1_6=1, var_1_7=-1, var_1_8=-50, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=2568920345, var_1_12=1191097264, var_1_13=1801344522, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_17=9/2, var_1_18=0, var_1_19=128, var_1_1=-8, var_1_5=0, var_1_6=1, var_1_7=-1, var_1_8=-50, var_1_9=100] [L72] RET assume_abort_if_not(var_1_5 <= 1) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=2568920345, var_1_12=1191097264, var_1_13=1801344522, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_17=9/2, var_1_18=0, var_1_19=128, var_1_1=-8, var_1_5=0, var_1_6=1, var_1_7=-1, var_1_8=-50, var_1_9=100] [L73] var_1_6 = __VERIFIER_nondet_uchar() [L74] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=2568920345, var_1_12=1191097264, var_1_13=1801344522, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_17=9/2, var_1_18=0, var_1_19=128, var_1_1=-8, var_1_5=0, var_1_7=-1, var_1_8=-50, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=2568920345, var_1_12=1191097264, var_1_13=1801344522, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_17=9/2, var_1_18=0, var_1_19=128, var_1_1=-8, var_1_5=0, var_1_7=-1, var_1_8=-50, var_1_9=100] [L74] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=2568920345, var_1_12=1191097264, var_1_13=1801344522, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_17=9/2, var_1_18=0, var_1_19=128, var_1_1=-8, var_1_5=0, var_1_7=-1, var_1_8=-50, var_1_9=100] [L75] CALL assume_abort_if_not(var_1_6 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=2568920345, var_1_12=1191097264, var_1_13=1801344522, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_17=9/2, var_1_18=0, var_1_19=128, var_1_1=-8, var_1_5=0, var_1_6=0, var_1_7=-1, var_1_8=-50, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=2568920345, var_1_12=1191097264, var_1_13=1801344522, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_17=9/2, var_1_18=0, var_1_19=128, var_1_1=-8, var_1_5=0, var_1_6=0, var_1_7=-1, var_1_8=-50, var_1_9=100] [L75] RET assume_abort_if_not(var_1_6 <= 1) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=2568920345, var_1_12=1191097264, var_1_13=1801344522, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_17=9/2, var_1_18=0, var_1_19=128, var_1_1=-8, var_1_5=0, var_1_6=0, var_1_7=-1, var_1_8=-50, var_1_9=100] [L76] var_1_7 = __VERIFIER_nondet_char() [L77] CALL assume_abort_if_not(var_1_7 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=2568920345, var_1_12=1191097264, var_1_13=1801344522, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_17=9/2, var_1_18=0, var_1_19=128, var_1_1=-8, var_1_5=0, var_1_6=0, var_1_7=-49, var_1_8=-50, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=2568920345, var_1_12=1191097264, var_1_13=1801344522, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_17=9/2, var_1_18=0, var_1_19=128, var_1_1=-8, var_1_5=0, var_1_6=0, var_1_7=-49, var_1_8=-50, var_1_9=100] [L77] RET assume_abort_if_not(var_1_7 >= -127) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=2568920345, var_1_12=1191097264, var_1_13=1801344522, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_17=9/2, var_1_18=0, var_1_19=128, var_1_1=-8, var_1_5=0, var_1_6=0, var_1_7=-49, var_1_8=-50, var_1_9=100] [L78] CALL assume_abort_if_not(var_1_7 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=2568920345, var_1_12=1191097264, var_1_13=1801344522, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_17=9/2, var_1_18=0, var_1_19=128, var_1_1=-8, var_1_5=0, var_1_6=0, var_1_7=-49, var_1_8=-50, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=2568920345, var_1_12=1191097264, var_1_13=1801344522, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_17=9/2, var_1_18=0, var_1_19=128, var_1_1=-8, var_1_5=0, var_1_6=0, var_1_7=-49, var_1_8=-50, var_1_9=100] [L78] RET assume_abort_if_not(var_1_7 <= 126) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=2568920345, var_1_12=1191097264, var_1_13=1801344522, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_17=9/2, var_1_18=0, var_1_19=128, var_1_1=-8, var_1_5=0, var_1_6=0, var_1_7=-49, var_1_8=-50, var_1_9=100] [L79] var_1_9 = __VERIFIER_nondet_char() [L80] CALL assume_abort_if_not(var_1_9 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=2568920345, var_1_12=1191097264, var_1_13=1801344522, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_17=9/2, var_1_18=0, var_1_19=128, var_1_1=-8, var_1_5=0, var_1_6=0, var_1_7=-49, var_1_8=-50, var_1_9=-49] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=2568920345, var_1_12=1191097264, var_1_13=1801344522, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_17=9/2, var_1_18=0, var_1_19=128, var_1_1=-8, var_1_5=0, var_1_6=0, var_1_7=-49, var_1_8=-50, var_1_9=-49] [L80] RET assume_abort_if_not(var_1_9 >= -127) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=2568920345, var_1_12=1191097264, var_1_13=1801344522, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_17=9/2, var_1_18=0, var_1_19=128, var_1_1=-8, var_1_5=0, var_1_6=0, var_1_7=-49, var_1_8=-50, var_1_9=-49] [L81] CALL assume_abort_if_not(var_1_9 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=2568920345, var_1_12=1191097264, var_1_13=1801344522, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_17=9/2, var_1_18=0, var_1_19=128, var_1_1=-8, var_1_5=0, var_1_6=0, var_1_7=-49, var_1_8=-50, var_1_9=-49] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=2568920345, var_1_12=1191097264, var_1_13=1801344522, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_17=9/2, var_1_18=0, var_1_19=128, var_1_1=-8, var_1_5=0, var_1_6=0, var_1_7=-49, var_1_8=-50, var_1_9=-49] [L81] RET assume_abort_if_not(var_1_9 <= 126) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=2568920345, var_1_12=1191097264, var_1_13=1801344522, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_17=9/2, var_1_18=0, var_1_19=128, var_1_1=-8, var_1_5=0, var_1_6=0, var_1_7=-49, var_1_8=-50, var_1_9=-49] [L82] var_1_11 = __VERIFIER_nondet_ulong() [L83] CALL assume_abort_if_not(var_1_11 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=4294967294, var_1_12=1191097264, var_1_13=1801344522, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_17=9/2, var_1_18=0, var_1_19=128, var_1_1=-8, var_1_5=0, var_1_6=0, var_1_7=-49, var_1_8=-50, var_1_9=-49] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=4294967294, var_1_12=1191097264, var_1_13=1801344522, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_17=9/2, var_1_18=0, var_1_19=128, var_1_1=-8, var_1_5=0, var_1_6=0, var_1_7=-49, var_1_8=-50, var_1_9=-49] [L83] RET assume_abort_if_not(var_1_11 >= 2147483647) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=4294967294, var_1_12=1191097264, var_1_13=1801344522, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_17=9/2, var_1_18=0, var_1_19=128, var_1_1=-8, var_1_5=0, var_1_6=0, var_1_7=-49, var_1_8=-50, var_1_9=-49] [L84] CALL assume_abort_if_not(var_1_11 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=4294967294, var_1_12=1191097264, var_1_13=1801344522, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_17=9/2, var_1_18=0, var_1_19=128, var_1_1=-8, var_1_5=0, var_1_6=0, var_1_7=-49, var_1_8=-50, var_1_9=-49] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=4294967294, var_1_12=1191097264, var_1_13=1801344522, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_17=9/2, var_1_18=0, var_1_19=128, var_1_1=-8, var_1_5=0, var_1_6=0, var_1_7=-49, var_1_8=-50, var_1_9=-49] [L84] RET assume_abort_if_not(var_1_11 <= 4294967294) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=4294967294, var_1_12=1191097264, var_1_13=1801344522, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_17=9/2, var_1_18=0, var_1_19=128, var_1_1=-8, var_1_5=0, var_1_6=0, var_1_7=-49, var_1_8=-50, var_1_9=-49] [L85] var_1_12 = __VERIFIER_nondet_ulong() [L86] CALL assume_abort_if_not(var_1_12 >= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=4294967294, var_1_12=1073741825, var_1_13=1801344522, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_17=9/2, var_1_18=0, var_1_19=128, var_1_1=-8, var_1_5=0, var_1_6=0, var_1_7=-49, var_1_8=-50, var_1_9=-49] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=4294967294, var_1_12=1073741825, var_1_13=1801344522, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_17=9/2, var_1_18=0, var_1_19=128, var_1_1=-8, var_1_5=0, var_1_6=0, var_1_7=-49, var_1_8=-50, var_1_9=-49] [L86] RET assume_abort_if_not(var_1_12 >= 1073741823) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=4294967294, var_1_12=1073741825, var_1_13=1801344522, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_17=9/2, var_1_18=0, var_1_19=128, var_1_1=-8, var_1_5=0, var_1_6=0, var_1_7=-49, var_1_8=-50, var_1_9=-49] [L87] CALL assume_abort_if_not(var_1_12 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=4294967294, var_1_12=1073741825, var_1_13=1801344522, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_17=9/2, var_1_18=0, var_1_19=128, var_1_1=-8, var_1_5=0, var_1_6=0, var_1_7=-49, var_1_8=-50, var_1_9=-49] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=4294967294, var_1_12=1073741825, var_1_13=1801344522, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_17=9/2, var_1_18=0, var_1_19=128, var_1_1=-8, var_1_5=0, var_1_6=0, var_1_7=-49, var_1_8=-50, var_1_9=-49] [L87] RET assume_abort_if_not(var_1_12 <= 2147483647) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=4294967294, var_1_12=1073741825, var_1_13=1801344522, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_17=9/2, var_1_18=0, var_1_19=128, var_1_1=-8, var_1_5=0, var_1_6=0, var_1_7=-49, var_1_8=-50, var_1_9=-49] [L88] var_1_13 = __VERIFIER_nondet_ulong() [L89] CALL assume_abort_if_not(var_1_13 >= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=4294967294, var_1_12=1073741825, var_1_13=1073741823, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_17=9/2, var_1_18=0, var_1_19=128, var_1_1=-8, var_1_5=0, var_1_6=0, var_1_7=-49, var_1_8=-50, var_1_9=-49] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=4294967294, var_1_12=1073741825, var_1_13=1073741823, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_17=9/2, var_1_18=0, var_1_19=128, var_1_1=-8, var_1_5=0, var_1_6=0, var_1_7=-49, var_1_8=-50, var_1_9=-49] [L89] RET assume_abort_if_not(var_1_13 >= 1073741823) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=4294967294, var_1_12=1073741825, var_1_13=1073741823, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_17=9/2, var_1_18=0, var_1_19=128, var_1_1=-8, var_1_5=0, var_1_6=0, var_1_7=-49, var_1_8=-50, var_1_9=-49] [L90] CALL assume_abort_if_not(var_1_13 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=4294967294, var_1_12=1073741825, var_1_13=1073741823, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_17=9/2, var_1_18=0, var_1_19=128, var_1_1=-8, var_1_5=0, var_1_6=0, var_1_7=-49, var_1_8=-50, var_1_9=-49] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=4294967294, var_1_12=1073741825, var_1_13=1073741823, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_17=9/2, var_1_18=0, var_1_19=128, var_1_1=-8, var_1_5=0, var_1_6=0, var_1_7=-49, var_1_8=-50, var_1_9=-49] [L90] RET assume_abort_if_not(var_1_13 <= 2147483647) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=4294967294, var_1_12=1073741825, var_1_13=1073741823, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_17=9/2, var_1_18=0, var_1_19=128, var_1_1=-8, var_1_5=0, var_1_6=0, var_1_7=-49, var_1_8=-50, var_1_9=-49] [L91] var_1_17 = __VERIFIER_nondet_float() [L92] CALL assume_abort_if_not((var_1_17 >= -922337.2036854765600e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=4294967294, var_1_12=1073741825, var_1_13=1073741823, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_18=0, var_1_19=128, var_1_1=-8, var_1_5=0, var_1_6=0, var_1_7=-49, var_1_8=-50, var_1_9=-49] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=4294967294, var_1_12=1073741825, var_1_13=1073741823, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_18=0, var_1_19=128, var_1_1=-8, var_1_5=0, var_1_6=0, var_1_7=-49, var_1_8=-50, var_1_9=-49] [L92] RET assume_abort_if_not((var_1_17 >= -922337.2036854765600e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=4294967294, var_1_12=1073741825, var_1_13=1073741823, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_18=0, var_1_19=128, var_1_1=-8, var_1_5=0, var_1_6=0, var_1_7=-49, var_1_8=-50, var_1_9=-49] [L93] var_1_19 = __VERIFIER_nondet_uchar() [L94] CALL assume_abort_if_not(var_1_19 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=4294967294, var_1_12=1073741825, var_1_13=1073741823, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_18=0, var_1_1=-8, var_1_5=0, var_1_6=0, var_1_7=-49, var_1_8=-50, var_1_9=-49] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=4294967294, var_1_12=1073741825, var_1_13=1073741823, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_18=0, var_1_1=-8, var_1_5=0, var_1_6=0, var_1_7=-49, var_1_8=-50, var_1_9=-49] [L94] RET assume_abort_if_not(var_1_19 >= 0) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=4294967294, var_1_12=1073741825, var_1_13=1073741823, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_18=0, var_1_1=-8, var_1_5=0, var_1_6=0, var_1_7=-49, var_1_8=-50, var_1_9=-49] [L95] CALL assume_abort_if_not(var_1_19 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=4294967294, var_1_12=1073741825, var_1_13=1073741823, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_18=0, var_1_19=254, var_1_1=-8, var_1_5=0, var_1_6=0, var_1_7=-49, var_1_8=-50, var_1_9=-49] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=4294967294, var_1_12=1073741825, var_1_13=1073741823, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_18=0, var_1_19=254, var_1_1=-8, var_1_5=0, var_1_6=0, var_1_7=-49, var_1_8=-50, var_1_9=-49] [L95] RET assume_abort_if_not(var_1_19 <= 254) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=4294967294, var_1_12=1073741825, var_1_13=1073741823, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_18=0, var_1_19=254, var_1_1=-8, var_1_5=0, var_1_6=0, var_1_7=-49, var_1_8=-50, var_1_9=-49] [L111] RET updateVariables() [L112] CALL step() [L44] EXPR last_1_var_1_15 | last_1_var_1_10 VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=4294967294, var_1_12=1073741825, var_1_13=1073741823, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_18=0, var_1_19=254, var_1_1=-8, var_1_5=0, var_1_6=0, var_1_7=-49, var_1_8=-50, var_1_9=-49] [L44] COND FALSE !(((last_1_var_1_15 | last_1_var_1_10) > last_1_var_1_18) && var_1_5) [L51] var_1_1 = var_1_7 VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=4294967294, var_1_12=1073741825, var_1_13=1073741823, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_18=0, var_1_19=254, var_1_1=-49, var_1_5=0, var_1_6=0, var_1_7=-49, var_1_8=-50, var_1_9=-49] [L53] COND FALSE !(\read(var_1_5)) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=4294967294, var_1_12=1073741825, var_1_13=1073741823, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_18=0, var_1_19=254, var_1_1=-49, var_1_5=0, var_1_6=0, var_1_7=-49, var_1_8=-50, var_1_9=-49] [L56] COND TRUE var_1_12 <= var_1_8 [L57] var_1_14 = ((((var_1_8) < 0 ) ? -(var_1_8) : (var_1_8))) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=4294967294, var_1_12=1073741825, var_1_13=1073741823, var_1_14=50, var_1_15=-16, var_1_16=2000001/2, var_1_18=0, var_1_19=254, var_1_1=-49, var_1_5=0, var_1_6=0, var_1_7=-49, var_1_8=-50, var_1_9=-49] [L59] var_1_15 = 2 [L60] var_1_16 = var_1_17 [L61] var_1_18 = var_1_19 [L62] unsigned char stepLocal_0 = var_1_8 < var_1_1; VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, stepLocal_0=1, var_1_10=25, var_1_11=4294967294, var_1_12=1073741825, var_1_13=1073741823, var_1_14=50, var_1_15=2, var_1_16=5368709124, var_1_17=5368709124, var_1_18=254, var_1_19=254, var_1_1=-49, var_1_5=0, var_1_6=0, var_1_7=-49, var_1_8=-50, var_1_9=-49] [L63] COND TRUE stepLocal_0 && (((((var_1_9) > (var_1_8)) ? (var_1_9) : (var_1_8))) == var_1_7) [L64] var_1_10 = (var_1_11 - (((((var_1_12) > (var_1_13)) ? (var_1_12) : (var_1_13))) - 1u)) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, stepLocal_0=1, var_1_10=3221225470, var_1_11=4294967294, var_1_12=1073741825, var_1_13=1073741823, var_1_14=50, var_1_15=2, var_1_16=5368709124, var_1_17=5368709124, var_1_18=254, var_1_19=254, var_1_1=-49, var_1_5=0, var_1_6=0, var_1_7=-49, var_1_8=-50, var_1_9=-49] [L112] RET step() [L113] CALL, EXPR property() [L103] EXPR last_1_var_1_15 | last_1_var_1_10 VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=3221225470, var_1_11=4294967294, var_1_12=1073741825, var_1_13=1073741823, var_1_14=50, var_1_15=2, var_1_16=5368709124, var_1_17=5368709124, var_1_18=254, var_1_19=254, var_1_1=-49, var_1_5=0, var_1_6=0, var_1_7=-49, var_1_8=-50, var_1_9=-49] [L103-L104] return (((((((((last_1_var_1_15 | last_1_var_1_10) > last_1_var_1_18) && var_1_5) ? ((var_1_5 && var_1_6) ? (var_1_1 == ((signed char) var_1_7)) : (var_1_1 == ((signed char) var_1_7))) : (var_1_1 == ((signed char) var_1_7))) && (var_1_5 ? (var_1_8 == ((signed char) ((((var_1_7) > (var_1_9)) ? (var_1_7) : (var_1_9))))) : 1)) && (((var_1_8 < var_1_1) && (((((var_1_9) > (var_1_8)) ? (var_1_9) : (var_1_8))) == var_1_7)) ? (var_1_10 == ((unsigned long int) (var_1_11 - (((((var_1_12) > (var_1_13)) ? (var_1_12) : (var_1_13))) - 1u)))) : (var_1_10 == ((unsigned long int) (var_1_11 - var_1_13))))) && ((var_1_12 <= var_1_8) ? (var_1_14 == ((signed long int) ((((var_1_8) < 0 ) ? -(var_1_8) : (var_1_8))))) : 1)) && (var_1_15 == ((signed short int) 2))) && (var_1_16 == ((float) var_1_17))) && (var_1_18 == ((unsigned char) var_1_19)) ; [L113] RET, EXPR property() [L113] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=3221225470, var_1_11=4294967294, var_1_12=1073741825, var_1_13=1073741823, var_1_14=50, var_1_15=2, var_1_16=5368709124, var_1_17=5368709124, var_1_18=254, var_1_19=254, var_1_1=-49, var_1_5=0, var_1_6=0, var_1_7=-49, var_1_8=-50, var_1_9=-49] [L19] reach_error() VAL [\old(cond)=0, cond=0, isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=3221225470, var_1_11=4294967294, var_1_12=1073741825, var_1_13=1073741823, var_1_14=50, var_1_15=2, var_1_16=5368709124, var_1_17=5368709124, var_1_18=254, var_1_19=254, var_1_1=-49, var_1_5=0, var_1_6=0, var_1_7=-49, var_1_8=-50, var_1_9=-49] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 50 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.7s, OverallIterations: 6, TraceHistogramMax: 17, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 271 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 271 mSDsluCounter, 879 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 542 mSDsCounter, 172 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 300 IncrementalHoareTripleChecker+Invalid, 472 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 172 mSolverCounterUnsat, 337 mSDtfsCounter, 300 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 225 GetRequests, 203 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=105occurred in iteration=5, InterpolantAutomatonStates: 24, 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, 5 MinimizatonAttempts, 56 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 648 NumberOfCodeBlocks, 648 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 534 ConstructedInterpolants, 0 QuantifiedInterpolants, 2408 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 2720/2720 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:29:00,347 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...