/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_100-1loop_file-34.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-19 11:16:28,746 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-19 11:16:28,809 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2023-12-19 11:16:28,814 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-19 11:16:28,815 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-19 11:16:28,837 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-19 11:16:28,837 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-19 11:16:28,838 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-19 11:16:28,838 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-19 11:16:28,841 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-19 11:16:28,841 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-19 11:16:28,842 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-19 11:16:28,842 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-19 11:16:28,843 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-19 11:16:28,843 INFO L153 SettingsManager]: * Use SBE=true [2023-12-19 11:16:28,843 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-19 11:16:28,843 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-19 11:16:28,843 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-19 11:16:28,844 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-19 11:16:28,845 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-19 11:16:28,845 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-19 11:16:28,845 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-19 11:16:28,845 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-19 11:16:28,845 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-19 11:16:28,845 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-19 11:16:28,846 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-19 11:16:28,846 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-19 11:16:28,846 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-19 11:16:28,846 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-19 11:16:28,846 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-19 11:16:28,847 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-19 11:16:28,847 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-19 11:16:28,847 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-19 11:16:28,848 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-19 11:16:28,848 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-19 11:16:28,848 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-19 11:16:28,848 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-19 11:16:28,848 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-19 11:16:28,848 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-19 11:16:28,848 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-19 11:16:28,848 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-19 11:16:28,849 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-19 11:16:28,849 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-19 11:16:28,849 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Use bitabs translation -> true [2023-12-19 11:16:29,015 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-19 11:16:29,034 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-19 11:16:29,036 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-19 11:16:29,037 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-19 11:16:29,037 INFO L274 PluginConnector]: CDTParser initialized [2023-12-19 11:16:29,038 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-34.i [2023-12-19 11:16:30,005 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-19 11:16:30,258 INFO L384 CDTParser]: Found 1 translation units. [2023-12-19 11:16:30,259 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-34.i [2023-12-19 11:16:30,272 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a488475e7/8d850325e68f4f8692512ce44103b27d/FLAG127d5f72b [2023-12-19 11:16:30,287 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a488475e7/8d850325e68f4f8692512ce44103b27d [2023-12-19 11:16:30,288 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-19 11:16:30,289 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-19 11:16:30,292 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-19 11:16:30,292 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-19 11:16:30,296 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-19 11:16:30,296 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 11:16:30" (1/1) ... [2023-12-19 11:16:30,297 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@88a3c72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 11:16:30, skipping insertion in model container [2023-12-19 11:16:30,297 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 11:16:30" (1/1) ... [2023-12-19 11:16:30,330 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-19 11:16:30,434 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_100-1loop_file-34.i[916,929] [2023-12-19 11:16:30,510 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-19 11:16:30,518 INFO L202 MainTranslator]: Completed pre-run [2023-12-19 11:16:30,525 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_100-1loop_file-34.i[916,929] [2023-12-19 11:16:30,568 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-19 11:16:30,579 INFO L206 MainTranslator]: Completed translation [2023-12-19 11:16:30,580 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 11:16:30 WrapperNode [2023-12-19 11:16:30,580 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-19 11:16:30,581 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-19 11:16:30,581 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-19 11:16:30,581 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-19 11:16:30,585 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 11:16:30" (1/1) ... [2023-12-19 11:16:30,595 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 11:16:30" (1/1) ... [2023-12-19 11:16:30,626 INFO L138 Inliner]: procedures = 26, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 186 [2023-12-19 11:16:30,626 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-19 11:16:30,627 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-19 11:16:30,627 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-19 11:16:30,627 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-19 11:16:30,637 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 11:16:30" (1/1) ... [2023-12-19 11:16:30,637 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 11:16:30" (1/1) ... [2023-12-19 11:16:30,640 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 11:16:30" (1/1) ... [2023-12-19 11:16:30,665 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-19 11:16:30,665 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 11:16:30" (1/1) ... [2023-12-19 11:16:30,665 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 11:16:30" (1/1) ... [2023-12-19 11:16:30,671 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 11:16:30" (1/1) ... [2023-12-19 11:16:30,686 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 11:16:30" (1/1) ... [2023-12-19 11:16:30,687 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 11:16:30" (1/1) ... [2023-12-19 11:16:30,689 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 11:16:30" (1/1) ... [2023-12-19 11:16:30,691 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-19 11:16:30,692 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-19 11:16:30,692 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-19 11:16:30,692 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-19 11:16:30,692 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 11:16:30" (1/1) ... [2023-12-19 11:16:30,704 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-19 11:16:30,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 11:16:30,723 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-19 11:16:30,734 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-19 11:16:30,751 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-19 11:16:30,752 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-19 11:16:30,752 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-19 11:16:30,752 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-19 11:16:30,752 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-19 11:16:30,752 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-19 11:16:30,824 INFO L241 CfgBuilder]: Building ICFG [2023-12-19 11:16:30,826 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-19 11:16:31,125 INFO L282 CfgBuilder]: Performing block encoding [2023-12-19 11:16:31,186 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-19 11:16:31,186 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-19 11:16:31,187 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 11:16:31 BoogieIcfgContainer [2023-12-19 11:16:31,187 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-19 11:16:31,188 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-19 11:16:31,188 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-19 11:16:31,190 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-19 11:16:31,191 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.12 11:16:30" (1/3) ... [2023-12-19 11:16:31,191 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4791f0bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 11:16:31, skipping insertion in model container [2023-12-19 11:16:31,191 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 11:16:30" (2/3) ... [2023-12-19 11:16:31,191 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4791f0bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 11:16:31, skipping insertion in model container [2023-12-19 11:16:31,191 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 11:16:31" (3/3) ... [2023-12-19 11:16:31,192 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-1loop_file-34.i [2023-12-19 11:16:31,206 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-19 11:16:31,206 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-19 11:16:31,238 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-19 11:16:31,243 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;@17679e23, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-19 11:16:31,243 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-19 11:16:31,245 INFO L276 IsEmpty]: Start isEmpty. Operand has 74 states, 51 states have (on average 1.5098039215686274) internal successors, (77), 52 states have internal predecessors, (77), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-12-19 11:16:31,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2023-12-19 11:16:31,257 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 11:16:31,258 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 11:16:31,259 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 11:16:31,262 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 11:16:31,263 INFO L85 PathProgramCache]: Analyzing trace with hash -1379427813, now seen corresponding path program 1 times [2023-12-19 11:16:31,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 11:16:31,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525685653] [2023-12-19 11:16:31,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 11:16:31,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 11:16:31,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:16:31,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 11:16:31,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:16:31,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-19 11:16:31,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:16:31,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-19 11:16:31,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:16:31,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-19 11:16:31,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:16:31,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-19 11:16:31,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:16:31,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 11:16:31,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:16:31,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-19 11:16:31,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:16:31,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-19 11:16:31,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:16:31,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 11:16:31,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:16:31,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 11:16:31,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:16:31,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 11:16:31,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:16:31,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-19 11:16:31,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:16:31,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 11:16:31,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:16:31,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-12-19 11:16:31,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:16:31,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-12-19 11:16:31,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:16:31,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-12-19 11:16:31,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:16:31,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-12-19 11:16:31,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:16:31,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-19 11:16:31,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:16:31,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-19 11:16:31,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:16:31,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-12-19 11:16:31,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:16:31,592 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-12-19 11:16:31,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 11:16:31,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525685653] [2023-12-19 11:16:31,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [525685653] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 11:16:31,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 11:16:31,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-19 11:16:31,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983626430] [2023-12-19 11:16:31,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 11:16:31,598 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-19 11:16:31,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 11:16:31,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-19 11:16:31,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-19 11:16:31,626 INFO L87 Difference]: Start difference. First operand has 74 states, 51 states have (on average 1.5098039215686274) internal successors, (77), 52 states have internal predecessors, (77), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2023-12-19 11:16:31,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 11:16:31,671 INFO L93 Difference]: Finished difference Result 147 states and 253 transitions. [2023-12-19 11:16:31,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-19 11:16:31,673 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 138 [2023-12-19 11:16:31,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 11:16:31,680 INFO L225 Difference]: With dead ends: 147 [2023-12-19 11:16:31,680 INFO L226 Difference]: Without dead ends: 72 [2023-12-19 11:16:31,683 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-19 11:16:31,686 INFO L413 NwaCegarLoop]: 109 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, 109 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-19 11:16:31,687 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 109 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 11:16:31,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2023-12-19 11:16:31,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2023-12-19 11:16:31,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 50 states have (on average 1.44) internal successors, (72), 50 states have internal predecessors, (72), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-12-19 11:16:31,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 112 transitions. [2023-12-19 11:16:31,728 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 112 transitions. Word has length 138 [2023-12-19 11:16:31,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 11:16:31,729 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 112 transitions. [2023-12-19 11:16:31,729 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2023-12-19 11:16:31,729 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 112 transitions. [2023-12-19 11:16:31,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2023-12-19 11:16:31,738 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 11:16:31,738 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 11:16:31,738 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-19 11:16:31,738 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 11:16:31,739 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 11:16:31,740 INFO L85 PathProgramCache]: Analyzing trace with hash 1299327975, now seen corresponding path program 1 times [2023-12-19 11:16:31,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 11:16:31,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617518108] [2023-12-19 11:16:31,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 11:16:31,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 11:16:31,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:16:32,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 11:16:32,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:16:32,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-19 11:16:32,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:16:32,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-19 11:16:32,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:16:32,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-19 11:16:32,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:16:32,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-19 11:16:32,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:16:32,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 11:16:32,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:16:32,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-19 11:16:32,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:16:32,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-19 11:16:32,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:16:32,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 11:16:32,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:16:32,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 11:16:32,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:16:32,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 11:16:32,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:16:32,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-19 11:16:32,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:16:32,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 11:16:32,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:16:32,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-12-19 11:16:32,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:16:32,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-12-19 11:16:32,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:16:32,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-12-19 11:16:32,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:16:32,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-12-19 11:16:32,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:16:32,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-19 11:16:32,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:16:32,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-19 11:16:32,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:16:32,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-12-19 11:16:32,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:16:32,562 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-12-19 11:16:32,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 11:16:32,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617518108] [2023-12-19 11:16:32,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [617518108] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 11:16:32,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 11:16:32,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-19 11:16:32,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365587209] [2023-12-19 11:16:32,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 11:16:32,565 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-19 11:16:32,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 11:16:32,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-19 11:16:32,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-19 11:16:32,569 INFO L87 Difference]: Start difference. First operand 72 states and 112 transitions. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-19 11:16:32,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 11:16:32,963 INFO L93 Difference]: Finished difference Result 315 states and 477 transitions. [2023-12-19 11:16:32,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-19 11:16:32,963 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 138 [2023-12-19 11:16:32,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 11:16:32,969 INFO L225 Difference]: With dead ends: 315 [2023-12-19 11:16:32,969 INFO L226 Difference]: Without dead ends: 244 [2023-12-19 11:16:32,971 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2023-12-19 11:16:32,972 INFO L413 NwaCegarLoop]: 179 mSDtfsCounter, 229 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 553 SdHoareTripleChecker+Invalid, 303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-19 11:16:32,973 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [229 Valid, 553 Invalid, 303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-19 11:16:32,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2023-12-19 11:16:33,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 206. [2023-12-19 11:16:33,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 137 states have (on average 1.3503649635036497) internal successors, (185), 139 states have internal predecessors, (185), 64 states have call successors, (64), 4 states have call predecessors, (64), 4 states have return successors, (64), 62 states have call predecessors, (64), 64 states have call successors, (64) [2023-12-19 11:16:33,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 313 transitions. [2023-12-19 11:16:33,017 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 313 transitions. Word has length 138 [2023-12-19 11:16:33,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 11:16:33,017 INFO L495 AbstractCegarLoop]: Abstraction has 206 states and 313 transitions. [2023-12-19 11:16:33,017 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-19 11:16:33,017 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 313 transitions. [2023-12-19 11:16:33,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2023-12-19 11:16:33,018 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 11:16:33,019 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 11:16:33,019 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-19 11:16:33,019 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 11:16:33,019 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 11:16:33,019 INFO L85 PathProgramCache]: Analyzing trace with hash 1299268393, now seen corresponding path program 1 times [2023-12-19 11:16:33,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 11:16:33,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920982547] [2023-12-19 11:16:33,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 11:16:33,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 11:16:33,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:16:33,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 11:16:33,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:16:33,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-19 11:16:33,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:16:33,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-19 11:16:33,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:16:33,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-19 11:16:33,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:16:33,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-19 11:16:33,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:16:33,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 11:16:33,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:16:33,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-19 11:16:33,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:16:33,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-19 11:16:33,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:16:33,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 11:16:33,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:16:33,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 11:16:33,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:16:33,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 11:16:33,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:16:33,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-19 11:16:33,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:16:33,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 11:16:33,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:16:33,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-12-19 11:16:33,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:16:33,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-12-19 11:16:33,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:16:33,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-12-19 11:16:33,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:16:33,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-12-19 11:16:33,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:16:33,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-19 11:16:33,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:16:33,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-19 11:16:33,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:16:33,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-12-19 11:16:33,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:16:33,477 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-12-19 11:16:33,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 11:16:33,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920982547] [2023-12-19 11:16:33,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1920982547] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 11:16:33,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 11:16:33,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-19 11:16:33,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654844300] [2023-12-19 11:16:33,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 11:16:33,478 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-19 11:16:33,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 11:16:33,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-19 11:16:33,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-12-19 11:16:33,480 INFO L87 Difference]: Start difference. First operand 206 states and 313 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-19 11:16:33,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 11:16:33,679 INFO L93 Difference]: Finished difference Result 502 states and 756 transitions. [2023-12-19 11:16:33,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-19 11:16:33,680 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 138 [2023-12-19 11:16:33,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 11:16:33,685 INFO L225 Difference]: With dead ends: 502 [2023-12-19 11:16:33,685 INFO L226 Difference]: Without dead ends: 322 [2023-12-19 11:16:33,688 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-12-19 11:16:33,690 INFO L413 NwaCegarLoop]: 133 mSDtfsCounter, 115 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-19 11:16:33,691 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 298 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-19 11:16:33,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2023-12-19 11:16:33,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 228. [2023-12-19 11:16:33,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 159 states have (on average 1.3773584905660377) internal successors, (219), 161 states have internal predecessors, (219), 64 states have call successors, (64), 4 states have call predecessors, (64), 4 states have return successors, (64), 62 states have call predecessors, (64), 64 states have call successors, (64) [2023-12-19 11:16:33,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 347 transitions. [2023-12-19 11:16:33,732 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 347 transitions. Word has length 138 [2023-12-19 11:16:33,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 11:16:33,733 INFO L495 AbstractCegarLoop]: Abstraction has 228 states and 347 transitions. [2023-12-19 11:16:33,734 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-19 11:16:33,734 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 347 transitions. [2023-12-19 11:16:33,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2023-12-19 11:16:33,737 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 11:16:33,739 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 11:16:33,740 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-19 11:16:33,741 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 11:16:33,741 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 11:16:33,741 INFO L85 PathProgramCache]: Analyzing trace with hash 1301175017, now seen corresponding path program 1 times [2023-12-19 11:16:33,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 11:16:33,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464714972] [2023-12-19 11:16:33,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 11:16:33,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 11:16:33,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:16:33,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 11:16:33,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:16:33,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-19 11:16:33,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:16:33,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-19 11:16:33,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:16:33,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-19 11:16:33,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:16:33,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-19 11:16:33,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:16:33,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 11:16:33,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:16:33,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-19 11:16:33,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:16:33,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-19 11:16:33,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:16:33,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 11:16:33,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:16:33,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 11:16:33,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:16:33,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 11:16:33,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:16:33,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-19 11:16:33,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:16:33,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 11:16:33,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:16:33,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-12-19 11:16:33,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:16:33,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-12-19 11:16:33,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:16:33,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-12-19 11:16:33,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:16:33,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-12-19 11:16:33,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:16:33,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-19 11:16:33,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:16:33,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-19 11:16:33,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:16:33,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-12-19 11:16:33,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:16:33,998 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 36 proven. 21 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2023-12-19 11:16:33,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 11:16:33,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464714972] [2023-12-19 11:16:33,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464714972] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 11:16:33,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1820849905] [2023-12-19 11:16:33,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 11:16:33,999 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 11:16:33,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 11:16:34,001 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-19 11:16:34,007 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-19 11:16:34,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:16:34,125 INFO L262 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-19 11:16:34,135 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 11:16:34,285 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 379 proven. 21 refuted. 0 times theorem prover too weak. 360 trivial. 0 not checked. [2023-12-19 11:16:34,285 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-19 11:16:34,456 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 36 proven. 21 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2023-12-19 11:16:34,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1820849905] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-19 11:16:34,457 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-19 11:16:34,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2023-12-19 11:16:34,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206068773] [2023-12-19 11:16:34,457 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-19 11:16:34,458 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-19 11:16:34,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 11:16:34,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-19 11:16:34,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-12-19 11:16:34,459 INFO L87 Difference]: Start difference. First operand 228 states and 347 transitions. Second operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 2 states have call successors, (27), 2 states have call predecessors, (27), 4 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2023-12-19 11:16:34,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 11:16:34,599 INFO L93 Difference]: Finished difference Result 471 states and 707 transitions. [2023-12-19 11:16:34,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-19 11:16:34,599 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 2 states have call successors, (27), 2 states have call predecessors, (27), 4 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 138 [2023-12-19 11:16:34,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 11:16:34,601 INFO L225 Difference]: With dead ends: 471 [2023-12-19 11:16:34,601 INFO L226 Difference]: Without dead ends: 244 [2023-12-19 11:16:34,601 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 322 GetRequests, 311 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2023-12-19 11:16:34,602 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 103 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-19 11:16:34,602 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 202 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-19 11:16:34,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2023-12-19 11:16:34,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 235. [2023-12-19 11:16:34,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 164 states have (on average 1.3414634146341464) internal successors, (220), 166 states have internal predecessors, (220), 64 states have call successors, (64), 6 states have call predecessors, (64), 6 states have return successors, (64), 62 states have call predecessors, (64), 64 states have call successors, (64) [2023-12-19 11:16:34,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 348 transitions. [2023-12-19 11:16:34,628 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 348 transitions. Word has length 138 [2023-12-19 11:16:34,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 11:16:34,629 INFO L495 AbstractCegarLoop]: Abstraction has 235 states and 348 transitions. [2023-12-19 11:16:34,629 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 2 states have call successors, (27), 2 states have call predecessors, (27), 4 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2023-12-19 11:16:34,629 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 348 transitions. [2023-12-19 11:16:34,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2023-12-19 11:16:34,630 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 11:16:34,630 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 11:16:34,656 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-19 11:16:34,840 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 11:16:34,841 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 11:16:34,841 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 11:16:34,841 INFO L85 PathProgramCache]: Analyzing trace with hash 1301115435, now seen corresponding path program 1 times [2023-12-19 11:16:34,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 11:16:34,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357380471] [2023-12-19 11:16:34,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 11:16:34,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 11:16:34,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:16:35,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 11:16:35,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:16:35,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-19 11:16:35,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:16:35,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-19 11:16:35,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:16:35,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-19 11:16:35,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:16:35,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-19 11:16:35,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:16:35,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 11:16:35,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:16:35,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-19 11:16:35,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:16:35,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-19 11:16:35,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:16:35,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 11:16:35,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:16:35,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 11:16:35,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:16:35,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 11:16:35,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:16:35,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-19 11:16:35,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:16:35,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 11:16:35,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:16:35,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-12-19 11:16:35,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:16:35,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-12-19 11:16:35,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:16:35,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-12-19 11:16:35,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:16:35,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-12-19 11:16:35,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:16:35,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-19 11:16:35,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:16:35,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-19 11:16:35,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:16:35,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-12-19 11:16:35,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:16:35,218 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 36 proven. 21 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2023-12-19 11:16:35,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 11:16:35,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357380471] [2023-12-19 11:16:35,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [357380471] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 11:16:35,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2133284045] [2023-12-19 11:16:35,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 11:16:35,218 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 11:16:35,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 11:16:35,219 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-19 11:16:35,236 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-19 11:16:35,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:16:35,331 INFO L262 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-19 11:16:35,341 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 11:16:35,383 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 189 proven. 6 refuted. 0 times theorem prover too weak. 565 trivial. 0 not checked. [2023-12-19 11:16:35,383 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-19 11:16:35,502 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 51 proven. 6 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2023-12-19 11:16:35,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2133284045] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-19 11:16:35,503 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-19 11:16:35,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 12 [2023-12-19 11:16:35,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531362827] [2023-12-19 11:16:35,503 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-19 11:16:35,504 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-19 11:16:35,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 11:16:35,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-19 11:16:35,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2023-12-19 11:16:35,504 INFO L87 Difference]: Start difference. First operand 235 states and 348 transitions. Second operand has 12 states, 12 states have (on average 6.416666666666667) internal successors, (77), 12 states have internal predecessors, (77), 4 states have call successors, (42), 2 states have call predecessors, (42), 4 states have return successors, (43), 4 states have call predecessors, (43), 4 states have call successors, (43) [2023-12-19 11:16:36,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 11:16:36,126 INFO L93 Difference]: Finished difference Result 534 states and 778 transitions. [2023-12-19 11:16:36,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-12-19 11:16:36,126 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.416666666666667) internal successors, (77), 12 states have internal predecessors, (77), 4 states have call successors, (42), 2 states have call predecessors, (42), 4 states have return successors, (43), 4 states have call predecessors, (43), 4 states have call successors, (43) Word has length 138 [2023-12-19 11:16:36,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 11:16:36,128 INFO L225 Difference]: With dead ends: 534 [2023-12-19 11:16:36,128 INFO L226 Difference]: Without dead ends: 300 [2023-12-19 11:16:36,129 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 349 GetRequests, 312 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 321 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=312, Invalid=1020, Unknown=0, NotChecked=0, Total=1332 [2023-12-19 11:16:36,129 INFO L413 NwaCegarLoop]: 129 mSDtfsCounter, 508 mSDsluCounter, 497 mSDsCounter, 0 mSdLazyCounter, 436 mSolverCounterSat, 210 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 510 SdHoareTripleChecker+Valid, 626 SdHoareTripleChecker+Invalid, 646 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 210 IncrementalHoareTripleChecker+Valid, 436 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-19 11:16:36,129 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [510 Valid, 626 Invalid, 646 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [210 Valid, 436 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-19 11:16:36,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2023-12-19 11:16:36,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 216. [2023-12-19 11:16:36,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 145 states have (on average 1.282758620689655) internal successors, (186), 145 states have internal predecessors, (186), 60 states have call successors, (60), 10 states have call predecessors, (60), 10 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2023-12-19 11:16:36,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 306 transitions. [2023-12-19 11:16:36,150 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 306 transitions. Word has length 138 [2023-12-19 11:16:36,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 11:16:36,151 INFO L495 AbstractCegarLoop]: Abstraction has 216 states and 306 transitions. [2023-12-19 11:16:36,151 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.416666666666667) internal successors, (77), 12 states have internal predecessors, (77), 4 states have call successors, (42), 2 states have call predecessors, (42), 4 states have return successors, (43), 4 states have call predecessors, (43), 4 states have call successors, (43) [2023-12-19 11:16:36,151 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 306 transitions. [2023-12-19 11:16:36,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2023-12-19 11:16:36,152 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 11:16:36,152 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 11:16:36,169 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-12-19 11:16:36,358 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 11:16:36,358 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 11:16:36,358 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 11:16:36,359 INFO L85 PathProgramCache]: Analyzing trace with hash -1185841896, now seen corresponding path program 1 times [2023-12-19 11:16:36,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 11:16:36,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655011191] [2023-12-19 11:16:36,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 11:16:36,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 11:16:36,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:16:36,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 11:16:36,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:16:36,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-19 11:16:36,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:16:36,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-19 11:16:36,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:16:36,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-19 11:16:36,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:16:36,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-19 11:16:36,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:16:36,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 11:16:36,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:16:36,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-19 11:16:36,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:16:36,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-19 11:16:36,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:16:36,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 11:16:36,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:16:36,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 11:16:36,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:16:36,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 11:16:36,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:16:36,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-19 11:16:36,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:16:36,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 11:16:36,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:16:36,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-12-19 11:16:36,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:16:36,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-12-19 11:16:36,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:16:36,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-12-19 11:16:36,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:16:36,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-12-19 11:16:36,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:16:36,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-19 11:16:36,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:16:36,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-19 11:16:36,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:16:36,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-12-19 11:16:36,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:16:36,660 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-12-19 11:16:36,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 11:16:36,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655011191] [2023-12-19 11:16:36,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655011191] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 11:16:36,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 11:16:36,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-19 11:16:36,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923234288] [2023-12-19 11:16:36,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 11:16:36,661 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-19 11:16:36,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 11:16:36,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-19 11:16:36,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-12-19 11:16:36,662 INFO L87 Difference]: Start difference. First operand 216 states and 306 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-19 11:16:36,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 11:16:36,806 INFO L93 Difference]: Finished difference Result 468 states and 655 transitions. [2023-12-19 11:16:36,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-19 11:16:36,806 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 139 [2023-12-19 11:16:36,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 11:16:36,807 INFO L225 Difference]: With dead ends: 468 [2023-12-19 11:16:36,807 INFO L226 Difference]: Without dead ends: 316 [2023-12-19 11:16:36,808 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-12-19 11:16:36,808 INFO L413 NwaCegarLoop]: 140 mSDtfsCounter, 119 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 414 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-19 11:16:36,808 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 414 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-19 11:16:36,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2023-12-19 11:16:36,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 236. [2023-12-19 11:16:36,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 163 states have (on average 1.2699386503067485) internal successors, (207), 163 states have internal predecessors, (207), 60 states have call successors, (60), 12 states have call predecessors, (60), 12 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2023-12-19 11:16:36,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 327 transitions. [2023-12-19 11:16:36,855 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 327 transitions. Word has length 139 [2023-12-19 11:16:36,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 11:16:36,856 INFO L495 AbstractCegarLoop]: Abstraction has 236 states and 327 transitions. [2023-12-19 11:16:36,856 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-19 11:16:36,856 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 327 transitions. [2023-12-19 11:16:36,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2023-12-19 11:16:36,857 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 11:16:36,857 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 11:16:36,857 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-19 11:16:36,857 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 11:16:36,857 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 11:16:36,857 INFO L85 PathProgramCache]: Analyzing trace with hash -1183994854, now seen corresponding path program 1 times [2023-12-19 11:16:36,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 11:16:36,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371726212] [2023-12-19 11:16:36,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 11:16:36,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 11:16:36,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-19 11:16:36,897 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-19 11:16:36,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-19 11:16:36,970 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-19 11:16:36,970 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-19 11:16:36,970 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-19 11:16:36,972 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-19 11:16:36,974 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2023-12-19 11:16:36,976 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-19 11:16:37,042 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.12 11:16:37 BoogieIcfgContainer [2023-12-19 11:16:37,042 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-19 11:16:37,042 INFO L158 Benchmark]: Toolchain (without parser) took 6752.69ms. Allocated memory was 241.2MB in the beginning and 341.8MB in the end (delta: 100.7MB). Free memory was 201.5MB in the beginning and 239.5MB in the end (delta: -38.1MB). Peak memory consumption was 63.1MB. Max. memory is 8.0GB. [2023-12-19 11:16:37,042 INFO L158 Benchmark]: CDTParser took 0.45ms. Allocated memory is still 170.9MB. Free memory is still 119.2MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-19 11:16:37,042 INFO L158 Benchmark]: CACSL2BoogieTranslator took 288.66ms. Allocated memory is still 241.2MB. Free memory was 201.5MB in the beginning and 185.2MB in the end (delta: 16.3MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. [2023-12-19 11:16:37,043 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.50ms. Allocated memory is still 241.2MB. Free memory was 185.2MB in the beginning and 181.5MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2023-12-19 11:16:37,043 INFO L158 Benchmark]: Boogie Preprocessor took 64.13ms. Allocated memory is still 241.2MB. Free memory was 181.5MB in the beginning and 176.3MB in the end (delta: 5.2MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. [2023-12-19 11:16:37,043 INFO L158 Benchmark]: RCFGBuilder took 495.29ms. Allocated memory is still 241.2MB. Free memory was 176.3MB in the beginning and 149.0MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. [2023-12-19 11:16:37,043 INFO L158 Benchmark]: TraceAbstraction took 5853.58ms. Allocated memory was 241.2MB in the beginning and 341.8MB in the end (delta: 100.7MB). Free memory was 148.5MB in the beginning and 239.5MB in the end (delta: -91.0MB). Peak memory consumption was 10.7MB. Max. memory is 8.0GB. [2023-12-19 11:16:37,044 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.45ms. Allocated memory is still 170.9MB. Free memory is still 119.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 288.66ms. Allocated memory is still 241.2MB. Free memory was 201.5MB in the beginning and 185.2MB in the end (delta: 16.3MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 45.50ms. Allocated memory is still 241.2MB. Free memory was 185.2MB in the beginning and 181.5MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 64.13ms. Allocated memory is still 241.2MB. Free memory was 181.5MB in the beginning and 176.3MB in the end (delta: 5.2MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. * RCFGBuilder took 495.29ms. Allocated memory is still 241.2MB. Free memory was 176.3MB in the beginning and 149.0MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. * TraceAbstraction took 5853.58ms. Allocated memory was 241.2MB in the beginning and 341.8MB in the end (delta: 100.7MB). Free memory was 148.5MB in the beginning and 239.5MB in the end (delta: -91.0MB). Peak memory consumption was 10.7MB. 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 185, overapproximation of someUnaryDOUBLEoperation at line 76, overapproximation of someBinaryArithmeticDOUBLEoperation at line 80, overapproximation of someBinaryDOUBLEComparisonOperation at line 185. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 64; [L23] unsigned char var_1_3 = 200; [L24] unsigned char var_1_4 = 16; [L25] unsigned char var_1_5 = 0; [L26] double var_1_7 = 31.75; [L27] double var_1_8 = 64.75; [L28] double var_1_9 = 1.625; [L29] double var_1_10 = 0.0; [L30] double var_1_11 = 15.75; [L31] double var_1_12 = 199.6; [L32] double var_1_13 = 31.625; [L33] float var_1_14 = 2.575; [L34] float var_1_15 = 0.0; [L35] double var_1_16 = 64.8; [L36] double var_1_18 = 8.01; [L37] double var_1_19 = 1000000.5; [L38] unsigned char var_1_22 = 1; [L39] unsigned char var_1_23 = 1; [L40] unsigned char var_1_24 = 1; [L41] unsigned char var_1_25 = 0; [L42] double var_1_26 = 49.31; [L43] signed long int var_1_28 = 1; [L44] unsigned char var_1_29 = 1; [L45] unsigned char var_1_30 = 0; [L46] unsigned char var_1_31 = 1; [L47] unsigned short int last_1_var_1_1 = 64; [L48] unsigned char last_1_var_1_22 = 1; [L49] signed long int last_1_var_1_28 = 1; [L50] unsigned char last_1_var_1_29 = 1; [L51] unsigned char last_1_var_1_31 = 1; [L189] isInitial = 1 [L190] FCALL initially() [L191] int k_loop; [L192] k_loop = 0 VAL [isInitial=1, k_loop=0, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_10=0, var_1_11=63/4, var_1_12=998/5, var_1_13=253/8, var_1_14=103/40, var_1_15=0, var_1_16=324/5, var_1_18=801/100, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=200, var_1_4=16, var_1_5=0, var_1_7=127/4, var_1_8=259/4, var_1_9=13/8] [L192] COND TRUE k_loop < 1 [L193] CALL updateLastVariables() [L178] last_1_var_1_1 = var_1_1 [L179] last_1_var_1_22 = var_1_22 [L180] last_1_var_1_28 = var_1_28 [L181] last_1_var_1_29 = var_1_29 [L182] last_1_var_1_31 = var_1_31 [L193] RET updateLastVariables() [L194] CALL updateVariables() [L143] var_1_3 = __VERIFIER_nondet_uchar() [L144] CALL assume_abort_if_not(var_1_3 >= 191) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_10=0, var_1_11=63/4, var_1_12=998/5, var_1_13=253/8, var_1_14=103/40, var_1_15=0, var_1_16=324/5, var_1_18=801/100, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=191, var_1_4=16, var_1_5=0, var_1_7=127/4, var_1_8=259/4, var_1_9=13/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_10=0, var_1_11=63/4, var_1_12=998/5, var_1_13=253/8, var_1_14=103/40, var_1_15=0, var_1_16=324/5, var_1_18=801/100, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=191, var_1_4=16, var_1_5=0, var_1_7=127/4, var_1_8=259/4, var_1_9=13/8] [L144] RET assume_abort_if_not(var_1_3 >= 191) VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_10=0, var_1_11=63/4, var_1_12=998/5, var_1_13=253/8, var_1_14=103/40, var_1_15=0, var_1_16=324/5, var_1_18=801/100, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=191, var_1_4=16, var_1_5=0, var_1_7=127/4, var_1_8=259/4, var_1_9=13/8] [L145] CALL assume_abort_if_not(var_1_3 <= 255) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_10=0, var_1_11=63/4, var_1_12=998/5, var_1_13=253/8, var_1_14=103/40, var_1_15=0, var_1_16=324/5, var_1_18=801/100, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=191, var_1_4=16, var_1_5=0, var_1_7=127/4, var_1_8=259/4, var_1_9=13/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_10=0, var_1_11=63/4, var_1_12=998/5, var_1_13=253/8, var_1_14=103/40, var_1_15=0, var_1_16=324/5, var_1_18=801/100, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=191, var_1_4=16, var_1_5=0, var_1_7=127/4, var_1_8=259/4, var_1_9=13/8] [L145] RET assume_abort_if_not(var_1_3 <= 255) VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_10=0, var_1_11=63/4, var_1_12=998/5, var_1_13=253/8, var_1_14=103/40, var_1_15=0, var_1_16=324/5, var_1_18=801/100, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=191, var_1_4=16, var_1_5=0, var_1_7=127/4, var_1_8=259/4, var_1_9=13/8] [L146] var_1_4 = __VERIFIER_nondet_uchar() [L147] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_10=0, var_1_11=63/4, var_1_12=998/5, var_1_13=253/8, var_1_14=103/40, var_1_15=0, var_1_16=324/5, var_1_18=801/100, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=191, var_1_5=0, var_1_7=127/4, var_1_8=259/4, var_1_9=13/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_10=0, var_1_11=63/4, var_1_12=998/5, var_1_13=253/8, var_1_14=103/40, var_1_15=0, var_1_16=324/5, var_1_18=801/100, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=191, var_1_5=0, var_1_7=127/4, var_1_8=259/4, var_1_9=13/8] [L147] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_10=0, var_1_11=63/4, var_1_12=998/5, var_1_13=253/8, var_1_14=103/40, var_1_15=0, var_1_16=324/5, var_1_18=801/100, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=191, var_1_5=0, var_1_7=127/4, var_1_8=259/4, var_1_9=13/8] [L148] CALL assume_abort_if_not(var_1_4 <= 64) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_10=0, var_1_11=63/4, var_1_12=998/5, var_1_13=253/8, var_1_14=103/40, var_1_15=0, var_1_16=324/5, var_1_18=801/100, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=191, var_1_4=63, var_1_5=0, var_1_7=127/4, var_1_8=259/4, var_1_9=13/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_10=0, var_1_11=63/4, var_1_12=998/5, var_1_13=253/8, var_1_14=103/40, var_1_15=0, var_1_16=324/5, var_1_18=801/100, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=191, var_1_4=63, var_1_5=0, var_1_7=127/4, var_1_8=259/4, var_1_9=13/8] [L148] RET assume_abort_if_not(var_1_4 <= 64) VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_10=0, var_1_11=63/4, var_1_12=998/5, var_1_13=253/8, var_1_14=103/40, var_1_15=0, var_1_16=324/5, var_1_18=801/100, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=191, var_1_4=63, var_1_5=0, var_1_7=127/4, var_1_8=259/4, var_1_9=13/8] [L149] var_1_5 = __VERIFIER_nondet_uchar() [L150] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_10=0, var_1_11=63/4, var_1_12=998/5, var_1_13=253/8, var_1_14=103/40, var_1_15=0, var_1_16=324/5, var_1_18=801/100, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=191, var_1_4=63, var_1_7=127/4, var_1_8=259/4, var_1_9=13/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_10=0, var_1_11=63/4, var_1_12=998/5, var_1_13=253/8, var_1_14=103/40, var_1_15=0, var_1_16=324/5, var_1_18=801/100, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=191, var_1_4=63, var_1_7=127/4, var_1_8=259/4, var_1_9=13/8] [L150] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_10=0, var_1_11=63/4, var_1_12=998/5, var_1_13=253/8, var_1_14=103/40, var_1_15=0, var_1_16=324/5, var_1_18=801/100, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=191, var_1_4=63, var_1_7=127/4, var_1_8=259/4, var_1_9=13/8] [L151] CALL assume_abort_if_not(var_1_5 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_10=0, var_1_11=63/4, var_1_12=998/5, var_1_13=253/8, var_1_14=103/40, var_1_15=0, var_1_16=324/5, var_1_18=801/100, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=191, var_1_4=63, var_1_5=127, var_1_7=127/4, var_1_8=259/4, var_1_9=13/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_10=0, var_1_11=63/4, var_1_12=998/5, var_1_13=253/8, var_1_14=103/40, var_1_15=0, var_1_16=324/5, var_1_18=801/100, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=191, var_1_4=63, var_1_5=127, var_1_7=127/4, var_1_8=259/4, var_1_9=13/8] [L151] RET assume_abort_if_not(var_1_5 <= 127) VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_10=0, var_1_11=63/4, var_1_12=998/5, var_1_13=253/8, var_1_14=103/40, var_1_15=0, var_1_16=324/5, var_1_18=801/100, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=191, var_1_4=63, var_1_5=127, var_1_7=127/4, var_1_8=259/4, var_1_9=13/8] [L152] var_1_8 = __VERIFIER_nondet_double() [L153] CALL assume_abort_if_not((var_1_8 >= -922337.2036854765600e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_10=0, var_1_11=63/4, var_1_12=998/5, var_1_13=253/8, var_1_14=103/40, var_1_15=0, var_1_16=324/5, var_1_18=801/100, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=191, var_1_4=63, var_1_5=127, var_1_7=127/4, var_1_9=13/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_10=0, var_1_11=63/4, var_1_12=998/5, var_1_13=253/8, var_1_14=103/40, var_1_15=0, var_1_16=324/5, var_1_18=801/100, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=191, var_1_4=63, var_1_5=127, var_1_7=127/4, var_1_9=13/8] [L153] RET assume_abort_if_not((var_1_8 >= -922337.2036854765600e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_10=0, var_1_11=63/4, var_1_12=998/5, var_1_13=253/8, var_1_14=103/40, var_1_15=0, var_1_16=324/5, var_1_18=801/100, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=191, var_1_4=63, var_1_5=127, var_1_7=127/4, var_1_9=13/8] [L154] var_1_10 = __VERIFIER_nondet_double() [L155] CALL assume_abort_if_not((var_1_10 >= 4611686.018427382800e+12F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_11=63/4, var_1_12=998/5, var_1_13=253/8, var_1_14=103/40, var_1_15=0, var_1_16=324/5, var_1_18=801/100, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=191, var_1_4=63, var_1_5=127, var_1_7=127/4, var_1_9=13/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_11=63/4, var_1_12=998/5, var_1_13=253/8, var_1_14=103/40, var_1_15=0, var_1_16=324/5, var_1_18=801/100, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=191, var_1_4=63, var_1_5=127, var_1_7=127/4, var_1_9=13/8] [L155] RET assume_abort_if_not((var_1_10 >= 4611686.018427382800e+12F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_11=63/4, var_1_12=998/5, var_1_13=253/8, var_1_14=103/40, var_1_15=0, var_1_16=324/5, var_1_18=801/100, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=191, var_1_4=63, var_1_5=127, var_1_7=127/4, var_1_9=13/8] [L156] var_1_11 = __VERIFIER_nondet_double() [L157] CALL assume_abort_if_not((var_1_11 >= 0.0F && 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_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_12=998/5, var_1_13=253/8, var_1_14=103/40, var_1_15=0, var_1_16=324/5, var_1_18=801/100, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=191, var_1_4=63, var_1_5=127, var_1_7=127/4, var_1_9=13/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_12=998/5, var_1_13=253/8, var_1_14=103/40, var_1_15=0, var_1_16=324/5, var_1_18=801/100, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=191, var_1_4=63, var_1_5=127, var_1_7=127/4, var_1_9=13/8] [L157] RET assume_abort_if_not((var_1_11 >= 0.0F && 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_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_12=998/5, var_1_13=253/8, var_1_14=103/40, var_1_15=0, var_1_16=324/5, var_1_18=801/100, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=191, var_1_4=63, var_1_5=127, var_1_7=127/4, var_1_9=13/8] [L158] var_1_12 = __VERIFIER_nondet_double() [L159] CALL assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_13=253/8, var_1_14=103/40, var_1_15=0, var_1_16=324/5, var_1_18=801/100, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=191, var_1_4=63, var_1_5=127, var_1_7=127/4, var_1_9=13/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_13=253/8, var_1_14=103/40, var_1_15=0, var_1_16=324/5, var_1_18=801/100, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=191, var_1_4=63, var_1_5=127, var_1_7=127/4, var_1_9=13/8] [L159] RET assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_13=253/8, var_1_14=103/40, var_1_15=0, var_1_16=324/5, var_1_18=801/100, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=191, var_1_4=63, var_1_5=127, var_1_7=127/4, var_1_9=13/8] [L160] var_1_15 = __VERIFIER_nondet_float() [L161] CALL assume_abort_if_not((var_1_15 >= 4611686.018427382800e+12F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_13=253/8, var_1_14=103/40, var_1_16=324/5, var_1_18=801/100, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=191, var_1_4=63, var_1_5=127, var_1_7=127/4, var_1_9=13/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_13=253/8, var_1_14=103/40, var_1_16=324/5, var_1_18=801/100, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=191, var_1_4=63, var_1_5=127, var_1_7=127/4, var_1_9=13/8] [L161] RET assume_abort_if_not((var_1_15 >= 4611686.018427382800e+12F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_13=253/8, var_1_14=103/40, var_1_16=324/5, var_1_18=801/100, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=191, var_1_4=63, var_1_5=127, var_1_7=127/4, var_1_9=13/8] [L162] var_1_18 = __VERIFIER_nondet_double() [L163] CALL assume_abort_if_not((var_1_18 >= 0.0F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_13=253/8, var_1_14=103/40, var_1_16=324/5, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=191, var_1_4=63, var_1_5=127, var_1_7=127/4, var_1_9=13/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_13=253/8, var_1_14=103/40, var_1_16=324/5, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=191, var_1_4=63, var_1_5=127, var_1_7=127/4, var_1_9=13/8] [L163] RET assume_abort_if_not((var_1_18 >= 0.0F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_13=253/8, var_1_14=103/40, var_1_16=324/5, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=191, var_1_4=63, var_1_5=127, var_1_7=127/4, var_1_9=13/8] [L164] var_1_23 = __VERIFIER_nondet_uchar() [L165] CALL assume_abort_if_not(var_1_23 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_13=253/8, var_1_14=103/40, var_1_16=324/5, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=191, var_1_4=63, var_1_5=127, var_1_7=127/4, var_1_9=13/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_13=253/8, var_1_14=103/40, var_1_16=324/5, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=191, var_1_4=63, var_1_5=127, var_1_7=127/4, var_1_9=13/8] [L165] RET assume_abort_if_not(var_1_23 >= 1) VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_13=253/8, var_1_14=103/40, var_1_16=324/5, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=191, var_1_4=63, var_1_5=127, var_1_7=127/4, var_1_9=13/8] [L166] CALL assume_abort_if_not(var_1_23 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_13=253/8, var_1_14=103/40, var_1_16=324/5, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=191, var_1_4=63, var_1_5=127, var_1_7=127/4, var_1_9=13/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_13=253/8, var_1_14=103/40, var_1_16=324/5, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=191, var_1_4=63, var_1_5=127, var_1_7=127/4, var_1_9=13/8] [L166] RET assume_abort_if_not(var_1_23 <= 1) VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_13=253/8, var_1_14=103/40, var_1_16=324/5, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=191, var_1_4=63, var_1_5=127, var_1_7=127/4, var_1_9=13/8] [L167] var_1_24 = __VERIFIER_nondet_uchar() [L168] CALL assume_abort_if_not(var_1_24 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_13=253/8, var_1_14=103/40, var_1_16=324/5, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=191, var_1_4=63, var_1_5=127, var_1_7=127/4, var_1_9=13/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_13=253/8, var_1_14=103/40, var_1_16=324/5, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=191, var_1_4=63, var_1_5=127, var_1_7=127/4, var_1_9=13/8] [L168] RET assume_abort_if_not(var_1_24 >= 1) VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_13=253/8, var_1_14=103/40, var_1_16=324/5, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=191, var_1_4=63, var_1_5=127, var_1_7=127/4, var_1_9=13/8] [L169] CALL assume_abort_if_not(var_1_24 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_13=253/8, var_1_14=103/40, var_1_16=324/5, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=191, var_1_4=63, var_1_5=127, var_1_7=127/4, var_1_9=13/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_13=253/8, var_1_14=103/40, var_1_16=324/5, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=191, var_1_4=63, var_1_5=127, var_1_7=127/4, var_1_9=13/8] [L169] RET assume_abort_if_not(var_1_24 <= 1) VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_13=253/8, var_1_14=103/40, var_1_16=324/5, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=191, var_1_4=63, var_1_5=127, var_1_7=127/4, var_1_9=13/8] [L170] var_1_25 = __VERIFIER_nondet_uchar() [L171] CALL assume_abort_if_not(var_1_25 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_13=253/8, var_1_14=103/40, var_1_16=324/5, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=191, var_1_4=63, var_1_5=127, var_1_7=127/4, var_1_9=13/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_13=253/8, var_1_14=103/40, var_1_16=324/5, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=191, var_1_4=63, var_1_5=127, var_1_7=127/4, var_1_9=13/8] [L171] RET assume_abort_if_not(var_1_25 >= 0) VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_13=253/8, var_1_14=103/40, var_1_16=324/5, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=191, var_1_4=63, var_1_5=127, var_1_7=127/4, var_1_9=13/8] [L172] CALL assume_abort_if_not(var_1_25 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_13=253/8, var_1_14=103/40, var_1_16=324/5, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=191, var_1_4=63, var_1_5=127, var_1_7=127/4, var_1_9=13/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_13=253/8, var_1_14=103/40, var_1_16=324/5, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=191, var_1_4=63, var_1_5=127, var_1_7=127/4, var_1_9=13/8] [L172] RET assume_abort_if_not(var_1_25 <= 0) VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_13=253/8, var_1_14=103/40, var_1_16=324/5, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=191, var_1_4=63, var_1_5=127, var_1_7=127/4, var_1_9=13/8] [L173] var_1_30 = __VERIFIER_nondet_uchar() [L174] CALL assume_abort_if_not(var_1_30 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_13=253/8, var_1_14=103/40, var_1_16=324/5, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=1, var_1_3=191, var_1_4=63, var_1_5=127, var_1_7=127/4, var_1_9=13/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_13=253/8, var_1_14=103/40, var_1_16=324/5, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=1, var_1_3=191, var_1_4=63, var_1_5=127, var_1_7=127/4, var_1_9=13/8] [L174] RET assume_abort_if_not(var_1_30 >= 1) VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_13=253/8, var_1_14=103/40, var_1_16=324/5, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=1, var_1_3=191, var_1_4=63, var_1_5=127, var_1_7=127/4, var_1_9=13/8] [L175] CALL assume_abort_if_not(var_1_30 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_13=253/8, var_1_14=103/40, var_1_16=324/5, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=1, var_1_3=191, var_1_4=63, var_1_5=127, var_1_7=127/4, var_1_9=13/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_13=253/8, var_1_14=103/40, var_1_16=324/5, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=1, var_1_3=191, var_1_4=63, var_1_5=127, var_1_7=127/4, var_1_9=13/8] [L175] RET assume_abort_if_not(var_1_30 <= 1) VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_13=253/8, var_1_14=103/40, var_1_16=324/5, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=1, var_1_3=191, var_1_4=63, var_1_5=127, var_1_7=127/4, var_1_9=13/8] [L194] RET updateVariables() [L195] CALL step() [L55] COND FALSE !(var_1_8 <= (((((- var_1_12)) < ((var_1_11 - 99999.75))) ? ((- var_1_12)) : ((var_1_11 - 99999.75))))) VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_13=253/8, var_1_14=103/40, var_1_16=324/5, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=1, var_1_3=191, var_1_4=63, var_1_5=127, var_1_7=127/4, var_1_9=13/8] [L62] signed long int stepLocal_7 = 100; VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, stepLocal_7=100, var_1_13=253/8, var_1_14=103/40, var_1_16=324/5, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=1, var_1_3=191, var_1_4=63, var_1_5=127, var_1_7=127/4, var_1_9=13/8] [L63] COND TRUE ! (var_1_10 <= 16.8) [L64] var_1_29 = (var_1_23 && ((var_1_24 || last_1_var_1_22) || var_1_30)) VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, stepLocal_7=100, var_1_13=253/8, var_1_14=103/40, var_1_16=324/5, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=1, var_1_3=191, var_1_4=63, var_1_5=127, var_1_7=127/4, var_1_9=13/8] [L74] unsigned char stepLocal_1 = var_1_4; VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, stepLocal_1=63, stepLocal_7=100, var_1_13=253/8, var_1_14=103/40, var_1_16=324/5, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=1, var_1_3=191, var_1_4=63, var_1_5=127, var_1_7=127/4, var_1_9=13/8] [L75] COND TRUE stepLocal_1 >= var_1_28 [L76] var_1_7 = ((((var_1_8) < 0 ) ? -(var_1_8) : (var_1_8))) VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, stepLocal_1=63, stepLocal_7=100, var_1_13=253/8, var_1_14=103/40, var_1_16=324/5, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=1, var_1_3=191, var_1_4=63, var_1_5=127, var_1_7=1000007, var_1_8=1000007, var_1_9=13/8] [L78] unsigned char stepLocal_4 = var_1_4; VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, stepLocal_1=63, stepLocal_4=63, stepLocal_7=100, var_1_13=253/8, var_1_14=103/40, var_1_16=324/5, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=1, var_1_3=191, var_1_4=63, var_1_5=127, var_1_7=1000007, var_1_8=1000007, var_1_9=13/8] [L79] COND TRUE stepLocal_4 <= ((((var_1_5) < 0 ) ? -(var_1_5) : (var_1_5))) [L80] var_1_14 = ((((var_1_12) < ((var_1_10 - (var_1_15 - var_1_11)))) ? (var_1_12) : ((var_1_10 - (var_1_15 - var_1_11))))) VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, stepLocal_1=63, stepLocal_4=63, stepLocal_7=100, var_1_12=1000006, var_1_13=253/8, var_1_14=1000006, var_1_16=324/5, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=1, var_1_3=191, var_1_4=63, var_1_5=127, var_1_7=1000007, var_1_8=1000007, var_1_9=13/8] [L84] COND FALSE !((- var_1_7) == var_1_10) VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, stepLocal_1=63, stepLocal_4=63, stepLocal_7=100, var_1_12=1000006, var_1_13=253/8, var_1_14=1000006, var_1_16=324/5, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=1, var_1_3=191, var_1_4=63, var_1_5=127, var_1_7=1000007, var_1_8=1000007, var_1_9=13/8] [L87] var_1_31 = var_1_25 [L88] signed long int stepLocal_0 = var_1_28; VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, stepLocal_0=1, stepLocal_1=63, stepLocal_4=63, stepLocal_7=100, var_1_12=1000006, var_1_13=253/8, var_1_14=1000006, var_1_16=324/5, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=0, var_1_3=191, var_1_4=63, var_1_5=127, var_1_7=1000007, var_1_8=1000007, var_1_9=13/8] [L89] COND TRUE \read(var_1_29) VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, stepLocal_0=1, stepLocal_1=63, stepLocal_4=63, stepLocal_7=100, var_1_12=1000006, var_1_13=253/8, var_1_14=1000006, var_1_16=324/5, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=0, var_1_3=191, var_1_4=63, var_1_5=127, var_1_7=1000007, var_1_8=1000007, var_1_9=13/8] [L90] COND TRUE ((var_1_3 - var_1_4) - var_1_5) <= stepLocal_0 [L91] var_1_1 = var_1_3 VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, stepLocal_0=1, stepLocal_1=63, stepLocal_4=63, stepLocal_7=100, var_1_12=1000006, var_1_13=253/8, var_1_14=1000006, var_1_16=324/5, var_1_19=2000001/2, var_1_1=191, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=0, var_1_3=191, var_1_4=63, var_1_5=127, var_1_7=1000007, var_1_8=1000007, var_1_9=13/8] [L94] unsigned char stepLocal_6 = var_1_31; VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, stepLocal_0=1, stepLocal_1=63, stepLocal_4=63, stepLocal_6=0, stepLocal_7=100, var_1_12=1000006, var_1_13=253/8, var_1_14=1000006, var_1_16=324/5, var_1_19=2000001/2, var_1_1=191, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=0, var_1_3=191, var_1_4=63, var_1_5=127, var_1_7=1000007, var_1_8=1000007, var_1_9=13/8] [L95] COND FALSE !(var_1_31 && stepLocal_6) [L98] var_1_22 = (! (var_1_24 && (! var_1_25))) VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, stepLocal_0=1, stepLocal_1=63, stepLocal_4=63, stepLocal_6=0, stepLocal_7=100, var_1_12=1000006, var_1_13=253/8, var_1_14=1000006, var_1_16=324/5, var_1_19=2000001/2, var_1_1=191, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=0, var_1_3=191, var_1_4=63, var_1_5=127, var_1_7=1000007, var_1_8=1000007, var_1_9=13/8] [L100] COND FALSE !(\read(var_1_22)) VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, stepLocal_0=1, stepLocal_1=63, stepLocal_4=63, stepLocal_6=0, stepLocal_7=100, var_1_12=1000006, var_1_13=253/8, var_1_14=1000006, var_1_16=324/5, var_1_19=2000001/2, var_1_1=191, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=0, var_1_3=191, var_1_4=63, var_1_5=127, var_1_7=1000007, var_1_8=1000007, var_1_9=13/8] [L105] COND TRUE var_1_12 == var_1_8 [L106] var_1_9 = var_1_11 VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, stepLocal_0=1, stepLocal_1=63, stepLocal_4=63, stepLocal_6=0, stepLocal_7=100, var_1_11=1000005, var_1_12=1000006, var_1_13=253/8, var_1_14=1000006, var_1_16=324/5, var_1_19=2000001/2, var_1_1=191, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=0, var_1_3=191, var_1_4=63, var_1_5=127, var_1_7=1000007, var_1_8=1000007, var_1_9=1000005] [L111] unsigned char stepLocal_3 = var_1_3; [L112] unsigned char stepLocal_2 = var_1_10 != var_1_9; VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, stepLocal_0=1, stepLocal_1=63, stepLocal_2=0, stepLocal_3=191, stepLocal_4=63, stepLocal_6=0, stepLocal_7=100, var_1_11=1000005, var_1_12=1000006, var_1_13=253/8, var_1_14=1000006, var_1_16=324/5, var_1_19=2000001/2, var_1_1=191, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=0, var_1_3=191, var_1_4=63, var_1_5=127, var_1_7=1000007, var_1_8=1000007, var_1_9=1000005] [L113] COND FALSE !(stepLocal_2 && var_1_29) [L124] var_1_13 = var_1_12 VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, stepLocal_0=1, stepLocal_1=63, stepLocal_2=0, stepLocal_3=191, stepLocal_4=63, stepLocal_6=0, stepLocal_7=100, var_1_11=1000005, var_1_12=1000006, var_1_13=1000006, var_1_14=1000006, var_1_16=324/5, var_1_19=2000001/2, var_1_1=191, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=0, var_1_3=191, var_1_4=63, var_1_5=127, var_1_7=1000007, var_1_8=1000007, var_1_9=1000005] [L126] unsigned char stepLocal_5 = var_1_22; VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, stepLocal_0=1, stepLocal_1=63, stepLocal_2=0, stepLocal_3=191, stepLocal_4=63, stepLocal_5=0, stepLocal_6=0, stepLocal_7=100, var_1_11=1000005, var_1_12=1000006, var_1_13=1000006, var_1_14=1000006, var_1_16=324/5, var_1_19=2000001/2, var_1_1=191, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=0, var_1_3=191, var_1_4=63, var_1_5=127, var_1_7=1000007, var_1_8=1000007, var_1_9=1000005] [L127] COND FALSE !(\read(var_1_22)) VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, stepLocal_0=1, stepLocal_1=63, stepLocal_2=0, stepLocal_3=191, stepLocal_4=63, stepLocal_5=0, stepLocal_6=0, stepLocal_7=100, var_1_11=1000005, var_1_12=1000006, var_1_13=1000006, var_1_14=1000006, var_1_16=324/5, var_1_19=2000001/2, var_1_1=191, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=0, var_1_3=191, var_1_4=63, var_1_5=127, var_1_7=1000007, var_1_8=1000007, var_1_9=1000005] [L134] COND FALSE !(stepLocal_5 || var_1_22) VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, stepLocal_0=1, stepLocal_1=63, stepLocal_2=0, stepLocal_3=191, stepLocal_4=63, stepLocal_5=0, stepLocal_6=0, stepLocal_7=100, var_1_11=1000005, var_1_12=1000006, var_1_13=1000006, var_1_14=1000006, var_1_16=324/5, var_1_19=2000001/2, var_1_1=191, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=0, var_1_3=191, var_1_4=63, var_1_5=127, var_1_7=1000007, var_1_8=1000007, var_1_9=1000005] [L138] COND TRUE var_1_23 || (((((var_1_3) > (var_1_5)) ? (var_1_3) : (var_1_5))) < var_1_1) [L139] var_1_26 = 25.5 VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, stepLocal_0=1, stepLocal_1=63, stepLocal_2=0, stepLocal_3=191, stepLocal_4=63, stepLocal_5=0, stepLocal_6=0, stepLocal_7=100, var_1_11=1000005, var_1_12=1000006, var_1_13=1000006, var_1_14=1000006, var_1_16=324/5, var_1_19=2000001/2, var_1_1=191, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=51/2, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=0, var_1_3=191, var_1_4=63, var_1_5=127, var_1_7=1000007, var_1_8=1000007, var_1_9=1000005] [L195] RET step() [L196] CALL, EXPR property() [L185-L186] return (((((((((((var_1_29 ? ((((var_1_3 - var_1_4) - var_1_5) <= var_1_28) ? (var_1_1 == ((unsigned short int) var_1_3)) : 1) : 1) && ((var_1_4 >= var_1_28) ? (var_1_7 == ((double) ((((var_1_8) < 0 ) ? -(var_1_8) : (var_1_8))))) : 1)) && (var_1_22 ? ((var_1_1 >= var_1_5) ? (var_1_9 == ((double) ((((((var_1_10 - var_1_11) - var_1_12)) < (var_1_8)) ? (((var_1_10 - var_1_11) - var_1_12)) : (var_1_8))))) : 1) : ((var_1_12 == var_1_8) ? (var_1_9 == ((double) var_1_11)) : (var_1_9 == ((double) var_1_12))))) && (((var_1_10 != var_1_9) && var_1_29) ? ((var_1_11 >= (127.5 / var_1_10)) ? ((var_1_3 >= var_1_28) ? (var_1_13 == ((double) var_1_10)) : (var_1_13 == ((double) 9.9999999999996E12))) : (var_1_13 == ((double) var_1_11))) : (var_1_13 == ((double) var_1_12)))) && ((var_1_4 <= ((((var_1_5) < 0 ) ? -(var_1_5) : (var_1_5)))) ? (var_1_14 == ((float) ((((var_1_12) < ((var_1_10 - (var_1_15 - var_1_11)))) ? (var_1_12) : ((var_1_10 - (var_1_15 - var_1_11))))))) : (var_1_14 == ((float) var_1_15)))) && (((- var_1_7) == var_1_10) ? (var_1_16 == ((double) (((((var_1_18 - var_1_15)) > (var_1_11)) ? ((var_1_18 - var_1_15)) : (var_1_11))))) : 1)) && (var_1_22 ? ((var_1_10 >= (var_1_8 * var_1_13)) ? (var_1_19 == ((double) (var_1_18 - (var_1_15 - var_1_11)))) : (var_1_19 == ((double) ((((((((var_1_12) < 0 ) ? -(var_1_12) : (var_1_12)))) < (((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11))))) ? (((((var_1_12) < 0 ) ? -(var_1_12) : (var_1_12)))) : (((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11))))))))) : ((var_1_22 || var_1_22) ? (var_1_19 == ((double) var_1_12)) : 1))) && ((var_1_31 && var_1_31) ? (var_1_22 == ((unsigned char) ((var_1_29 || var_1_23) && var_1_24))) : (var_1_22 == ((unsigned char) (! (var_1_24 && (! var_1_25))))))) && ((var_1_23 || (((((var_1_3) > (var_1_5)) ? (var_1_3) : (var_1_5))) < var_1_1)) ? (var_1_26 == ((double) 25.5)) : 1)) && ((var_1_8 <= (((((- var_1_12)) < ((var_1_11 - 99999.75))) ? ((- var_1_12)) : ((var_1_11 - 99999.75))))) ? ((last_1_var_1_29 && last_1_var_1_31) ? (var_1_28 == ((signed long int) last_1_var_1_1)) : (var_1_28 == ((signed long int) last_1_var_1_1))) : 1)) && ((! (var_1_10 <= 16.8)) ? (var_1_29 == ((unsigned char) (var_1_23 && ((var_1_24 || last_1_var_1_22) || var_1_30)))) : (((last_1_var_1_28 * (- 2)) <= 100) ? (last_1_var_1_22 ? (var_1_29 == ((unsigned char) 0)) : (var_1_29 == ((unsigned char) (var_1_23 && var_1_24)))) : 1))) && (var_1_31 == ((unsigned char) var_1_25)) ; [L196] RET, EXPR property() [L196] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_11=1000005, var_1_12=1000006, var_1_13=1000006, var_1_14=1000006, var_1_16=324/5, var_1_19=2000001/2, var_1_1=191, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=51/2, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=0, var_1_3=191, var_1_4=63, var_1_5=127, var_1_7=1000007, var_1_8=1000007, var_1_9=1000005] [L19] reach_error() VAL [\old(cond)=0, cond=0, isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_11=1000005, var_1_12=1000006, var_1_13=1000006, var_1_14=1000006, var_1_16=324/5, var_1_19=2000001/2, var_1_1=191, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=51/2, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=0, var_1_3=191, var_1_4=63, var_1_5=127, var_1_7=1000007, var_1_8=1000007, var_1_9=1000005] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 74 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.7s, OverallIterations: 7, TraceHistogramMax: 20, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1088 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1074 mSDsluCounter, 2202 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1430 mSDsCounter, 324 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1046 IncrementalHoareTripleChecker+Invalid, 1370 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 324 mSolverCounterUnsat, 772 mSDtfsCounter, 1046 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 877 GetRequests, 816 SyntacticMatches, 4 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 328 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=236occurred in iteration=6, InterpolantAutomatonStates: 55, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 6 MinimizatonAttempts, 305 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 1244 NumberOfCodeBlocks, 1244 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 1371 ConstructedInterpolants, 0 QuantifiedInterpolants, 3509 SizeOfPredicates, 6 NumberOfNonLiveVariables, 708 ConjunctsInSsa, 14 ConjunctsInUnsatCore, 10 InterpolantComputations, 4 PerfectInterpolantSequences, 7504/7600 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-12-19 11:16:37,066 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...