/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 false -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-45.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-20 22:56:27,268 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-20 22:56:27,334 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-20 22:56:27,338 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-20 22:56:27,338 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-20 22:56:27,360 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-20 22:56:27,360 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-20 22:56:27,361 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-20 22:56:27,361 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-20 22:56:27,364 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-20 22:56:27,364 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-20 22:56:27,364 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-20 22:56:27,365 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-20 22:56:27,366 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-20 22:56:27,366 INFO L153 SettingsManager]: * Use SBE=true [2023-12-20 22:56:27,366 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-20 22:56:27,366 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-20 22:56:27,366 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-20 22:56:27,366 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-20 22:56:27,367 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-20 22:56:27,367 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-20 22:56:27,368 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-20 22:56:27,368 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-20 22:56:27,368 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-20 22:56:27,368 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-20 22:56:27,368 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-20 22:56:27,368 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-20 22:56:27,369 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-20 22:56:27,369 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-20 22:56:27,369 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-20 22:56:27,370 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-20 22:56:27,370 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-20 22:56:27,370 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-20 22:56:27,370 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-20 22:56:27,370 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-20 22:56:27,371 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-20 22:56:27,371 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-20 22:56:27,371 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-20 22:56:27,371 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-20 22:56:27,371 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-20 22:56:27,371 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-20 22:56:27,371 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-20 22:56:27,371 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-20 22:56:27,371 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 -> false [2023-12-20 22:56:27,553 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-20 22:56:27,567 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-20 22:56:27,569 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-20 22:56:27,570 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-20 22:56:27,570 INFO L274 PluginConnector]: CDTParser initialized [2023-12-20 22:56:27,571 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-45.i [2023-12-20 22:56:28,586 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-20 22:56:28,708 INFO L384 CDTParser]: Found 1 translation units. [2023-12-20 22:56:28,708 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-45.i [2023-12-20 22:56:28,713 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d99c50fc/508aea431aac4e8f8cb72eeecddd7020/FLAG1a95dd6f4 [2023-12-20 22:56:28,722 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d99c50fc/508aea431aac4e8f8cb72eeecddd7020 [2023-12-20 22:56:28,724 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-20 22:56:28,724 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-20 22:56:28,725 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-20 22:56:28,725 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-20 22:56:28,728 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-20 22:56:28,728 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.12 10:56:28" (1/1) ... [2023-12-20 22:56:28,729 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58776667 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 10:56:28, skipping insertion in model container [2023-12-20 22:56:28,729 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.12 10:56:28" (1/1) ... [2023-12-20 22:56:28,743 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-20 22:56:28,851 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-45.i[915,928] [2023-12-20 22:56:28,896 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-20 22:56:28,903 INFO L202 MainTranslator]: Completed pre-run [2023-12-20 22:56:28,913 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_25-1loop_file-45.i[915,928] [2023-12-20 22:56:28,928 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-20 22:56:28,952 INFO L206 MainTranslator]: Completed translation [2023-12-20 22:56:28,952 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 10:56:28 WrapperNode [2023-12-20 22:56:28,952 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-20 22:56:28,953 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-20 22:56:28,953 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-20 22:56:28,953 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-20 22:56:28,957 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 10:56:28" (1/1) ... [2023-12-20 22:56:28,962 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 10:56:28" (1/1) ... [2023-12-20 22:56:28,988 INFO L138 Inliner]: procedures = 26, calls = 32, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 122 [2023-12-20 22:56:28,989 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-20 22:56:28,989 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-20 22:56:28,989 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-20 22:56:28,989 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-20 22:56:28,998 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 10:56:28" (1/1) ... [2023-12-20 22:56:28,998 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 10:56:28" (1/1) ... [2023-12-20 22:56:29,011 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 10:56:28" (1/1) ... [2023-12-20 22:56:29,019 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-20 22:56:29,020 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 10:56:28" (1/1) ... [2023-12-20 22:56:29,020 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 10:56:28" (1/1) ... [2023-12-20 22:56:29,024 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 10:56:28" (1/1) ... [2023-12-20 22:56:29,026 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 10:56:28" (1/1) ... [2023-12-20 22:56:29,026 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 10:56:28" (1/1) ... [2023-12-20 22:56:29,027 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 10:56:28" (1/1) ... [2023-12-20 22:56:29,029 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-20 22:56:29,029 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-20 22:56:29,029 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-20 22:56:29,029 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-20 22:56:29,030 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 10:56:28" (1/1) ... [2023-12-20 22:56:29,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-20 22:56:29,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 22:56:29,097 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-20 22:56:29,137 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-20 22:56:29,141 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-20 22:56:29,141 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-20 22:56:29,141 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-20 22:56:29,141 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-20 22:56:29,142 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-20 22:56:29,142 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-20 22:56:29,189 INFO L241 CfgBuilder]: Building ICFG [2023-12-20 22:56:29,190 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-20 22:56:29,332 INFO L282 CfgBuilder]: Performing block encoding [2023-12-20 22:56:29,364 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-20 22:56:29,365 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-20 22:56:29,365 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.12 10:56:29 BoogieIcfgContainer [2023-12-20 22:56:29,365 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-20 22:56:29,366 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-20 22:56:29,366 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-20 22:56:29,368 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-20 22:56:29,369 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.12 10:56:28" (1/3) ... [2023-12-20 22:56:29,369 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ab1e5ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.12 10:56:29, skipping insertion in model container [2023-12-20 22:56:29,369 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 10:56:28" (2/3) ... [2023-12-20 22:56:29,369 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ab1e5ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.12 10:56:29, skipping insertion in model container [2023-12-20 22:56:29,369 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.12 10:56:29" (3/3) ... [2023-12-20 22:56:29,370 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-45.i [2023-12-20 22:56:29,389 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-20 22:56:29,389 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-20 22:56:29,416 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-20 22:56:29,420 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;@5b75fe07, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-20 22:56:29,421 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-20 22:56:29,424 INFO L276 IsEmpty]: Start isEmpty. Operand has 48 states, 26 states have (on average 1.3461538461538463) internal successors, (35), 27 states have internal predecessors, (35), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2023-12-20 22:56:29,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2023-12-20 22:56:29,454 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 22:56:29,455 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 22:56:29,455 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 22:56:29,458 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 22:56:29,459 INFO L85 PathProgramCache]: Analyzing trace with hash 1661675722, now seen corresponding path program 1 times [2023-12-20 22:56:29,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 22:56:29,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098477433] [2023-12-20 22:56:29,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 22:56:29,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 22:56:29,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:56:29,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 22:56:29,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:56:29,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-20 22:56:29,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:56:29,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-20 22:56:29,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:56:29,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-20 22:56:29,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:56:29,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-20 22:56:29,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:56:29,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-12-20 22:56:29,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:56:29,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-20 22:56:29,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:56:29,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-20 22:56:29,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:56:29,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-20 22:56:29,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:56:29,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-20 22:56:29,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:56:29,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-12-20 22:56:29,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:56:29,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-12-20 22:56:29,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:56:29,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-12-20 22:56:29,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:56:29,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-12-20 22:56:29,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:56:29,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-20 22:56:29,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:56:29,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-20 22:56:29,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:56:29,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-12-20 22:56:29,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:56:29,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2023-12-20 22:56:29,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:56:29,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2023-12-20 22:56:29,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:56:29,663 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-12-20 22:56:29,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 22:56:29,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098477433] [2023-12-20 22:56:29,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2098477433] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 22:56:29,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 22:56:29,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-20 22:56:29,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219732039] [2023-12-20 22:56:29,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 22:56:29,668 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-20 22:56:29,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 22:56:29,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-20 22:56:29,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-20 22:56:29,686 INFO L87 Difference]: Start difference. First operand has 48 states, 26 states have (on average 1.3461538461538463) internal successors, (35), 27 states have internal predecessors, (35), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2023-12-20 22:56:29,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 22:56:29,715 INFO L93 Difference]: Finished difference Result 95 states and 164 transitions. [2023-12-20 22:56:29,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-20 22:56:29,717 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 115 [2023-12-20 22:56:29,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 22:56:29,721 INFO L225 Difference]: With dead ends: 95 [2023-12-20 22:56:29,721 INFO L226 Difference]: Without dead ends: 46 [2023-12-20 22:56:29,724 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 59 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-20 22:56:29,727 INFO L413 NwaCegarLoop]: 65 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, 65 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-20 22:56:29,729 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 65 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 22:56:29,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2023-12-20 22:56:29,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2023-12-20 22:56:29,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 25 states have (on average 1.2) internal successors, (30), 25 states have internal predecessors, (30), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2023-12-20 22:56:29,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 68 transitions. [2023-12-20 22:56:29,769 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 68 transitions. Word has length 115 [2023-12-20 22:56:29,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 22:56:29,769 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 68 transitions. [2023-12-20 22:56:29,770 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2023-12-20 22:56:29,771 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 68 transitions. [2023-12-20 22:56:29,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2023-12-20 22:56:29,775 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 22:56:29,775 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 22:56:29,775 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-20 22:56:29,776 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 22:56:29,778 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 22:56:29,779 INFO L85 PathProgramCache]: Analyzing trace with hash -575866160, now seen corresponding path program 1 times [2023-12-20 22:56:29,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 22:56:29,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978795909] [2023-12-20 22:56:29,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 22:56:29,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 22:56:30,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:56:34,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 22:56:34,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:56:34,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-20 22:56:34,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:56:34,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-20 22:56:34,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:56:34,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-20 22:56:34,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:56:34,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-20 22:56:34,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:56:34,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-12-20 22:56:34,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:56:34,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-20 22:56:34,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:56:35,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-20 22:56:35,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:56:35,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-20 22:56:35,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:56:35,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-20 22:56:35,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:56:35,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-12-20 22:56:35,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:56:35,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-12-20 22:56:35,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:56:35,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-12-20 22:56:35,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:56:35,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-12-20 22:56:35,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:56:35,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-20 22:56:35,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:56:35,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-20 22:56:35,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:56:35,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-12-20 22:56:35,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:56:35,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2023-12-20 22:56:35,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:56:35,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2023-12-20 22:56:35,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:56:35,057 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 54 proven. 90 refuted. 0 times theorem prover too weak. 540 trivial. 0 not checked. [2023-12-20 22:56:35,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 22:56:35,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978795909] [2023-12-20 22:56:35,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [978795909] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 22:56:35,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [133525628] [2023-12-20 22:56:35,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 22:56:35,058 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 22:56:35,058 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 22:56:35,082 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-20 22:56:35,123 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-20 22:58:24,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:58:24,509 INFO L262 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 35 conjunts are in the unsatisfiable core [2023-12-20 22:58:24,515 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 22:58:25,850 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 467 proven. 120 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2023-12-20 22:58:25,850 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-20 22:58:44,697 WARN L293 SmtUtils]: Spent 8.04s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-20 22:59:39,054 WARN L293 SmtUtils]: Spent 16.41s on a formula simplification that was a NOOP. DAG size: 60 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-20 22:59:51,829 WARN L293 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-20 23:00:12,030 WARN L293 SmtUtils]: Spent 8.02s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-20 23:00:20,086 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse1 (mod (+ 27 c_~var_1_11~0) 32)) (.cse2 (div (mod (+ 4294967291 c_~var_1_11~0) 4294967296) 32)) (.cse3 (mod c_~var_1_12~0 4294967296))) (or (= c_assume_abort_if_not_~cond 0) (let ((.cse0 (mod (+ 4160749568 .cse2) 4294967296))) (< (+ (* .cse0 32) .cse1) (+ 136365215680 (* 137438953472 (div (+ (- 4227858433) .cse0) 4294967296))))) (< 125 (mod (div (mod (+ 4294967291 c_~var_1_12~0 c_~var_1_11~0) 4294967296) 32) 4294967296)) (and (or (< .cse3 1073741824) (not (= |c_assume_abort_if_not_#in~cond| 1))) (or (< 1073741823 .cse3) (not (= |c_assume_abort_if_not_#in~cond| 0)))) (let ((.cse4 (mod (+ 4160749569 .cse2) 4294967296))) (< (+ 272730423328 (* 137438953472 (div (+ .cse4 (- 4261412990)) 4294967296))) (+ (* 32 .cse4) .cse1))) (< 2147483647 .cse3))) is different from true [2023-12-20 23:00:45,069 WARN L293 SmtUtils]: Spent 8.02s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-20 23:00:53,106 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse1 (mod (+ 27 c_~var_1_11~0) 32)) (.cse2 (div (mod (+ 4294967291 c_~var_1_11~0) 4294967296) 32)) (.cse4 (mod c_~var_1_12~0 4294967296))) (or (let ((.cse0 (mod (+ 4160749568 .cse2) 4294967296))) (< (+ (* .cse0 32) .cse1) (+ 136365215680 (* 137438953472 (div (+ (- 4227858433) .cse0) 4294967296))))) (< 125 (mod (div (mod (+ 4294967291 c_~var_1_12~0 c_~var_1_11~0) 4294967296) 32) 4294967296)) (let ((.cse3 (mod (+ 4160749569 .cse2) 4294967296))) (< (+ 272730423328 (* 137438953472 (div (+ .cse3 (- 4261412990)) 4294967296))) (+ (* 32 .cse3) .cse1))) (< 2147483647 .cse4) (< .cse4 1073741824) (not (= |c_assume_abort_if_not_#in~cond| 1)))) is different from true [2023-12-20 23:01:04,363 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 121 proven. 112 refuted. 21 times theorem prover too weak. 426 trivial. 4 not checked. [2023-12-20 23:01:04,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [133525628] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-20 23:01:04,364 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-20 23:01:04,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 22, 20] total 46 [2023-12-20 23:01:04,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372337441] [2023-12-20 23:01:04,365 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-20 23:01:04,366 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2023-12-20 23:01:04,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 23:01:04,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2023-12-20 23:01:04,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=417, Invalid=1474, Unknown=9, NotChecked=170, Total=2070 [2023-12-20 23:01:04,368 INFO L87 Difference]: Start difference. First operand 46 states and 68 transitions. Second operand has 46 states, 43 states have (on average 1.9534883720930232) internal successors, (84), 39 states have internal predecessors, (84), 15 states have call successors, (44), 8 states have call predecessors, (44), 14 states have return successors, (46), 15 states have call predecessors, (46), 15 states have call successors, (46) [2023-12-20 23:01:09,031 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-20 23:01:14,118 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-20 23:01:15,441 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-20 23:01:23,666 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-20 23:01:56,221 WARN L293 SmtUtils]: Spent 25.94s on a formula simplification. DAG size of input: 63 DAG size of output: 55 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-20 23:02:02,591 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.39s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-20 23:02:06,604 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-20 23:02:54,644 WARN L293 SmtUtils]: Spent 28.19s on a formula simplification. DAG size of input: 65 DAG size of output: 61 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-20 23:03:03,284 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse5 (mod (div (mod (+ 4294967291 c_~var_1_12~0 c_~var_1_11~0) 4294967296) 32) 4294967296))) (let ((.cse0 (mod c_~var_1_11~0 4294967296)) (.cse4 (< (mod c_~var_1_16~0 256) (+ .cse5 1))) (.cse3 (not (= |c_assume_abort_if_not_#in~cond| 0))) (.cse1 (< 125 .cse5)) (.cse2 (mod c_~var_1_12~0 4294967296))) (and (<= 1073741823 .cse0) (<= .cse0 2147483647) (or .cse1 (< .cse2 2147483648) .cse3) (or (< c_~var_1_16~0 127) .cse4 .cse3) (or .cse4 (< 126 c_~var_1_16~0) (< .cse5 126) .cse3) (let ((.cse7 (mod (+ 27 c_~var_1_11~0) 32)) (.cse8 (div (mod (+ 4294967291 c_~var_1_11~0) 4294967296) 32))) (or (let ((.cse6 (mod (+ 4160749568 .cse8) 4294967296))) (< (+ (* .cse6 32) .cse7) (+ 136365215680 (* 137438953472 (div (+ (- 4227858433) .cse6) 4294967296))))) .cse1 (let ((.cse9 (mod (+ 4160749569 .cse8) 4294967296))) (< (+ 272730423328 (* 137438953472 (div (+ .cse9 (- 4261412990)) 4294967296))) (+ (* 32 .cse9) .cse7))) (< 2147483647 .cse2) (< .cse2 1073741824) (not (= |c_assume_abort_if_not_#in~cond| 1))))))) is different from false [2023-12-20 23:03:46,216 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-20 23:03:55,410 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-20 23:03:59,941 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.78s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-20 23:04:05,204 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-20 23:04:50,711 WARN L293 SmtUtils]: Spent 28.14s on a formula simplification. DAG size of input: 89 DAG size of output: 85 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-20 23:04:55,640 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-20 23:04:59,731 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-20 23:05:56,871 WARN L293 SmtUtils]: Spent 28.33s on a formula simplification. DAG size of input: 91 DAG size of output: 87 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-20 23:06:44,537 WARN L293 SmtUtils]: Spent 9.05s on a formula simplification. DAG size of input: 89 DAG size of output: 48 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-20 23:07:46,278 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-20 23:08:01,775 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-20 23:08:01,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 23:08:01,776 INFO L93 Difference]: Finished difference Result 236 states and 302 transitions. [2023-12-20 23:08:01,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2023-12-20 23:08:01,781 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 43 states have (on average 1.9534883720930232) internal successors, (84), 39 states have internal predecessors, (84), 15 states have call successors, (44), 8 states have call predecessors, (44), 14 states have return successors, (46), 15 states have call predecessors, (46), 15 states have call successors, (46) Word has length 115 [2023-12-20 23:08:01,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 23:08:01,784 INFO L225 Difference]: With dead ends: 236 [2023-12-20 23:08:01,784 INFO L226 Difference]: Without dead ends: 191 [2023-12-20 23:08:01,787 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 339 GetRequests, 241 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 2299 ImplicationChecksByTransitivity, 431.7s TimeCoverageRelationStatistics Valid=2369, Invalid=6912, Unknown=43, NotChecked=576, Total=9900 [2023-12-20 23:08:01,787 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 373 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 965 mSolverCounterSat, 257 mSolverCounterUnsat, 10 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 55.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 378 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 1728 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 257 IncrementalHoareTripleChecker+Valid, 965 IncrementalHoareTripleChecker+Invalid, 10 IncrementalHoareTripleChecker+Unknown, 496 IncrementalHoareTripleChecker+Unchecked, 55.4s IncrementalHoareTripleChecker+Time [2023-12-20 23:08:01,788 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [378 Valid, 402 Invalid, 1728 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [257 Valid, 965 Invalid, 10 Unknown, 496 Unchecked, 55.4s Time] [2023-12-20 23:08:01,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2023-12-20 23:08:01,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 157. [2023-12-20 23:08:01,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 98 states have (on average 1.1224489795918366) internal successors, (110), 99 states have internal predecessors, (110), 43 states have call successors, (43), 15 states have call predecessors, (43), 15 states have return successors, (43), 42 states have call predecessors, (43), 43 states have call successors, (43) [2023-12-20 23:08:01,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 196 transitions. [2023-12-20 23:08:01,817 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 196 transitions. Word has length 115 [2023-12-20 23:08:01,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 23:08:01,817 INFO L495 AbstractCegarLoop]: Abstraction has 157 states and 196 transitions. [2023-12-20 23:08:01,817 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 43 states have (on average 1.9534883720930232) internal successors, (84), 39 states have internal predecessors, (84), 15 states have call successors, (44), 8 states have call predecessors, (44), 14 states have return successors, (46), 15 states have call predecessors, (46), 15 states have call successors, (46) [2023-12-20 23:08:01,818 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 196 transitions. [2023-12-20 23:08:01,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2023-12-20 23:08:01,819 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 23:08:01,819 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 23:08:01,829 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-20 23:08:02,028 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 23:08:02,029 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 23:08:02,029 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 23:08:02,030 INFO L85 PathProgramCache]: Analyzing trace with hash -575806578, now seen corresponding path program 1 times [2023-12-20 23:08:02,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 23:08:02,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808371935] [2023-12-20 23:08:02,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 23:08:02,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 23:08:02,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-20 23:08:02,094 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-20 23:08:02,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-20 23:08:02,308 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-20 23:08:02,309 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-20 23:08:02,310 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-20 23:08:02,313 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-20 23:08:02,315 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-12-20 23:08:02,317 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-20 23:08:02,381 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.12 11:08:02 BoogieIcfgContainer [2023-12-20 23:08:02,381 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-20 23:08:02,382 INFO L158 Benchmark]: Toolchain (without parser) took 693657.28ms. Allocated memory was 198.2MB in the beginning and 433.1MB in the end (delta: 234.9MB). Free memory was 163.4MB in the beginning and 389.2MB in the end (delta: -225.8MB). Peak memory consumption was 251.6MB. Max. memory is 8.0GB. [2023-12-20 23:08:02,382 INFO L158 Benchmark]: CDTParser took 0.40ms. Allocated memory is still 198.2MB. Free memory was 156.4MB in the beginning and 156.3MB in the end (delta: 146.8kB). There was no memory consumed. Max. memory is 8.0GB. [2023-12-20 23:08:02,382 INFO L158 Benchmark]: CACSL2BoogieTranslator took 227.30ms. Allocated memory is still 198.2MB. Free memory was 163.3MB in the beginning and 150.4MB in the end (delta: 12.9MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2023-12-20 23:08:02,382 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.89ms. Allocated memory is still 198.2MB. Free memory was 150.4MB in the beginning and 148.0MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-20 23:08:02,383 INFO L158 Benchmark]: Boogie Preprocessor took 39.37ms. Allocated memory is still 198.2MB. Free memory was 148.0MB in the beginning and 145.6MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-20 23:08:02,383 INFO L158 Benchmark]: RCFGBuilder took 335.85ms. Allocated memory is still 198.2MB. Free memory was 145.4MB in the beginning and 127.3MB in the end (delta: 18.1MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. [2023-12-20 23:08:02,383 INFO L158 Benchmark]: TraceAbstraction took 693014.94ms. Allocated memory was 198.2MB in the beginning and 433.1MB in the end (delta: 234.9MB). Free memory was 126.7MB in the beginning and 389.2MB in the end (delta: -262.5MB). Peak memory consumption was 214.9MB. Max. memory is 8.0GB. [2023-12-20 23:08:02,384 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.40ms. Allocated memory is still 198.2MB. Free memory was 156.4MB in the beginning and 156.3MB in the end (delta: 146.8kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 227.30ms. Allocated memory is still 198.2MB. Free memory was 163.3MB in the beginning and 150.4MB in the end (delta: 12.9MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 35.89ms. Allocated memory is still 198.2MB. Free memory was 150.4MB in the beginning and 148.0MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 39.37ms. Allocated memory is still 198.2MB. Free memory was 148.0MB in the beginning and 145.6MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 335.85ms. Allocated memory is still 198.2MB. Free memory was 145.4MB in the beginning and 127.3MB in the end (delta: 18.1MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. * TraceAbstraction took 693014.94ms. Allocated memory was 198.2MB in the beginning and 433.1MB in the end (delta: 234.9MB). Free memory was 126.7MB in the beginning and 389.2MB in the end (delta: -262.5MB). Peak memory consumption was 214.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 93. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 999999.2; [L23] double var_1_6 = 0.0; [L24] double var_1_7 = 5.9; [L25] double var_1_8 = 255.6; [L26] unsigned long int var_1_9 = 4; [L27] unsigned char var_1_10 = 0; [L28] unsigned long int var_1_11 = 1142722175; [L29] unsigned long int var_1_12 = 1231257437; [L30] signed char var_1_13 = -10; [L31] signed char var_1_14 = 100; [L32] signed char var_1_15 = 4; [L33] signed char var_1_16 = 64; [L34] signed char var_1_17 = 1; [L35] signed char var_1_18 = -8; [L36] unsigned char var_1_19 = 4; [L97] isInitial = 1 [L98] FCALL initially() [L99] int k_loop; [L100] k_loop = 0 VAL [isInitial=1, k_loop=0, var_1_10=0, var_1_11=1142722175, var_1_12=1231257437, var_1_13=-10, var_1_14=100, var_1_15=4, var_1_16=64, var_1_17=1, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_6=0, var_1_7=59/10, var_1_8=1278/5, var_1_9=4] [L100] COND TRUE k_loop < 1 [L101] FCALL updateLastVariables() [L102] CALL updateVariables() [L59] var_1_6 = __VERIFIER_nondet_double() [L60] CALL assume_abort_if_not((var_1_6 >= 4611686.018427382800e+12F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854765600e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1142722175, var_1_12=1231257437, var_1_13=-10, var_1_14=100, var_1_15=4, var_1_16=64, var_1_17=1, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_7=59/10, var_1_8=1278/5, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=0, var_1_11=1142722175, var_1_12=1231257437, var_1_13=-10, var_1_14=100, var_1_15=4, var_1_16=64, var_1_17=1, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_7=59/10, var_1_8=1278/5, var_1_9=4] [L60] RET assume_abort_if_not((var_1_6 >= 4611686.018427382800e+12F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854765600e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_11=1142722175, var_1_12=1231257437, var_1_13=-10, var_1_14=100, var_1_15=4, var_1_16=64, var_1_17=1, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_7=59/10, var_1_8=1278/5, var_1_9=4] [L61] var_1_7 = __VERIFIER_nondet_double() [L62] CALL assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 4611686.018427382800e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1142722175, var_1_12=1231257437, var_1_13=-10, var_1_14=100, var_1_15=4, var_1_16=64, var_1_17=1, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_8=1278/5, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=0, var_1_11=1142722175, var_1_12=1231257437, var_1_13=-10, var_1_14=100, var_1_15=4, var_1_16=64, var_1_17=1, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_8=1278/5, var_1_9=4] [L62] RET assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 4611686.018427382800e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_11=1142722175, var_1_12=1231257437, var_1_13=-10, var_1_14=100, var_1_15=4, var_1_16=64, var_1_17=1, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_8=1278/5, var_1_9=4] [L63] var_1_8 = __VERIFIER_nondet_double() [L64] CALL assume_abort_if_not((var_1_8 >= 0.0F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1142722175, var_1_12=1231257437, var_1_13=-10, var_1_14=100, var_1_15=4, var_1_16=64, var_1_17=1, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=0, var_1_11=1142722175, var_1_12=1231257437, var_1_13=-10, var_1_14=100, var_1_15=4, var_1_16=64, var_1_17=1, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_9=4] [L64] RET assume_abort_if_not((var_1_8 >= 0.0F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_11=1142722175, var_1_12=1231257437, var_1_13=-10, var_1_14=100, var_1_15=4, var_1_16=64, var_1_17=1, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_9=4] [L65] var_1_10 = __VERIFIER_nondet_uchar() [L66] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=1142722175, var_1_12=1231257437, var_1_13=-10, var_1_14=100, var_1_15=4, var_1_16=64, var_1_17=1, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_11=1142722175, var_1_12=1231257437, var_1_13=-10, var_1_14=100, var_1_15=4, var_1_16=64, var_1_17=1, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_9=4] [L66] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, var_1_11=1142722175, var_1_12=1231257437, var_1_13=-10, var_1_14=100, var_1_15=4, var_1_16=64, var_1_17=1, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_9=4] [L67] CALL assume_abort_if_not(var_1_10 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1142722175, var_1_12=1231257437, var_1_13=-10, var_1_14=100, var_1_15=4, var_1_16=64, var_1_17=1, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=1, var_1_11=1142722175, var_1_12=1231257437, var_1_13=-10, var_1_14=100, var_1_15=4, var_1_16=64, var_1_17=1, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_9=4] [L67] RET assume_abort_if_not(var_1_10 <= 1) VAL [isInitial=1, var_1_10=1, var_1_11=1142722175, var_1_12=1231257437, var_1_13=-10, var_1_14=100, var_1_15=4, var_1_16=64, var_1_17=1, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_9=4] [L68] var_1_11 = __VERIFIER_nondet_ulong() [L69] CALL assume_abort_if_not(var_1_11 >= 1073741823) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=2147483624, var_1_12=1231257437, var_1_13=-10, var_1_14=100, var_1_15=4, var_1_16=64, var_1_17=1, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=1, var_1_11=2147483624, var_1_12=1231257437, var_1_13=-10, var_1_14=100, var_1_15=4, var_1_16=64, var_1_17=1, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_9=4] [L69] RET assume_abort_if_not(var_1_11 >= 1073741823) VAL [isInitial=1, var_1_10=1, var_1_11=2147483624, var_1_12=1231257437, var_1_13=-10, var_1_14=100, var_1_15=4, var_1_16=64, var_1_17=1, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_9=4] [L70] CALL assume_abort_if_not(var_1_11 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=2147483624, var_1_12=1231257437, var_1_13=-10, var_1_14=100, var_1_15=4, var_1_16=64, var_1_17=1, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=1, var_1_11=2147483624, var_1_12=1231257437, var_1_13=-10, var_1_14=100, var_1_15=4, var_1_16=64, var_1_17=1, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_9=4] [L70] RET assume_abort_if_not(var_1_11 <= 2147483647) VAL [isInitial=1, var_1_10=1, var_1_11=2147483624, var_1_12=1231257437, var_1_13=-10, var_1_14=100, var_1_15=4, var_1_16=64, var_1_17=1, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_9=4] [L71] var_1_12 = __VERIFIER_nondet_ulong() [L72] CALL assume_abort_if_not(var_1_12 >= 1073741824) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=2147483624, var_1_12=2147483647, var_1_13=-10, var_1_14=100, var_1_15=4, var_1_16=64, var_1_17=1, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=1, var_1_11=2147483624, var_1_12=2147483647, var_1_13=-10, var_1_14=100, var_1_15=4, var_1_16=64, var_1_17=1, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_9=4] [L72] RET assume_abort_if_not(var_1_12 >= 1073741824) VAL [isInitial=1, var_1_10=1, var_1_11=2147483624, var_1_12=2147483647, var_1_13=-10, var_1_14=100, var_1_15=4, var_1_16=64, var_1_17=1, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_9=4] [L73] CALL assume_abort_if_not(var_1_12 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=2147483624, var_1_12=2147483647, var_1_13=-10, var_1_14=100, var_1_15=4, var_1_16=64, var_1_17=1, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=1, var_1_11=2147483624, var_1_12=2147483647, var_1_13=-10, var_1_14=100, var_1_15=4, var_1_16=64, var_1_17=1, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_9=4] [L73] RET assume_abort_if_not(var_1_12 <= 2147483647) VAL [isInitial=1, var_1_10=1, var_1_11=2147483624, var_1_12=2147483647, var_1_13=-10, var_1_14=100, var_1_15=4, var_1_16=64, var_1_17=1, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_9=4] [L74] var_1_14 = __VERIFIER_nondet_char() [L75] CALL assume_abort_if_not(var_1_14 >= -1) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=2147483624, var_1_12=2147483647, var_1_13=-10, var_1_14=126, var_1_15=4, var_1_16=64, var_1_17=1, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=1, var_1_11=2147483624, var_1_12=2147483647, var_1_13=-10, var_1_14=126, var_1_15=4, var_1_16=64, var_1_17=1, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_9=4] [L75] RET assume_abort_if_not(var_1_14 >= -1) VAL [isInitial=1, var_1_10=1, var_1_11=2147483624, var_1_12=2147483647, var_1_13=-10, var_1_14=126, var_1_15=4, var_1_16=64, var_1_17=1, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_9=4] [L76] CALL assume_abort_if_not(var_1_14 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=2147483624, var_1_12=2147483647, var_1_13=-10, var_1_14=126, var_1_15=4, var_1_16=64, var_1_17=1, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=1, var_1_11=2147483624, var_1_12=2147483647, var_1_13=-10, var_1_14=126, var_1_15=4, var_1_16=64, var_1_17=1, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_9=4] [L76] RET assume_abort_if_not(var_1_14 <= 126) VAL [isInitial=1, var_1_10=1, var_1_11=2147483624, var_1_12=2147483647, var_1_13=-10, var_1_14=126, var_1_15=4, var_1_16=64, var_1_17=1, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_9=4] [L77] var_1_15 = __VERIFIER_nondet_char() [L78] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=2147483624, var_1_12=2147483647, var_1_13=-10, var_1_14=126, var_1_15=126, var_1_16=64, var_1_17=1, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=1, var_1_11=2147483624, var_1_12=2147483647, var_1_13=-10, var_1_14=126, var_1_15=126, var_1_16=64, var_1_17=1, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_9=4] [L78] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, var_1_10=1, var_1_11=2147483624, var_1_12=2147483647, var_1_13=-10, var_1_14=126, var_1_15=126, var_1_16=64, var_1_17=1, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_9=4] [L79] CALL assume_abort_if_not(var_1_15 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=2147483624, var_1_12=2147483647, var_1_13=-10, var_1_14=126, var_1_15=126, var_1_16=64, var_1_17=1, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=1, var_1_11=2147483624, var_1_12=2147483647, var_1_13=-10, var_1_14=126, var_1_15=126, var_1_16=64, var_1_17=1, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_9=4] [L79] RET assume_abort_if_not(var_1_15 <= 126) VAL [isInitial=1, var_1_10=1, var_1_11=2147483624, var_1_12=2147483647, var_1_13=-10, var_1_14=126, var_1_15=126, var_1_16=64, var_1_17=1, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_9=4] [L80] var_1_16 = __VERIFIER_nondet_char() [L81] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=2147483624, var_1_12=2147483647, var_1_13=-10, var_1_14=126, var_1_15=126, var_1_16=48, var_1_17=1, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=1, var_1_11=2147483624, var_1_12=2147483647, var_1_13=-10, var_1_14=126, var_1_15=126, var_1_16=48, var_1_17=1, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_9=4] [L81] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, var_1_10=1, var_1_11=2147483624, var_1_12=2147483647, var_1_13=-10, var_1_14=126, var_1_15=126, var_1_16=48, var_1_17=1, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_9=4] [L82] CALL assume_abort_if_not(var_1_16 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=2147483624, var_1_12=2147483647, var_1_13=-10, var_1_14=126, var_1_15=126, var_1_16=48, var_1_17=1, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=1, var_1_11=2147483624, var_1_12=2147483647, var_1_13=-10, var_1_14=126, var_1_15=126, var_1_16=48, var_1_17=1, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_9=4] [L82] RET assume_abort_if_not(var_1_16 <= 126) VAL [isInitial=1, var_1_10=1, var_1_11=2147483624, var_1_12=2147483647, var_1_13=-10, var_1_14=126, var_1_15=126, var_1_16=48, var_1_17=1, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_9=4] [L83] var_1_17 = __VERIFIER_nondet_char() [L84] CALL assume_abort_if_not(var_1_17 >= -63) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=2147483624, var_1_12=2147483647, var_1_13=-10, var_1_14=126, var_1_15=126, var_1_16=48, var_1_17=-63, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=1, var_1_11=2147483624, var_1_12=2147483647, var_1_13=-10, var_1_14=126, var_1_15=126, var_1_16=48, var_1_17=-63, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_9=4] [L84] RET assume_abort_if_not(var_1_17 >= -63) VAL [isInitial=1, var_1_10=1, var_1_11=2147483624, var_1_12=2147483647, var_1_13=-10, var_1_14=126, var_1_15=126, var_1_16=48, var_1_17=-63, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_9=4] [L85] CALL assume_abort_if_not(var_1_17 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=2147483624, var_1_12=2147483647, var_1_13=-10, var_1_14=126, var_1_15=126, var_1_16=48, var_1_17=-63, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=1, var_1_11=2147483624, var_1_12=2147483647, var_1_13=-10, var_1_14=126, var_1_15=126, var_1_16=48, var_1_17=-63, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_9=4] [L85] RET assume_abort_if_not(var_1_17 <= 63) VAL [isInitial=1, var_1_10=1, var_1_11=2147483624, var_1_12=2147483647, var_1_13=-10, var_1_14=126, var_1_15=126, var_1_16=48, var_1_17=-63, var_1_18=-8, var_1_19=4, var_1_1=4999996/5, var_1_9=4] [L86] var_1_18 = __VERIFIER_nondet_char() [L87] CALL assume_abort_if_not(var_1_18 >= -63) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=2147483624, var_1_12=2147483647, var_1_13=-10, var_1_14=126, var_1_15=126, var_1_16=48, var_1_17=-63, var_1_18=62, var_1_19=4, var_1_1=4999996/5, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=1, var_1_11=2147483624, var_1_12=2147483647, var_1_13=-10, var_1_14=126, var_1_15=126, var_1_16=48, var_1_17=-63, var_1_18=62, var_1_19=4, var_1_1=4999996/5, var_1_9=4] [L87] RET assume_abort_if_not(var_1_18 >= -63) VAL [isInitial=1, var_1_10=1, var_1_11=2147483624, var_1_12=2147483647, var_1_13=-10, var_1_14=126, var_1_15=126, var_1_16=48, var_1_17=-63, var_1_18=62, var_1_19=4, var_1_1=4999996/5, var_1_9=4] [L88] CALL assume_abort_if_not(var_1_18 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=2147483624, var_1_12=2147483647, var_1_13=-10, var_1_14=126, var_1_15=126, var_1_16=48, var_1_17=-63, var_1_18=62, var_1_19=4, var_1_1=4999996/5, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=1, var_1_11=2147483624, var_1_12=2147483647, var_1_13=-10, var_1_14=126, var_1_15=126, var_1_16=48, var_1_17=-63, var_1_18=62, var_1_19=4, var_1_1=4999996/5, var_1_9=4] [L88] RET assume_abort_if_not(var_1_18 <= 63) VAL [isInitial=1, var_1_10=1, var_1_11=2147483624, var_1_12=2147483647, var_1_13=-10, var_1_14=126, var_1_15=126, var_1_16=48, var_1_17=-63, var_1_18=62, var_1_19=4, var_1_1=4999996/5, var_1_9=4] [L102] RET updateVariables() [L103] CALL step() [L40] COND TRUE \read(var_1_10) [L41] var_1_9 = ((var_1_11 + var_1_12) - 5u) VAL [isInitial=1, var_1_10=1, var_1_11=2147483624, var_1_12=2147483647, var_1_13=-10, var_1_14=126, var_1_15=126, var_1_16=48, var_1_17=-63, var_1_18=62, var_1_19=4, var_1_1=4999996/5, var_1_9=4294967266] [L43] var_1_19 = var_1_16 [L44] unsigned long int stepLocal_0 = ((((var_1_19 + var_1_9)) < (var_1_9)) ? ((var_1_19 + var_1_9)) : (var_1_9)); VAL [isInitial=1, stepLocal_0=18, var_1_10=1, var_1_11=2147483624, var_1_12=2147483647, var_1_13=-10, var_1_14=126, var_1_15=126, var_1_16=48, var_1_17=-63, var_1_18=62, var_1_19=48, var_1_1=4999996/5, var_1_9=4294967266] [L45] COND TRUE \read(var_1_10) [L46] var_1_13 = (var_1_14 - ((((((((var_1_15) < (var_1_16)) ? (var_1_15) : (var_1_16)))) < (50)) ? (((((var_1_15) < (var_1_16)) ? (var_1_15) : (var_1_16)))) : (50)))) VAL [isInitial=1, stepLocal_0=18, var_1_10=1, var_1_11=2147483624, var_1_12=2147483647, var_1_13=78, var_1_14=126, var_1_15=126, var_1_16=48, var_1_17=-63, var_1_18=62, var_1_19=48, var_1_1=4999996/5, var_1_9=4294967266] [L52] COND FALSE !((var_1_9 / 32) < (((((var_1_13 + var_1_9)) < (var_1_19)) ? ((var_1_13 + var_1_9)) : (var_1_19)))) [L55] var_1_1 = var_1_6 VAL [isInitial=1, stepLocal_0=18, var_1_10=1, var_1_11=2147483624, var_1_12=2147483647, var_1_13=78, var_1_14=126, var_1_15=126, var_1_16=48, var_1_17=-63, var_1_18=62, var_1_19=48, var_1_1=2147483629, var_1_6=2147483629, var_1_9=4294967266] [L103] RET step() [L104] CALL, EXPR property() [L93-L94] return (((((var_1_9 / 32) < (((((var_1_13 + var_1_9)) < (var_1_19)) ? ((var_1_13 + var_1_9)) : (var_1_19)))) ? (var_1_1 == ((double) ((var_1_6 - var_1_7) - var_1_8))) : (var_1_1 == ((double) var_1_6))) && (var_1_10 ? (var_1_9 == ((unsigned long int) ((var_1_11 + var_1_12) - 5u))) : 1)) && (var_1_10 ? (var_1_13 == ((signed char) (var_1_14 - ((((((((var_1_15) < (var_1_16)) ? (var_1_15) : (var_1_16)))) < (50)) ? (((((var_1_15) < (var_1_16)) ? (var_1_15) : (var_1_16)))) : (50)))))) : ((var_1_12 < (((((var_1_19 + var_1_9)) < (var_1_9)) ? ((var_1_19 + var_1_9)) : (var_1_9)))) ? (var_1_13 == ((signed char) (var_1_17 + var_1_18))) : 1))) && (var_1_19 == ((unsigned char) var_1_16)) ; [L104] RET, EXPR property() [L104] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, isInitial=1, var_1_10=1, var_1_11=2147483624, var_1_12=2147483647, var_1_13=78, var_1_14=126, var_1_15=126, var_1_16=48, var_1_17=-63, var_1_18=62, var_1_19=48, var_1_1=2147483629, var_1_6=2147483629, var_1_9=4294967266] [L19] reach_error() VAL [\old(cond)=0, cond=0, isInitial=1, var_1_10=1, var_1_11=2147483624, var_1_12=2147483647, var_1_13=78, var_1_14=126, var_1_15=126, var_1_16=48, var_1_17=-63, var_1_18=62, var_1_19=48, var_1_1=2147483629, var_1_6=2147483629, var_1_9=4294967266] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 48 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 692.9s, OverallIterations: 3, TraceHistogramMax: 19, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 417.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 10 mSolverCounterUnknown, 378 SdHoareTripleChecker+Valid, 55.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 373 mSDsluCounter, 467 SdHoareTripleChecker+Invalid, 55.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 496 IncrementalHoareTripleChecker+Unchecked, 331 mSDsCounter, 257 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 970 IncrementalHoareTripleChecker+Invalid, 1733 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 257 mSolverCounterUnsat, 136 mSDtfsCounter, 970 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 398 GetRequests, 300 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 2299 ImplicationChecksByTransitivity, 431.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=157occurred in iteration=2, InterpolantAutomatonStates: 69, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 2 MinimizatonAttempts, 34 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 109.7s SatisfiabilityAnalysisTime, 164.9s InterpolantComputationTime, 460 NumberOfCodeBlocks, 460 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 456 ConstructedInterpolants, 3 QuantifiedInterpolants, 5089 SizeOfPredicates, 15 NumberOfNonLiveVariables, 267 ConjunctsInSsa, 35 ConjunctsInUnsatCore, 4 InterpolantComputations, 1 PerfectInterpolantSequences, 2389/2736 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-20 23:08:02,431 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...