/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_loopvsstraightlinecode_50-1loop_file-53.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-15 20:58:32,261 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-15 20:58:32,319 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 20:58:32,322 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-15 20:58:32,322 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-15 20:58:32,340 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-15 20:58:32,341 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-15 20:58:32,341 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-15 20:58:32,341 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-15 20:58:32,345 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-15 20:58:32,345 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-15 20:58:32,346 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-15 20:58:32,346 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-15 20:58:32,347 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-15 20:58:32,347 INFO L153 SettingsManager]: * Use SBE=true [2023-12-15 20:58:32,348 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-15 20:58:32,348 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-15 20:58:32,348 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-15 20:58:32,348 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-15 20:58:32,348 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-15 20:58:32,348 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-15 20:58:32,349 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-15 20:58:32,349 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-15 20:58:32,349 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-15 20:58:32,349 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-15 20:58:32,349 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-15 20:58:32,349 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-15 20:58:32,349 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-15 20:58:32,350 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-15 20:58:32,350 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-15 20:58:32,351 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-15 20:58:32,351 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-15 20:58:32,351 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-15 20:58:32,351 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-15 20:58:32,351 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-15 20:58:32,351 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-15 20:58:32,351 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-15 20:58:32,351 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-15 20:58:32,351 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-15 20:58:32,352 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-15 20:58:32,352 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-15 20:58:32,352 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-15 20:58:32,352 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-15 20:58:32,352 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 20:58:32,528 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-15 20:58:32,547 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-15 20:58:32,549 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-15 20:58:32,550 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-15 20:58:32,550 INFO L274 PluginConnector]: CDTParser initialized [2023-12-15 20:58:32,551 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-53.i [2023-12-15 20:58:33,580 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-15 20:58:33,707 INFO L384 CDTParser]: Found 1 translation units. [2023-12-15 20:58:33,710 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-53.i [2023-12-15 20:58:33,716 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d6bd1a72/b6808f7953574cfbb5348b65687b5f01/FLAGba9823023 [2023-12-15 20:58:33,727 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d6bd1a72/b6808f7953574cfbb5348b65687b5f01 [2023-12-15 20:58:33,729 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-15 20:58:33,730 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-15 20:58:33,730 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-15 20:58:33,731 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-15 20:58:33,734 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-15 20:58:33,734 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 08:58:33" (1/1) ... [2023-12-15 20:58:33,735 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c91cb34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:58:33, skipping insertion in model container [2023-12-15 20:58:33,735 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 08:58:33" (1/1) ... [2023-12-15 20:58:33,756 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-15 20:58:33,851 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_loopvsstraightlinecode_50-1loop_file-53.i[915,928] [2023-12-15 20:58:33,896 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-15 20:58:33,904 INFO L202 MainTranslator]: Completed pre-run [2023-12-15 20:58:33,918 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_loopvsstraightlinecode_50-1loop_file-53.i[915,928] [2023-12-15 20:58:33,938 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-15 20:58:33,955 INFO L206 MainTranslator]: Completed translation [2023-12-15 20:58:33,955 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:58:33 WrapperNode [2023-12-15 20:58:33,955 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-15 20:58:33,956 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-15 20:58:33,956 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-15 20:58:33,956 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-15 20:58:33,960 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:58:33" (1/1) ... [2023-12-15 20:58:33,980 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:58:33" (1/1) ... [2023-12-15 20:58:34,000 INFO L138 Inliner]: procedures = 26, calls = 30, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 180 [2023-12-15 20:58:34,000 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-15 20:58:34,001 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-15 20:58:34,001 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-15 20:58:34,001 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-15 20:58:34,020 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:58:33" (1/1) ... [2023-12-15 20:58:34,021 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:58:33" (1/1) ... [2023-12-15 20:58:34,029 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:58:33" (1/1) ... [2023-12-15 20:58:34,055 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 20:58:34,055 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:58:33" (1/1) ... [2023-12-15 20:58:34,056 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:58:33" (1/1) ... [2023-12-15 20:58:34,061 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:58:33" (1/1) ... [2023-12-15 20:58:34,064 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:58:33" (1/1) ... [2023-12-15 20:58:34,065 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:58:33" (1/1) ... [2023-12-15 20:58:34,066 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:58:33" (1/1) ... [2023-12-15 20:58:34,084 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-15 20:58:34,085 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-15 20:58:34,085 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-15 20:58:34,085 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-15 20:58:34,086 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:58:33" (1/1) ... [2023-12-15 20:58:34,100 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-15 20:58:34,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 20:58:34,129 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 20:58:34,164 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 20:58:34,169 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-15 20:58:34,169 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-15 20:58:34,170 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-15 20:58:34,170 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-15 20:58:34,170 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-15 20:58:34,170 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-15 20:58:34,255 INFO L241 CfgBuilder]: Building ICFG [2023-12-15 20:58:34,257 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-15 20:58:34,501 INFO L282 CfgBuilder]: Performing block encoding [2023-12-15 20:58:34,521 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-15 20:58:34,522 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-15 20:58:34,522 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 08:58:34 BoogieIcfgContainer [2023-12-15 20:58:34,522 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-15 20:58:34,524 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-15 20:58:34,524 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-15 20:58:34,526 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-15 20:58:34,526 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.12 08:58:33" (1/3) ... [2023-12-15 20:58:34,526 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5df2ad4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 08:58:34, skipping insertion in model container [2023-12-15 20:58:34,527 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:58:33" (2/3) ... [2023-12-15 20:58:34,527 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5df2ad4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 08:58:34, skipping insertion in model container [2023-12-15 20:58:34,527 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 08:58:34" (3/3) ... [2023-12-15 20:58:34,528 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-1loop_file-53.i [2023-12-15 20:58:34,544 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-15 20:58:34,544 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-15 20:58:34,585 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-15 20:58:34,591 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;@11f6c0e5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-15 20:58:34,591 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-15 20:58:34,594 INFO L276 IsEmpty]: Start isEmpty. Operand has 66 states, 46 states have (on average 1.5) internal successors, (69), 47 states have internal predecessors, (69), 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 20:58:34,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2023-12-15 20:58:34,618 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 20:58:34,619 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, 1, 1, 1, 1] [2023-12-15 20:58:34,619 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 20:58:34,622 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 20:58:34,622 INFO L85 PathProgramCache]: Analyzing trace with hash 854357864, now seen corresponding path program 1 times [2023-12-15 20:58:34,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 20:58:34,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22909290] [2023-12-15 20:58:34,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:58:34,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 20:58:34,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:58:34,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 20:58:34,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22909290] [2023-12-15 20:58:34,787 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unsupported non-linear arithmetic [2023-12-15 20:58:34,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [870393523] [2023-12-15 20:58:34,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:58:34,788 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 20:58:34,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 20:58:34,790 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-15 20:58:34,799 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-15 20:58:34,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:58:34,937 INFO L262 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-15 20:58:34,942 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 20:58:34,988 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2023-12-15 20:58:34,988 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-15 20:58:34,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [870393523] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 20:58:34,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 20:58:34,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-15 20:58:34,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997552120] [2023-12-15 20:58:34,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 20:58:34,993 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-15 20:58:34,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 20:58:35,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-15 20:58:35,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-15 20:58:35,011 INFO L87 Difference]: Start difference. First operand has 66 states, 46 states have (on average 1.5) internal successors, (69), 47 states have internal predecessors, (69), 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 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (17), 2 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 20:58:35,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 20:58:35,047 INFO L93 Difference]: Finished difference Result 131 states and 222 transitions. [2023-12-15 20:58:35,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-15 20:58:35,049 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (17), 2 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 113 [2023-12-15 20:58:35,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 20:58:35,054 INFO L225 Difference]: With dead ends: 131 [2023-12-15 20:58:35,054 INFO L226 Difference]: Without dead ends: 64 [2023-12-15 20:58:35,057 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 112 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 20:58:35,061 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 20:58:35,062 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 95 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 20:58:35,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2023-12-15 20:58:35,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2023-12-15 20:58:35,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 45 states have (on average 1.4222222222222223) internal successors, (64), 45 states have internal predecessors, (64), 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 20:58:35,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 98 transitions. [2023-12-15 20:58:35,097 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 98 transitions. Word has length 113 [2023-12-15 20:58:35,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 20:58:35,097 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 98 transitions. [2023-12-15 20:58:35,098 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (17), 2 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 20:58:35,098 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 98 transitions. [2023-12-15 20:58:35,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2023-12-15 20:58:35,106 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 20:58:35,106 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, 1, 1, 1, 1] [2023-12-15 20:58:35,113 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-12-15 20:58:35,313 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2023-12-15 20:58:35,315 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 20:58:35,316 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 20:58:35,316 INFO L85 PathProgramCache]: Analyzing trace with hash -640191330, now seen corresponding path program 1 times [2023-12-15 20:58:35,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 20:58:35,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167402522] [2023-12-15 20:58:35,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:58:35,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 20:58:35,363 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-15 20:58:35,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2116059080] [2023-12-15 20:58:35,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:58:35,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 20:58:35,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 20:58:35,365 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-15 20:58:35,377 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-12-15 20:58:35,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:58:35,464 INFO L262 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-15 20:58:35,477 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 20:58:35,538 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 20:58:35,538 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-15 20:58:35,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 20:58:35,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167402522] [2023-12-15 20:58:35,539 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-15 20:58:35,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2116059080] [2023-12-15 20:58:35,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2116059080] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 20:58:35,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 20:58:35,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-15 20:58:35,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970436896] [2023-12-15 20:58:35,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 20:58:35,542 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 20:58:35,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 20:58:35,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 20:58:35,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 20:58:35,543 INFO L87 Difference]: Start difference. First operand 64 states and 98 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 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 20:58:35,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 20:58:35,616 INFO L93 Difference]: Finished difference Result 183 states and 279 transitions. [2023-12-15 20:58:35,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 20:58:35,616 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 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 113 [2023-12-15 20:58:35,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 20:58:35,620 INFO L225 Difference]: With dead ends: 183 [2023-12-15 20:58:35,620 INFO L226 Difference]: Without dead ends: 120 [2023-12-15 20:58:35,622 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 20:58:35,624 INFO L413 NwaCegarLoop]: 148 mSDtfsCounter, 79 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 20:58:35,625 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 230 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 20:58:35,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2023-12-15 20:58:35,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 118. [2023-12-15 20:58:35,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 81 states have (on average 1.3580246913580247) internal successors, (110), 81 states have internal predecessors, (110), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2023-12-15 20:58:35,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 178 transitions. [2023-12-15 20:58:35,647 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 178 transitions. Word has length 113 [2023-12-15 20:58:35,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 20:58:35,647 INFO L495 AbstractCegarLoop]: Abstraction has 118 states and 178 transitions. [2023-12-15 20:58:35,647 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 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 20:58:35,647 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 178 transitions. [2023-12-15 20:58:35,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-12-15 20:58:35,648 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 20:58:35,648 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, 1, 1, 1, 1, 1] [2023-12-15 20:58:35,657 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-12-15 20:58:35,854 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2023-12-15 20:58:35,855 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 20:58:35,856 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 20:58:35,856 INFO L85 PathProgramCache]: Analyzing trace with hash -301744662, now seen corresponding path program 1 times [2023-12-15 20:58:35,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 20:58:35,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895737813] [2023-12-15 20:58:35,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:58:35,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 20:58:35,877 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-15 20:58:35,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [249259950] [2023-12-15 20:58:35,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:58:35,880 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 20:58:35,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 20:58:35,891 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-15 20:58:35,891 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-12-15 20:58:35,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:58:35,973 INFO L262 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-15 20:58:35,981 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 20:58:36,285 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 20:58:36,286 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-15 20:58:36,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 20:58:36,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895737813] [2023-12-15 20:58:36,286 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-15 20:58:36,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [249259950] [2023-12-15 20:58:36,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [249259950] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 20:58:36,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 20:58:36,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-15 20:58:36,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543249227] [2023-12-15 20:58:36,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 20:58:36,287 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-15 20:58:36,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 20:58:36,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-15 20:58:36,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-15 20:58:36,288 INFO L87 Difference]: Start difference. First operand 118 states and 178 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 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 20:58:36,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 20:58:36,379 INFO L93 Difference]: Finished difference Result 352 states and 532 transitions. [2023-12-15 20:58:36,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 20:58:36,379 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 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 114 [2023-12-15 20:58:36,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 20:58:36,383 INFO L225 Difference]: With dead ends: 352 [2023-12-15 20:58:36,383 INFO L226 Difference]: Without dead ends: 235 [2023-12-15 20:58:36,384 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-15 20:58:36,386 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 45 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 20:58:36,388 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 220 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 20:58:36,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2023-12-15 20:58:36,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 233. [2023-12-15 20:58:36,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 160 states have (on average 1.3375) internal successors, (214), 160 states have internal predecessors, (214), 68 states have call successors, (68), 4 states have call predecessors, (68), 4 states have return successors, (68), 68 states have call predecessors, (68), 68 states have call successors, (68) [2023-12-15 20:58:36,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 350 transitions. [2023-12-15 20:58:36,426 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 350 transitions. Word has length 114 [2023-12-15 20:58:36,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 20:58:36,427 INFO L495 AbstractCegarLoop]: Abstraction has 233 states and 350 transitions. [2023-12-15 20:58:36,427 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 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 20:58:36,427 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 350 transitions. [2023-12-15 20:58:36,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-12-15 20:58:36,429 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 20:58:36,429 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, 1, 1, 1, 1, 1] [2023-12-15 20:58:36,436 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-12-15 20:58:36,634 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 20:58:36,636 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 20:58:36,637 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 20:58:36,637 INFO L85 PathProgramCache]: Analyzing trace with hash -1322813016, now seen corresponding path program 1 times [2023-12-15 20:58:36,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 20:58:36,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6571640] [2023-12-15 20:58:36,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:58:36,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 20:58:36,676 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-15 20:58:36,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [343533858] [2023-12-15 20:58:36,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:58:36,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 20:58:36,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 20:58:36,690 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-15 20:58:36,691 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-12-15 20:58:36,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:58:36,771 INFO L262 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-15 20:58:36,775 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 20:58:36,876 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 20:58:36,876 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-15 20:58:36,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 20:58:36,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6571640] [2023-12-15 20:58:36,876 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-15 20:58:36,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [343533858] [2023-12-15 20:58:36,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [343533858] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 20:58:36,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 20:58:36,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-15 20:58:36,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913050842] [2023-12-15 20:58:36,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 20:58:36,877 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 20:58:36,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 20:58:36,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 20:58:36,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 20:58:36,878 INFO L87 Difference]: Start difference. First operand 233 states and 350 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 2 states have internal predecessors, (32), 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 20:58:36,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 20:58:36,920 INFO L93 Difference]: Finished difference Result 587 states and 886 transitions. [2023-12-15 20:58:36,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 20:58:36,932 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 2 states have internal predecessors, (32), 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 114 [2023-12-15 20:58:36,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 20:58:36,934 INFO L225 Difference]: With dead ends: 587 [2023-12-15 20:58:36,934 INFO L226 Difference]: Without dead ends: 355 [2023-12-15 20:58:36,934 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 20:58:36,935 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 37 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 20:58:36,935 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 177 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 20:58:36,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2023-12-15 20:58:36,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 353. [2023-12-15 20:58:36,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 353 states, 244 states have (on average 1.3360655737704918) internal successors, (326), 244 states have internal predecessors, (326), 102 states have call successors, (102), 6 states have call predecessors, (102), 6 states have return successors, (102), 102 states have call predecessors, (102), 102 states have call successors, (102) [2023-12-15 20:58:36,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 530 transitions. [2023-12-15 20:58:36,966 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 530 transitions. Word has length 114 [2023-12-15 20:58:36,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 20:58:36,967 INFO L495 AbstractCegarLoop]: Abstraction has 353 states and 530 transitions. [2023-12-15 20:58:36,967 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 2 states have internal predecessors, (32), 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 20:58:36,967 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 530 transitions. [2023-12-15 20:58:36,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2023-12-15 20:58:36,968 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 20:58:36,968 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, 1, 1, 1, 1, 1, 1] [2023-12-15 20:58:36,975 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-12-15 20:58:37,173 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 20:58:37,173 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 20:58:37,173 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 20:58:37,173 INFO L85 PathProgramCache]: Analyzing trace with hash -660745709, now seen corresponding path program 1 times [2023-12-15 20:58:37,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 20:58:37,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160651884] [2023-12-15 20:58:37,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:58:37,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 20:58:37,202 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-15 20:58:37,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2037254944] [2023-12-15 20:58:37,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:58:37,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 20:58:37,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 20:58:37,204 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-15 20:58:37,232 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-12-15 20:58:37,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:58:37,311 INFO L262 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-15 20:58:37,313 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 20:58:37,321 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 20:58:37,321 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-15 20:58:37,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 20:58:37,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160651884] [2023-12-15 20:58:37,321 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-15 20:58:37,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2037254944] [2023-12-15 20:58:37,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2037254944] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 20:58:37,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 20:58:37,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-15 20:58:37,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87919348] [2023-12-15 20:58:37,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 20:58:37,322 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 20:58:37,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 20:58:37,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 20:58:37,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 20:58:37,323 INFO L87 Difference]: Start difference. First operand 353 states and 530 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 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 20:58:37,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 20:58:37,391 INFO L93 Difference]: Finished difference Result 1045 states and 1572 transitions. [2023-12-15 20:58:37,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 20:58:37,392 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 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 115 [2023-12-15 20:58:37,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 20:58:37,394 INFO L225 Difference]: With dead ends: 1045 [2023-12-15 20:58:37,394 INFO L226 Difference]: Without dead ends: 693 [2023-12-15 20:58:37,395 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 20:58:37,396 INFO L413 NwaCegarLoop]: 101 mSDtfsCounter, 91 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 20:58:37,396 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 174 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 20:58:37,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 693 states. [2023-12-15 20:58:37,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 693 to 361. [2023-12-15 20:58:37,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 361 states, 252 states have (on average 1.3253968253968254) internal successors, (334), 252 states have internal predecessors, (334), 102 states have call successors, (102), 6 states have call predecessors, (102), 6 states have return successors, (102), 102 states have call predecessors, (102), 102 states have call successors, (102) [2023-12-15 20:58:37,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 538 transitions. [2023-12-15 20:58:37,420 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 538 transitions. Word has length 115 [2023-12-15 20:58:37,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 20:58:37,420 INFO L495 AbstractCegarLoop]: Abstraction has 361 states and 538 transitions. [2023-12-15 20:58:37,420 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 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 20:58:37,420 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 538 transitions. [2023-12-15 20:58:37,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2023-12-15 20:58:37,421 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 20:58:37,421 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, 1, 1, 1, 1, 1, 1] [2023-12-15 20:58:37,429 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-12-15 20:58:37,626 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 20:58:37,627 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 20:58:37,627 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 20:58:37,627 INFO L85 PathProgramCache]: Analyzing trace with hash -1053772719, now seen corresponding path program 1 times [2023-12-15 20:58:37,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 20:58:37,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541541068] [2023-12-15 20:58:37,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:58:37,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 20:58:37,642 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-15 20:58:37,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1223742618] [2023-12-15 20:58:37,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:58:37,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 20:58:37,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 20:58:37,643 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-15 20:58:37,684 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-12-15 20:58:37,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:58:37,760 INFO L262 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 15 conjunts are in the unsatisfiable core [2023-12-15 20:58:37,762 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 20:58:38,013 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 106 proven. 3 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2023-12-15 20:58:38,013 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-15 20:58:38,185 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 45 proven. 3 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2023-12-15 20:58:38,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 20:58:38,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541541068] [2023-12-15 20:58:38,185 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-15 20:58:38,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1223742618] [2023-12-15 20:58:38,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1223742618] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-15 20:58:38,185 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-15 20:58:38,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2023-12-15 20:58:38,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531776400] [2023-12-15 20:58:38,186 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-15 20:58:38,186 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-15 20:58:38,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 20:58:38,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-15 20:58:38,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2023-12-15 20:58:38,188 INFO L87 Difference]: Start difference. First operand 361 states and 538 transitions. Second operand has 16 states, 16 states have (on average 3.875) internal successors, (62), 16 states have internal predecessors, (62), 4 states have call successors, (34), 3 states have call predecessors, (34), 5 states have return successors, (34), 4 states have call predecessors, (34), 4 states have call successors, (34) [2023-12-15 20:58:39,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 20:58:39,450 INFO L93 Difference]: Finished difference Result 1676 states and 2410 transitions. [2023-12-15 20:58:39,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2023-12-15 20:58:39,450 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.875) internal successors, (62), 16 states have internal predecessors, (62), 4 states have call successors, (34), 3 states have call predecessors, (34), 5 states have return successors, (34), 4 states have call predecessors, (34), 4 states have call successors, (34) Word has length 115 [2023-12-15 20:58:39,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 20:58:39,455 INFO L225 Difference]: With dead ends: 1676 [2023-12-15 20:58:39,455 INFO L226 Difference]: Without dead ends: 1316 [2023-12-15 20:58:39,457 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 219 SyntacticMatches, 2 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 734 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=675, Invalid=1875, Unknown=0, NotChecked=0, Total=2550 [2023-12-15 20:58:39,458 INFO L413 NwaCegarLoop]: 131 mSDtfsCounter, 897 mSDsluCounter, 1228 mSDsCounter, 0 mSdLazyCounter, 1040 mSolverCounterSat, 503 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 899 SdHoareTripleChecker+Valid, 1359 SdHoareTripleChecker+Invalid, 1543 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 503 IncrementalHoareTripleChecker+Valid, 1040 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-12-15 20:58:39,458 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [899 Valid, 1359 Invalid, 1543 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [503 Valid, 1040 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-12-15 20:58:39,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1316 states. [2023-12-15 20:58:39,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1316 to 698. [2023-12-15 20:58:39,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 698 states, 481 states have (on average 1.291060291060291) internal successors, (621), 487 states have internal predecessors, (621), 195 states have call successors, (195), 21 states have call predecessors, (195), 21 states have return successors, (195), 189 states have call predecessors, (195), 195 states have call successors, (195) [2023-12-15 20:58:39,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 698 states to 698 states and 1011 transitions. [2023-12-15 20:58:39,533 INFO L78 Accepts]: Start accepts. Automaton has 698 states and 1011 transitions. Word has length 115 [2023-12-15 20:58:39,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 20:58:39,533 INFO L495 AbstractCegarLoop]: Abstraction has 698 states and 1011 transitions. [2023-12-15 20:58:39,533 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.875) internal successors, (62), 16 states have internal predecessors, (62), 4 states have call successors, (34), 3 states have call predecessors, (34), 5 states have return successors, (34), 4 states have call predecessors, (34), 4 states have call successors, (34) [2023-12-15 20:58:39,533 INFO L276 IsEmpty]: Start isEmpty. Operand 698 states and 1011 transitions. [2023-12-15 20:58:39,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2023-12-15 20:58:39,534 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 20:58:39,534 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, 1, 1, 1, 1, 1, 1] [2023-12-15 20:58:39,552 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-12-15 20:58:39,740 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 20:58:39,740 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 20:58:39,740 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 20:58:39,740 INFO L85 PathProgramCache]: Analyzing trace with hash -364701553, now seen corresponding path program 1 times [2023-12-15 20:58:39,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 20:58:39,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806953402] [2023-12-15 20:58:39,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:58:39,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 20:58:39,754 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-15 20:58:39,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1380665561] [2023-12-15 20:58:39,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:58:39,754 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 20:58:39,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 20:58:39,755 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-15 20:58:39,796 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-12-15 20:58:39,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:58:39,873 INFO L262 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-15 20:58:39,875 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 20:58:40,079 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 20:58:40,079 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-15 20:58:40,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 20:58:40,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806953402] [2023-12-15 20:58:40,079 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-15 20:58:40,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1380665561] [2023-12-15 20:58:40,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1380665561] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 20:58:40,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 20:58:40,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-15 20:58:40,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164464585] [2023-12-15 20:58:40,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 20:58:40,080 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-15 20:58:40,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 20:58:40,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-15 20:58:40,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-12-15 20:58:40,081 INFO L87 Difference]: Start difference. First operand 698 states and 1011 transitions. Second operand has 6 states, 6 states have (on average 5.5) internal successors, (33), 5 states have internal predecessors, (33), 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 20:58:40,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 20:58:40,304 INFO L93 Difference]: Finished difference Result 1510 states and 2179 transitions. [2023-12-15 20:58:40,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-15 20:58:40,305 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 5 states have internal predecessors, (33), 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 115 [2023-12-15 20:58:40,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 20:58:40,309 INFO L225 Difference]: With dead ends: 1510 [2023-12-15 20:58:40,309 INFO L226 Difference]: Without dead ends: 813 [2023-12-15 20:58:40,310 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-12-15 20:58:40,311 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 195 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-15 20:58:40,311 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 258 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-15 20:58:40,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 813 states. [2023-12-15 20:58:40,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 813 to 698. [2023-12-15 20:58:40,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 698 states, 481 states have (on average 1.2848232848232848) internal successors, (618), 487 states have internal predecessors, (618), 195 states have call successors, (195), 21 states have call predecessors, (195), 21 states have return successors, (195), 189 states have call predecessors, (195), 195 states have call successors, (195) [2023-12-15 20:58:40,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 698 states to 698 states and 1008 transitions. [2023-12-15 20:58:40,356 INFO L78 Accepts]: Start accepts. Automaton has 698 states and 1008 transitions. Word has length 115 [2023-12-15 20:58:40,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 20:58:40,356 INFO L495 AbstractCegarLoop]: Abstraction has 698 states and 1008 transitions. [2023-12-15 20:58:40,356 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 5 states have internal predecessors, (33), 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 20:58:40,356 INFO L276 IsEmpty]: Start isEmpty. Operand 698 states and 1008 transitions. [2023-12-15 20:58:40,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2023-12-15 20:58:40,357 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 20:58:40,357 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, 1, 1, 1, 1, 1, 1] [2023-12-15 20:58:40,375 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-12-15 20:58:40,562 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 20:58:40,562 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 20:58:40,563 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 20:58:40,563 INFO L85 PathProgramCache]: Analyzing trace with hash -1174048179, now seen corresponding path program 1 times [2023-12-15 20:58:40,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 20:58:40,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461294291] [2023-12-15 20:58:40,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:58:40,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 20:58:40,585 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-15 20:58:40,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1768745542] [2023-12-15 20:58:40,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:58:40,586 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 20:58:40,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 20:58:40,588 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-15 20:58:40,637 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-12-15 20:58:40,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:58:40,938 INFO L262 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-15 20:58:40,940 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 20:58:41,054 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 20:58:41,054 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-15 20:58:41,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 20:58:41,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461294291] [2023-12-15 20:58:41,054 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-15 20:58:41,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1768745542] [2023-12-15 20:58:41,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1768745542] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 20:58:41,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 20:58:41,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-15 20:58:41,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947304023] [2023-12-15 20:58:41,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 20:58:41,055 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-15 20:58:41,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 20:58:41,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-15 20:58:41,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-15 20:58:41,056 INFO L87 Difference]: Start difference. First operand 698 states and 1008 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 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 20:58:41,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 20:58:41,117 INFO L93 Difference]: Finished difference Result 700 states and 1009 transitions. [2023-12-15 20:58:41,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 20:58:41,117 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 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 115 [2023-12-15 20:58:41,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 20:58:41,119 INFO L225 Difference]: With dead ends: 700 [2023-12-15 20:58:41,119 INFO L226 Difference]: Without dead ends: 242 [2023-12-15 20:58:41,119 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 112 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 20:58:41,120 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 100 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 20:58:41,121 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 81 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 20:58:41,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2023-12-15 20:58:41,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 242. [2023-12-15 20:58:41,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 169 states have (on average 1.2603550295857988) internal successors, (213), 171 states have internal predecessors, (213), 65 states have call successors, (65), 7 states have call predecessors, (65), 7 states have return successors, (65), 63 states have call predecessors, (65), 65 states have call successors, (65) [2023-12-15 20:58:41,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 343 transitions. [2023-12-15 20:58:41,135 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 343 transitions. Word has length 115 [2023-12-15 20:58:41,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 20:58:41,135 INFO L495 AbstractCegarLoop]: Abstraction has 242 states and 343 transitions. [2023-12-15 20:58:41,135 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 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 20:58:41,135 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 343 transitions. [2023-12-15 20:58:41,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2023-12-15 20:58:41,136 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 20:58:41,136 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, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 20:58:41,143 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-12-15 20:58:41,340 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2023-12-15 20:58:41,341 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 20:58:41,341 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 20:58:41,341 INFO L85 PathProgramCache]: Analyzing trace with hash -1748277037, now seen corresponding path program 1 times [2023-12-15 20:58:41,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 20:58:41,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566129630] [2023-12-15 20:58:41,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:58:41,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 20:58:41,362 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-15 20:58:41,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1525532751] [2023-12-15 20:58:41,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:58:41,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 20:58:41,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 20:58:41,364 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-15 20:58:41,420 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-12-15 20:58:41,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-15 20:58:41,519 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-15 20:58:41,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-15 20:58:41,618 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-15 20:58:41,618 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-15 20:58:41,619 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-15 20:58:41,640 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-12-15 20:58:41,840 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 20:58:41,843 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 20:58:41,845 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-15 20:58:41,950 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.12 08:58:41 BoogieIcfgContainer [2023-12-15 20:58:41,950 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-15 20:58:41,950 INFO L158 Benchmark]: Toolchain (without parser) took 8220.68ms. Allocated memory was 297.8MB in the beginning and 357.6MB in the end (delta: 59.8MB). Free memory was 248.2MB in the beginning and 251.1MB in the end (delta: -2.9MB). Peak memory consumption was 58.5MB. Max. memory is 8.0GB. [2023-12-15 20:58:41,951 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 178.3MB. Free memory was 126.2MB in the beginning and 126.1MB in the end (delta: 172.1kB). There was no memory consumed. Max. memory is 8.0GB. [2023-12-15 20:58:41,951 INFO L158 Benchmark]: CACSL2BoogieTranslator took 224.89ms. Allocated memory is still 297.8MB. Free memory was 247.7MB in the beginning and 234.1MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2023-12-15 20:58:41,951 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.40ms. Allocated memory is still 297.8MB. Free memory was 233.6MB in the beginning and 230.4MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-15 20:58:41,951 INFO L158 Benchmark]: Boogie Preprocessor took 84.08ms. Allocated memory is still 297.8MB. Free memory was 230.4MB in the beginning and 226.2MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2023-12-15 20:58:41,951 INFO L158 Benchmark]: RCFGBuilder took 436.78ms. Allocated memory is still 297.8MB. Free memory was 226.2MB in the beginning and 202.6MB in the end (delta: 23.6MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. [2023-12-15 20:58:41,951 INFO L158 Benchmark]: TraceAbstraction took 7426.46ms. Allocated memory was 297.8MB in the beginning and 357.6MB in the end (delta: 59.8MB). Free memory was 202.1MB in the beginning and 251.1MB in the end (delta: -49.0MB). Peak memory consumption was 12.3MB. Max. memory is 8.0GB. [2023-12-15 20:58:41,952 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.09ms. Allocated memory is still 178.3MB. Free memory was 126.2MB in the beginning and 126.1MB in the end (delta: 172.1kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 224.89ms. Allocated memory is still 297.8MB. Free memory was 247.7MB in the beginning and 234.1MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 44.40ms. Allocated memory is still 297.8MB. Free memory was 233.6MB in the beginning and 230.4MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 84.08ms. Allocated memory is still 297.8MB. Free memory was 230.4MB in the beginning and 226.2MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 436.78ms. Allocated memory is still 297.8MB. Free memory was 226.2MB in the beginning and 202.6MB in the end (delta: 23.6MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. * TraceAbstraction took 7426.46ms. Allocated memory was 297.8MB in the beginning and 357.6MB in the end (delta: 59.8MB). Free memory was 202.1MB in the beginning and 251.1MB in the end (delta: -49.0MB). Peak memory consumption was 12.3MB. 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 125, overapproximation of shiftLeft at line 55, overapproximation of someBinaryArithmeticFLOAToperation at line 61, overapproximation of someUnaryFLOAToperation at line 61. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 0; [L23] unsigned char var_1_8 = 0; [L24] unsigned long int var_1_9 = 10; [L25] float var_1_10 = 99.5; [L26] float var_1_11 = 5.6; [L27] float var_1_12 = 255.5; [L28] float var_1_13 = 31.25; [L29] signed short int var_1_14 = 32; [L30] unsigned long int var_1_15 = 16; [L31] unsigned char var_1_16 = 1; [L32] unsigned char var_1_17 = 5; [L33] unsigned char var_1_18 = 50; [L34] unsigned char var_1_19 = 50; [L35] signed char var_1_20 = 1; [L36] signed char var_1_21 = -10; [L37] float var_1_22 = 0.5; [L38] signed char var_1_23 = 100; [L39] unsigned char last_1_var_1_1 = 0; [L40] unsigned long int last_1_var_1_9 = 10; [L41] signed short int last_1_var_1_14 = 32; [L42] unsigned char last_1_var_1_16 = 1; [L43] signed char last_1_var_1_20 = 1; [L129] isInitial = 1 [L130] FCALL initially() [L131] int k_loop; [L132] k_loop = 0 VAL [isInitial=1, k_loop=0, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_8=0, var_1_9=10] [L132] COND TRUE k_loop < 1 [L133] CALL updateLastVariables() [L118] last_1_var_1_1 = var_1_1 [L119] last_1_var_1_9 = var_1_9 [L120] last_1_var_1_14 = var_1_14 [L121] last_1_var_1_16 = var_1_16 [L122] last_1_var_1_20 = var_1_20 [L133] RET updateLastVariables() [L134] CALL updateVariables() [L90] var_1_8 = __VERIFIER_nondet_uchar() [L91] CALL assume_abort_if_not(var_1_8 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L91] RET assume_abort_if_not(var_1_8 >= 1) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L92] CALL assume_abort_if_not(var_1_8 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L92] RET assume_abort_if_not(var_1_8 <= 1) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L93] var_1_11 = __VERIFIER_nondet_float() [L94] CALL assume_abort_if_not((var_1_11 >= -461168.6018427382800e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L94] RET assume_abort_if_not((var_1_11 >= -461168.6018427382800e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L95] var_1_12 = __VERIFIER_nondet_float() [L96] CALL assume_abort_if_not((var_1_12 >= -461168.6018427382800e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 4611686.018427382800e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L96] RET assume_abort_if_not((var_1_12 >= -461168.6018427382800e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 4611686.018427382800e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L97] var_1_13 = __VERIFIER_nondet_float() [L98] CALL assume_abort_if_not((var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L98] RET assume_abort_if_not((var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L99] var_1_15 = __VERIFIER_nondet_ulong() [L100] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L100] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L101] CALL assume_abort_if_not(var_1_15 <= 4294967295) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L101] RET assume_abort_if_not(var_1_15 <= 4294967295) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L102] CALL assume_abort_if_not(var_1_15 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=4294967295, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=4294967295, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L102] RET assume_abort_if_not(var_1_15 != 0) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=4294967295, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L103] var_1_17 = __VERIFIER_nondet_uchar() [L104] CALL assume_abort_if_not(var_1_17 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=4294967295, var_1_16=1, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=4294967295, var_1_16=1, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L104] RET assume_abort_if_not(var_1_17 >= 0) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=4294967295, var_1_16=1, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L105] CALL assume_abort_if_not(var_1_17 <= 255) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=4294967295, var_1_16=1, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=4294967295, var_1_16=1, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L105] RET assume_abort_if_not(var_1_17 <= 255) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=4294967295, var_1_16=1, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L106] CALL assume_abort_if_not(var_1_17 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=4294967295, var_1_16=1, var_1_17=1, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=4294967295, var_1_16=1, var_1_17=1, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L106] RET assume_abort_if_not(var_1_17 != 0) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=4294967295, var_1_16=1, var_1_17=1, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L107] var_1_18 = __VERIFIER_nondet_uchar() [L108] CALL assume_abort_if_not(var_1_18 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=4294967295, var_1_16=1, var_1_17=1, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=4294967295, var_1_16=1, var_1_17=1, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L108] RET assume_abort_if_not(var_1_18 >= 0) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=4294967295, var_1_16=1, var_1_17=1, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L109] CALL assume_abort_if_not(var_1_18 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=4294967295, var_1_16=1, var_1_17=1, var_1_18=254, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=4294967295, var_1_16=1, var_1_17=1, var_1_18=254, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L109] RET assume_abort_if_not(var_1_18 <= 254) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=4294967295, var_1_16=1, var_1_17=1, var_1_18=254, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L110] var_1_19 = __VERIFIER_nondet_uchar() [L111] CALL assume_abort_if_not(var_1_19 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=4294967295, var_1_16=1, var_1_17=1, var_1_18=254, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=4294967295, var_1_16=1, var_1_17=1, var_1_18=254, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L111] RET assume_abort_if_not(var_1_19 >= 0) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=4294967295, var_1_16=1, var_1_17=1, var_1_18=254, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L112] CALL assume_abort_if_not(var_1_19 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=4294967295, var_1_16=1, var_1_17=1, var_1_18=254, var_1_19=254, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=4294967295, var_1_16=1, var_1_17=1, var_1_18=254, var_1_19=254, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L112] RET assume_abort_if_not(var_1_19 <= 254) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=4294967295, var_1_16=1, var_1_17=1, var_1_18=254, var_1_19=254, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L113] var_1_21 = __VERIFIER_nondet_char() [L114] CALL assume_abort_if_not(var_1_21 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=4294967295, var_1_16=1, var_1_17=1, var_1_18=254, var_1_19=254, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=4294967295, var_1_16=1, var_1_17=1, var_1_18=254, var_1_19=254, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L114] RET assume_abort_if_not(var_1_21 >= -127) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=4294967295, var_1_16=1, var_1_17=1, var_1_18=254, var_1_19=254, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L115] CALL assume_abort_if_not(var_1_21 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=4294967295, var_1_16=1, var_1_17=1, var_1_18=254, var_1_19=254, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=4294967295, var_1_16=1, var_1_17=1, var_1_18=254, var_1_19=254, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L115] RET assume_abort_if_not(var_1_21 <= 126) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=4294967295, var_1_16=1, var_1_17=1, var_1_18=254, var_1_19=254, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L134] RET updateVariables() [L135] CALL step() [L47] unsigned char stepLocal_1 = last_1_var_1_14 > (last_1_var_1_16 - last_1_var_1_16); [L48] signed long int stepLocal_0 = last_1_var_1_20 * last_1_var_1_20; VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, stepLocal_0=1, stepLocal_1=1, var_1_10=199/2, var_1_14=32, var_1_15=4294967295, var_1_16=1, var_1_17=1, var_1_18=254, var_1_19=254, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L49] COND FALSE !(stepLocal_0 == last_1_var_1_14) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, stepLocal_0=1, stepLocal_1=1, var_1_10=199/2, var_1_14=32, var_1_15=4294967295, var_1_16=1, var_1_17=1, var_1_18=254, var_1_19=254, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L54] unsigned long int stepLocal_6 = ((((var_1_15) > (last_1_var_1_9)) ? (var_1_15) : (last_1_var_1_9))) / var_1_17; VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, stepLocal_0=1, stepLocal_1=1, stepLocal_6=4294967295, var_1_10=199/2, var_1_14=32, var_1_15=4294967295, var_1_16=1, var_1_17=1, var_1_18=254, var_1_19=254, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L55] EXPR 256u << last_1_var_1_16 VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, stepLocal_0=1, stepLocal_1=1, stepLocal_6=4294967295, var_1_10=199/2, var_1_14=32, var_1_15=4294967295, var_1_16=1, var_1_17=1, var_1_18=254, var_1_19=254, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L55] COND FALSE !(stepLocal_6 <= (256u << last_1_var_1_16)) [L58] unsigned char stepLocal_5 = var_1_16 != var_1_16; [L59] unsigned char stepLocal_4 = var_1_8; VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, stepLocal_0=1, stepLocal_1=1, stepLocal_4=1, stepLocal_5=0, stepLocal_6=4294967295, var_1_10=199/2, var_1_14=32, var_1_15=4294967295, var_1_16=1, var_1_17=1, var_1_18=254, var_1_19=254, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L60] COND TRUE (! var_1_1) || stepLocal_4 [L61] var_1_10 = (((((var_1_11 + var_1_12)) < (((((var_1_13) < 0 ) ? -(var_1_13) : (var_1_13))))) ? ((var_1_11 + var_1_12)) : (((((var_1_13) < 0 ) ? -(var_1_13) : (var_1_13)))))) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, stepLocal_0=1, stepLocal_1=1, stepLocal_4=1, stepLocal_5=0, stepLocal_6=4294967295, var_1_10=2, var_1_13=0, var_1_14=32, var_1_15=4294967295, var_1_16=1, var_1_17=1, var_1_18=254, var_1_19=254, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_8=1, var_1_9=10] [L69] var_1_20 = var_1_21 [L70] var_1_22 = var_1_12 [L71] var_1_23 = var_1_21 VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, stepLocal_0=1, stepLocal_1=1, stepLocal_4=1, stepLocal_5=0, stepLocal_6=4294967295, var_1_10=2, var_1_12=3, var_1_13=0, var_1_14=32, var_1_15=4294967295, var_1_16=1, var_1_17=1, var_1_18=254, var_1_19=254, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=3, var_1_23=0, var_1_8=1, var_1_9=10] [L72] COND FALSE !(\read(var_1_1)) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, stepLocal_0=1, stepLocal_1=1, stepLocal_4=1, stepLocal_5=0, stepLocal_6=4294967295, var_1_10=2, var_1_12=3, var_1_13=0, var_1_14=32, var_1_15=4294967295, var_1_16=1, var_1_17=1, var_1_18=254, var_1_19=254, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=3, var_1_23=0, var_1_8=1, var_1_9=10] [L75] EXPR (var_1_16 / var_1_15) & var_1_16 VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, stepLocal_0=1, stepLocal_1=1, stepLocal_4=1, stepLocal_5=0, stepLocal_6=4294967295, var_1_10=2, var_1_12=3, var_1_13=0, var_1_14=32, var_1_15=4294967295, var_1_16=1, var_1_17=1, var_1_18=254, var_1_19=254, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=3, var_1_23=0, var_1_8=1, var_1_9=10] [L75] COND TRUE ((var_1_16 / var_1_15) & var_1_16) >= var_1_20 [L76] var_1_14 = var_1_16 VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, stepLocal_0=1, stepLocal_1=1, stepLocal_4=1, stepLocal_5=0, stepLocal_6=4294967295, var_1_10=2, var_1_12=3, var_1_13=0, var_1_14=1, var_1_15=4294967295, var_1_16=1, var_1_17=1, var_1_18=254, var_1_19=254, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=3, var_1_23=0, var_1_8=1, var_1_9=10] [L81] unsigned char stepLocal_3 = var_1_20 != var_1_14; [L82] signed long int stepLocal_2 = (((var_1_16) < (0)) ? (var_1_16) : (0)); VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, stepLocal_0=1, stepLocal_1=1, stepLocal_2=0, stepLocal_3=1, stepLocal_4=1, stepLocal_5=0, stepLocal_6=4294967295, var_1_10=2, var_1_12=3, var_1_13=0, var_1_14=1, var_1_15=4294967295, var_1_16=1, var_1_17=1, var_1_18=254, var_1_19=254, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=3, var_1_23=0, var_1_8=1, var_1_9=10] [L83] COND TRUE (var_1_1 || (var_1_16 <= var_1_14)) || stepLocal_3 VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, stepLocal_0=1, stepLocal_1=1, stepLocal_2=0, stepLocal_3=1, stepLocal_4=1, stepLocal_5=0, stepLocal_6=4294967295, var_1_10=2, var_1_12=3, var_1_13=0, var_1_14=1, var_1_15=4294967295, var_1_16=1, var_1_17=1, var_1_18=254, var_1_19=254, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=3, var_1_23=0, var_1_8=1, var_1_9=10] [L84] COND FALSE !(stepLocal_2 <= (-5 + var_1_16)) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, stepLocal_0=1, stepLocal_1=1, stepLocal_2=0, stepLocal_3=1, stepLocal_4=1, stepLocal_5=0, stepLocal_6=4294967295, var_1_10=2, var_1_12=3, var_1_13=0, var_1_14=1, var_1_15=4294967295, var_1_16=1, var_1_17=1, var_1_18=254, var_1_19=254, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=3, var_1_23=0, var_1_8=1, var_1_9=10] [L135] RET step() [L136] CALL, EXPR property() [L125] EXPR (((((last_1_var_1_20 * last_1_var_1_20) == last_1_var_1_14) ? (((last_1_var_1_14 > (last_1_var_1_16 - last_1_var_1_16)) && last_1_var_1_1) ? (var_1_1 == ((unsigned char) var_1_8)) : 1) : 1) && (((var_1_1 || (var_1_16 <= var_1_14)) || (var_1_20 != var_1_14)) ? ((((((var_1_16) < (0)) ? (var_1_16) : (0))) <= (-5 + var_1_16)) ? (var_1_9 == ((unsigned long int) var_1_16)) : 1) : 1)) && (((! var_1_1) || var_1_8) ? (var_1_10 == ((float) (((((var_1_11 + var_1_12)) < (((((var_1_13) < 0 ) ? -(var_1_13) : (var_1_13))))) ? ((var_1_11 + var_1_12)) : (((((var_1_13) < 0 ) ? -(var_1_13) : (var_1_13)))))))) : (((var_1_11 < var_1_12) || (var_1_16 != var_1_16)) ? (var_1_10 == ((float) var_1_13)) : (var_1_10 == ((float) var_1_12))))) && (var_1_1 ? (var_1_14 == ((signed short int) ((((var_1_23) > (var_1_16)) ? (var_1_23) : (var_1_16))))) : ((((var_1_16 / var_1_15) & var_1_16) >= var_1_20) ? (var_1_14 == ((signed short int) var_1_16)) : (var_1_14 == ((signed short int) -128)))) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=2, var_1_12=3, var_1_13=0, var_1_14=1, var_1_15=4294967295, var_1_16=1, var_1_17=1, var_1_18=254, var_1_19=254, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=3, var_1_23=0, var_1_8=1, var_1_9=10] [L125] EXPR ((((((last_1_var_1_20 * last_1_var_1_20) == last_1_var_1_14) ? (((last_1_var_1_14 > (last_1_var_1_16 - last_1_var_1_16)) && last_1_var_1_1) ? (var_1_1 == ((unsigned char) var_1_8)) : 1) : 1) && (((var_1_1 || (var_1_16 <= var_1_14)) || (var_1_20 != var_1_14)) ? ((((((var_1_16) < (0)) ? (var_1_16) : (0))) <= (-5 + var_1_16)) ? (var_1_9 == ((unsigned long int) var_1_16)) : 1) : 1)) && (((! var_1_1) || var_1_8) ? (var_1_10 == ((float) (((((var_1_11 + var_1_12)) < (((((var_1_13) < 0 ) ? -(var_1_13) : (var_1_13))))) ? ((var_1_11 + var_1_12)) : (((((var_1_13) < 0 ) ? -(var_1_13) : (var_1_13)))))))) : (((var_1_11 < var_1_12) || (var_1_16 != var_1_16)) ? (var_1_10 == ((float) var_1_13)) : (var_1_10 == ((float) var_1_12))))) && (var_1_1 ? (var_1_14 == ((signed short int) ((((var_1_23) > (var_1_16)) ? (var_1_23) : (var_1_16))))) : ((((var_1_16 / var_1_15) & var_1_16) >= var_1_20) ? (var_1_14 == ((signed short int) var_1_16)) : (var_1_14 == ((signed short int) -128))))) && (((((((var_1_15) > (last_1_var_1_9)) ? (var_1_15) : (last_1_var_1_9))) / var_1_17) <= (256u << last_1_var_1_16)) ? (var_1_16 == ((unsigned char) ((((var_1_18) > (var_1_19)) ? (var_1_18) : (var_1_19))))) : 1) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=2, var_1_12=3, var_1_13=0, var_1_14=1, var_1_15=4294967295, var_1_16=1, var_1_17=1, var_1_18=254, var_1_19=254, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=3, var_1_23=0, var_1_8=1, var_1_9=10] [L125-L126] return (((((((((last_1_var_1_20 * last_1_var_1_20) == last_1_var_1_14) ? (((last_1_var_1_14 > (last_1_var_1_16 - last_1_var_1_16)) && last_1_var_1_1) ? (var_1_1 == ((unsigned char) var_1_8)) : 1) : 1) && (((var_1_1 || (var_1_16 <= var_1_14)) || (var_1_20 != var_1_14)) ? ((((((var_1_16) < (0)) ? (var_1_16) : (0))) <= (-5 + var_1_16)) ? (var_1_9 == ((unsigned long int) var_1_16)) : 1) : 1)) && (((! var_1_1) || var_1_8) ? (var_1_10 == ((float) (((((var_1_11 + var_1_12)) < (((((var_1_13) < 0 ) ? -(var_1_13) : (var_1_13))))) ? ((var_1_11 + var_1_12)) : (((((var_1_13) < 0 ) ? -(var_1_13) : (var_1_13)))))))) : (((var_1_11 < var_1_12) || (var_1_16 != var_1_16)) ? (var_1_10 == ((float) var_1_13)) : (var_1_10 == ((float) var_1_12))))) && (var_1_1 ? (var_1_14 == ((signed short int) ((((var_1_23) > (var_1_16)) ? (var_1_23) : (var_1_16))))) : ((((var_1_16 / var_1_15) & var_1_16) >= var_1_20) ? (var_1_14 == ((signed short int) var_1_16)) : (var_1_14 == ((signed short int) -128))))) && (((((((var_1_15) > (last_1_var_1_9)) ? (var_1_15) : (last_1_var_1_9))) / var_1_17) <= (256u << last_1_var_1_16)) ? (var_1_16 == ((unsigned char) ((((var_1_18) > (var_1_19)) ? (var_1_18) : (var_1_19))))) : 1)) && (var_1_20 == ((signed char) var_1_21))) && (var_1_22 == ((float) var_1_12))) && (var_1_23 == ((signed char) var_1_21)) ; [L136] RET, EXPR property() [L136] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=2, var_1_12=3, var_1_13=0, var_1_14=1, var_1_15=4294967295, var_1_16=1, var_1_17=1, var_1_18=254, var_1_19=254, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=3, var_1_23=0, var_1_8=1, var_1_9=10] [L19] reach_error() VAL [\old(cond)=0, cond=0, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=2, var_1_12=3, var_1_13=0, var_1_14=1, var_1_15=4294967295, var_1_16=1, var_1_17=1, var_1_18=254, var_1_19=254, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=3, var_1_23=0, var_1_8=1, var_1_9=10] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 66 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.3s, OverallIterations: 9, TraceHistogramMax: 17, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1446 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1444 mSDsluCounter, 2594 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1796 mSDsCounter, 582 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1432 IncrementalHoareTripleChecker+Invalid, 2014 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 582 mSolverCounterUnsat, 798 mSDtfsCounter, 1432 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1065 GetRequests, 1000 SyntacticMatches, 2 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 736 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=698occurred in iteration=6, InterpolantAutomatonStates: 67, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 8 MinimizatonAttempts, 1071 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 1143 NumberOfCodeBlocks, 1143 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 1020 ConstructedInterpolants, 0 QuantifiedInterpolants, 3058 SizeOfPredicates, 11 NumberOfNonLiveVariables, 2372 ConjunctsInSsa, 43 ConjunctsInUnsatCore, 9 InterpolantComputations, 7 PerfectInterpolantSequences, 4890/4896 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 20:58:41,965 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...