./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-83.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-83.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 39a407deab3a4246189c08648d528f65ba8317503440791fad31b3eeb9a40e8c --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 23:56:56,252 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 23:56:56,316 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 23:56:56,328 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 23:56:56,329 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 23:56:56,350 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 23:56:56,351 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 23:56:56,352 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 23:56:56,352 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 23:56:56,355 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 23:56:56,355 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 23:56:56,356 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 23:56:56,356 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 23:56:56,356 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 23:56:56,356 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 23:56:56,357 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 23:56:56,357 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 23:56:56,357 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 23:56:56,357 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 23:56:56,357 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 23:56:56,357 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 23:56:56,359 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 23:56:56,359 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 23:56:56,360 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 23:56:56,360 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 23:56:56,360 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 23:56:56,360 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 23:56:56,360 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 23:56:56,361 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 23:56:56,361 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 23:56:56,361 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 23:56:56,361 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 23:56:56,361 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 23:56:56,362 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 23:56:56,362 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 23:56:56,362 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 23:56:56,362 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 23:56:56,362 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 23:56:56,362 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 23:56:56,363 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 23:56:56,363 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 23:56:56,363 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 23:56:56,364 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: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 39a407deab3a4246189c08648d528f65ba8317503440791fad31b3eeb9a40e8c [2024-11-08 23:56:56,578 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 23:56:56,603 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 23:56:56,605 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 23:56:56,606 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 23:56:56,607 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 23:56:56,608 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-83.i [2024-11-08 23:56:58,042 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 23:56:58,205 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 23:56:58,206 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-83.i [2024-11-08 23:56:58,211 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b14e88f0/fd349e08ee664a0db85f1fcc5cbba6d7/FLAGe19a1a5d3 [2024-11-08 23:56:58,226 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b14e88f0/fd349e08ee664a0db85f1fcc5cbba6d7 [2024-11-08 23:56:58,228 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 23:56:58,229 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 23:56:58,229 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 23:56:58,230 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 23:56:58,236 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 23:56:58,236 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:56:58" (1/1) ... [2024-11-08 23:56:58,237 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7765add9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:56:58, skipping insertion in model container [2024-11-08 23:56:58,237 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:56:58" (1/1) ... [2024-11-08 23:56:58,254 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 23:56:58,390 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-83.i[915,928] [2024-11-08 23:56:58,452 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:56:58,464 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 23:56:58,476 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-83.i[915,928] [2024-11-08 23:56:58,509 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:56:58,533 INFO L204 MainTranslator]: Completed translation [2024-11-08 23:56:58,533 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:56:58 WrapperNode [2024-11-08 23:56:58,534 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 23:56:58,535 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 23:56:58,536 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 23:56:58,536 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 23:56:58,542 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:56:58" (1/1) ... [2024-11-08 23:56:58,550 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:56:58" (1/1) ... [2024-11-08 23:56:58,577 INFO L138 Inliner]: procedures = 26, calls = 28, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 99 [2024-11-08 23:56:58,578 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 23:56:58,578 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 23:56:58,578 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 23:56:58,579 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 23:56:58,588 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:56:58" (1/1) ... [2024-11-08 23:56:58,589 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:56:58" (1/1) ... [2024-11-08 23:56:58,595 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:56:58" (1/1) ... [2024-11-08 23:56:58,612 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]. [2024-11-08 23:56:58,613 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:56:58" (1/1) ... [2024-11-08 23:56:58,613 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:56:58" (1/1) ... [2024-11-08 23:56:58,618 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:56:58" (1/1) ... [2024-11-08 23:56:58,621 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:56:58" (1/1) ... [2024-11-08 23:56:58,623 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:56:58" (1/1) ... [2024-11-08 23:56:58,624 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:56:58" (1/1) ... [2024-11-08 23:56:58,627 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 23:56:58,628 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 23:56:58,628 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 23:56:58,628 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 23:56:58,628 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:56:58" (1/1) ... [2024-11-08 23:56:58,633 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 23:56:58,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 23:56:58,662 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) [2024-11-08 23:56:58,673 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 [2024-11-08 23:56:58,715 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 23:56:58,715 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 23:56:58,716 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 23:56:58,716 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 23:56:58,717 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 23:56:58,717 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 23:56:58,786 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 23:56:58,788 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 23:56:58,996 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-08 23:56:58,996 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 23:56:59,012 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 23:56:59,012 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 23:56:59,012 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:56:59 BoogieIcfgContainer [2024-11-08 23:56:59,013 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 23:56:59,015 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 23:56:59,015 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 23:56:59,017 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 23:56:59,018 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 11:56:58" (1/3) ... [2024-11-08 23:56:59,019 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1513c187 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:56:59, skipping insertion in model container [2024-11-08 23:56:59,019 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:56:58" (2/3) ... [2024-11-08 23:56:59,019 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1513c187 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:56:59, skipping insertion in model container [2024-11-08 23:56:59,019 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:56:59" (3/3) ... [2024-11-08 23:56:59,021 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-83.i [2024-11-08 23:56:59,036 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 23:56:59,036 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 23:56:59,096 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 23:56:59,102 INFO L333 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, 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;@5ef86941, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 23:56:59,102 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 23:56:59,114 INFO L276 IsEmpty]: Start isEmpty. Operand has 45 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 28 states have internal predecessors, (35), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-08 23:56:59,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-08 23:56:59,131 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:56:59,132 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:56:59,132 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:56:59,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:56:59,138 INFO L85 PathProgramCache]: Analyzing trace with hash 1148746169, now seen corresponding path program 1 times [2024-11-08 23:56:59,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:56:59,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681955629] [2024-11-08 23:56:59,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:56:59,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:56:59,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:56:59,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:56:59,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:56:59,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:56:59,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:56:59,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:56:59,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:56:59,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:56:59,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:56:59,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 23:56:59,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:56:59,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 23:56:59,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:56:59,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 23:56:59,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:56:59,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 23:56:59,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:56:59,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 23:56:59,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:56:59,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-08 23:56:59,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:56:59,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 23:56:59,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:56:59,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-08 23:56:59,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:56:59,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 23:56:59,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:56:59,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 23:56:59,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:56:59,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 23:56:59,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:56:59,558 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-08 23:56:59,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:56:59,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681955629] [2024-11-08 23:56:59,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681955629] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:56:59,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:56:59,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 23:56:59,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891060588] [2024-11-08 23:56:59,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:56:59,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 23:56:59,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:56:59,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 23:56:59,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 23:56:59,592 INFO L87 Difference]: Start difference. First operand has 45 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 28 states have internal predecessors, (35), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-08 23:56:59,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:56:59,613 INFO L93 Difference]: Finished difference Result 83 states and 139 transitions. [2024-11-08 23:56:59,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 23:56:59,616 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 94 [2024-11-08 23:56:59,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:56:59,622 INFO L225 Difference]: With dead ends: 83 [2024-11-08 23:56:59,623 INFO L226 Difference]: Without dead ends: 41 [2024-11-08 23:56:59,626 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 23:56:59,629 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 23:56:59,630 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 23:56:59,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-11-08 23:56:59,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2024-11-08 23:56:59,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-08 23:56:59,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 58 transitions. [2024-11-08 23:56:59,664 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 58 transitions. Word has length 94 [2024-11-08 23:56:59,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:56:59,665 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 58 transitions. [2024-11-08 23:56:59,665 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-08 23:56:59,665 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 58 transitions. [2024-11-08 23:56:59,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-08 23:56:59,668 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:56:59,669 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:56:59,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 23:56:59,669 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:56:59,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:56:59,670 INFO L85 PathProgramCache]: Analyzing trace with hash 2115167039, now seen corresponding path program 1 times [2024-11-08 23:56:59,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:56:59,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578050100] [2024-11-08 23:56:59,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:56:59,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:56:59,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 23:56:59,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1443412434] [2024-11-08 23:56:59,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:56:59,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 23:56:59,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 23:56:59,815 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 23:56:59,817 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-08 23:56:59,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 23:56:59,942 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 23:56:59,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 23:57:00,033 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 23:57:00,034 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 23:57:00,036 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 23:57:00,057 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-08 23:57:00,239 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 23:57:00,243 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1] [2024-11-08 23:57:00,290 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 23:57:00,293 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 11:57:00 BoogieIcfgContainer [2024-11-08 23:57:00,293 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 23:57:00,294 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 23:57:00,294 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 23:57:00,294 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 23:57:00,295 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:56:59" (3/4) ... [2024-11-08 23:57:00,298 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-08 23:57:00,303 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 23:57:00,304 INFO L158 Benchmark]: Toolchain (without parser) took 2075.20ms. Allocated memory was 184.5MB in the beginning and 274.7MB in the end (delta: 90.2MB). Free memory was 126.4MB in the beginning and 190.1MB in the end (delta: -63.8MB). Peak memory consumption was 29.5MB. Max. memory is 16.1GB. [2024-11-08 23:57:00,308 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 184.5MB. Free memory is still 146.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 23:57:00,309 INFO L158 Benchmark]: CACSL2BoogieTranslator took 304.91ms. Allocated memory is still 184.5MB. Free memory was 126.4MB in the beginning and 111.7MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-08 23:57:00,309 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.82ms. Allocated memory is still 184.5MB. Free memory was 111.7MB in the beginning and 108.5MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 23:57:00,309 INFO L158 Benchmark]: Boogie Preprocessor took 48.60ms. Allocated memory is still 184.5MB. Free memory was 108.5MB in the beginning and 103.5MB in the end (delta: 5.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 23:57:00,310 INFO L158 Benchmark]: RCFGBuilder took 385.29ms. Allocated memory is still 184.5MB. Free memory was 103.5MB in the beginning and 85.5MB in the end (delta: 18.0MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-08 23:57:00,310 INFO L158 Benchmark]: TraceAbstraction took 1278.81ms. Allocated memory was 184.5MB in the beginning and 274.7MB in the end (delta: 90.2MB). Free memory was 85.0MB in the beginning and 190.1MB in the end (delta: -105.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 23:57:00,310 INFO L158 Benchmark]: Witness Printer took 9.36ms. Allocated memory is still 274.7MB. Free memory is still 190.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 23:57:00,312 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.17ms. Allocated memory is still 184.5MB. Free memory is still 146.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 304.91ms. Allocated memory is still 184.5MB. Free memory was 126.4MB in the beginning and 111.7MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.82ms. Allocated memory is still 184.5MB. Free memory was 111.7MB in the beginning and 108.5MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 48.60ms. Allocated memory is still 184.5MB. Free memory was 108.5MB in the beginning and 103.5MB in the end (delta: 5.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 385.29ms. Allocated memory is still 184.5MB. Free memory was 103.5MB in the beginning and 85.5MB in the end (delta: 18.0MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 1278.81ms. Allocated memory was 184.5MB in the beginning and 274.7MB in the end (delta: 90.2MB). Free memory was 85.0MB in the beginning and 190.1MB in the end (delta: -105.2MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 9.36ms. Allocated memory is still 274.7MB. Free memory is still 190.1MB. There was no memory consumed. Max. memory is 16.1GB. * 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 83, overapproximation of someBinaryArithmeticDOUBLEoperation at line 50. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 128; [L23] unsigned char var_1_2 = 0; [L24] unsigned short int var_1_3 = 25; [L25] unsigned char var_1_4 = 4; [L26] double var_1_8 = 49.8; [L27] double var_1_9 = 127.8; [L28] double var_1_10 = 7.2; [L29] signed char var_1_11 = -1; [L30] signed char var_1_12 = 2; [L31] signed char var_1_13 = 4; [L32] signed char var_1_14 = 16; [L33] unsigned short int var_1_15 = 0; VAL [isInitial=0, var_1_10=36/5, var_1_11=-1, var_1_12=2, var_1_13=4, var_1_14=16, var_1_15=0, var_1_1=128, var_1_2=0, var_1_3=25, var_1_4=4, var_1_8=249/5, var_1_9=639/5] [L87] isInitial = 1 [L88] FCALL initially() [L89] COND TRUE 1 [L90] FCALL updateLastVariables() [L91] CALL updateVariables() [L56] var_1_2 = __VERIFIER_nondet_uchar() [L57] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=36/5, var_1_11=-1, var_1_12=2, var_1_13=4, var_1_14=16, var_1_15=0, var_1_1=128, var_1_3=25, var_1_4=4, var_1_8=249/5, var_1_9=639/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=36/5, var_1_11=-1, var_1_12=2, var_1_13=4, var_1_14=16, var_1_15=0, var_1_1=128, var_1_3=25, var_1_4=4, var_1_8=249/5, var_1_9=639/5] [L57] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=36/5, var_1_11=-1, var_1_12=2, var_1_13=4, var_1_14=16, var_1_15=0, var_1_1=128, var_1_3=25, var_1_4=4, var_1_8=249/5, var_1_9=639/5] [L58] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=36/5, var_1_11=-1, var_1_12=2, var_1_13=4, var_1_14=16, var_1_15=0, var_1_1=128, var_1_2=1, var_1_3=25, var_1_4=4, var_1_8=249/5, var_1_9=639/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=36/5, var_1_11=-1, var_1_12=2, var_1_13=4, var_1_14=16, var_1_15=0, var_1_1=128, var_1_2=1, var_1_3=25, var_1_4=4, var_1_8=249/5, var_1_9=639/5] [L58] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, var_1_10=36/5, var_1_11=-1, var_1_12=2, var_1_13=4, var_1_14=16, var_1_15=0, var_1_1=128, var_1_2=1, var_1_3=25, var_1_4=4, var_1_8=249/5, var_1_9=639/5] [L59] var_1_3 = __VERIFIER_nondet_ushort() [L60] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=36/5, var_1_11=-1, var_1_12=2, var_1_13=4, var_1_14=16, var_1_15=0, var_1_1=128, var_1_2=1, var_1_4=4, var_1_8=249/5, var_1_9=639/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=36/5, var_1_11=-1, var_1_12=2, var_1_13=4, var_1_14=16, var_1_15=0, var_1_1=128, var_1_2=1, var_1_4=4, var_1_8=249/5, var_1_9=639/5] [L60] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_10=36/5, var_1_11=-1, var_1_12=2, var_1_13=4, var_1_14=16, var_1_15=0, var_1_1=128, var_1_2=1, var_1_4=4, var_1_8=249/5, var_1_9=639/5] [L61] CALL assume_abort_if_not(var_1_3 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_10=36/5, var_1_11=-1, var_1_12=2, var_1_13=4, var_1_14=16, var_1_15=0, var_1_1=128, var_1_2=1, var_1_3=-196354, var_1_4=4, var_1_8=249/5, var_1_9=639/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=36/5, var_1_11=-1, var_1_12=2, var_1_13=4, var_1_14=16, var_1_15=0, var_1_1=128, var_1_2=1, var_1_3=-196354, var_1_4=4, var_1_8=249/5, var_1_9=639/5] [L61] RET assume_abort_if_not(var_1_3 <= 65534) VAL [isInitial=1, var_1_10=36/5, var_1_11=-1, var_1_12=2, var_1_13=4, var_1_14=16, var_1_15=0, var_1_1=128, var_1_2=1, var_1_3=-196354, var_1_4=4, var_1_8=249/5, var_1_9=639/5] [L62] var_1_4 = __VERIFIER_nondet_uchar() [L63] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=36/5, var_1_11=-1, var_1_12=2, var_1_13=4, var_1_14=16, var_1_15=0, var_1_1=128, var_1_2=1, var_1_3=-196354, var_1_8=249/5, var_1_9=639/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=36/5, var_1_11=-1, var_1_12=2, var_1_13=4, var_1_14=16, var_1_15=0, var_1_1=128, var_1_2=1, var_1_3=-196354, var_1_8=249/5, var_1_9=639/5] [L63] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, var_1_10=36/5, var_1_11=-1, var_1_12=2, var_1_13=4, var_1_14=16, var_1_15=0, var_1_1=128, var_1_2=1, var_1_3=-196354, var_1_8=249/5, var_1_9=639/5] [L64] CALL assume_abort_if_not(var_1_4 <= 255) VAL [\old(cond)=1, isInitial=1, var_1_10=36/5, var_1_11=-1, var_1_12=2, var_1_13=4, var_1_14=16, var_1_15=0, var_1_1=128, var_1_2=1, var_1_3=-196354, var_1_8=249/5, var_1_9=639/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=36/5, var_1_11=-1, var_1_12=2, var_1_13=4, var_1_14=16, var_1_15=0, var_1_1=128, var_1_2=1, var_1_3=-196354, var_1_8=249/5, var_1_9=639/5] [L64] RET assume_abort_if_not(var_1_4 <= 255) VAL [isInitial=1, var_1_10=36/5, var_1_11=-1, var_1_12=2, var_1_13=4, var_1_14=16, var_1_15=0, var_1_1=128, var_1_2=1, var_1_3=-196354, var_1_8=249/5, var_1_9=639/5] [L65] CALL assume_abort_if_not(var_1_4 != 0) VAL [\old(cond)=1, isInitial=1, var_1_10=36/5, var_1_11=-1, var_1_12=2, var_1_13=4, var_1_14=16, var_1_15=0, var_1_1=128, var_1_2=1, var_1_3=-196354, var_1_4=-257, var_1_8=249/5, var_1_9=639/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=36/5, var_1_11=-1, var_1_12=2, var_1_13=4, var_1_14=16, var_1_15=0, var_1_1=128, var_1_2=1, var_1_3=-196354, var_1_4=-257, var_1_8=249/5, var_1_9=639/5] [L65] RET assume_abort_if_not(var_1_4 != 0) VAL [isInitial=1, var_1_10=36/5, var_1_11=-1, var_1_12=2, var_1_13=4, var_1_14=16, var_1_15=0, var_1_1=128, var_1_2=1, var_1_3=-196354, var_1_4=-257, var_1_8=249/5, var_1_9=639/5] [L66] var_1_9 = __VERIFIER_nondet_double() [L67] CALL assume_abort_if_not((var_1_9 >= -461168.6018427382800e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 4611686.018427382800e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=36/5, var_1_11=-1, var_1_12=2, var_1_13=4, var_1_14=16, var_1_15=0, var_1_1=128, var_1_2=1, var_1_3=-196354, var_1_4=-257, var_1_8=249/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=36/5, var_1_11=-1, var_1_12=2, var_1_13=4, var_1_14=16, var_1_15=0, var_1_1=128, var_1_2=1, var_1_3=-196354, var_1_4=-257, var_1_8=249/5] [L67] RET assume_abort_if_not((var_1_9 >= -461168.6018427382800e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 4611686.018427382800e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=36/5, var_1_11=-1, var_1_12=2, var_1_13=4, var_1_14=16, var_1_15=0, var_1_1=128, var_1_2=1, var_1_3=-196354, var_1_4=-257, var_1_8=249/5] [L68] var_1_10 = __VERIFIER_nondet_double() [L69] CALL assume_abort_if_not((var_1_10 >= -461168.6018427382800e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_11=-1, var_1_12=2, var_1_13=4, var_1_14=16, var_1_15=0, var_1_1=128, var_1_2=1, var_1_3=-196354, var_1_4=-257, var_1_8=249/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=-1, var_1_12=2, var_1_13=4, var_1_14=16, var_1_15=0, var_1_1=128, var_1_2=1, var_1_3=-196354, var_1_4=-257, var_1_8=249/5] [L69] RET assume_abort_if_not((var_1_10 >= -461168.6018427382800e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, var_1_11=-1, var_1_12=2, var_1_13=4, var_1_14=16, var_1_15=0, var_1_1=128, var_1_2=1, var_1_3=-196354, var_1_4=-257, var_1_8=249/5] [L70] var_1_12 = __VERIFIER_nondet_char() [L71] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=-1, var_1_12=0, var_1_13=4, var_1_14=16, var_1_15=0, var_1_1=128, var_1_2=1, var_1_3=-196354, var_1_4=-257, var_1_8=249/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=-1, var_1_12=0, var_1_13=4, var_1_14=16, var_1_15=0, var_1_1=128, var_1_2=1, var_1_3=-196354, var_1_4=-257, var_1_8=249/5] [L71] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, var_1_11=-1, var_1_12=0, var_1_13=4, var_1_14=16, var_1_15=0, var_1_1=128, var_1_2=1, var_1_3=-196354, var_1_4=-257, var_1_8=249/5] [L72] CALL assume_abort_if_not(var_1_12 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_11=-1, var_1_12=0, var_1_13=4, var_1_14=16, var_1_15=0, var_1_1=128, var_1_2=1, var_1_3=-196354, var_1_4=-257, var_1_8=249/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=-1, var_1_12=0, var_1_13=4, var_1_14=16, var_1_15=0, var_1_1=128, var_1_2=1, var_1_3=-196354, var_1_4=-257, var_1_8=249/5] [L72] RET assume_abort_if_not(var_1_12 <= 63) VAL [isInitial=1, var_1_11=-1, var_1_12=0, var_1_13=4, var_1_14=16, var_1_15=0, var_1_1=128, var_1_2=1, var_1_3=-196354, var_1_4=-257, var_1_8=249/5] [L73] var_1_13 = __VERIFIER_nondet_char() [L74] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=-1, var_1_12=0, var_1_13=0, var_1_14=16, var_1_15=0, var_1_1=128, var_1_2=1, var_1_3=-196354, var_1_4=-257, var_1_8=249/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=-1, var_1_12=0, var_1_13=0, var_1_14=16, var_1_15=0, var_1_1=128, var_1_2=1, var_1_3=-196354, var_1_4=-257, var_1_8=249/5] [L74] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, var_1_11=-1, var_1_12=0, var_1_13=0, var_1_14=16, var_1_15=0, var_1_1=128, var_1_2=1, var_1_3=-196354, var_1_4=-257, var_1_8=249/5] [L75] CALL assume_abort_if_not(var_1_13 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_11=-1, var_1_12=0, var_1_13=0, var_1_14=16, var_1_15=0, var_1_1=128, var_1_2=1, var_1_3=-196354, var_1_4=-257, var_1_8=249/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=-1, var_1_12=0, var_1_13=0, var_1_14=16, var_1_15=0, var_1_1=128, var_1_2=1, var_1_3=-196354, var_1_4=-257, var_1_8=249/5] [L75] RET assume_abort_if_not(var_1_13 <= 63) VAL [isInitial=1, var_1_11=-1, var_1_12=0, var_1_13=0, var_1_14=16, var_1_15=0, var_1_1=128, var_1_2=1, var_1_3=-196354, var_1_4=-257, var_1_8=249/5] [L76] var_1_14 = __VERIFIER_nondet_char() [L77] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=-1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=0, var_1_1=128, var_1_2=1, var_1_3=-196354, var_1_4=-257, var_1_8=249/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=-1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=0, var_1_1=128, var_1_2=1, var_1_3=-196354, var_1_4=-257, var_1_8=249/5] [L77] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, var_1_11=-1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=0, var_1_1=128, var_1_2=1, var_1_3=-196354, var_1_4=-257, var_1_8=249/5] [L78] CALL assume_abort_if_not(var_1_14 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_11=-1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=0, var_1_1=128, var_1_2=1, var_1_3=-196354, var_1_4=-257, var_1_8=249/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=-1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=0, var_1_1=128, var_1_2=1, var_1_3=-196354, var_1_4=-257, var_1_8=249/5] [L78] RET assume_abort_if_not(var_1_14 <= 126) VAL [isInitial=1, var_1_11=-1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=0, var_1_1=128, var_1_2=1, var_1_3=-196354, var_1_4=-257, var_1_8=249/5] [L91] RET updateVariables() [L92] CALL step() [L37] var_1_11 = ((var_1_12 + var_1_13) - ((((25) < (var_1_14)) ? (25) : (var_1_14)))) [L38] var_1_15 = var_1_14 [L39] signed long int stepLocal_0 = var_1_3 / var_1_4; VAL [isInitial=1, stepLocal_0=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=0, var_1_1=128, var_1_2=1, var_1_3=-196354, var_1_4=-257, var_1_8=249/5] [L40] COND TRUE \read(var_1_2) [L41] var_1_1 = (((((((var_1_3) < 0 ) ? -(var_1_3) : (var_1_3))) < 0 ) ? -((((var_1_3) < 0 ) ? -(var_1_3) : (var_1_3))) : ((((var_1_3) < 0 ) ? -(var_1_3) : (var_1_3))))) VAL [isInitial=1, stepLocal_0=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=0, var_1_1=254, var_1_2=1, var_1_3=-196354, var_1_4=-257, var_1_8=249/5] [L49] COND TRUE var_1_11 >= ((var_1_3 / var_1_4) + (var_1_1 * var_1_11)) [L50] var_1_8 = (var_1_9 + ((((var_1_10) < 0 ) ? -(var_1_10) : (var_1_10)))) VAL [isInitial=1, stepLocal_0=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=0, var_1_1=254, var_1_2=1, var_1_3=-196354, var_1_4=-257] [L92] RET step() [L93] CALL, EXPR property() [L83-L84] return (((var_1_2 ? (var_1_1 == ((unsigned short int) (((((((var_1_3) < 0 ) ? -(var_1_3) : (var_1_3))) < 0 ) ? -((((var_1_3) < 0 ) ? -(var_1_3) : (var_1_3))) : ((((var_1_3) < 0 ) ? -(var_1_3) : (var_1_3))))))) : (((var_1_3 / var_1_4) >= (((((var_1_15 * var_1_15)) < (var_1_11)) ? ((var_1_15 * var_1_15)) : (var_1_11)))) ? (var_1_1 == ((unsigned short int) var_1_4)) : (var_1_1 == ((unsigned short int) 5)))) && ((var_1_11 >= ((var_1_3 / var_1_4) + (var_1_1 * var_1_11))) ? (var_1_8 == ((double) (var_1_9 + ((((var_1_10) < 0 ) ? -(var_1_10) : (var_1_10)))))) : (var_1_8 == ((double) var_1_9)))) && (var_1_11 == ((signed char) ((var_1_12 + var_1_13) - ((((25) < (var_1_14)) ? (25) : (var_1_14))))))) && (var_1_15 == ((unsigned short int) var_1_14)) ; VAL [\result=0, isInitial=1, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=0, var_1_1=254, var_1_2=1, var_1_3=-196354, var_1_4=-257] [L93] RET, EXPR property() [L93] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=0, var_1_1=254, var_1_2=1, var_1_3=-196354, var_1_4=-257] [L19] reach_error() VAL [isInitial=1, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=0, var_1_1=254, var_1_2=1, var_1_3=-196354, var_1_4=-257] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 45 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.2s, OverallIterations: 2, TraceHistogramMax: 15, 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, 58 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 0 IncrementalHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 58 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 47 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=45occurred 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.2s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 282 NumberOfCodeBlocks, 282 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 93 ConstructedInterpolants, 0 QuantifiedInterpolants, 93 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 420/420 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 [2024-11-08 23:57:00,344 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... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-83.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 39a407deab3a4246189c08648d528f65ba8317503440791fad31b3eeb9a40e8c --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 23:57:02,369 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 23:57:02,430 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-08 23:57:02,434 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 23:57:02,435 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 23:57:02,457 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 23:57:02,459 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 23:57:02,459 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 23:57:02,460 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 23:57:02,460 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 23:57:02,460 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 23:57:02,460 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 23:57:02,461 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 23:57:02,461 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 23:57:02,461 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 23:57:02,462 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 23:57:02,462 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 23:57:02,464 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 23:57:02,464 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 23:57:02,464 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 23:57:02,466 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 23:57:02,467 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 23:57:02,467 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 23:57:02,467 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 23:57:02,467 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-08 23:57:02,467 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 23:57:02,468 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-08 23:57:02,468 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 23:57:02,468 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 23:57:02,468 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 23:57:02,468 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 23:57:02,468 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 23:57:02,469 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 23:57:02,469 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 23:57:02,469 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 23:57:02,469 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 23:57:02,469 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 23:57:02,469 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 23:57:02,470 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-08 23:57:02,470 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-08 23:57:02,470 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 23:57:02,472 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 23:57:02,472 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 23:57:02,472 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 23:57:02,472 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: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 39a407deab3a4246189c08648d528f65ba8317503440791fad31b3eeb9a40e8c [2024-11-08 23:57:02,767 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 23:57:02,789 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 23:57:02,793 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 23:57:02,794 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 23:57:02,794 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 23:57:02,796 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-83.i [2024-11-08 23:57:04,291 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 23:57:04,462 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 23:57:04,463 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-83.i [2024-11-08 23:57:04,474 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e90cddee8/6175f3bba66e4c45846174e1079ed510/FLAG68f2251c3 [2024-11-08 23:57:04,484 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e90cddee8/6175f3bba66e4c45846174e1079ed510 [2024-11-08 23:57:04,487 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 23:57:04,488 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 23:57:04,489 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 23:57:04,493 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 23:57:04,500 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 23:57:04,501 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:57:04" (1/1) ... [2024-11-08 23:57:04,502 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3bc25a67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:57:04, skipping insertion in model container [2024-11-08 23:57:04,502 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:57:04" (1/1) ... [2024-11-08 23:57:04,531 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 23:57:04,677 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-83.i[915,928] [2024-11-08 23:57:04,721 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:57:04,736 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 23:57:04,747 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-83.i[915,928] [2024-11-08 23:57:04,768 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:57:04,787 INFO L204 MainTranslator]: Completed translation [2024-11-08 23:57:04,787 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:57:04 WrapperNode [2024-11-08 23:57:04,787 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 23:57:04,788 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 23:57:04,788 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 23:57:04,788 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 23:57:04,793 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:57:04" (1/1) ... [2024-11-08 23:57:04,805 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:57:04" (1/1) ... [2024-11-08 23:57:04,824 INFO L138 Inliner]: procedures = 27, calls = 28, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 96 [2024-11-08 23:57:04,825 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 23:57:04,825 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 23:57:04,825 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 23:57:04,825 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 23:57:04,835 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:57:04" (1/1) ... [2024-11-08 23:57:04,835 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:57:04" (1/1) ... [2024-11-08 23:57:04,839 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:57:04" (1/1) ... [2024-11-08 23:57:04,850 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]. [2024-11-08 23:57:04,850 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:57:04" (1/1) ... [2024-11-08 23:57:04,850 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:57:04" (1/1) ... [2024-11-08 23:57:04,858 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:57:04" (1/1) ... [2024-11-08 23:57:04,864 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:57:04" (1/1) ... [2024-11-08 23:57:04,865 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:57:04" (1/1) ... [2024-11-08 23:57:04,866 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:57:04" (1/1) ... [2024-11-08 23:57:04,868 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 23:57:04,869 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 23:57:04,869 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 23:57:04,869 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 23:57:04,869 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:57:04" (1/1) ... [2024-11-08 23:57:04,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 23:57:04,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 23:57:04,899 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) [2024-11-08 23:57:04,901 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 [2024-11-08 23:57:04,930 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 23:57:04,930 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-08 23:57:04,931 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 23:57:04,931 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 23:57:04,931 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 23:57:04,931 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 23:57:05,006 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 23:57:05,008 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 23:57:05,698 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-08 23:57:05,699 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 23:57:05,708 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 23:57:05,708 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 23:57:05,709 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:57:05 BoogieIcfgContainer [2024-11-08 23:57:05,709 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 23:57:05,710 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 23:57:05,710 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 23:57:05,713 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 23:57:05,713 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 11:57:04" (1/3) ... [2024-11-08 23:57:05,713 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d832b5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:57:05, skipping insertion in model container [2024-11-08 23:57:05,714 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:57:04" (2/3) ... [2024-11-08 23:57:05,714 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d832b5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:57:05, skipping insertion in model container [2024-11-08 23:57:05,714 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:57:05" (3/3) ... [2024-11-08 23:57:05,715 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-83.i [2024-11-08 23:57:05,728 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 23:57:05,728 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 23:57:05,780 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 23:57:05,792 INFO L333 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, 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;@1b7baa45, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 23:57:05,792 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 23:57:05,800 INFO L276 IsEmpty]: Start isEmpty. Operand has 45 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 28 states have internal predecessors, (35), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-08 23:57:05,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-08 23:57:05,808 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:57:05,809 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:57:05,810 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:57:05,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:57:05,815 INFO L85 PathProgramCache]: Analyzing trace with hash 1148746169, now seen corresponding path program 1 times [2024-11-08 23:57:05,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 23:57:05,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [351740087] [2024-11-08 23:57:05,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:57:05,828 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 23:57:05,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 23:57:05,830 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 23:57:05,831 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-08 23:57:06,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:06,013 INFO L255 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-08 23:57:06,019 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:57:06,048 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2024-11-08 23:57:06,048 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 23:57:06,048 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 23:57:06,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [351740087] [2024-11-08 23:57:06,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [351740087] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:57:06,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:57:06,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 23:57:06,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995462647] [2024-11-08 23:57:06,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:57:06,054 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 23:57:06,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 23:57:06,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 23:57:06,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 23:57:06,070 INFO L87 Difference]: Start difference. First operand has 45 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 28 states have internal predecessors, (35), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 1 states have call successors, (15), 1 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 23:57:06,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:57:06,086 INFO L93 Difference]: Finished difference Result 83 states and 139 transitions. [2024-11-08 23:57:06,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 23:57:06,088 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 1 states have call successors, (15), 1 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) Word has length 94 [2024-11-08 23:57:06,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:57:06,092 INFO L225 Difference]: With dead ends: 83 [2024-11-08 23:57:06,092 INFO L226 Difference]: Without dead ends: 41 [2024-11-08 23:57:06,095 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 23:57:06,097 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 23:57:06,100 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 23:57:06,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-11-08 23:57:06,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2024-11-08 23:57:06,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-08 23:57:06,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 58 transitions. [2024-11-08 23:57:06,128 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 58 transitions. Word has length 94 [2024-11-08 23:57:06,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:57:06,129 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 58 transitions. [2024-11-08 23:57:06,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 1 states have call successors, (15), 1 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 23:57:06,129 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 58 transitions. [2024-11-08 23:57:06,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-08 23:57:06,132 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:57:06,132 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:57:06,140 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-08 23:57:06,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 23:57:06,332 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:57:06,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:57:06,333 INFO L85 PathProgramCache]: Analyzing trace with hash 2115167039, now seen corresponding path program 1 times [2024-11-08 23:57:06,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 23:57:06,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [448537092] [2024-11-08 23:57:06,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:57:06,334 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 23:57:06,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 23:57:06,337 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 23:57:06,337 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-08 23:57:06,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:06,533 INFO L255 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-08 23:57:06,540 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:57:43,037 WARN L286 SmtUtils]: Spent 17.31s on a formula simplification that was a NOOP. DAG size: 84 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)