./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-24.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-24.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 1c6c11b57806b00201b98326e672a3344df9212139d60f788fa43f0ecfa41035 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 09:24:58,801 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 09:24:58,854 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 09:24:58,859 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 09:24:58,859 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 09:24:58,877 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 09:24:58,878 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 09:24:58,879 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 09:24:58,880 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 09:24:58,881 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 09:24:58,881 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 09:24:58,881 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 09:24:58,882 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 09:24:58,882 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 09:24:58,883 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 09:24:58,884 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 09:24:58,884 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 09:24:58,884 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 09:24:58,884 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 09:24:58,885 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 09:24:58,885 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 09:24:58,888 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 09:24:58,888 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 09:24:58,888 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 09:24:58,888 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 09:24:58,889 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 09:24:58,889 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 09:24:58,889 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 09:24:58,889 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 09:24:58,889 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 09:24:58,889 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 09:24:58,890 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 09:24:58,890 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 09:24:58,890 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 09:24:58,890 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 09:24:58,890 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 09:24:58,890 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 09:24:58,890 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 09:24:58,891 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 09:24:58,891 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 09:24:58,891 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 09:24:58,892 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 09:24:58,892 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 -> 1c6c11b57806b00201b98326e672a3344df9212139d60f788fa43f0ecfa41035 [2024-10-24 09:24:59,151 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 09:24:59,172 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 09:24:59,175 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 09:24:59,176 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 09:24:59,176 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 09:24:59,177 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-24.i [2024-10-24 09:25:00,460 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 09:25:00,677 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 09:25:00,678 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-24.i [2024-10-24 09:25:00,689 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3448e4bc6/9a889e97f09d4e37a12f3cd3146ccf28/FLAGbf103f4dd [2024-10-24 09:25:00,703 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3448e4bc6/9a889e97f09d4e37a12f3cd3146ccf28 [2024-10-24 09:25:00,706 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 09:25:00,707 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 09:25:00,709 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 09:25:00,709 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 09:25:00,714 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 09:25:00,714 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 09:25:00" (1/1) ... [2024-10-24 09:25:00,716 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c2fc8aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:25:00, skipping insertion in model container [2024-10-24 09:25:00,717 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 09:25:00" (1/1) ... [2024-10-24 09:25:00,740 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 09:25:00,896 WARN L248 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-1loop_file-24.i[915,928] [2024-10-24 09:25:00,947 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 09:25:00,956 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 09:25:00,969 WARN L248 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-1loop_file-24.i[915,928] [2024-10-24 09:25:00,999 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 09:25:01,022 INFO L204 MainTranslator]: Completed translation [2024-10-24 09:25:01,023 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:25:01 WrapperNode [2024-10-24 09:25:01,023 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 09:25:01,024 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 09:25:01,024 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 09:25:01,024 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 09:25:01,031 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:25:01" (1/1) ... [2024-10-24 09:25:01,042 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:25:01" (1/1) ... [2024-10-24 09:25:01,080 INFO L138 Inliner]: procedures = 26, calls = 28, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 107 [2024-10-24 09:25:01,080 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 09:25:01,081 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 09:25:01,081 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 09:25:01,081 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 09:25:01,090 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:25:01" (1/1) ... [2024-10-24 09:25:01,091 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:25:01" (1/1) ... [2024-10-24 09:25:01,093 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:25:01" (1/1) ... [2024-10-24 09:25:01,109 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-10-24 09:25:01,109 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:25:01" (1/1) ... [2024-10-24 09:25:01,109 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:25:01" (1/1) ... [2024-10-24 09:25:01,114 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:25:01" (1/1) ... [2024-10-24 09:25:01,120 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:25:01" (1/1) ... [2024-10-24 09:25:01,127 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:25:01" (1/1) ... [2024-10-24 09:25:01,128 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:25:01" (1/1) ... [2024-10-24 09:25:01,132 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 09:25:01,133 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 09:25:01,133 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 09:25:01,133 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 09:25:01,134 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:25:01" (1/1) ... [2024-10-24 09:25:01,141 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 09:25:01,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 09:25:01,176 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-10-24 09:25:01,183 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-10-24 09:25:01,223 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 09:25:01,223 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 09:25:01,223 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 09:25:01,224 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 09:25:01,224 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 09:25:01,224 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 09:25:01,294 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 09:25:01,298 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 09:25:01,546 INFO L? ?]: Removed 9 outVars from TransFormulas that were not future-live. [2024-10-24 09:25:01,546 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 09:25:01,586 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 09:25:01,586 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 09:25:01,586 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 09:25:01 BoogieIcfgContainer [2024-10-24 09:25:01,586 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 09:25:01,590 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 09:25:01,590 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 09:25:01,593 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 09:25:01,594 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 09:25:00" (1/3) ... [2024-10-24 09:25:01,594 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34cc7fa9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 09:25:01, skipping insertion in model container [2024-10-24 09:25:01,595 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:25:01" (2/3) ... [2024-10-24 09:25:01,595 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34cc7fa9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 09:25:01, skipping insertion in model container [2024-10-24 09:25:01,595 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 09:25:01" (3/3) ... [2024-10-24 09:25:01,597 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-24.i [2024-10-24 09:25:01,615 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 09:25:01,616 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 09:25:01,694 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 09:25:01,703 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;@10b892f9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 09:25:01,704 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 09:25:01,709 INFO L276 IsEmpty]: Start isEmpty. Operand has 42 states, 24 states have (on average 1.4166666666666667) internal successors, (34), 25 states have internal predecessors, (34), 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-10-24 09:25:01,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-24 09:25:01,737 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:25:01,738 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] [2024-10-24 09:25:01,739 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:25:01,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:25:01,743 INFO L85 PathProgramCache]: Analyzing trace with hash 1158333792, now seen corresponding path program 1 times [2024-10-24 09:25:01,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 09:25:01,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232751326] [2024-10-24 09:25:01,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:25:01,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 09:25:01,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:01,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 09:25:01,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:01,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 09:25:01,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:01,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 09:25:01,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:01,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-24 09:25:01,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:01,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 09:25:01,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:01,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-24 09:25:01,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:01,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 09:25:01,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:02,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 09:25:02,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:02,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 09:25:02,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:02,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 09:25:02,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:02,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 09:25:02,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:02,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 09:25:02,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:02,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 09:25:02,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:02,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 09:25:02,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:02,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 09:25:02,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:02,066 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 09:25:02,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 09:25:02,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232751326] [2024-10-24 09:25:02,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [232751326] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 09:25:02,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 09:25:02,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 09:25:02,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769991731] [2024-10-24 09:25:02,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 09:25:02,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 09:25:02,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 09:25:02,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 09:25:02,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 09:25:02,099 INFO L87 Difference]: Start difference. First operand has 42 states, 24 states have (on average 1.4166666666666667) internal successors, (34), 25 states have internal predecessors, (34), 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 10.0) internal successors, (20), 2 states have internal predecessors, (20), 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-10-24 09:25:02,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 09:25:02,139 INFO L93 Difference]: Finished difference Result 83 states and 142 transitions. [2024-10-24 09:25:02,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 09:25:02,143 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 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 92 [2024-10-24 09:25:02,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 09:25:02,149 INFO L225 Difference]: With dead ends: 83 [2024-10-24 09:25:02,149 INFO L226 Difference]: Without dead ends: 40 [2024-10-24 09:25:02,152 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-10-24 09:25:02,156 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 09:25:02,157 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 56 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 09:25:02,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-10-24 09:25:02,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2024-10-24 09:25:02,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 23 states have internal predecessors, (29), 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-10-24 09:25:02,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 59 transitions. [2024-10-24 09:25:02,197 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 59 transitions. Word has length 92 [2024-10-24 09:25:02,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 09:25:02,197 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 59 transitions. [2024-10-24 09:25:02,198 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 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-10-24 09:25:02,198 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 59 transitions. [2024-10-24 09:25:02,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-24 09:25:02,200 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:25:02,201 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] [2024-10-24 09:25:02,201 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 09:25:02,201 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:25:02,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:25:02,202 INFO L85 PathProgramCache]: Analyzing trace with hash 669175970, now seen corresponding path program 1 times [2024-10-24 09:25:02,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 09:25:02,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208385597] [2024-10-24 09:25:02,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:25:02,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 09:25:02,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 09:25:02,350 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 09:25:02,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 09:25:02,457 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 09:25:02,457 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 09:25:02,458 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-24 09:25:02,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 09:25:02,464 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1] [2024-10-24 09:25:02,525 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 09:25:02,530 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 09:25:02 BoogieIcfgContainer [2024-10-24 09:25:02,530 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 09:25:02,531 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 09:25:02,531 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 09:25:02,531 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 09:25:02,531 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 09:25:01" (3/4) ... [2024-10-24 09:25:02,533 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-24 09:25:02,534 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 09:25:02,534 INFO L158 Benchmark]: Toolchain (without parser) took 1827.64ms. Allocated memory is still 165.7MB. Free memory was 134.7MB in the beginning and 80.3MB in the end (delta: 54.4MB). Peak memory consumption was 51.5MB. Max. memory is 16.1GB. [2024-10-24 09:25:02,535 INFO L158 Benchmark]: CDTParser took 0.08ms. Allocated memory is still 117.4MB. Free memory is still 90.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 09:25:02,535 INFO L158 Benchmark]: CACSL2BoogieTranslator took 314.36ms. Allocated memory is still 165.7MB. Free memory was 133.9MB in the beginning and 120.2MB in the end (delta: 13.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-24 09:25:02,538 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.17ms. Allocated memory is still 165.7MB. Free memory was 120.2MB in the beginning and 117.1MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 09:25:02,538 INFO L158 Benchmark]: Boogie Preprocessor took 51.35ms. Allocated memory is still 165.7MB. Free memory was 117.1MB in the beginning and 112.9MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 09:25:02,538 INFO L158 Benchmark]: RCFGBuilder took 453.74ms. Allocated memory is still 165.7MB. Free memory was 112.9MB in the beginning and 93.0MB in the end (delta: 19.9MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-10-24 09:25:02,539 INFO L158 Benchmark]: TraceAbstraction took 939.96ms. Allocated memory is still 165.7MB. Free memory was 93.0MB in the beginning and 80.3MB in the end (delta: 12.7MB). Peak memory consumption was 9.5MB. Max. memory is 16.1GB. [2024-10-24 09:25:02,539 INFO L158 Benchmark]: Witness Printer took 3.42ms. Allocated memory is still 165.7MB. Free memory is still 80.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 09:25:02,540 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.08ms. Allocated memory is still 117.4MB. Free memory is still 90.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 314.36ms. Allocated memory is still 165.7MB. Free memory was 133.9MB in the beginning and 120.2MB in the end (delta: 13.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 56.17ms. Allocated memory is still 165.7MB. Free memory was 120.2MB in the beginning and 117.1MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 51.35ms. Allocated memory is still 165.7MB. Free memory was 117.1MB in the beginning and 112.9MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 453.74ms. Allocated memory is still 165.7MB. Free memory was 112.9MB in the beginning and 93.0MB in the end (delta: 19.9MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 939.96ms. Allocated memory is still 165.7MB. Free memory was 93.0MB in the beginning and 80.3MB in the end (delta: 12.7MB). Peak memory consumption was 9.5MB. Max. memory is 16.1GB. * Witness Printer took 3.42ms. Allocated memory is still 165.7MB. Free memory is still 80.3MB. 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 someBinaryFLOATComparisonOperation at line 88. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed char var_1_1 = 32; [L23] unsigned char var_1_2 = 0; [L24] float var_1_3 = 127.1; [L25] signed char var_1_4 = 16; [L26] signed char var_1_5 = 4; [L27] unsigned char var_1_6 = 8; [L28] float var_1_7 = 1000000.6; [L29] unsigned char var_1_8 = 64; [L30] unsigned char var_1_9 = 64; [L31] unsigned char var_1_10 = 128; [L32] unsigned char var_1_11 = 32; [L33] float var_1_12 = 16.8; [L92] isInitial = 1 [L93] FCALL initially() [L94] int k_loop; [L95] k_loop = 0 VAL [isInitial=1, k_loop=0, var_1_10=128, var_1_11=32, var_1_12=84/5, var_1_1=32, var_1_2=0, var_1_3=1271/10, var_1_4=16, var_1_5=4, var_1_6=8, var_1_7=5000003/5, var_1_8=64, var_1_9=64] [L95] COND TRUE k_loop < 1 [L96] FCALL updateLastVariables() [L97] CALL updateVariables() [L60] var_1_2 = __VERIFIER_nondet_uchar() [L61] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=32, var_1_12=84/5, var_1_1=32, var_1_3=1271/10, var_1_4=16, var_1_5=4, var_1_6=8, var_1_7=5000003/5, var_1_8=64, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=32, var_1_12=84/5, var_1_1=32, var_1_3=1271/10, var_1_4=16, var_1_5=4, var_1_6=8, var_1_7=5000003/5, var_1_8=64, var_1_9=64] [L61] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=128, var_1_11=32, var_1_12=84/5, var_1_1=32, var_1_3=1271/10, var_1_4=16, var_1_5=4, var_1_6=8, var_1_7=5000003/5, var_1_8=64, var_1_9=64] [L62] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=32, var_1_12=84/5, var_1_1=32, var_1_2=0, var_1_3=1271/10, var_1_4=16, var_1_5=4, var_1_6=8, var_1_7=5000003/5, var_1_8=64, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=32, var_1_12=84/5, var_1_1=32, var_1_2=0, var_1_3=1271/10, var_1_4=16, var_1_5=4, var_1_6=8, var_1_7=5000003/5, var_1_8=64, var_1_9=64] [L62] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, var_1_10=128, var_1_11=32, var_1_12=84/5, var_1_1=32, var_1_2=0, var_1_3=1271/10, var_1_4=16, var_1_5=4, var_1_6=8, var_1_7=5000003/5, var_1_8=64, var_1_9=64] [L63] var_1_3 = __VERIFIER_nondet_float() [L64] CALL assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=32, var_1_12=84/5, var_1_1=32, var_1_2=0, var_1_4=16, var_1_5=4, var_1_6=8, var_1_7=5000003/5, var_1_8=64, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=32, var_1_12=84/5, var_1_1=32, var_1_2=0, var_1_4=16, var_1_5=4, var_1_6=8, var_1_7=5000003/5, var_1_8=64, var_1_9=64] [L64] RET assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=128, var_1_11=32, var_1_12=84/5, var_1_1=32, var_1_2=0, var_1_4=16, var_1_5=4, var_1_6=8, var_1_7=5000003/5, var_1_8=64, var_1_9=64] [L65] var_1_4 = __VERIFIER_nondet_char() [L66] CALL assume_abort_if_not(var_1_4 >= -1) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=32, var_1_12=84/5, var_1_1=32, var_1_2=0, var_1_4=125, var_1_5=4, var_1_6=8, var_1_7=5000003/5, var_1_8=64, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=32, var_1_12=84/5, var_1_1=32, var_1_2=0, var_1_4=125, var_1_5=4, var_1_6=8, var_1_7=5000003/5, var_1_8=64, var_1_9=64] [L66] RET assume_abort_if_not(var_1_4 >= -1) VAL [isInitial=1, var_1_10=128, var_1_11=32, var_1_12=84/5, var_1_1=32, var_1_2=0, var_1_4=125, var_1_5=4, var_1_6=8, var_1_7=5000003/5, var_1_8=64, var_1_9=64] [L67] CALL assume_abort_if_not(var_1_4 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=32, var_1_12=84/5, var_1_1=32, var_1_2=0, var_1_4=125, var_1_5=4, var_1_6=8, var_1_7=5000003/5, var_1_8=64, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=32, var_1_12=84/5, var_1_1=32, var_1_2=0, var_1_4=125, var_1_5=4, var_1_6=8, var_1_7=5000003/5, var_1_8=64, var_1_9=64] [L67] RET assume_abort_if_not(var_1_4 <= 126) VAL [isInitial=1, var_1_10=128, var_1_11=32, var_1_12=84/5, var_1_1=32, var_1_2=0, var_1_4=125, var_1_5=4, var_1_6=8, var_1_7=5000003/5, var_1_8=64, var_1_9=64] [L68] var_1_5 = __VERIFIER_nondet_char() [L69] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=32, var_1_12=84/5, var_1_1=32, var_1_2=0, var_1_4=125, var_1_5=126, var_1_6=8, var_1_7=5000003/5, var_1_8=64, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=32, var_1_12=84/5, var_1_1=32, var_1_2=0, var_1_4=125, var_1_5=126, var_1_6=8, var_1_7=5000003/5, var_1_8=64, var_1_9=64] [L69] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, var_1_10=128, var_1_11=32, var_1_12=84/5, var_1_1=32, var_1_2=0, var_1_4=125, var_1_5=126, var_1_6=8, var_1_7=5000003/5, var_1_8=64, var_1_9=64] [L70] CALL assume_abort_if_not(var_1_5 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=32, var_1_12=84/5, var_1_1=32, var_1_2=0, var_1_4=125, var_1_5=126, var_1_6=8, var_1_7=5000003/5, var_1_8=64, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=32, var_1_12=84/5, var_1_1=32, var_1_2=0, var_1_4=125, var_1_5=126, var_1_6=8, var_1_7=5000003/5, var_1_8=64, var_1_9=64] [L70] RET assume_abort_if_not(var_1_5 <= 126) VAL [isInitial=1, var_1_10=128, var_1_11=32, var_1_12=84/5, var_1_1=32, var_1_2=0, var_1_4=125, var_1_5=126, var_1_6=8, var_1_7=5000003/5, var_1_8=64, var_1_9=64] [L71] var_1_7 = __VERIFIER_nondet_float() [L72] CALL assume_abort_if_not((var_1_7 >= -922337.2036854776000e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854776000e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=32, var_1_12=84/5, var_1_1=32, var_1_2=0, var_1_4=125, var_1_5=126, var_1_6=8, var_1_8=64, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=32, var_1_12=84/5, var_1_1=32, var_1_2=0, var_1_4=125, var_1_5=126, var_1_6=8, var_1_8=64, var_1_9=64] [L72] RET assume_abort_if_not((var_1_7 >= -922337.2036854776000e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854776000e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=128, var_1_11=32, var_1_12=84/5, var_1_1=32, var_1_2=0, var_1_4=125, var_1_5=126, var_1_6=8, var_1_8=64, var_1_9=64] [L73] var_1_8 = __VERIFIER_nondet_uchar() [L74] CALL assume_abort_if_not(var_1_8 >= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=32, var_1_12=84/5, var_1_1=32, var_1_2=0, var_1_4=125, var_1_5=126, var_1_6=8, var_1_8=127, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=32, var_1_12=84/5, var_1_1=32, var_1_2=0, var_1_4=125, var_1_5=126, var_1_6=8, var_1_8=127, var_1_9=64] [L74] RET assume_abort_if_not(var_1_8 >= 63) VAL [isInitial=1, var_1_10=128, var_1_11=32, var_1_12=84/5, var_1_1=32, var_1_2=0, var_1_4=125, var_1_5=126, var_1_6=8, var_1_8=127, var_1_9=64] [L75] CALL assume_abort_if_not(var_1_8 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=32, var_1_12=84/5, var_1_1=32, var_1_2=0, var_1_4=125, var_1_5=126, var_1_6=8, var_1_8=127, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=32, var_1_12=84/5, var_1_1=32, var_1_2=0, var_1_4=125, var_1_5=126, var_1_6=8, var_1_8=127, var_1_9=64] [L75] RET assume_abort_if_not(var_1_8 <= 127) VAL [isInitial=1, var_1_10=128, var_1_11=32, var_1_12=84/5, var_1_1=32, var_1_2=0, var_1_4=125, var_1_5=126, var_1_6=8, var_1_8=127, var_1_9=64] [L76] var_1_9 = __VERIFIER_nondet_uchar() [L77] CALL assume_abort_if_not(var_1_9 >= 64) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=32, var_1_12=84/5, var_1_1=32, var_1_2=0, var_1_4=125, var_1_5=126, var_1_6=8, var_1_8=127, var_1_9=127] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=32, var_1_12=84/5, var_1_1=32, var_1_2=0, var_1_4=125, var_1_5=126, var_1_6=8, var_1_8=127, var_1_9=127] [L77] RET assume_abort_if_not(var_1_9 >= 64) VAL [isInitial=1, var_1_10=128, var_1_11=32, var_1_12=84/5, var_1_1=32, var_1_2=0, var_1_4=125, var_1_5=126, var_1_6=8, var_1_8=127, var_1_9=127] [L78] CALL assume_abort_if_not(var_1_9 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=32, var_1_12=84/5, var_1_1=32, var_1_2=0, var_1_4=125, var_1_5=126, var_1_6=8, var_1_8=127, var_1_9=127] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=32, var_1_12=84/5, var_1_1=32, var_1_2=0, var_1_4=125, var_1_5=126, var_1_6=8, var_1_8=127, var_1_9=127] [L78] RET assume_abort_if_not(var_1_9 <= 127) VAL [isInitial=1, var_1_10=128, var_1_11=32, var_1_12=84/5, var_1_1=32, var_1_2=0, var_1_4=125, var_1_5=126, var_1_6=8, var_1_8=127, var_1_9=127] [L79] var_1_10 = __VERIFIER_nondet_uchar() [L80] CALL assume_abort_if_not(var_1_10 >= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=127, var_1_11=32, var_1_12=84/5, var_1_1=32, var_1_2=0, var_1_4=125, var_1_5=126, var_1_6=8, var_1_8=127, var_1_9=127] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=127, var_1_11=32, var_1_12=84/5, var_1_1=32, var_1_2=0, var_1_4=125, var_1_5=126, var_1_6=8, var_1_8=127, var_1_9=127] [L80] RET assume_abort_if_not(var_1_10 >= 127) VAL [isInitial=1, var_1_10=127, var_1_11=32, var_1_12=84/5, var_1_1=32, var_1_2=0, var_1_4=125, var_1_5=126, var_1_6=8, var_1_8=127, var_1_9=127] [L81] CALL assume_abort_if_not(var_1_10 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_10=127, var_1_11=32, var_1_12=84/5, var_1_1=32, var_1_2=0, var_1_4=125, var_1_5=126, var_1_6=8, var_1_8=127, var_1_9=127] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=127, var_1_11=32, var_1_12=84/5, var_1_1=32, var_1_2=0, var_1_4=125, var_1_5=126, var_1_6=8, var_1_8=127, var_1_9=127] [L81] RET assume_abort_if_not(var_1_10 <= 254) VAL [isInitial=1, var_1_10=127, var_1_11=32, var_1_12=84/5, var_1_1=32, var_1_2=0, var_1_4=125, var_1_5=126, var_1_6=8, var_1_8=127, var_1_9=127] [L82] var_1_12 = __VERIFIER_nondet_float() [L83] CALL assume_abort_if_not((var_1_12 >= -922337.2036854776000e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854776000e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=127, var_1_11=32, var_1_1=32, var_1_2=0, var_1_4=125, var_1_5=126, var_1_6=8, var_1_8=127, var_1_9=127] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=127, var_1_11=32, var_1_1=32, var_1_2=0, var_1_4=125, var_1_5=126, var_1_6=8, var_1_8=127, var_1_9=127] [L83] RET assume_abort_if_not((var_1_12 >= -922337.2036854776000e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854776000e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=127, var_1_11=32, var_1_1=32, var_1_2=0, var_1_4=125, var_1_5=126, var_1_6=8, var_1_8=127, var_1_9=127] [L97] RET updateVariables() [L98] CALL step() [L37] COND FALSE !(var_1_2 || (64.75f < var_1_3)) [L44] var_1_1 = var_1_5 VAL [isInitial=1, var_1_10=127, var_1_11=32, var_1_1=126, var_1_2=0, var_1_4=125, var_1_5=126, var_1_6=8, var_1_8=127, var_1_9=127] [L46] COND TRUE var_1_3 <= var_1_7 [L47] var_1_6 = ((((((var_1_8 + var_1_9)) > (((((var_1_10) > (200)) ? (var_1_10) : (200))))) ? ((var_1_8 + var_1_9)) : (((((var_1_10) > (200)) ? (var_1_10) : (200)))))) - var_1_5) VAL [isInitial=1, var_1_10=127, var_1_11=32, var_1_1=126, var_1_2=0, var_1_4=125, var_1_5=126, var_1_6=128, var_1_8=127, var_1_9=127] [L51] COND FALSE !(((((var_1_6) > (var_1_8)) ? (var_1_6) : (var_1_8))) <= var_1_10) VAL [isInitial=1, var_1_10=127, var_1_11=32, var_1_1=126, var_1_2=0, var_1_4=125, var_1_5=126, var_1_6=128, var_1_8=127, var_1_9=127] [L98] RET step() [L99] CALL, EXPR property() [L88-L89] return (((var_1_2 || (64.75f < var_1_3)) ? (var_1_2 ? (var_1_1 == ((signed char) (var_1_4 - var_1_5))) : (var_1_1 == ((signed char) var_1_4))) : (var_1_1 == ((signed char) var_1_5))) && ((var_1_3 <= var_1_7) ? (var_1_6 == ((unsigned char) ((((((var_1_8 + var_1_9)) > (((((var_1_10) > (200)) ? (var_1_10) : (200))))) ? ((var_1_8 + var_1_9)) : (((((var_1_10) > (200)) ? (var_1_10) : (200)))))) - var_1_5))) : (var_1_6 == ((unsigned char) var_1_10)))) && ((((((var_1_6) > (var_1_8)) ? (var_1_6) : (var_1_8))) <= var_1_10) ? ((var_1_3 == (var_1_7 + var_1_12)) ? (var_1_11 == ((unsigned char) (var_1_9 + var_1_5))) : (var_1_11 == ((unsigned char) var_1_9))) : 1) ; [L99] RET, EXPR property() [L99] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=127, var_1_11=32, var_1_1=126, var_1_2=0, var_1_4=125, var_1_5=126, var_1_6=128, var_1_8=127, var_1_9=127] [L19] reach_error() VAL [isInitial=1, var_1_10=127, var_1_11=32, var_1_1=126, var_1_2=0, var_1_4=125, var_1_5=126, var_1_6=128, var_1_8=127, var_1_9=127] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 42 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.8s, 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, 56 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5 IncrementalHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 56 mSDtfsCounter, 5 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=42occurred 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, 184 NumberOfCodeBlocks, 184 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 91 ConstructedInterpolants, 0 QuantifiedInterpolants, 91 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-10-24 09:25:02,568 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- 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/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-24.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 1c6c11b57806b00201b98326e672a3344df9212139d60f788fa43f0ecfa41035 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 09:25:04,584 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 09:25:04,651 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-24 09:25:04,655 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 09:25:04,656 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 09:25:04,687 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 09:25:04,687 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 09:25:04,688 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 09:25:04,688 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 09:25:04,689 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 09:25:04,689 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 09:25:04,689 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 09:25:04,690 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 09:25:04,690 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 09:25:04,690 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 09:25:04,690 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 09:25:04,691 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 09:25:04,691 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 09:25:04,691 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 09:25:04,691 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 09:25:04,692 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 09:25:04,694 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 09:25:04,694 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 09:25:04,695 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 09:25:04,695 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-24 09:25:04,695 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 09:25:04,695 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-24 09:25:04,695 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 09:25:04,695 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 09:25:04,695 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 09:25:04,696 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 09:25:04,696 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 09:25:04,696 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 09:25:04,696 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 09:25:04,696 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 09:25:04,696 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 09:25:04,697 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 09:25:04,697 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 09:25:04,697 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-24 09:25:04,699 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-24 09:25:04,699 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 09:25:04,700 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 09:25:04,700 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 09:25:04,700 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 09:25:04,700 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-24 09:25:04,700 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 -> 1c6c11b57806b00201b98326e672a3344df9212139d60f788fa43f0ecfa41035 [2024-10-24 09:25:04,991 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 09:25:05,015 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 09:25:05,018 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 09:25:05,019 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 09:25:05,019 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 09:25:05,021 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-24.i [2024-10-24 09:25:06,398 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 09:25:06,604 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 09:25:06,605 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-24.i [2024-10-24 09:25:06,613 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/458a1b879/e0997b0fe0424e1ab39cc6dfb7cfdb4f/FLAGf1894c7b3 [2024-10-24 09:25:06,971 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/458a1b879/e0997b0fe0424e1ab39cc6dfb7cfdb4f [2024-10-24 09:25:06,973 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 09:25:06,975 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 09:25:06,975 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 09:25:06,976 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 09:25:06,980 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 09:25:06,981 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 09:25:06" (1/1) ... [2024-10-24 09:25:06,982 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7efb52bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:25:06, skipping insertion in model container [2024-10-24 09:25:06,982 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 09:25:06" (1/1) ... [2024-10-24 09:25:06,999 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 09:25:07,171 WARN L248 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-1loop_file-24.i[915,928] [2024-10-24 09:25:07,227 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 09:25:07,248 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 09:25:07,258 WARN L248 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-1loop_file-24.i[915,928] [2024-10-24 09:25:07,281 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 09:25:07,304 INFO L204 MainTranslator]: Completed translation [2024-10-24 09:25:07,304 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:25:07 WrapperNode [2024-10-24 09:25:07,305 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 09:25:07,305 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 09:25:07,306 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 09:25:07,306 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 09:25:07,312 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:25:07" (1/1) ... [2024-10-24 09:25:07,328 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:25:07" (1/1) ... [2024-10-24 09:25:07,355 INFO L138 Inliner]: procedures = 27, calls = 28, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 105 [2024-10-24 09:25:07,357 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 09:25:07,358 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 09:25:07,359 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 09:25:07,359 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 09:25:07,367 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:25:07" (1/1) ... [2024-10-24 09:25:07,368 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:25:07" (1/1) ... [2024-10-24 09:25:07,372 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:25:07" (1/1) ... [2024-10-24 09:25:07,391 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-10-24 09:25:07,393 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:25:07" (1/1) ... [2024-10-24 09:25:07,393 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:25:07" (1/1) ... [2024-10-24 09:25:07,401 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:25:07" (1/1) ... [2024-10-24 09:25:07,404 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:25:07" (1/1) ... [2024-10-24 09:25:07,406 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:25:07" (1/1) ... [2024-10-24 09:25:07,407 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:25:07" (1/1) ... [2024-10-24 09:25:07,410 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 09:25:07,410 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 09:25:07,411 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 09:25:07,411 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 09:25:07,411 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:25:07" (1/1) ... [2024-10-24 09:25:07,416 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 09:25:07,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 09:25:07,447 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-10-24 09:25:07,453 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-10-24 09:25:07,494 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 09:25:07,494 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-24 09:25:07,495 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 09:25:07,495 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 09:25:07,496 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 09:25:07,496 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 09:25:07,561 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 09:25:07,563 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 09:25:08,035 INFO L? ?]: Removed 9 outVars from TransFormulas that were not future-live. [2024-10-24 09:25:08,035 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 09:25:08,094 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 09:25:08,094 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 09:25:08,094 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 09:25:08 BoogieIcfgContainer [2024-10-24 09:25:08,095 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 09:25:08,096 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 09:25:08,096 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 09:25:08,100 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 09:25:08,101 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 09:25:06" (1/3) ... [2024-10-24 09:25:08,102 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@784ef2da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 09:25:08, skipping insertion in model container [2024-10-24 09:25:08,102 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:25:07" (2/3) ... [2024-10-24 09:25:08,103 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@784ef2da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 09:25:08, skipping insertion in model container [2024-10-24 09:25:08,103 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 09:25:08" (3/3) ... [2024-10-24 09:25:08,105 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-24.i [2024-10-24 09:25:08,118 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 09:25:08,119 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 09:25:08,169 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 09:25:08,178 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;@64e0acfd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 09:25:08,179 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 09:25:08,184 INFO L276 IsEmpty]: Start isEmpty. Operand has 42 states, 24 states have (on average 1.4166666666666667) internal successors, (34), 25 states have internal predecessors, (34), 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-10-24 09:25:08,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-24 09:25:08,193 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:25:08,195 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] [2024-10-24 09:25:08,196 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:25:08,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:25:08,203 INFO L85 PathProgramCache]: Analyzing trace with hash 1158333792, now seen corresponding path program 1 times [2024-10-24 09:25:08,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 09:25:08,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [146716020] [2024-10-24 09:25:08,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:25:08,217 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-10-24 09:25:08,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 09:25:08,220 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-10-24 09:25:08,221 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-10-24 09:25:08,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:08,460 INFO L255 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-24 09:25:08,466 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 09:25:08,497 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2024-10-24 09:25:08,498 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 09:25:08,499 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 09:25:08,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [146716020] [2024-10-24 09:25:08,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [146716020] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 09:25:08,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 09:25:08,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 09:25:08,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601380039] [2024-10-24 09:25:08,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 09:25:08,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 09:25:08,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 09:25:08,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 09:25:08,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 09:25:08,533 INFO L87 Difference]: Start difference. First operand has 42 states, 24 states have (on average 1.4166666666666667) internal successors, (34), 25 states have internal predecessors, (34), 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), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-24 09:25:08,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 09:25:08,612 INFO L93 Difference]: Finished difference Result 83 states and 142 transitions. [2024-10-24 09:25:08,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 09:25:08,614 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), 2 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 92 [2024-10-24 09:25:08,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 09:25:08,619 INFO L225 Difference]: With dead ends: 83 [2024-10-24 09:25:08,619 INFO L226 Difference]: Without dead ends: 40 [2024-10-24 09:25:08,623 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 91 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-10-24 09:25:08,625 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 09:25:08,626 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 56 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 09:25:08,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-10-24 09:25:08,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2024-10-24 09:25:08,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 23 states have internal predecessors, (29), 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-10-24 09:25:08,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 59 transitions. [2024-10-24 09:25:08,663 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 59 transitions. Word has length 92 [2024-10-24 09:25:08,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 09:25:08,664 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 59 transitions. [2024-10-24 09:25:08,664 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), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-24 09:25:08,665 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 59 transitions. [2024-10-24 09:25:08,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-24 09:25:08,669 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:25:08,670 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] [2024-10-24 09:25:08,677 INFO L552 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)] Ended with exit code 0 [2024-10-24 09:25:08,870 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-10-24 09:25:08,871 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:25:08,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:25:08,872 INFO L85 PathProgramCache]: Analyzing trace with hash 669175970, now seen corresponding path program 1 times [2024-10-24 09:25:08,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 09:25:08,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1419621049] [2024-10-24 09:25:08,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:25:08,874 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-10-24 09:25:08,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 09:25:08,880 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-10-24 09:25:08,881 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-10-24 09:25:09,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:09,071 INFO L255 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-24 09:25:09,077 INFO L278 TraceCheckSpWp]: Computing forward predicates...