/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_25-1loop_file-19.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-15 20:52:47,226 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-15 20:52:47,290 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2023-12-15 20:52:47,294 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-15 20:52:47,295 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-15 20:52:47,316 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-15 20:52:47,317 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-15 20:52:47,317 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-15 20:52:47,317 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-15 20:52:47,320 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-15 20:52:47,320 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-15 20:52:47,321 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-15 20:52:47,321 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-15 20:52:47,322 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-15 20:52:47,322 INFO L153 SettingsManager]: * Use SBE=true [2023-12-15 20:52:47,322 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-15 20:52:47,322 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-15 20:52:47,323 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-15 20:52:47,323 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-15 20:52:47,323 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-15 20:52:47,324 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-15 20:52:47,324 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-15 20:52:47,324 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-15 20:52:47,324 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-15 20:52:47,324 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-15 20:52:47,324 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-15 20:52:47,325 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-15 20:52:47,325 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-15 20:52:47,325 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-15 20:52:47,325 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-15 20:52:47,326 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-15 20:52:47,326 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-15 20:52:47,326 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-15 20:52:47,326 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-15 20:52:47,326 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-15 20:52:47,327 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-15 20:52:47,327 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-15 20:52:47,327 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-15 20:52:47,327 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-15 20:52:47,327 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-15 20:52:47,327 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-15 20:52:47,327 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-15 20:52:47,327 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-15 20:52:47,327 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Use bitabs translation -> true [2023-12-15 20:52:47,517 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-15 20:52:47,534 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-15 20:52:47,535 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-15 20:52:47,536 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-15 20:52:47,536 INFO L274 PluginConnector]: CDTParser initialized [2023-12-15 20:52:47,537 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-19.i [2023-12-15 20:52:48,558 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-15 20:52:48,699 INFO L384 CDTParser]: Found 1 translation units. [2023-12-15 20:52:48,699 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-19.i [2023-12-15 20:52:48,712 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4dd85ed7d/46c9bdbc64c04f62a21411668dd60fcb/FLAG9618feaf9 [2023-12-15 20:52:48,728 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4dd85ed7d/46c9bdbc64c04f62a21411668dd60fcb [2023-12-15 20:52:48,730 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-15 20:52:48,731 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-15 20:52:48,733 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-15 20:52:48,733 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-15 20:52:48,736 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-15 20:52:48,736 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 08:52:48" (1/1) ... [2023-12-15 20:52:48,737 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ffbd53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:52:48, skipping insertion in model container [2023-12-15 20:52:48,737 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 08:52:48" (1/1) ... [2023-12-15 20:52:48,761 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-15 20:52:48,863 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-19.i[915,928] [2023-12-15 20:52:48,897 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-15 20:52:48,903 INFO L202 MainTranslator]: Completed pre-run [2023-12-15 20:52:48,910 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-19.i[915,928] [2023-12-15 20:52:48,927 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-15 20:52:48,937 INFO L206 MainTranslator]: Completed translation [2023-12-15 20:52:48,938 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:52:48 WrapperNode [2023-12-15 20:52:48,938 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-15 20:52:48,938 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-15 20:52:48,938 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-15 20:52:48,939 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-15 20:52:48,943 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:52:48" (1/1) ... [2023-12-15 20:52:48,948 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:52:48" (1/1) ... [2023-12-15 20:52:48,972 INFO L138 Inliner]: procedures = 26, calls = 30, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 129 [2023-12-15 20:52:48,973 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-15 20:52:48,973 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-15 20:52:48,973 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-15 20:52:48,973 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-15 20:52:48,980 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:52:48" (1/1) ... [2023-12-15 20:52:48,981 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:52:48" (1/1) ... [2023-12-15 20:52:48,984 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:52:48" (1/1) ... [2023-12-15 20:52:49,000 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2023-12-15 20:52:49,001 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:52:48" (1/1) ... [2023-12-15 20:52:49,001 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:52:48" (1/1) ... [2023-12-15 20:52:49,005 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:52:48" (1/1) ... [2023-12-15 20:52:49,007 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:52:48" (1/1) ... [2023-12-15 20:52:49,015 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:52:48" (1/1) ... [2023-12-15 20:52:49,016 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:52:48" (1/1) ... [2023-12-15 20:52:49,017 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-15 20:52:49,018 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-15 20:52:49,018 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-15 20:52:49,018 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-15 20:52:49,019 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:52:48" (1/1) ... [2023-12-15 20:52:49,031 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-15 20:52:49,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 20:52:49,053 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-15 20:52:49,074 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-15 20:52:49,081 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-15 20:52:49,081 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-15 20:52:49,082 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-15 20:52:49,082 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-15 20:52:49,082 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-15 20:52:49,082 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-15 20:52:49,172 INFO L241 CfgBuilder]: Building ICFG [2023-12-15 20:52:49,174 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-15 20:52:49,365 INFO L282 CfgBuilder]: Performing block encoding [2023-12-15 20:52:49,411 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-15 20:52:49,411 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-15 20:52:49,412 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 08:52:49 BoogieIcfgContainer [2023-12-15 20:52:49,412 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-15 20:52:49,413 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-15 20:52:49,413 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-15 20:52:49,415 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-15 20:52:49,415 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.12 08:52:48" (1/3) ... [2023-12-15 20:52:49,417 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15a1355 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 08:52:49, skipping insertion in model container [2023-12-15 20:52:49,417 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:52:48" (2/3) ... [2023-12-15 20:52:49,417 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15a1355 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 08:52:49, skipping insertion in model container [2023-12-15 20:52:49,417 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 08:52:49" (3/3) ... [2023-12-15 20:52:49,418 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-19.i [2023-12-15 20:52:49,429 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-15 20:52:49,429 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-15 20:52:49,456 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-15 20:52:49,462 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;@79f018b2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-15 20:52:49,462 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-15 20:52:49,466 INFO L276 IsEmpty]: Start isEmpty. Operand has 51 states, 31 states have (on average 1.4193548387096775) internal successors, (44), 32 states have internal predecessors, (44), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2023-12-15 20:52:49,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2023-12-15 20:52:49,478 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 20:52:49,479 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 20:52:49,479 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 20:52:49,484 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 20:52:49,485 INFO L85 PathProgramCache]: Analyzing trace with hash 724440957, now seen corresponding path program 1 times [2023-12-15 20:52:49,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 20:52:49,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556287336] [2023-12-15 20:52:49,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:52:49,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 20:52:49,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:52:49,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 20:52:49,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:52:49,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 20:52:49,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:52:49,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 20:52:49,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:52:49,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 20:52:49,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:52:49,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 20:52:49,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:52:49,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 20:52:49,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:52:49,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 20:52:49,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:52:49,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-15 20:52:49,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:52:49,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-15 20:52:49,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:52:49,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-15 20:52:49,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:52:49,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-15 20:52:49,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:52:49,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 20:52:49,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:52:49,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 20:52:49,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:52:49,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-15 20:52:49,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:52:49,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-15 20:52:49,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:52:49,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-12-15 20:52:49,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:52:49,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-12-15 20:52:49,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:52:49,754 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-12-15 20:52:49,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 20:52:49,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556287336] [2023-12-15 20:52:49,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1556287336] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 20:52:49,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 20:52:49,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-15 20:52:49,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879162037] [2023-12-15 20:52:49,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 20:52:49,760 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-15 20:52:49,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 20:52:49,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-15 20:52:49,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-15 20:52:49,781 INFO L87 Difference]: Start difference. First operand has 51 states, 31 states have (on average 1.4193548387096775) internal successors, (44), 32 states have internal predecessors, (44), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2023-12-15 20:52:49,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 20:52:49,818 INFO L93 Difference]: Finished difference Result 101 states and 172 transitions. [2023-12-15 20:52:49,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-15 20:52:49,830 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 109 [2023-12-15 20:52:49,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 20:52:49,834 INFO L225 Difference]: With dead ends: 101 [2023-12-15 20:52:49,835 INFO L226 Difference]: Without dead ends: 49 [2023-12-15 20:52:49,837 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-15 20:52:49,840 INFO L413 NwaCegarLoop]: 70 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, 70 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 20:52:49,841 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 70 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 20:52:49,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2023-12-15 20:52:49,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2023-12-15 20:52:49,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 30 states have (on average 1.3) internal successors, (39), 30 states have internal predecessors, (39), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2023-12-15 20:52:49,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 73 transitions. [2023-12-15 20:52:49,891 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 73 transitions. Word has length 109 [2023-12-15 20:52:49,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 20:52:49,892 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 73 transitions. [2023-12-15 20:52:49,892 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2023-12-15 20:52:49,893 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 73 transitions. [2023-12-15 20:52:49,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2023-12-15 20:52:49,897 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 20:52:49,897 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 20:52:49,897 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-15 20:52:49,897 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 20:52:49,898 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 20:52:49,898 INFO L85 PathProgramCache]: Analyzing trace with hash -1611074057, now seen corresponding path program 1 times [2023-12-15 20:52:49,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 20:52:49,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135732224] [2023-12-15 20:52:49,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:52:49,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 20:52:49,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:52:50,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 20:52:50,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:52:50,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 20:52:50,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:52:50,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 20:52:50,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:52:50,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 20:52:50,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:52:50,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 20:52:50,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:52:50,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 20:52:50,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:52:50,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 20:52:50,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:52:50,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-15 20:52:50,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:52:50,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-15 20:52:50,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:52:50,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-15 20:52:50,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:52:50,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-15 20:52:50,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:52:50,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 20:52:50,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:52:50,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 20:52:50,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:52:50,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-15 20:52:50,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:52:50,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-15 20:52:50,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:52:50,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-12-15 20:52:50,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:52:50,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-12-15 20:52:50,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:52:50,062 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-12-15 20:52:50,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 20:52:50,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135732224] [2023-12-15 20:52:50,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1135732224] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 20:52:50,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 20:52:50,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-15 20:52:50,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696707465] [2023-12-15 20:52:50,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 20:52:50,065 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 20:52:50,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 20:52:50,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 20:52:50,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 20:52:50,066 INFO L87 Difference]: Start difference. First operand 49 states and 73 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-12-15 20:52:50,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 20:52:50,099 INFO L93 Difference]: Finished difference Result 133 states and 197 transitions. [2023-12-15 20:52:50,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 20:52:50,099 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 109 [2023-12-15 20:52:50,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 20:52:50,101 INFO L225 Difference]: With dead ends: 133 [2023-12-15 20:52:50,101 INFO L226 Difference]: Without dead ends: 85 [2023-12-15 20:52:50,101 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 20:52:50,102 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 48 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 20:52:50,102 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 128 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 20:52:50,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2023-12-15 20:52:50,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 82. [2023-12-15 20:52:50,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 50 states have (on average 1.26) internal successors, (63), 51 states have internal predecessors, (63), 29 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2023-12-15 20:52:50,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 121 transitions. [2023-12-15 20:52:50,128 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 121 transitions. Word has length 109 [2023-12-15 20:52:50,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 20:52:50,128 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 121 transitions. [2023-12-15 20:52:50,129 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-12-15 20:52:50,129 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 121 transitions. [2023-12-15 20:52:50,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2023-12-15 20:52:50,130 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 20:52:50,130 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 20:52:50,130 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-15 20:52:50,130 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 20:52:50,130 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 20:52:50,131 INFO L85 PathProgramCache]: Analyzing trace with hash 2003834869, now seen corresponding path program 1 times [2023-12-15 20:52:50,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 20:52:50,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205692945] [2023-12-15 20:52:50,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:52:50,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 20:52:50,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-15 20:52:50,256 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-15 20:52:50,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-15 20:52:50,369 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-15 20:52:50,370 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-15 20:52:50,370 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-15 20:52:50,371 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-15 20:52:50,375 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-12-15 20:52:50,377 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-15 20:52:50,443 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.12 08:52:50 BoogieIcfgContainer [2023-12-15 20:52:50,444 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-15 20:52:50,444 INFO L158 Benchmark]: Toolchain (without parser) took 1713.51ms. Allocated memory is still 195.0MB. Free memory was 160.0MB in the beginning and 88.9MB in the end (delta: 71.1MB). Peak memory consumption was 72.0MB. Max. memory is 8.0GB. [2023-12-15 20:52:50,444 INFO L158 Benchmark]: CDTParser took 0.40ms. Allocated memory is still 195.0MB. Free memory is still 152.3MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-15 20:52:50,445 INFO L158 Benchmark]: CACSL2BoogieTranslator took 205.16ms. Allocated memory is still 195.0MB. Free memory was 160.0MB in the beginning and 147.0MB in the end (delta: 13.0MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2023-12-15 20:52:50,445 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.31ms. Allocated memory is still 195.0MB. Free memory was 147.0MB in the beginning and 144.6MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-15 20:52:50,445 INFO L158 Benchmark]: Boogie Preprocessor took 44.36ms. Allocated memory is still 195.0MB. Free memory was 144.6MB in the beginning and 141.7MB in the end (delta: 2.9MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-15 20:52:50,446 INFO L158 Benchmark]: RCFGBuilder took 393.90ms. Allocated memory is still 195.0MB. Free memory was 141.7MB in the beginning and 123.2MB in the end (delta: 18.5MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. [2023-12-15 20:52:50,446 INFO L158 Benchmark]: TraceAbstraction took 1030.54ms. Allocated memory is still 195.0MB. Free memory was 122.6MB in the beginning and 88.9MB in the end (delta: 33.7MB). Peak memory consumption was 35.3MB. Max. memory is 8.0GB. [2023-12-15 20:52:50,448 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 195.0MB. Free memory is still 152.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 205.16ms. Allocated memory is still 195.0MB. Free memory was 160.0MB in the beginning and 147.0MB in the end (delta: 13.0MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 34.31ms. Allocated memory is still 195.0MB. Free memory was 147.0MB in the beginning and 144.6MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 44.36ms. Allocated memory is still 195.0MB. Free memory was 144.6MB in the beginning and 141.7MB in the end (delta: 2.9MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 393.90ms. Allocated memory is still 195.0MB. Free memory was 141.7MB in the beginning and 123.2MB in the end (delta: 18.5MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. * TraceAbstraction took 1030.54ms. Allocated memory is still 195.0MB. Free memory was 122.6MB in the beginning and 88.9MB in the end (delta: 33.7MB). Peak memory consumption was 35.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 97, overapproximation of someBinaryArithmeticFLOAToperation at line 50. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed char var_1_1 = 8; [L23] unsigned char var_1_2 = 128; [L24] unsigned char var_1_3 = 64; [L25] unsigned long int var_1_4 = 1; [L26] unsigned long int var_1_5 = 5; [L27] signed char var_1_7 = 4; [L28] signed char var_1_8 = 100; [L29] unsigned char var_1_9 = 1; [L30] signed long int var_1_10 = -8; [L31] float var_1_11 = 255.2; [L32] float var_1_12 = 128.25; [L33] float var_1_13 = 100.5; [L34] float var_1_14 = 255.9; [L35] signed long int var_1_15 = -128; [L36] unsigned short int var_1_16 = 2; [L37] signed long int last_1_var_1_10 = -8; [L101] isInitial = 1 [L102] FCALL initially() [L103] int k_loop; [L104] k_loop = 0 VAL [isInitial=1, k_loop=0, last_1_var_1_10=-8, var_1_10=-8, var_1_11=1276/5, var_1_12=513/4, var_1_13=201/2, var_1_14=2559/10, var_1_15=-128, var_1_16=2, var_1_1=8, var_1_2=128, var_1_3=64, var_1_4=1, var_1_5=5, var_1_7=4, var_1_8=100, var_1_9=1] [L104] COND TRUE k_loop < 1 [L105] CALL updateLastVariables() [L94] last_1_var_1_10 = var_1_10 [L105] RET updateLastVariables() [L106] CALL updateVariables() [L65] var_1_2 = __VERIFIER_nondet_uchar() [L66] CALL assume_abort_if_not(var_1_2 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-8, var_1_10=-8, var_1_11=1276/5, var_1_12=513/4, var_1_13=201/2, var_1_14=2559/10, var_1_15=-128, var_1_16=2, var_1_1=8, var_1_2=127, var_1_3=64, var_1_4=1, var_1_5=5, var_1_7=4, var_1_8=100, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_10=-8, var_1_10=-8, var_1_11=1276/5, var_1_12=513/4, var_1_13=201/2, var_1_14=2559/10, var_1_15=-128, var_1_16=2, var_1_1=8, var_1_2=127, var_1_3=64, var_1_4=1, var_1_5=5, var_1_7=4, var_1_8=100, var_1_9=1] [L66] RET assume_abort_if_not(var_1_2 >= 127) VAL [isInitial=1, last_1_var_1_10=-8, var_1_10=-8, var_1_11=1276/5, var_1_12=513/4, var_1_13=201/2, var_1_14=2559/10, var_1_15=-128, var_1_16=2, var_1_1=8, var_1_2=127, var_1_3=64, var_1_4=1, var_1_5=5, var_1_7=4, var_1_8=100, var_1_9=1] [L67] CALL assume_abort_if_not(var_1_2 <= 255) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-8, var_1_10=-8, var_1_11=1276/5, var_1_12=513/4, var_1_13=201/2, var_1_14=2559/10, var_1_15=-128, var_1_16=2, var_1_1=8, var_1_2=127, var_1_3=64, var_1_4=1, var_1_5=5, var_1_7=4, var_1_8=100, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_10=-8, var_1_10=-8, var_1_11=1276/5, var_1_12=513/4, var_1_13=201/2, var_1_14=2559/10, var_1_15=-128, var_1_16=2, var_1_1=8, var_1_2=127, var_1_3=64, var_1_4=1, var_1_5=5, var_1_7=4, var_1_8=100, var_1_9=1] [L67] RET assume_abort_if_not(var_1_2 <= 255) VAL [isInitial=1, last_1_var_1_10=-8, var_1_10=-8, var_1_11=1276/5, var_1_12=513/4, var_1_13=201/2, var_1_14=2559/10, var_1_15=-128, var_1_16=2, var_1_1=8, var_1_2=127, var_1_3=64, var_1_4=1, var_1_5=5, var_1_7=4, var_1_8=100, var_1_9=1] [L68] var_1_3 = __VERIFIER_nondet_uchar() [L69] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-8, var_1_10=-8, var_1_11=1276/5, var_1_12=513/4, var_1_13=201/2, var_1_14=2559/10, var_1_15=-128, var_1_16=2, var_1_1=8, var_1_2=127, var_1_4=1, var_1_5=5, var_1_7=4, var_1_8=100, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_10=-8, var_1_10=-8, var_1_11=1276/5, var_1_12=513/4, var_1_13=201/2, var_1_14=2559/10, var_1_15=-128, var_1_16=2, var_1_1=8, var_1_2=127, var_1_4=1, var_1_5=5, var_1_7=4, var_1_8=100, var_1_9=1] [L69] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_10=-8, var_1_10=-8, var_1_11=1276/5, var_1_12=513/4, var_1_13=201/2, var_1_14=2559/10, var_1_15=-128, var_1_16=2, var_1_1=8, var_1_2=127, var_1_4=1, var_1_5=5, var_1_7=4, var_1_8=100, var_1_9=1] [L70] CALL assume_abort_if_not(var_1_3 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-8, var_1_10=-8, var_1_11=1276/5, var_1_12=513/4, var_1_13=201/2, var_1_14=2559/10, var_1_15=-128, var_1_16=2, var_1_1=8, var_1_2=127, var_1_3=63, var_1_4=1, var_1_5=5, var_1_7=4, var_1_8=100, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_10=-8, var_1_10=-8, var_1_11=1276/5, var_1_12=513/4, var_1_13=201/2, var_1_14=2559/10, var_1_15=-128, var_1_16=2, var_1_1=8, var_1_2=127, var_1_3=63, var_1_4=1, var_1_5=5, var_1_7=4, var_1_8=100, var_1_9=1] [L70] RET assume_abort_if_not(var_1_3 <= 127) VAL [isInitial=1, last_1_var_1_10=-8, var_1_10=-8, var_1_11=1276/5, var_1_12=513/4, var_1_13=201/2, var_1_14=2559/10, var_1_15=-128, var_1_16=2, var_1_1=8, var_1_2=127, var_1_3=63, var_1_4=1, var_1_5=5, var_1_7=4, var_1_8=100, var_1_9=1] [L71] var_1_4 = __VERIFIER_nondet_ulong() [L72] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-8, var_1_10=-8, var_1_11=1276/5, var_1_12=513/4, var_1_13=201/2, var_1_14=2559/10, var_1_15=-128, var_1_16=2, var_1_1=8, var_1_2=127, var_1_3=63, var_1_5=5, var_1_7=4, var_1_8=100, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_10=-8, var_1_10=-8, var_1_11=1276/5, var_1_12=513/4, var_1_13=201/2, var_1_14=2559/10, var_1_15=-128, var_1_16=2, var_1_1=8, var_1_2=127, var_1_3=63, var_1_5=5, var_1_7=4, var_1_8=100, var_1_9=1] [L72] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_10=-8, var_1_10=-8, var_1_11=1276/5, var_1_12=513/4, var_1_13=201/2, var_1_14=2559/10, var_1_15=-128, var_1_16=2, var_1_1=8, var_1_2=127, var_1_3=63, var_1_5=5, var_1_7=4, var_1_8=100, var_1_9=1] [L73] CALL assume_abort_if_not(var_1_4 <= 12) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-8, var_1_10=-8, var_1_11=1276/5, var_1_12=513/4, var_1_13=201/2, var_1_14=2559/10, var_1_15=-128, var_1_16=2, var_1_1=8, var_1_2=127, var_1_3=63, var_1_4=0, var_1_5=5, var_1_7=4, var_1_8=100, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_10=-8, var_1_10=-8, var_1_11=1276/5, var_1_12=513/4, var_1_13=201/2, var_1_14=2559/10, var_1_15=-128, var_1_16=2, var_1_1=8, var_1_2=127, var_1_3=63, var_1_4=0, var_1_5=5, var_1_7=4, var_1_8=100, var_1_9=1] [L73] RET assume_abort_if_not(var_1_4 <= 12) VAL [isInitial=1, last_1_var_1_10=-8, var_1_10=-8, var_1_11=1276/5, var_1_12=513/4, var_1_13=201/2, var_1_14=2559/10, var_1_15=-128, var_1_16=2, var_1_1=8, var_1_2=127, var_1_3=63, var_1_4=0, var_1_5=5, var_1_7=4, var_1_8=100, var_1_9=1] [L74] var_1_5 = __VERIFIER_nondet_ulong() [L75] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-8, var_1_10=-8, var_1_11=1276/5, var_1_12=513/4, var_1_13=201/2, var_1_14=2559/10, var_1_15=-128, var_1_16=2, var_1_1=8, var_1_2=127, var_1_3=63, var_1_4=0, var_1_7=4, var_1_8=100, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_10=-8, var_1_10=-8, var_1_11=1276/5, var_1_12=513/4, var_1_13=201/2, var_1_14=2559/10, var_1_15=-128, var_1_16=2, var_1_1=8, var_1_2=127, var_1_3=63, var_1_4=0, var_1_7=4, var_1_8=100, var_1_9=1] [L75] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_10=-8, var_1_10=-8, var_1_11=1276/5, var_1_12=513/4, var_1_13=201/2, var_1_14=2559/10, var_1_15=-128, var_1_16=2, var_1_1=8, var_1_2=127, var_1_3=63, var_1_4=0, var_1_7=4, var_1_8=100, var_1_9=1] [L76] CALL assume_abort_if_not(var_1_5 <= 11) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-8, var_1_10=-8, var_1_11=1276/5, var_1_12=513/4, var_1_13=201/2, var_1_14=2559/10, var_1_15=-128, var_1_16=2, var_1_1=8, var_1_2=127, var_1_3=63, var_1_4=0, var_1_5=0, var_1_7=4, var_1_8=100, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_10=-8, var_1_10=-8, var_1_11=1276/5, var_1_12=513/4, var_1_13=201/2, var_1_14=2559/10, var_1_15=-128, var_1_16=2, var_1_1=8, var_1_2=127, var_1_3=63, var_1_4=0, var_1_5=0, var_1_7=4, var_1_8=100, var_1_9=1] [L76] RET assume_abort_if_not(var_1_5 <= 11) VAL [isInitial=1, last_1_var_1_10=-8, var_1_10=-8, var_1_11=1276/5, var_1_12=513/4, var_1_13=201/2, var_1_14=2559/10, var_1_15=-128, var_1_16=2, var_1_1=8, var_1_2=127, var_1_3=63, var_1_4=0, var_1_5=0, var_1_7=4, var_1_8=100, var_1_9=1] [L77] var_1_7 = __VERIFIER_nondet_char() [L78] CALL assume_abort_if_not(var_1_7 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-8, var_1_10=-8, var_1_11=1276/5, var_1_12=513/4, var_1_13=201/2, var_1_14=2559/10, var_1_15=-128, var_1_16=2, var_1_1=8, var_1_2=127, var_1_3=63, var_1_4=0, var_1_5=0, var_1_7=63, var_1_8=100, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_10=-8, var_1_10=-8, var_1_11=1276/5, var_1_12=513/4, var_1_13=201/2, var_1_14=2559/10, var_1_15=-128, var_1_16=2, var_1_1=8, var_1_2=127, var_1_3=63, var_1_4=0, var_1_5=0, var_1_7=63, var_1_8=100, var_1_9=1] [L78] RET assume_abort_if_not(var_1_7 >= -63) VAL [isInitial=1, last_1_var_1_10=-8, var_1_10=-8, var_1_11=1276/5, var_1_12=513/4, var_1_13=201/2, var_1_14=2559/10, var_1_15=-128, var_1_16=2, var_1_1=8, var_1_2=127, var_1_3=63, var_1_4=0, var_1_5=0, var_1_7=63, var_1_8=100, var_1_9=1] [L79] CALL assume_abort_if_not(var_1_7 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-8, var_1_10=-8, var_1_11=1276/5, var_1_12=513/4, var_1_13=201/2, var_1_14=2559/10, var_1_15=-128, var_1_16=2, var_1_1=8, var_1_2=127, var_1_3=63, var_1_4=0, var_1_5=0, var_1_7=63, var_1_8=100, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_10=-8, var_1_10=-8, var_1_11=1276/5, var_1_12=513/4, var_1_13=201/2, var_1_14=2559/10, var_1_15=-128, var_1_16=2, var_1_1=8, var_1_2=127, var_1_3=63, var_1_4=0, var_1_5=0, var_1_7=63, var_1_8=100, var_1_9=1] [L79] RET assume_abort_if_not(var_1_7 <= 63) VAL [isInitial=1, last_1_var_1_10=-8, var_1_10=-8, var_1_11=1276/5, var_1_12=513/4, var_1_13=201/2, var_1_14=2559/10, var_1_15=-128, var_1_16=2, var_1_1=8, var_1_2=127, var_1_3=63, var_1_4=0, var_1_5=0, var_1_7=63, var_1_8=100, var_1_9=1] [L80] var_1_8 = __VERIFIER_nondet_char() [L81] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-8, var_1_10=-8, var_1_11=1276/5, var_1_12=513/4, var_1_13=201/2, var_1_14=2559/10, var_1_15=-128, var_1_16=2, var_1_1=8, var_1_2=127, var_1_3=63, var_1_4=0, var_1_5=0, var_1_7=63, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_10=-8, var_1_10=-8, var_1_11=1276/5, var_1_12=513/4, var_1_13=201/2, var_1_14=2559/10, var_1_15=-128, var_1_16=2, var_1_1=8, var_1_2=127, var_1_3=63, var_1_4=0, var_1_5=0, var_1_7=63, var_1_8=0, var_1_9=1] [L81] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_10=-8, var_1_10=-8, var_1_11=1276/5, var_1_12=513/4, var_1_13=201/2, var_1_14=2559/10, var_1_15=-128, var_1_16=2, var_1_1=8, var_1_2=127, var_1_3=63, var_1_4=0, var_1_5=0, var_1_7=63, var_1_8=0, var_1_9=1] [L82] CALL assume_abort_if_not(var_1_8 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-8, var_1_10=-8, var_1_11=1276/5, var_1_12=513/4, var_1_13=201/2, var_1_14=2559/10, var_1_15=-128, var_1_16=2, var_1_1=8, var_1_2=127, var_1_3=63, var_1_4=0, var_1_5=0, var_1_7=63, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_10=-8, var_1_10=-8, var_1_11=1276/5, var_1_12=513/4, var_1_13=201/2, var_1_14=2559/10, var_1_15=-128, var_1_16=2, var_1_1=8, var_1_2=127, var_1_3=63, var_1_4=0, var_1_5=0, var_1_7=63, var_1_8=0, var_1_9=1] [L82] RET assume_abort_if_not(var_1_8 <= 126) VAL [isInitial=1, last_1_var_1_10=-8, var_1_10=-8, var_1_11=1276/5, var_1_12=513/4, var_1_13=201/2, var_1_14=2559/10, var_1_15=-128, var_1_16=2, var_1_1=8, var_1_2=127, var_1_3=63, var_1_4=0, var_1_5=0, var_1_7=63, var_1_8=0, var_1_9=1] [L83] var_1_9 = __VERIFIER_nondet_uchar() [L84] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-8, var_1_10=-8, var_1_11=1276/5, var_1_12=513/4, var_1_13=201/2, var_1_14=2559/10, var_1_15=-128, var_1_16=2, var_1_1=8, var_1_2=127, var_1_3=63, var_1_4=0, var_1_5=0, var_1_7=63, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_10=-8, var_1_10=-8, var_1_11=1276/5, var_1_12=513/4, var_1_13=201/2, var_1_14=2559/10, var_1_15=-128, var_1_16=2, var_1_1=8, var_1_2=127, var_1_3=63, var_1_4=0, var_1_5=0, var_1_7=63, var_1_8=0] [L84] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, last_1_var_1_10=-8, var_1_10=-8, var_1_11=1276/5, var_1_12=513/4, var_1_13=201/2, var_1_14=2559/10, var_1_15=-128, var_1_16=2, var_1_1=8, var_1_2=127, var_1_3=63, var_1_4=0, var_1_5=0, var_1_7=63, var_1_8=0] [L85] CALL assume_abort_if_not(var_1_9 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-8, var_1_10=-8, var_1_11=1276/5, var_1_12=513/4, var_1_13=201/2, var_1_14=2559/10, var_1_15=-128, var_1_16=2, var_1_1=8, var_1_2=127, var_1_3=63, var_1_4=0, var_1_5=0, var_1_7=63, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_10=-8, var_1_10=-8, var_1_11=1276/5, var_1_12=513/4, var_1_13=201/2, var_1_14=2559/10, var_1_15=-128, var_1_16=2, var_1_1=8, var_1_2=127, var_1_3=63, var_1_4=0, var_1_5=0, var_1_7=63, var_1_8=0, var_1_9=1] [L85] RET assume_abort_if_not(var_1_9 <= 1) VAL [isInitial=1, last_1_var_1_10=-8, var_1_10=-8, var_1_11=1276/5, var_1_12=513/4, var_1_13=201/2, var_1_14=2559/10, var_1_15=-128, var_1_16=2, var_1_1=8, var_1_2=127, var_1_3=63, var_1_4=0, var_1_5=0, var_1_7=63, var_1_8=0, var_1_9=1] [L86] var_1_12 = __VERIFIER_nondet_float() [L87] CALL assume_abort_if_not((var_1_12 >= -461168.6018427382800e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 4611686.018427382800e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-8, var_1_10=-8, var_1_11=1276/5, var_1_13=201/2, var_1_14=2559/10, var_1_15=-128, var_1_16=2, var_1_1=8, var_1_2=127, var_1_3=63, var_1_4=0, var_1_5=0, var_1_7=63, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_10=-8, var_1_10=-8, var_1_11=1276/5, var_1_13=201/2, var_1_14=2559/10, var_1_15=-128, var_1_16=2, var_1_1=8, var_1_2=127, var_1_3=63, var_1_4=0, var_1_5=0, var_1_7=63, var_1_8=0, var_1_9=1] [L87] RET assume_abort_if_not((var_1_12 >= -461168.6018427382800e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 4611686.018427382800e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=-8, var_1_10=-8, var_1_11=1276/5, var_1_13=201/2, var_1_14=2559/10, var_1_15=-128, var_1_16=2, var_1_1=8, var_1_2=127, var_1_3=63, var_1_4=0, var_1_5=0, var_1_7=63, var_1_8=0, var_1_9=1] [L88] var_1_13 = __VERIFIER_nondet_float() [L89] CALL assume_abort_if_not((var_1_13 >= -230584.3009213691390e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 2305843.009213691390e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-8, var_1_10=-8, var_1_11=1276/5, var_1_14=2559/10, var_1_15=-128, var_1_16=2, var_1_1=8, var_1_2=127, var_1_3=63, var_1_4=0, var_1_5=0, var_1_7=63, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_10=-8, var_1_10=-8, var_1_11=1276/5, var_1_14=2559/10, var_1_15=-128, var_1_16=2, var_1_1=8, var_1_2=127, var_1_3=63, var_1_4=0, var_1_5=0, var_1_7=63, var_1_8=0, var_1_9=1] [L89] RET assume_abort_if_not((var_1_13 >= -230584.3009213691390e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 2305843.009213691390e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=-8, var_1_10=-8, var_1_11=1276/5, var_1_14=2559/10, var_1_15=-128, var_1_16=2, var_1_1=8, var_1_2=127, var_1_3=63, var_1_4=0, var_1_5=0, var_1_7=63, var_1_8=0, var_1_9=1] [L90] var_1_14 = __VERIFIER_nondet_float() [L91] CALL assume_abort_if_not((var_1_14 >= -230584.3009213691390e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 2305843.009213691390e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-8, var_1_10=-8, var_1_11=1276/5, var_1_15=-128, var_1_16=2, var_1_1=8, var_1_2=127, var_1_3=63, var_1_4=0, var_1_5=0, var_1_7=63, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_10=-8, var_1_10=-8, var_1_11=1276/5, var_1_15=-128, var_1_16=2, var_1_1=8, var_1_2=127, var_1_3=63, var_1_4=0, var_1_5=0, var_1_7=63, var_1_8=0, var_1_9=1] [L91] RET assume_abort_if_not((var_1_14 >= -230584.3009213691390e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 2305843.009213691390e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=-8, var_1_10=-8, var_1_11=1276/5, var_1_15=-128, var_1_16=2, var_1_1=8, var_1_2=127, var_1_3=63, var_1_4=0, var_1_5=0, var_1_7=63, var_1_8=0, var_1_9=1] [L106] RET updateVariables() [L107] CALL step() [L41] COND FALSE !(var_1_7 < var_1_3) VAL [isInitial=1, last_1_var_1_10=-8, var_1_10=-8, var_1_11=1276/5, var_1_15=-128, var_1_16=2, var_1_1=8, var_1_2=127, var_1_3=63, var_1_4=0, var_1_5=0, var_1_7=63, var_1_8=0, var_1_9=1] [L46] COND TRUE \read(var_1_9) [L47] var_1_10 = var_1_5 VAL [isInitial=1, last_1_var_1_10=-8, var_1_10=0, var_1_11=1276/5, var_1_15=-128, var_1_16=2, var_1_1=8, var_1_2=127, var_1_3=63, var_1_4=0, var_1_5=0, var_1_7=63, var_1_8=0, var_1_9=1] [L50] var_1_11 = (var_1_12 + (var_1_13 + var_1_14)) [L51] var_1_16 = 64 VAL [isInitial=1, last_1_var_1_10=-8, var_1_10=0, var_1_15=-128, var_1_16=64, var_1_1=8, var_1_2=127, var_1_3=63, var_1_4=0, var_1_5=0, var_1_7=63, var_1_8=0, var_1_9=1] [L52] COND TRUE \read(var_1_9) [L53] var_1_15 = (var_1_7 + var_1_16) VAL [isInitial=1, last_1_var_1_10=-8, var_1_10=0, var_1_15=127, var_1_16=64, var_1_1=8, var_1_2=127, var_1_3=63, var_1_4=0, var_1_5=0, var_1_7=63, var_1_8=0, var_1_9=1] [L55] signed long int stepLocal_0 = var_1_15; VAL [isInitial=1, last_1_var_1_10=-8, stepLocal_0=127, var_1_10=0, var_1_15=127, var_1_16=64, var_1_1=8, var_1_2=127, var_1_3=63, var_1_4=0, var_1_5=0, var_1_7=63, var_1_8=0, var_1_9=1] [L56] EXPR (var_1_2 - var_1_3) << (var_1_4 + var_1_5) VAL [isInitial=1, last_1_var_1_10=-8, stepLocal_0=127, var_1_10=0, var_1_15=127, var_1_16=64, var_1_1=8, var_1_2=127, var_1_3=63, var_1_4=0, var_1_5=0, var_1_7=63, var_1_8=0, var_1_9=1] [L56] COND TRUE ((var_1_2 - var_1_3) << (var_1_4 + var_1_5)) <= stepLocal_0 [L57] var_1_1 = ((((var_1_4) > (((((var_1_8) < 0 ) ? -(var_1_8) : (var_1_8))))) ? (var_1_4) : (((((var_1_8) < 0 ) ? -(var_1_8) : (var_1_8)))))) VAL [isInitial=1, last_1_var_1_10=-8, stepLocal_0=127, var_1_10=0, var_1_15=127, var_1_16=64, var_1_1=0, var_1_2=127, var_1_3=63, var_1_4=0, var_1_5=0, var_1_7=63, var_1_8=0, var_1_9=1] [L107] RET step() [L108] CALL, EXPR property() [L97] EXPR (var_1_2 - var_1_3) << (var_1_4 + var_1_5) VAL [isInitial=1, last_1_var_1_10=-8, var_1_10=0, var_1_15=127, var_1_16=64, var_1_1=0, var_1_2=127, var_1_3=63, var_1_4=0, var_1_5=0, var_1_7=63, var_1_8=0, var_1_9=1] [L97-L98] return (((((((var_1_2 - var_1_3) << (var_1_4 + var_1_5)) <= var_1_15) ? (var_1_1 == ((signed char) ((((var_1_4) > (((((var_1_8) < 0 ) ? -(var_1_8) : (var_1_8))))) ? (var_1_4) : (((((var_1_8) < 0 ) ? -(var_1_8) : (var_1_8)))))))) : (var_1_9 ? (var_1_1 == ((signed char) var_1_5)) : 1)) && ((var_1_7 < var_1_3) ? ((last_1_var_1_10 > var_1_7) ? (var_1_10 == ((signed long int) (var_1_3 - var_1_8))) : 1) : (var_1_9 ? (var_1_10 == ((signed long int) var_1_5)) : 1))) && (var_1_11 == ((float) (var_1_12 + (var_1_13 + var_1_14))))) && (var_1_9 ? (var_1_15 == ((signed long int) (var_1_7 + var_1_16))) : 1)) && (var_1_16 == ((unsigned short int) 64)) ; [L108] RET, EXPR property() [L108] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, isInitial=1, last_1_var_1_10=-8, var_1_10=0, var_1_15=127, var_1_16=64, var_1_1=0, var_1_2=127, var_1_3=63, var_1_4=0, var_1_5=0, var_1_7=63, var_1_8=0, var_1_9=1] [L19] reach_error() VAL [\old(cond)=0, cond=0, isInitial=1, last_1_var_1_10=-8, var_1_10=0, var_1_15=127, var_1_16=64, var_1_1=0, var_1_2=127, var_1_3=63, var_1_4=0, var_1_5=0, var_1_7=63, var_1_8=0, var_1_9=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 51 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.9s, OverallIterations: 3, TraceHistogramMax: 17, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 48 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 48 mSDsluCounter, 198 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 61 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 19 IncrementalHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 137 mSDtfsCounter, 19 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 90 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=82occurred in iteration=2, InterpolantAutomatonStates: 5, 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, 3 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 327 NumberOfCodeBlocks, 327 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 216 ConstructedInterpolants, 0 QuantifiedInterpolants, 230 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 1088/1088 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-12-15 20:52:50,468 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...