/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.use.bitabs.translation false -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_normal_file-47.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-21 01:33:39,250 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-21 01:33:39,306 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-21 01:33:39,310 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-21 01:33:39,310 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-21 01:33:39,339 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-21 01:33:39,340 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-21 01:33:39,340 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-21 01:33:39,340 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-21 01:33:39,341 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-21 01:33:39,341 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-21 01:33:39,341 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-21 01:33:39,341 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-21 01:33:39,342 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-21 01:33:39,342 INFO L153 SettingsManager]: * Use SBE=true [2023-12-21 01:33:39,342 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-21 01:33:39,342 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-21 01:33:39,342 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-21 01:33:39,343 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-21 01:33:39,343 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-21 01:33:39,343 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-21 01:33:39,346 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-21 01:33:39,346 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-21 01:33:39,347 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-21 01:33:39,349 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-21 01:33:39,349 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-21 01:33:39,349 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-21 01:33:39,350 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-21 01:33:39,350 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-21 01:33:39,351 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-21 01:33:39,351 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-21 01:33:39,351 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-21 01:33:39,351 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-21 01:33:39,352 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-21 01:33:39,352 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-21 01:33:39,352 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-21 01:33:39,352 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-21 01:33:39,352 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-21 01:33:39,353 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-21 01:33:39,353 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-21 01:33:39,353 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-21 01:33:39,353 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-21 01:33:39,353 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-21 01:33:39,353 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Use bitabs translation -> false [2023-12-21 01:33:39,555 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-21 01:33:39,569 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-21 01:33:39,571 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-21 01:33:39,572 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-21 01:33:39,572 INFO L274 PluginConnector]: CDTParser initialized [2023-12-21 01:33:39,573 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-47.i [2023-12-21 01:33:40,525 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-21 01:33:40,699 INFO L384 CDTParser]: Found 1 translation units. [2023-12-21 01:33:40,706 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_normal_file-47.i [2023-12-21 01:33:40,721 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f551f642/36501b8cdaef4b6782ac4ddcf1a98a72/FLAG36283214d [2023-12-21 01:33:40,731 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f551f642/36501b8cdaef4b6782ac4ddcf1a98a72 [2023-12-21 01:33:40,733 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-21 01:33:40,735 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-21 01:33:40,737 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-21 01:33:40,738 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-21 01:33:40,741 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-21 01:33:40,741 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 01:33:40" (1/1) ... [2023-12-21 01:33:40,742 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79c942dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:33:40, skipping insertion in model container [2023-12-21 01:33:40,742 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 01:33:40" (1/1) ... [2023-12-21 01:33:40,759 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-21 01:33:40,847 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-47.i[913,926] [2023-12-21 01:33:40,867 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-21 01:33:40,878 INFO L202 MainTranslator]: Completed pre-run [2023-12-21 01:33:40,886 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-47.i[913,926] [2023-12-21 01:33:40,899 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-21 01:33:40,911 INFO L206 MainTranslator]: Completed translation [2023-12-21 01:33:40,911 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:33:40 WrapperNode [2023-12-21 01:33:40,911 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-21 01:33:40,912 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-21 01:33:40,912 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-21 01:33:40,912 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-21 01:33:40,917 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:33:40" (1/1) ... [2023-12-21 01:33:40,922 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:33:40" (1/1) ... [2023-12-21 01:33:40,948 INFO L138 Inliner]: procedures = 26, calls = 22, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 86 [2023-12-21 01:33:40,949 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-21 01:33:40,949 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-21 01:33:40,949 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-21 01:33:40,949 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-21 01:33:40,958 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:33:40" (1/1) ... [2023-12-21 01:33:40,958 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:33:40" (1/1) ... [2023-12-21 01:33:40,960 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:33:40" (1/1) ... [2023-12-21 01:33:40,970 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-21 01:33:40,970 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:33:40" (1/1) ... [2023-12-21 01:33:40,970 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:33:40" (1/1) ... [2023-12-21 01:33:40,982 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:33:40" (1/1) ... [2023-12-21 01:33:40,985 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:33:40" (1/1) ... [2023-12-21 01:33:40,986 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:33:40" (1/1) ... [2023-12-21 01:33:40,987 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:33:40" (1/1) ... [2023-12-21 01:33:40,988 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-21 01:33:40,989 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-21 01:33:40,989 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-21 01:33:40,989 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-21 01:33:40,989 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:33:40" (1/1) ... [2023-12-21 01:33:40,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-21 01:33:41,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 01:33:41,024 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-21 01:33:41,030 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-21 01:33:41,047 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-21 01:33:41,047 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-21 01:33:41,047 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-21 01:33:41,047 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-21 01:33:41,047 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-21 01:33:41,047 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-21 01:33:41,111 INFO L241 CfgBuilder]: Building ICFG [2023-12-21 01:33:41,113 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-21 01:33:41,268 INFO L282 CfgBuilder]: Performing block encoding [2023-12-21 01:33:41,319 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-21 01:33:41,319 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-21 01:33:41,319 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 01:33:41 BoogieIcfgContainer [2023-12-21 01:33:41,319 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-21 01:33:41,321 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-21 01:33:41,321 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-21 01:33:41,323 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-21 01:33:41,323 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.12 01:33:40" (1/3) ... [2023-12-21 01:33:41,323 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4345dd15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 01:33:41, skipping insertion in model container [2023-12-21 01:33:41,323 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:33:40" (2/3) ... [2023-12-21 01:33:41,324 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4345dd15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 01:33:41, skipping insertion in model container [2023-12-21 01:33:41,324 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 01:33:41" (3/3) ... [2023-12-21 01:33:41,324 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-47.i [2023-12-21 01:33:41,335 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-21 01:33:41,336 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-21 01:33:41,367 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-21 01:33:41,372 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;@24833a43, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-21 01:33:41,372 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-21 01:33:41,375 INFO L276 IsEmpty]: Start isEmpty. Operand has 36 states, 24 states have (on average 1.5) internal successors, (36), 25 states have internal predecessors, (36), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-12-21 01:33:41,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-12-21 01:33:41,387 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 01:33:41,388 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 01:33:41,388 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 01:33:41,391 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 01:33:41,391 INFO L85 PathProgramCache]: Analyzing trace with hash 1720123119, now seen corresponding path program 1 times [2023-12-21 01:33:41,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 01:33:41,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203623966] [2023-12-21 01:33:41,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:33:41,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 01:33:41,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:33:41,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 01:33:41,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:33:41,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 01:33:41,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:33:41,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-21 01:33:41,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:33:41,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-21 01:33:41,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:33:41,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-21 01:33:41,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:33:41,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-21 01:33:41,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:33:41,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 01:33:41,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:33:41,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-21 01:33:41,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:33:41,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-21 01:33:41,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:33:41,557 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2023-12-21 01:33:41,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 01:33:41,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203623966] [2023-12-21 01:33:41,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [203623966] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 01:33:41,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 01:33:41,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-21 01:33:41,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136980651] [2023-12-21 01:33:41,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 01:33:41,563 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-21 01:33:41,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 01:33:41,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-21 01:33:41,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-21 01:33:41,582 INFO L87 Difference]: Start difference. First operand has 36 states, 24 states have (on average 1.5) internal successors, (36), 25 states have internal predecessors, (36), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2023-12-21 01:33:41,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 01:33:41,610 INFO L93 Difference]: Finished difference Result 69 states and 115 transitions. [2023-12-21 01:33:41,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-21 01:33:41,613 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) Word has length 61 [2023-12-21 01:33:41,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 01:33:41,617 INFO L225 Difference]: With dead ends: 69 [2023-12-21 01:33:41,617 INFO L226 Difference]: Without dead ends: 34 [2023-12-21 01:33:41,619 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 29 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-21 01:33:41,621 INFO L413 NwaCegarLoop]: 46 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, 46 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-21 01:33:41,622 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 46 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 01:33:41,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2023-12-21 01:33:41,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2023-12-21 01:33:41,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 23 states have internal predecessors, (31), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-12-21 01:33:41,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2023-12-21 01:33:41,655 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 61 [2023-12-21 01:33:41,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 01:33:41,655 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2023-12-21 01:33:41,656 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2023-12-21 01:33:41,656 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2023-12-21 01:33:41,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-12-21 01:33:41,660 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 01:33:41,660 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 01:33:41,661 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-21 01:33:41,661 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 01:33:41,661 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 01:33:41,661 INFO L85 PathProgramCache]: Analyzing trace with hash -663846671, now seen corresponding path program 1 times [2023-12-21 01:33:41,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 01:33:41,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131989975] [2023-12-21 01:33:41,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:33:41,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 01:33:41,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-21 01:33:41,738 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-21 01:33:41,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-21 01:33:41,801 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-21 01:33:41,801 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-21 01:33:41,802 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-21 01:33:41,803 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-21 01:33:41,806 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2023-12-21 01:33:41,808 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-21 01:33:41,859 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.12 01:33:41 BoogieIcfgContainer [2023-12-21 01:33:41,859 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-21 01:33:41,860 INFO L158 Benchmark]: Toolchain (without parser) took 1124.56ms. Allocated memory was 216.0MB in the beginning and 273.7MB in the end (delta: 57.7MB). Free memory was 150.8MB in the beginning and 193.0MB in the end (delta: -42.2MB). Peak memory consumption was 16.5MB. Max. memory is 8.0GB. [2023-12-21 01:33:41,860 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 216.0MB. Free memory is still 163.9MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-21 01:33:41,860 INFO L158 Benchmark]: CACSL2BoogieTranslator took 174.45ms. Allocated memory is still 216.0MB. Free memory was 150.6MB in the beginning and 138.5MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2023-12-21 01:33:41,861 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.32ms. Allocated memory is still 216.0MB. Free memory was 138.5MB in the beginning and 136.7MB in the end (delta: 1.8MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-12-21 01:33:41,861 INFO L158 Benchmark]: Boogie Preprocessor took 38.94ms. Allocated memory is still 216.0MB. Free memory was 136.7MB in the beginning and 134.3MB in the end (delta: 2.3MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-21 01:33:41,861 INFO L158 Benchmark]: RCFGBuilder took 330.66ms. Allocated memory was 216.0MB in the beginning and 273.7MB in the end (delta: 57.7MB). Free memory was 134.3MB in the beginning and 236.0MB in the end (delta: -101.7MB). Peak memory consumption was 13.4MB. Max. memory is 8.0GB. [2023-12-21 01:33:41,862 INFO L158 Benchmark]: TraceAbstraction took 538.40ms. Allocated memory is still 273.7MB. Free memory was 235.0MB in the beginning and 193.0MB in the end (delta: 41.9MB). Peak memory consumption was 41.9MB. Max. memory is 8.0GB. [2023-12-21 01:33:41,864 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.12ms. Allocated memory is still 216.0MB. Free memory is still 163.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 174.45ms. Allocated memory is still 216.0MB. Free memory was 150.6MB in the beginning and 138.5MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 36.32ms. Allocated memory is still 216.0MB. Free memory was 138.5MB in the beginning and 136.7MB in the end (delta: 1.8MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 38.94ms. Allocated memory is still 216.0MB. Free memory was 136.7MB in the beginning and 134.3MB in the end (delta: 2.3MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 330.66ms. Allocated memory was 216.0MB in the beginning and 273.7MB in the end (delta: 57.7MB). Free memory was 134.3MB in the beginning and 236.0MB in the end (delta: -101.7MB). Peak memory consumption was 13.4MB. Max. memory is 8.0GB. * TraceAbstraction took 538.40ms. Allocated memory is still 273.7MB. Free memory was 235.0MB in the beginning and 193.0MB in the end (delta: 41.9MB). Peak memory consumption was 41.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 81. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 24.575; [L23] double var_1_8 = 3.5; [L24] signed char var_1_9 = 16; [L25] signed char var_1_10 = 16; [L26] signed char var_1_11 = 4; [L27] signed long int var_1_12 = 8; [L28] unsigned char var_1_13 = 1; [L29] unsigned char var_1_14 = 1; [L30] double var_1_15 = 3.8; [L31] signed long int last_1_var_1_12 = 8; [L85] isInitial = 1 [L86] FCALL initially() [L87] COND TRUE 1 [L88] CALL updateLastVariables() [L78] last_1_var_1_12 = var_1_12 [L88] RET updateLastVariables() [L89] CALL updateVariables() [L62] var_1_8 = __VERIFIER_nondet_double() [L63] CALL assume_abort_if_not((var_1_8 >= -922337.2036854765600e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, var_1_10=16, var_1_11=4, var_1_12=8, var_1_13=1, var_1_14=1, var_1_15=19/5, var_1_1=983/40, var_1_9=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_12=8, var_1_10=16, var_1_11=4, var_1_12=8, var_1_13=1, var_1_14=1, var_1_15=19/5, var_1_1=983/40, var_1_9=16] [L63] RET assume_abort_if_not((var_1_8 >= -922337.2036854765600e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=8, var_1_10=16, var_1_11=4, var_1_12=8, var_1_13=1, var_1_14=1, var_1_15=19/5, var_1_1=983/40, var_1_9=16] [L64] var_1_10 = __VERIFIER_nondet_char() [L65] CALL assume_abort_if_not(var_1_10 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, var_1_10=-8, var_1_11=4, var_1_12=8, var_1_13=1, var_1_14=1, var_1_15=19/5, var_1_1=983/40, var_1_9=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_12=8, var_1_10=-8, var_1_11=4, var_1_12=8, var_1_13=1, var_1_14=1, var_1_15=19/5, var_1_1=983/40, var_1_9=16] [L65] RET assume_abort_if_not(var_1_10 >= -63) VAL [isInitial=1, last_1_var_1_12=8, var_1_10=-8, var_1_11=4, var_1_12=8, var_1_13=1, var_1_14=1, var_1_15=19/5, var_1_1=983/40, var_1_9=16] [L66] CALL assume_abort_if_not(var_1_10 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, var_1_10=-8, var_1_11=4, var_1_12=8, var_1_13=1, var_1_14=1, var_1_15=19/5, var_1_1=983/40, var_1_9=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_12=8, var_1_10=-8, var_1_11=4, var_1_12=8, var_1_13=1, var_1_14=1, var_1_15=19/5, var_1_1=983/40, var_1_9=16] [L66] RET assume_abort_if_not(var_1_10 <= 63) VAL [isInitial=1, last_1_var_1_12=8, var_1_10=-8, var_1_11=4, var_1_12=8, var_1_13=1, var_1_14=1, var_1_15=19/5, var_1_1=983/40, var_1_9=16] [L67] var_1_11 = __VERIFIER_nondet_char() [L68] CALL assume_abort_if_not(var_1_11 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, var_1_10=-8, var_1_11=63, var_1_12=8, var_1_13=1, var_1_14=1, var_1_15=19/5, var_1_1=983/40, var_1_9=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_12=8, var_1_10=-8, var_1_11=63, var_1_12=8, var_1_13=1, var_1_14=1, var_1_15=19/5, var_1_1=983/40, var_1_9=16] [L68] RET assume_abort_if_not(var_1_11 >= -63) VAL [isInitial=1, last_1_var_1_12=8, var_1_10=-8, var_1_11=63, var_1_12=8, var_1_13=1, var_1_14=1, var_1_15=19/5, var_1_1=983/40, var_1_9=16] [L69] CALL assume_abort_if_not(var_1_11 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, var_1_10=-8, var_1_11=63, var_1_12=8, var_1_13=1, var_1_14=1, var_1_15=19/5, var_1_1=983/40, var_1_9=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_12=8, var_1_10=-8, var_1_11=63, var_1_12=8, var_1_13=1, var_1_14=1, var_1_15=19/5, var_1_1=983/40, var_1_9=16] [L69] RET assume_abort_if_not(var_1_11 <= 63) VAL [isInitial=1, last_1_var_1_12=8, var_1_10=-8, var_1_11=63, var_1_12=8, var_1_13=1, var_1_14=1, var_1_15=19/5, var_1_1=983/40, var_1_9=16] [L70] var_1_13 = __VERIFIER_nondet_uchar() [L71] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, var_1_10=-8, var_1_11=63, var_1_12=8, var_1_14=1, var_1_15=19/5, var_1_1=983/40, var_1_9=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_12=8, var_1_10=-8, var_1_11=63, var_1_12=8, var_1_14=1, var_1_15=19/5, var_1_1=983/40, var_1_9=16] [L71] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_12=8, var_1_10=-8, var_1_11=63, var_1_12=8, var_1_14=1, var_1_15=19/5, var_1_1=983/40, var_1_9=16] [L72] CALL assume_abort_if_not(var_1_13 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, var_1_10=-8, var_1_11=63, var_1_12=8, var_1_13=1, var_1_14=1, var_1_15=19/5, var_1_1=983/40, var_1_9=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_12=8, var_1_10=-8, var_1_11=63, var_1_12=8, var_1_13=1, var_1_14=1, var_1_15=19/5, var_1_1=983/40, var_1_9=16] [L72] RET assume_abort_if_not(var_1_13 <= 1) VAL [isInitial=1, last_1_var_1_12=8, var_1_10=-8, var_1_11=63, var_1_12=8, var_1_13=1, var_1_14=1, var_1_15=19/5, var_1_1=983/40, var_1_9=16] [L73] var_1_14 = __VERIFIER_nondet_uchar() [L74] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, var_1_10=-8, var_1_11=63, var_1_12=8, var_1_13=1, var_1_15=19/5, var_1_1=983/40, var_1_9=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_12=8, var_1_10=-8, var_1_11=63, var_1_12=8, var_1_13=1, var_1_15=19/5, var_1_1=983/40, var_1_9=16] [L74] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_12=8, var_1_10=-8, var_1_11=63, var_1_12=8, var_1_13=1, var_1_15=19/5, var_1_1=983/40, var_1_9=16] [L75] CALL assume_abort_if_not(var_1_14 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, var_1_10=-8, var_1_11=63, var_1_12=8, var_1_13=1, var_1_14=0, var_1_15=19/5, var_1_1=983/40, var_1_9=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_12=8, var_1_10=-8, var_1_11=63, var_1_12=8, var_1_13=1, var_1_14=0, var_1_15=19/5, var_1_1=983/40, var_1_9=16] [L75] RET assume_abort_if_not(var_1_14 <= 1) VAL [isInitial=1, last_1_var_1_12=8, var_1_10=-8, var_1_11=63, var_1_12=8, var_1_13=1, var_1_14=0, var_1_15=19/5, var_1_1=983/40, var_1_9=16] [L89] RET updateVariables() [L90] CALL step() [L35] COND FALSE !(-4 > last_1_var_1_12) [L40] var_1_9 = var_1_10 VAL [isInitial=1, last_1_var_1_12=8, var_1_10=-8, var_1_11=63, var_1_12=8, var_1_13=1, var_1_14=0, var_1_15=19/5, var_1_1=983/40, var_1_9=-8] [L42] unsigned char stepLocal_0 = ! var_1_13; VAL [isInitial=1, last_1_var_1_12=8, stepLocal_0=0, var_1_10=-8, var_1_11=63, var_1_12=8, var_1_13=1, var_1_14=0, var_1_15=19/5, var_1_1=983/40, var_1_9=-8] [L43] COND FALSE !(stepLocal_0 || var_1_14) VAL [isInitial=1, last_1_var_1_12=8, stepLocal_0=0, var_1_10=-8, var_1_11=63, var_1_12=8, var_1_13=1, var_1_14=0, var_1_15=19/5, var_1_1=983/40, var_1_9=-8] [L50] var_1_15 = var_1_8 VAL [isInitial=1, last_1_var_1_12=8, stepLocal_0=0, var_1_10=-8, var_1_11=63, var_1_12=8, var_1_13=1, var_1_14=0, var_1_15=68, var_1_1=983/40, var_1_8=68, var_1_9=-8] [L51] COND FALSE !(var_1_15 <= var_1_15) VAL [isInitial=1, last_1_var_1_12=8, stepLocal_0=0, var_1_10=-8, var_1_11=63, var_1_12=8, var_1_13=1, var_1_14=0, var_1_15=68, var_1_1=983/40, var_1_8=68, var_1_9=-8] [L56] COND TRUE var_1_12 > var_1_9 [L57] var_1_1 = var_1_8 VAL [isInitial=1, last_1_var_1_12=8, stepLocal_0=0, var_1_10=-8, var_1_11=63, var_1_12=8, var_1_13=1, var_1_14=0, var_1_15=68, var_1_1=68, var_1_8=68, var_1_9=-8] [L90] RET step() [L91] CALL, EXPR property() [L81-L82] return ((((var_1_15 <= var_1_15) ? (((var_1_12 + var_1_12) >= (var_1_12 + var_1_9)) ? (var_1_1 == ((double) ((((var_1_8) < 0 ) ? -(var_1_8) : (var_1_8))))) : 1) : ((var_1_12 > var_1_9) ? (var_1_1 == ((double) var_1_8)) : 1)) && ((-4 > last_1_var_1_12) ? (((~ last_1_var_1_12) <= last_1_var_1_12) ? (var_1_9 == ((signed char) ((((var_1_10 + var_1_11) < 0 ) ? -(var_1_10 + var_1_11) : (var_1_10 + var_1_11))))) : 1) : (var_1_9 == ((signed char) var_1_10)))) && (((! var_1_13) || var_1_14) ? ((! var_1_14) ? (var_1_12 == ((signed long int) (((((((var_1_9) < (var_1_9)) ? (var_1_9) : (var_1_9))) < 0 ) ? -((((var_1_9) < (var_1_9)) ? (var_1_9) : (var_1_9))) : ((((var_1_9) < (var_1_9)) ? (var_1_9) : (var_1_9))))))) : (var_1_12 == ((signed long int) var_1_9))) : 1)) && (var_1_15 == ((double) var_1_8)) ; [L91] RET, EXPR property() [L91] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, isInitial=1, last_1_var_1_12=8, var_1_10=-8, var_1_11=63, var_1_12=8, var_1_13=1, var_1_14=0, var_1_15=68, var_1_1=68, var_1_8=68, var_1_9=-8] [L19] reach_error() VAL [\old(cond)=0, cond=0, isInitial=1, last_1_var_1_12=8, var_1_10=-8, var_1_11=63, var_1_12=8, var_1_13=1, var_1_14=0, var_1_15=68, var_1_1=68, var_1_8=68, var_1_9=-8] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 36 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.4s, OverallIterations: 2, TraceHistogramMax: 9, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 46 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3 IncrementalHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 46 mSDtfsCounter, 3 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 29 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=36occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 122 NumberOfCodeBlocks, 122 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 60 ConstructedInterpolants, 0 QuantifiedInterpolants, 60 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 144/144 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-21 01:33:41,890 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...