/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.use.bitabs.translation true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_normal_file-74.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-15 21:28:28,958 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-15 21:28:29,028 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2023-12-15 21:28:29,032 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-15 21:28:29,033 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-15 21:28:29,055 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-15 21:28:29,055 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-15 21:28:29,055 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-15 21:28:29,056 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-15 21:28:29,059 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-15 21:28:29,059 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-15 21:28:29,059 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-15 21:28:29,060 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-15 21:28:29,061 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-15 21:28:29,061 INFO L153 SettingsManager]: * Use SBE=true [2023-12-15 21:28:29,061 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-15 21:28:29,061 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-15 21:28:29,061 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-15 21:28:29,061 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-15 21:28:29,062 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-15 21:28:29,062 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-15 21:28:29,063 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-15 21:28:29,063 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-15 21:28:29,063 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-15 21:28:29,063 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-15 21:28:29,063 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-15 21:28:29,063 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-15 21:28:29,063 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-15 21:28:29,064 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-15 21:28:29,064 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-15 21:28:29,065 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-15 21:28:29,065 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-15 21:28:29,065 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-15 21:28:29,065 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-15 21:28:29,065 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-15 21:28:29,065 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-15 21:28:29,066 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-15 21:28:29,066 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-15 21:28:29,066 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-15 21:28:29,066 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-15 21:28:29,066 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-15 21:28:29,066 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-15 21:28:29,066 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-15 21:28:29,066 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Use bitabs translation -> true [2023-12-15 21:28:29,257 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-15 21:28:29,272 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-15 21:28:29,274 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-15 21:28:29,275 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-15 21:28:29,276 INFO L274 PluginConnector]: CDTParser initialized [2023-12-15 21:28:29,277 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_normal_file-74.i [2023-12-15 21:28:30,348 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-15 21:28:30,529 INFO L384 CDTParser]: Found 1 translation units. [2023-12-15 21:28:30,529 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_normal_file-74.i [2023-12-15 21:28:30,536 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3eb4e71de/6043d82dedff45bf815136c9b16c4c40/FLAG86eb3b3b1 [2023-12-15 21:28:30,546 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3eb4e71de/6043d82dedff45bf815136c9b16c4c40 [2023-12-15 21:28:30,548 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-15 21:28:30,549 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-15 21:28:30,550 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-15 21:28:30,550 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-15 21:28:30,554 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-15 21:28:30,554 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 09:28:30" (1/1) ... [2023-12-15 21:28:30,555 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@399f179f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:28:30, skipping insertion in model container [2023-12-15 21:28:30,555 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 09:28:30" (1/1) ... [2023-12-15 21:28:30,585 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-15 21:28:30,681 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_normal_file-74.i[913,926] [2023-12-15 21:28:30,714 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-15 21:28:30,722 INFO L202 MainTranslator]: Completed pre-run [2023-12-15 21:28:30,729 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_normal_file-74.i[913,926] [2023-12-15 21:28:30,743 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-15 21:28:30,753 INFO L206 MainTranslator]: Completed translation [2023-12-15 21:28:30,754 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:28:30 WrapperNode [2023-12-15 21:28:30,754 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-15 21:28:30,754 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-15 21:28:30,754 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-15 21:28:30,755 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-15 21:28:30,759 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:28:30" (1/1) ... [2023-12-15 21:28:30,765 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:28:30" (1/1) ... [2023-12-15 21:28:30,783 INFO L138 Inliner]: procedures = 26, calls = 30, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 117 [2023-12-15 21:28:30,783 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-15 21:28:30,784 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-15 21:28:30,784 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-15 21:28:30,784 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-15 21:28:30,791 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:28:30" (1/1) ... [2023-12-15 21:28:30,792 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:28:30" (1/1) ... [2023-12-15 21:28:30,794 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:28:30" (1/1) ... [2023-12-15 21:28:30,807 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2023-12-15 21:28:30,807 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:28:30" (1/1) ... [2023-12-15 21:28:30,807 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:28:30" (1/1) ... [2023-12-15 21:28:30,812 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:28:30" (1/1) ... [2023-12-15 21:28:30,814 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:28:30" (1/1) ... [2023-12-15 21:28:30,815 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:28:30" (1/1) ... [2023-12-15 21:28:30,816 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:28:30" (1/1) ... [2023-12-15 21:28:30,818 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-15 21:28:30,832 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-15 21:28:30,833 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-15 21:28:30,833 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-15 21:28:30,834 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:28:30" (1/1) ... [2023-12-15 21:28:30,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-15 21:28:30,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 21:28:30,872 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-15 21:28:30,904 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-15 21:28:30,921 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-15 21:28:30,921 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-15 21:28:30,922 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-15 21:28:30,922 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-15 21:28:30,922 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-15 21:28:30,922 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-15 21:28:31,003 INFO L241 CfgBuilder]: Building ICFG [2023-12-15 21:28:31,006 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-15 21:28:31,211 INFO L282 CfgBuilder]: Performing block encoding [2023-12-15 21:28:31,240 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-15 21:28:31,240 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-15 21:28:31,240 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 09:28:31 BoogieIcfgContainer [2023-12-15 21:28:31,240 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-15 21:28:31,242 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-15 21:28:31,242 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-15 21:28:31,244 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-15 21:28:31,244 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.12 09:28:30" (1/3) ... [2023-12-15 21:28:31,245 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e9f11d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 09:28:31, skipping insertion in model container [2023-12-15 21:28:31,245 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:28:30" (2/3) ... [2023-12-15 21:28:31,245 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e9f11d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 09:28:31, skipping insertion in model container [2023-12-15 21:28:31,245 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 09:28:31" (3/3) ... [2023-12-15 21:28:31,246 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-74.i [2023-12-15 21:28:31,258 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-15 21:28:31,258 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-15 21:28:31,292 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-15 21:28:31,298 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;@525d809d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-15 21:28:31,298 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-15 21:28:31,302 INFO L276 IsEmpty]: Start isEmpty. Operand has 48 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 29 states have internal predecessors, (39), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2023-12-15 21:28:31,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2023-12-15 21:28:31,311 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:28:31,312 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] [2023-12-15 21:28:31,312 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:28:31,316 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:28:31,316 INFO L85 PathProgramCache]: Analyzing trace with hash -162583371, now seen corresponding path program 1 times [2023-12-15 21:28:31,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:28:31,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167983145] [2023-12-15 21:28:31,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:28:31,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:28:31,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:28:31,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:28:31,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:28:31,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:28:31,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:28:31,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:28:31,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:28:31,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:28:31,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:28:31,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-15 21:28:31,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:28:31,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-12-15 21:28:31,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:28:31,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-15 21:28:31,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:28:31,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-15 21:28:31,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:28:31,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-15 21:28:31,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:28:31,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-15 21:28:31,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:28:31,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-15 21:28:31,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:28:31,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-12-15 21:28:31,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:28:31,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-12-15 21:28:31,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:28:31,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-12-15 21:28:31,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:28:31,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-12-15 21:28:31,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:28:31,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-12-15 21:28:31,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:28:31,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-15 21:28:31,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:28:31,642 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-12-15 21:28:31,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:28:31,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167983145] [2023-12-15 21:28:31,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1167983145] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:28:31,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:28:31,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-15 21:28:31,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025608590] [2023-12-15 21:28:31,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:28:31,648 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-15 21:28:31,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:28:31,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-15 21:28:31,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-15 21:28:31,679 INFO L87 Difference]: Start difference. First operand has 48 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 29 states have internal predecessors, (39), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2023-12-15 21:28:31,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:28:31,725 INFO L93 Difference]: Finished difference Result 93 states and 161 transitions. [2023-12-15 21:28:31,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-15 21:28:31,728 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, (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 105 [2023-12-15 21:28:31,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:28:31,733 INFO L225 Difference]: With dead ends: 93 [2023-12-15 21:28:31,733 INFO L226 Difference]: Without dead ends: 46 [2023-12-15 21:28:31,737 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-15 21:28:31,740 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 21:28:31,741 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 65 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 21:28:31,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2023-12-15 21:28:31,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2023-12-15 21:28:31,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 27 states have internal predecessors, (34), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2023-12-15 21:28:31,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 68 transitions. [2023-12-15 21:28:31,777 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 68 transitions. Word has length 105 [2023-12-15 21:28:31,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:28:31,777 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 68 transitions. [2023-12-15 21:28:31,777 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2023-12-15 21:28:31,778 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 68 transitions. [2023-12-15 21:28:31,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2023-12-15 21:28:31,780 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:28:31,780 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] [2023-12-15 21:28:31,780 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-15 21:28:31,780 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:28:31,781 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:28:31,781 INFO L85 PathProgramCache]: Analyzing trace with hash 529998271, now seen corresponding path program 1 times [2023-12-15 21:28:31,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:28:31,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935184838] [2023-12-15 21:28:31,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:28:31,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:28:31,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:28:32,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:28:32,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:28:32,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:28:32,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:28:32,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:28:32,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:28:32,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:28:32,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:28:32,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-15 21:28:32,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:28:32,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-12-15 21:28:32,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:28:32,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-15 21:28:32,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:28:32,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-15 21:28:32,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:28:32,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-15 21:28:32,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:28:32,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-15 21:28:32,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:28:32,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-15 21:28:32,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:28:32,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-12-15 21:28:32,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:28:32,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-12-15 21:28:32,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:28:32,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-12-15 21:28:32,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:28:32,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-12-15 21:28:32,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:28:32,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-12-15 21:28:32,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:28:32,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-15 21:28:32,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:28:32,308 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-12-15 21:28:32,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:28:32,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935184838] [2023-12-15 21:28:32,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935184838] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:28:32,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:28:32,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-15 21:28:32,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022218725] [2023-12-15 21:28:32,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:28:32,317 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-15 21:28:32,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:28:32,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-15 21:28:32,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-15 21:28:32,320 INFO L87 Difference]: Start difference. First operand 46 states and 68 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-12-15 21:28:32,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:28:32,464 INFO L93 Difference]: Finished difference Result 137 states and 203 transitions. [2023-12-15 21:28:32,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-15 21:28:32,465 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 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 105 [2023-12-15 21:28:32,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:28:32,468 INFO L225 Difference]: With dead ends: 137 [2023-12-15 21:28:32,468 INFO L226 Difference]: Without dead ends: 92 [2023-12-15 21:28:32,469 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-12-15 21:28:32,470 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 38 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 21:28:32,470 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 217 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 21:28:32,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2023-12-15 21:28:32,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 80. [2023-12-15 21:28:32,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 43 states have (on average 1.1627906976744187) internal successors, (50), 43 states have internal predecessors, (50), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2023-12-15 21:28:32,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 118 transitions. [2023-12-15 21:28:32,503 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 118 transitions. Word has length 105 [2023-12-15 21:28:32,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:28:32,504 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 118 transitions. [2023-12-15 21:28:32,504 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-12-15 21:28:32,504 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 118 transitions. [2023-12-15 21:28:32,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2023-12-15 21:28:32,509 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:28:32,509 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] [2023-12-15 21:28:32,509 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-15 21:28:32,509 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:28:32,510 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:28:32,510 INFO L85 PathProgramCache]: Analyzing trace with hash -1245009091, now seen corresponding path program 1 times [2023-12-15 21:28:32,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:28:32,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92266755] [2023-12-15 21:28:32,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:28:32,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:28:32,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-15 21:28:32,620 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-15 21:28:32,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-15 21:28:32,719 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-15 21:28:32,720 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-15 21:28:32,721 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-15 21:28:32,722 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-15 21:28:32,725 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-12-15 21:28:32,727 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-15 21:28:32,789 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.12 09:28:32 BoogieIcfgContainer [2023-12-15 21:28:32,789 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-15 21:28:32,790 INFO L158 Benchmark]: Toolchain (without parser) took 2240.78ms. Allocated memory is still 317.7MB. Free memory was 263.5MB in the beginning and 248.3MB in the end (delta: 15.2MB). Peak memory consumption was 16.2MB. Max. memory is 8.0GB. [2023-12-15 21:28:32,790 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 184.5MB. Free memory is still 134.3MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-15 21:28:32,790 INFO L158 Benchmark]: CACSL2BoogieTranslator took 203.67ms. Allocated memory is still 317.7MB. Free memory was 263.1MB in the beginning and 250.4MB in the end (delta: 12.7MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2023-12-15 21:28:32,791 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.75ms. Allocated memory is still 317.7MB. Free memory was 250.4MB in the beginning and 248.0MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-15 21:28:32,793 INFO L158 Benchmark]: Boogie Preprocessor took 34.44ms. Allocated memory is still 317.7MB. Free memory was 248.0MB in the beginning and 245.3MB in the end (delta: 2.7MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-15 21:28:32,794 INFO L158 Benchmark]: RCFGBuilder took 407.98ms. Allocated memory is still 317.7MB. Free memory was 245.3MB in the beginning and 228.1MB in the end (delta: 17.2MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2023-12-15 21:28:32,794 INFO L158 Benchmark]: TraceAbstraction took 1547.28ms. Allocated memory is still 317.7MB. Free memory was 227.4MB in the beginning and 248.3MB in the end (delta: -20.9MB). There was no memory consumed. Max. memory is 8.0GB. [2023-12-15 21:28:32,795 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 184.5MB. Free memory is still 134.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 203.67ms. Allocated memory is still 317.7MB. Free memory was 263.1MB in the beginning and 250.4MB in the end (delta: 12.7MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 28.75ms. Allocated memory is still 317.7MB. Free memory was 250.4MB in the beginning and 248.0MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 34.44ms. Allocated memory is still 317.7MB. Free memory was 248.0MB in the beginning and 245.3MB in the end (delta: 2.7MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 407.98ms. Allocated memory is still 317.7MB. Free memory was 245.3MB in the beginning and 228.1MB in the end (delta: 17.2MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * TraceAbstraction took 1547.28ms. Allocated memory is still 317.7MB. Free memory was 227.4MB in the beginning and 248.3MB in the end (delta: -20.9MB). There was no memory consumed. 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 104. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned long int var_1_1 = 25; [L23] double var_1_2 = 63.25; [L24] double var_1_3 = 3.779; [L25] double var_1_4 = 31.6; [L26] double var_1_5 = 100.5; [L27] unsigned long int var_1_6 = 64; [L28] unsigned long int var_1_7 = 3150951169; [L29] unsigned long int var_1_8 = 128; [L30] unsigned long int var_1_9 = 1; [L31] unsigned char var_1_10 = 1; [L32] double var_1_11 = 9.3; [L33] unsigned char var_1_14 = 0; [L34] unsigned char var_1_15 = 1; [L35] unsigned char var_1_16 = 1; [L36] unsigned char last_1_var_1_16 = 1; [L108] isInitial = 1 [L109] FCALL initially() [L110] COND TRUE 1 [L111] CALL updateLastVariables() [L101] last_1_var_1_16 = var_1_16 [L111] RET updateLastVariables() [L112] CALL updateVariables() [L71] var_1_2 = __VERIFIER_nondet_double() [L72] CALL assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, var_1_10=1, var_1_11=93/10, var_1_14=0, var_1_15=1, var_1_16=1, var_1_1=25, var_1_3=3779/1000, var_1_4=158/5, var_1_5=201/2, var_1_6=64, var_1_7=3150951169, var_1_8=128, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_16=1, var_1_10=1, var_1_11=93/10, var_1_14=0, var_1_15=1, var_1_16=1, var_1_1=25, var_1_3=3779/1000, var_1_4=158/5, var_1_5=201/2, var_1_6=64, var_1_7=3150951169, var_1_8=128, var_1_9=1] [L72] RET assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_16=1, var_1_10=1, var_1_11=93/10, var_1_14=0, var_1_15=1, var_1_16=1, var_1_1=25, var_1_3=3779/1000, var_1_4=158/5, var_1_5=201/2, var_1_6=64, var_1_7=3150951169, var_1_8=128, var_1_9=1] [L73] var_1_3 = __VERIFIER_nondet_double() [L74] CALL assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, var_1_10=1, var_1_11=93/10, var_1_14=0, var_1_15=1, var_1_16=1, var_1_1=25, var_1_4=158/5, var_1_5=201/2, var_1_6=64, var_1_7=3150951169, var_1_8=128, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_16=1, var_1_10=1, var_1_11=93/10, var_1_14=0, var_1_15=1, var_1_16=1, var_1_1=25, var_1_4=158/5, var_1_5=201/2, var_1_6=64, var_1_7=3150951169, var_1_8=128, var_1_9=1] [L74] RET assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_16=1, var_1_10=1, var_1_11=93/10, var_1_14=0, var_1_15=1, var_1_16=1, var_1_1=25, var_1_4=158/5, var_1_5=201/2, var_1_6=64, var_1_7=3150951169, var_1_8=128, var_1_9=1] [L75] var_1_4 = __VERIFIER_nondet_double() [L76] CALL assume_abort_if_not((var_1_4 >= -922337.2036854776000e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, var_1_10=1, var_1_11=93/10, var_1_14=0, var_1_15=1, var_1_16=1, var_1_1=25, var_1_5=201/2, var_1_6=64, var_1_7=3150951169, var_1_8=128, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_16=1, var_1_10=1, var_1_11=93/10, var_1_14=0, var_1_15=1, var_1_16=1, var_1_1=25, var_1_5=201/2, var_1_6=64, var_1_7=3150951169, var_1_8=128, var_1_9=1] [L76] RET assume_abort_if_not((var_1_4 >= -922337.2036854776000e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_16=1, var_1_10=1, var_1_11=93/10, var_1_14=0, var_1_15=1, var_1_16=1, var_1_1=25, var_1_5=201/2, var_1_6=64, var_1_7=3150951169, var_1_8=128, var_1_9=1] [L77] var_1_5 = __VERIFIER_nondet_double() [L78] CALL assume_abort_if_not((var_1_5 >= -922337.2036854776000e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, var_1_10=1, var_1_11=93/10, var_1_14=0, var_1_15=1, var_1_16=1, var_1_1=25, var_1_6=64, var_1_7=3150951169, var_1_8=128, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_16=1, var_1_10=1, var_1_11=93/10, var_1_14=0, var_1_15=1, var_1_16=1, var_1_1=25, var_1_6=64, var_1_7=3150951169, var_1_8=128, var_1_9=1] [L78] RET assume_abort_if_not((var_1_5 >= -922337.2036854776000e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_16=1, var_1_10=1, var_1_11=93/10, var_1_14=0, var_1_15=1, var_1_16=1, var_1_1=25, var_1_6=64, var_1_7=3150951169, var_1_8=128, var_1_9=1] [L79] var_1_6 = __VERIFIER_nondet_ulong() [L80] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, var_1_10=1, var_1_11=93/10, var_1_14=0, var_1_15=1, var_1_16=1, var_1_1=25, var_1_7=3150951169, var_1_8=128, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_16=1, var_1_10=1, var_1_11=93/10, var_1_14=0, var_1_15=1, var_1_16=1, var_1_1=25, var_1_7=3150951169, var_1_8=128, var_1_9=1] [L80] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_16=1, var_1_10=1, var_1_11=93/10, var_1_14=0, var_1_15=1, var_1_16=1, var_1_1=25, var_1_7=3150951169, var_1_8=128, var_1_9=1] [L81] CALL assume_abort_if_not(var_1_6 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, var_1_10=1, var_1_11=93/10, var_1_14=0, var_1_15=1, var_1_16=1, var_1_1=25, var_1_6=4294967294, var_1_7=3150951169, var_1_8=128, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_16=1, var_1_10=1, var_1_11=93/10, var_1_14=0, var_1_15=1, var_1_16=1, var_1_1=25, var_1_6=4294967294, var_1_7=3150951169, var_1_8=128, var_1_9=1] [L81] RET assume_abort_if_not(var_1_6 <= 4294967294) VAL [isInitial=1, last_1_var_1_16=1, var_1_10=1, var_1_11=93/10, var_1_14=0, var_1_15=1, var_1_16=1, var_1_1=25, var_1_6=4294967294, var_1_7=3150951169, var_1_8=128, var_1_9=1] [L82] var_1_7 = __VERIFIER_nondet_ulong() [L83] CALL assume_abort_if_not(var_1_7 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, var_1_10=1, var_1_11=93/10, var_1_14=0, var_1_15=1, var_1_16=1, var_1_1=25, var_1_6=4294967294, var_1_7=2147483647, var_1_8=128, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_16=1, var_1_10=1, var_1_11=93/10, var_1_14=0, var_1_15=1, var_1_16=1, var_1_1=25, var_1_6=4294967294, var_1_7=2147483647, var_1_8=128, var_1_9=1] [L83] RET assume_abort_if_not(var_1_7 >= 2147483647) VAL [isInitial=1, last_1_var_1_16=1, var_1_10=1, var_1_11=93/10, var_1_14=0, var_1_15=1, var_1_16=1, var_1_1=25, var_1_6=4294967294, var_1_7=2147483647, var_1_8=128, var_1_9=1] [L84] CALL assume_abort_if_not(var_1_7 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, var_1_10=1, var_1_11=93/10, var_1_14=0, var_1_15=1, var_1_16=1, var_1_1=25, var_1_6=4294967294, var_1_7=2147483647, var_1_8=128, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_16=1, var_1_10=1, var_1_11=93/10, var_1_14=0, var_1_15=1, var_1_16=1, var_1_1=25, var_1_6=4294967294, var_1_7=2147483647, var_1_8=128, var_1_9=1] [L84] RET assume_abort_if_not(var_1_7 <= 4294967294) VAL [isInitial=1, last_1_var_1_16=1, var_1_10=1, var_1_11=93/10, var_1_14=0, var_1_15=1, var_1_16=1, var_1_1=25, var_1_6=4294967294, var_1_7=2147483647, var_1_8=128, var_1_9=1] [L85] var_1_8 = __VERIFIER_nondet_ulong() [L86] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, var_1_10=1, var_1_11=93/10, var_1_14=0, var_1_15=1, var_1_16=1, var_1_1=25, var_1_6=4294967294, var_1_7=2147483647, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_16=1, var_1_10=1, var_1_11=93/10, var_1_14=0, var_1_15=1, var_1_16=1, var_1_1=25, var_1_6=4294967294, var_1_7=2147483647, var_1_9=1] [L86] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_16=1, var_1_10=1, var_1_11=93/10, var_1_14=0, var_1_15=1, var_1_16=1, var_1_1=25, var_1_6=4294967294, var_1_7=2147483647, var_1_9=1] [L87] CALL assume_abort_if_not(var_1_8 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, var_1_10=1, var_1_11=93/10, var_1_14=0, var_1_15=1, var_1_16=1, var_1_1=25, var_1_6=4294967294, var_1_7=2147483647, var_1_8=2147483647, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_16=1, var_1_10=1, var_1_11=93/10, var_1_14=0, var_1_15=1, var_1_16=1, var_1_1=25, var_1_6=4294967294, var_1_7=2147483647, var_1_8=2147483647, var_1_9=1] [L87] RET assume_abort_if_not(var_1_8 <= 2147483647) VAL [isInitial=1, last_1_var_1_16=1, var_1_10=1, var_1_11=93/10, var_1_14=0, var_1_15=1, var_1_16=1, var_1_1=25, var_1_6=4294967294, var_1_7=2147483647, var_1_8=2147483647, var_1_9=1] [L88] var_1_9 = __VERIFIER_nondet_ulong() [L89] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, var_1_10=1, var_1_11=93/10, var_1_14=0, var_1_15=1, var_1_16=1, var_1_1=25, var_1_6=4294967294, var_1_7=2147483647, var_1_8=2147483647] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_16=1, var_1_10=1, var_1_11=93/10, var_1_14=0, var_1_15=1, var_1_16=1, var_1_1=25, var_1_6=4294967294, var_1_7=2147483647, var_1_8=2147483647] [L89] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, last_1_var_1_16=1, var_1_10=1, var_1_11=93/10, var_1_14=0, var_1_15=1, var_1_16=1, var_1_1=25, var_1_6=4294967294, var_1_7=2147483647, var_1_8=2147483647] [L90] CALL assume_abort_if_not(var_1_9 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, var_1_10=1, var_1_11=93/10, var_1_14=0, var_1_15=1, var_1_16=1, var_1_1=25, var_1_6=4294967294, var_1_7=2147483647, var_1_8=2147483647, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_16=1, var_1_10=1, var_1_11=93/10, var_1_14=0, var_1_15=1, var_1_16=1, var_1_1=25, var_1_6=4294967294, var_1_7=2147483647, var_1_8=2147483647, var_1_9=0] [L90] RET assume_abort_if_not(var_1_9 <= 4294967294) VAL [isInitial=1, last_1_var_1_16=1, var_1_10=1, var_1_11=93/10, var_1_14=0, var_1_15=1, var_1_16=1, var_1_1=25, var_1_6=4294967294, var_1_7=2147483647, var_1_8=2147483647, var_1_9=0] [L91] var_1_11 = __VERIFIER_nondet_double() [L92] CALL assume_abort_if_not((var_1_11 >= -922337.2036854776000e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854776000e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, var_1_10=1, var_1_14=0, var_1_15=1, var_1_16=1, var_1_1=25, var_1_6=4294967294, var_1_7=2147483647, var_1_8=2147483647, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_16=1, var_1_10=1, var_1_14=0, var_1_15=1, var_1_16=1, var_1_1=25, var_1_6=4294967294, var_1_7=2147483647, var_1_8=2147483647, var_1_9=0] [L92] RET assume_abort_if_not((var_1_11 >= -922337.2036854776000e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854776000e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_16=1, var_1_10=1, var_1_14=0, var_1_15=1, var_1_16=1, var_1_1=25, var_1_6=4294967294, var_1_7=2147483647, var_1_8=2147483647, var_1_9=0] [L93] var_1_14 = __VERIFIER_nondet_uchar() [L94] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, var_1_10=1, var_1_15=1, var_1_16=1, var_1_1=25, var_1_6=4294967294, var_1_7=2147483647, var_1_8=2147483647, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_16=1, var_1_10=1, var_1_15=1, var_1_16=1, var_1_1=25, var_1_6=4294967294, var_1_7=2147483647, var_1_8=2147483647, var_1_9=0] [L94] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_16=1, var_1_10=1, var_1_15=1, var_1_16=1, var_1_1=25, var_1_6=4294967294, var_1_7=2147483647, var_1_8=2147483647, var_1_9=0] [L95] CALL assume_abort_if_not(var_1_14 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, var_1_10=1, var_1_14=0, var_1_15=1, var_1_16=1, var_1_1=25, var_1_6=4294967294, var_1_7=2147483647, var_1_8=2147483647, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_16=1, var_1_10=1, var_1_14=0, var_1_15=1, var_1_16=1, var_1_1=25, var_1_6=4294967294, var_1_7=2147483647, var_1_8=2147483647, var_1_9=0] [L95] RET assume_abort_if_not(var_1_14 <= 0) VAL [isInitial=1, last_1_var_1_16=1, var_1_10=1, var_1_14=0, var_1_15=1, var_1_16=1, var_1_1=25, var_1_6=4294967294, var_1_7=2147483647, var_1_8=2147483647, var_1_9=0] [L96] var_1_15 = __VERIFIER_nondet_uchar() [L97] CALL assume_abort_if_not(var_1_15 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, var_1_10=1, var_1_14=0, var_1_15=1, var_1_16=1, var_1_1=25, var_1_6=4294967294, var_1_7=2147483647, var_1_8=2147483647, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_16=1, var_1_10=1, var_1_14=0, var_1_15=1, var_1_16=1, var_1_1=25, var_1_6=4294967294, var_1_7=2147483647, var_1_8=2147483647, var_1_9=0] [L97] RET assume_abort_if_not(var_1_15 >= 1) VAL [isInitial=1, last_1_var_1_16=1, var_1_10=1, var_1_14=0, var_1_15=1, var_1_16=1, var_1_1=25, var_1_6=4294967294, var_1_7=2147483647, var_1_8=2147483647, var_1_9=0] [L98] CALL assume_abort_if_not(var_1_15 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, var_1_10=1, var_1_14=0, var_1_15=1, var_1_16=1, var_1_1=25, var_1_6=4294967294, var_1_7=2147483647, var_1_8=2147483647, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_16=1, var_1_10=1, var_1_14=0, var_1_15=1, var_1_16=1, var_1_1=25, var_1_6=4294967294, var_1_7=2147483647, var_1_8=2147483647, var_1_9=0] [L98] RET assume_abort_if_not(var_1_15 <= 1) VAL [isInitial=1, last_1_var_1_16=1, var_1_10=1, var_1_14=0, var_1_15=1, var_1_16=1, var_1_1=25, var_1_6=4294967294, var_1_7=2147483647, var_1_8=2147483647, var_1_9=0] [L112] RET updateVariables() [L113] CALL step() [L40] unsigned char stepLocal_0 = last_1_var_1_16 && last_1_var_1_16; VAL [isInitial=1, last_1_var_1_16=1, stepLocal_0=1, var_1_10=1, var_1_14=0, var_1_15=1, var_1_16=1, var_1_1=25, var_1_6=4294967294, var_1_7=2147483647, var_1_8=2147483647, var_1_9=0] [L41] COND TRUE (var_1_5 > var_1_11) || stepLocal_0 [L42] var_1_10 = var_1_14 VAL [isInitial=1, last_1_var_1_16=1, stepLocal_0=1, var_1_10=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_1=25, var_1_6=4294967294, var_1_7=2147483647, var_1_8=2147483647, var_1_9=0] [L46] unsigned char stepLocal_1 = var_1_10; VAL [isInitial=1, last_1_var_1_16=1, stepLocal_0=1, stepLocal_1=0, var_1_10=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_1=25, var_1_6=4294967294, var_1_7=2147483647, var_1_8=2147483647, var_1_9=0] [L47] COND FALSE !(stepLocal_1 && var_1_10) [L54] var_1_16 = var_1_15 VAL [isInitial=1, last_1_var_1_16=1, stepLocal_0=1, stepLocal_1=0, var_1_10=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_1=25, var_1_6=4294967294, var_1_7=2147483647, var_1_8=2147483647, var_1_9=0] [L56] COND TRUE ((((((((var_1_2) > (var_1_3)) ? (var_1_2) : (var_1_3)))) < (var_1_4)) ? (((((var_1_2) > (var_1_3)) ? (var_1_2) : (var_1_3)))) : (var_1_4))) < var_1_5 [L57] var_1_1 = ((((var_1_6) > ((var_1_7 - var_1_8))) ? (var_1_6) : ((var_1_7 - var_1_8)))) VAL [isInitial=1, last_1_var_1_16=1, stepLocal_0=1, stepLocal_1=0, var_1_10=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_1=4294967294, var_1_6=4294967294, var_1_7=2147483647, var_1_8=2147483647, var_1_9=0] [L113] RET step() [L114] CALL, EXPR property() [L104-L105] return (((((((((((var_1_2) > (var_1_3)) ? (var_1_2) : (var_1_3)))) < (var_1_4)) ? (((((var_1_2) > (var_1_3)) ? (var_1_2) : (var_1_3)))) : (var_1_4))) < var_1_5) ? (var_1_1 == ((unsigned long int) ((((var_1_6) > ((var_1_7 - var_1_8))) ? (var_1_6) : ((var_1_7 - var_1_8)))))) : ((var_1_2 >= (var_1_3 + var_1_5)) ? ((var_1_4 > (- var_1_5)) ? (var_1_1 == ((unsigned long int) var_1_6)) : (var_1_1 == ((unsigned long int) var_1_9))) : (var_1_1 == ((unsigned long int) var_1_6)))) && (((var_1_5 > var_1_11) || (last_1_var_1_16 && last_1_var_1_16)) ? (var_1_10 == ((unsigned char) var_1_14)) : (var_1_10 == ((unsigned char) (var_1_14 && (! var_1_15)))))) && ((var_1_10 && var_1_10) ? ((var_1_4 < (- var_1_5)) ? (var_1_16 == ((unsigned char) var_1_15)) : (var_1_16 == ((unsigned char) var_1_15))) : (var_1_16 == ((unsigned char) var_1_15))) ; [L114] RET, EXPR property() [L114] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, isInitial=1, last_1_var_1_16=1, var_1_10=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_1=4294967294, var_1_6=4294967294, var_1_7=2147483647, var_1_8=2147483647, var_1_9=0] [L19] reach_error() VAL [\old(cond)=0, cond=0, isInitial=1, last_1_var_1_16=1, var_1_10=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_1=4294967294, var_1_6=4294967294, var_1_7=2147483647, var_1_8=2147483647, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 48 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.4s, OverallIterations: 3, TraceHistogramMax: 17, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 38 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 38 mSDsluCounter, 282 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 154 mSDsCounter, 52 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 56 IncrementalHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 52 mSolverCounterUnsat, 128 mSDtfsCounter, 56 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 95 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=80occurred in iteration=2, InterpolantAutomatonStates: 8, 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, 12 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 315 NumberOfCodeBlocks, 315 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 208 ConstructedInterpolants, 0 QuantifiedInterpolants, 272 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 21:28:32,808 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...