./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-53.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-53.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 9d47886cf593addfb5e45528195520db8a5c30504e46ec7d00ca0344fac955f8 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 09:27:59,716 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 09:27:59,769 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 09:27:59,773 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 09:27:59,773 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 09:27:59,800 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 09:27:59,801 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 09:27:59,801 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 09:27:59,802 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 09:27:59,802 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 09:27:59,803 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 09:27:59,803 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 09:27:59,803 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 09:27:59,804 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 09:27:59,804 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 09:27:59,805 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 09:27:59,805 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 09:27:59,805 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 09:27:59,806 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 09:27:59,806 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 09:27:59,806 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 09:27:59,810 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 09:27:59,811 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 09:27:59,811 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 09:27:59,811 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 09:27:59,811 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 09:27:59,812 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 09:27:59,812 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 09:27:59,812 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 09:27:59,812 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 09:27:59,813 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 09:27:59,813 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 09:27:59,813 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 09:27:59,813 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 09:27:59,813 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 09:27:59,814 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 09:27:59,814 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 09:27:59,815 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 09:27:59,815 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 09:27:59,815 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 09:27:59,816 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 09:27:59,816 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 09:27:59,816 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 -> 9d47886cf593addfb5e45528195520db8a5c30504e46ec7d00ca0344fac955f8 [2024-10-24 09:28:00,045 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 09:28:00,072 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 09:28:00,076 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 09:28:00,077 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 09:28:00,078 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 09:28:00,079 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-53.i [2024-10-24 09:28:01,570 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 09:28:01,812 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 09:28:01,813 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-53.i [2024-10-24 09:28:01,825 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8832d4c62/b1d2b913280b4de793055a557591eb0a/FLAGead359152 [2024-10-24 09:28:01,844 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8832d4c62/b1d2b913280b4de793055a557591eb0a [2024-10-24 09:28:01,846 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 09:28:01,848 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 09:28:01,849 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 09:28:01,850 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 09:28:01,855 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 09:28:01,856 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 09:28:01" (1/1) ... [2024-10-24 09:28:01,858 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ca7e276 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:28:01, skipping insertion in model container [2024-10-24 09:28:01,859 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 09:28:01" (1/1) ... [2024-10-24 09:28:01,887 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 09:28:02,045 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-53.i[915,928] [2024-10-24 09:28:02,104 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 09:28:02,116 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 09:28:02,129 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-53.i[915,928] [2024-10-24 09:28:02,161 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 09:28:02,184 INFO L204 MainTranslator]: Completed translation [2024-10-24 09:28:02,184 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:28:02 WrapperNode [2024-10-24 09:28:02,185 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 09:28:02,186 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 09:28:02,186 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 09:28:02,187 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 09:28:02,193 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:28:02" (1/1) ... [2024-10-24 09:28:02,203 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:28:02" (1/1) ... [2024-10-24 09:28:02,239 INFO L138 Inliner]: procedures = 26, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 113 [2024-10-24 09:28:02,242 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 09:28:02,243 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 09:28:02,243 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 09:28:02,243 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 09:28:02,252 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:28:02" (1/1) ... [2024-10-24 09:28:02,253 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:28:02" (1/1) ... [2024-10-24 09:28:02,256 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:28:02" (1/1) ... [2024-10-24 09:28:02,280 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:28:02,281 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:28:02" (1/1) ... [2024-10-24 09:28:02,281 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:28:02" (1/1) ... [2024-10-24 09:28:02,286 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:28:02" (1/1) ... [2024-10-24 09:28:02,294 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:28:02" (1/1) ... [2024-10-24 09:28:02,298 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:28:02" (1/1) ... [2024-10-24 09:28:02,300 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:28:02" (1/1) ... [2024-10-24 09:28:02,302 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 09:28:02,303 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 09:28:02,303 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 09:28:02,304 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 09:28:02,304 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:28:02" (1/1) ... [2024-10-24 09:28:02,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 09:28:02,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 09:28:02,339 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:28:02,343 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:28:02,391 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 09:28:02,392 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 09:28:02,393 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 09:28:02,393 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 09:28:02,393 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 09:28:02,393 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 09:28:02,476 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 09:28:02,479 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 09:28:02,757 INFO L? ?]: Removed 11 outVars from TransFormulas that were not future-live. [2024-10-24 09:28:02,758 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 09:28:02,823 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 09:28:02,823 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 09:28:02,824 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 09:28:02 BoogieIcfgContainer [2024-10-24 09:28:02,825 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 09:28:02,827 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 09:28:02,827 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 09:28:02,831 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 09:28:02,831 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 09:28:01" (1/3) ... [2024-10-24 09:28:02,832 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b549aef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 09:28:02, skipping insertion in model container [2024-10-24 09:28:02,832 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:28:02" (2/3) ... [2024-10-24 09:28:02,833 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b549aef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 09:28:02, skipping insertion in model container [2024-10-24 09:28:02,833 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 09:28:02" (3/3) ... [2024-10-24 09:28:02,834 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-53.i [2024-10-24 09:28:02,852 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 09:28:02,852 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 09:28:02,922 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 09:28:02,930 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;@1ff20e27, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 09:28:02,930 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 09:28:02,934 INFO L276 IsEmpty]: Start isEmpty. Operand has 44 states, 25 states have (on average 1.36) internal successors, (34), 26 states have internal predecessors, (34), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-24 09:28:02,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-24 09:28:02,943 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:28:02,943 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28:02,944 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:28:02,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:28:02,949 INFO L85 PathProgramCache]: Analyzing trace with hash 2082293045, now seen corresponding path program 1 times [2024-10-24 09:28:02,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 09:28:02,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296739311] [2024-10-24 09:28:02,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:28:02,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 09:28:03,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:28:03,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 09:28:03,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:28:03,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 09:28:03,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:28:03,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 09:28:03,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:28:03,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 09:28:03,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:28:03,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 09:28:03,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:28:03,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 09:28:03,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:28:03,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 09:28:03,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:28:03,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 09:28:03,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:28:03,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 09:28:03,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:28:03,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 09:28:03,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:28:03,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 09:28:03,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:28:03,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 09:28:03,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:28:03,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 09:28:03,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:28:03,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 09:28:03,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:28:03,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 09:28:03,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:28:03,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 09:28:03,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:28:03,403 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-24 09:28:03,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 09:28:03,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296739311] [2024-10-24 09:28:03,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [296739311] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 09:28:03,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 09:28:03,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 09:28:03,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407630217] [2024-10-24 09:28:03,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 09:28:03,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 09:28:03,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 09:28:03,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 09:28:03,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 09:28:03,445 INFO L87 Difference]: Start difference. First operand has 44 states, 25 states have (on average 1.36) internal successors, (34), 26 states have internal predecessors, (34), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-24 09:28:03,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 09:28:03,503 INFO L93 Difference]: Finished difference Result 87 states and 147 transitions. [2024-10-24 09:28:03,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 09:28:03,506 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 98 [2024-10-24 09:28:03,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 09:28:03,513 INFO L225 Difference]: With dead ends: 87 [2024-10-24 09:28:03,513 INFO L226 Difference]: Without dead ends: 42 [2024-10-24 09:28:03,517 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 50 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:28:03,524 INFO L432 NwaCegarLoop]: 58 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, 58 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:28:03,525 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 58 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 09:28:03,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-10-24 09:28:03,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2024-10-24 09:28:03,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-24 09:28:03,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 61 transitions. [2024-10-24 09:28:03,575 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 61 transitions. Word has length 98 [2024-10-24 09:28:03,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 09:28:03,576 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 61 transitions. [2024-10-24 09:28:03,576 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-24 09:28:03,577 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 61 transitions. [2024-10-24 09:28:03,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-24 09:28:03,581 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:28:03,582 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28:03,582 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 09:28:03,582 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:28:03,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:28:03,583 INFO L85 PathProgramCache]: Analyzing trace with hash 1632780077, now seen corresponding path program 1 times [2024-10-24 09:28:03,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 09:28:03,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828955254] [2024-10-24 09:28:03,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:28:03,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 09:28:03,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:28:05,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 09:28:05,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:28:05,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 09:28:05,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:28:05,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 09:28:05,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:28:05,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 09:28:05,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:28:05,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 09:28:05,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:28:05,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 09:28:05,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:28:05,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 09:28:05,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:28:05,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 09:28:05,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:28:05,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 09:28:05,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:28:05,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 09:28:05,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:28:05,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 09:28:05,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:28:05,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 09:28:05,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:28:05,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 09:28:05,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:28:05,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 09:28:05,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:28:06,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 09:28:06,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:28:06,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 09:28:06,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:28:06,054 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 21 proven. 159 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2024-10-24 09:28:06,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 09:28:06,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828955254] [2024-10-24 09:28:06,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828955254] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 09:28:06,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [981276673] [2024-10-24 09:28:06,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:28:06,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 09:28:06,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 09:28:06,059 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-10-24 09:28:06,066 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-10-24 09:28:06,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:28:06,199 INFO L255 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-10-24 09:28:06,208 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 09:28:09,091 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 207 proven. 159 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2024-10-24 09:28:09,093 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 09:29:21,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [981276673] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 09:29:21,378 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 09:29:21,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 23] total 30 [2024-10-24 09:29:21,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960255110] [2024-10-24 09:29:21,379 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 09:29:21,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-10-24 09:29:21,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 09:29:21,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-10-24 09:29:21,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=342, Invalid=1370, Unknown=10, NotChecked=0, Total=1722 [2024-10-24 09:29:21,383 INFO L87 Difference]: Start difference. First operand 42 states and 61 transitions. Second operand has 30 states, 29 states have (on average 1.9655172413793103) internal successors, (57), 27 states have internal predecessors, (57), 11 states have call successors, (30), 7 states have call predecessors, (30), 9 states have return successors, (30), 11 states have call predecessors, (30), 11 states have call successors, (30) [2024-10-24 09:29:26,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 09:29:26,768 INFO L93 Difference]: Finished difference Result 133 states and 169 transitions. [2024-10-24 09:29:26,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-10-24 09:29:26,769 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 1.9655172413793103) internal successors, (57), 27 states have internal predecessors, (57), 11 states have call successors, (30), 7 states have call predecessors, (30), 9 states have return successors, (30), 11 states have call predecessors, (30), 11 states have call successors, (30) Word has length 98 [2024-10-24 09:29:26,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 09:29:26,771 INFO L225 Difference]: With dead ends: 133 [2024-10-24 09:29:26,771 INFO L226 Difference]: Without dead ends: 92 [2024-10-24 09:29:26,772 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 623 ImplicationChecksByTransitivity, 66.4s TimeCoverageRelationStatistics Valid=602, Invalid=2144, Unknown=10, NotChecked=0, Total=2756 [2024-10-24 09:29:26,773 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 134 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 678 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 695 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 678 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-24 09:29:26,774 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 313 Invalid, 695 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 678 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-24 09:29:26,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-10-24 09:29:26,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 68. [2024-10-24 09:29:26,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 44 states have (on average 1.1136363636363635) internal successors, (49), 44 states have internal predecessors, (49), 16 states have call successors, (16), 7 states have call predecessors, (16), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-24 09:29:26,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 81 transitions. [2024-10-24 09:29:26,789 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 81 transitions. Word has length 98 [2024-10-24 09:29:26,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 09:29:26,791 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 81 transitions. [2024-10-24 09:29:26,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 1.9655172413793103) internal successors, (57), 27 states have internal predecessors, (57), 11 states have call successors, (30), 7 states have call predecessors, (30), 9 states have return successors, (30), 11 states have call predecessors, (30), 11 states have call successors, (30) [2024-10-24 09:29:26,791 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 81 transitions. [2024-10-24 09:29:26,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-24 09:29:26,793 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:29:26,793 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29:26,813 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-24 09:29:26,995 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-10-24 09:29:26,996 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:29:26,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:29:26,996 INFO L85 PathProgramCache]: Analyzing trace with hash 1690038379, now seen corresponding path program 1 times [2024-10-24 09:29:26,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 09:29:26,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506351879] [2024-10-24 09:29:26,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:29:26,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 09:29:27,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 09:29:27,088 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 09:29:27,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 09:29:27,191 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 09:29:27,191 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 09:29:27,193 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-24 09:29:27,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 09:29:27,201 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-10-24 09:29:27,288 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 09:29:27,292 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 09:29:27 BoogieIcfgContainer [2024-10-24 09:29:27,293 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 09:29:27,294 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 09:29:27,294 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 09:29:27,294 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 09:29:27,295 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 09:28:02" (3/4) ... [2024-10-24 09:29:27,297 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-24 09:29:27,299 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 09:29:27,301 INFO L158 Benchmark]: Toolchain (without parser) took 85452.80ms. Allocated memory was 151.0MB in the beginning and 234.9MB in the end (delta: 83.9MB). Free memory was 96.6MB in the beginning and 91.3MB in the end (delta: 5.3MB). Peak memory consumption was 90.4MB. Max. memory is 16.1GB. [2024-10-24 09:29:27,303 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 151.0MB. Free memory is still 87.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 09:29:27,303 INFO L158 Benchmark]: CACSL2BoogieTranslator took 335.59ms. Allocated memory is still 151.0MB. Free memory was 96.6MB in the beginning and 82.5MB in the end (delta: 14.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-24 09:29:27,303 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.48ms. Allocated memory is still 151.0MB. Free memory was 82.5MB in the beginning and 80.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 09:29:27,303 INFO L158 Benchmark]: Boogie Preprocessor took 59.62ms. Allocated memory is still 151.0MB. Free memory was 80.4MB in the beginning and 77.7MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 09:29:27,304 INFO L158 Benchmark]: RCFGBuilder took 521.74ms. Allocated memory is still 151.0MB. Free memory was 77.7MB in the beginning and 60.3MB in the end (delta: 17.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-24 09:29:27,304 INFO L158 Benchmark]: TraceAbstraction took 84466.13ms. Allocated memory was 151.0MB in the beginning and 234.9MB in the end (delta: 83.9MB). Free memory was 59.4MB in the beginning and 91.3MB in the end (delta: -31.8MB). Peak memory consumption was 52.7MB. Max. memory is 16.1GB. [2024-10-24 09:29:27,304 INFO L158 Benchmark]: Witness Printer took 6.22ms. Allocated memory is still 234.9MB. Free memory is still 91.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 09:29:27,309 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 151.0MB. Free memory is still 87.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 335.59ms. Allocated memory is still 151.0MB. Free memory was 96.6MB in the beginning and 82.5MB in the end (delta: 14.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 56.48ms. Allocated memory is still 151.0MB. Free memory was 82.5MB in the beginning and 80.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 59.62ms. Allocated memory is still 151.0MB. Free memory was 80.4MB in the beginning and 77.7MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 521.74ms. Allocated memory is still 151.0MB. Free memory was 77.7MB in the beginning and 60.3MB in the end (delta: 17.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 84466.13ms. Allocated memory was 151.0MB in the beginning and 234.9MB in the end (delta: 83.9MB). Free memory was 59.4MB in the beginning and 91.3MB in the end (delta: -31.8MB). Peak memory consumption was 52.7MB. Max. memory is 16.1GB. * Witness Printer took 6.22ms. Allocated memory is still 234.9MB. Free memory is still 91.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 90, overapproximation of someBinaryDOUBLEComparisonOperation at line 90, overapproximation of someBinaryArithmeticFLOAToperation at line 43. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned long int var_1_1 = 5; [L23] unsigned long int var_1_2 = 500; [L24] unsigned long int var_1_3 = 1456677701; [L25] unsigned long int var_1_4 = 1000000000; [L26] unsigned long int var_1_5 = 1; [L27] unsigned char var_1_6 = 0; [L28] unsigned char var_1_7 = 0; [L29] unsigned char var_1_8 = 0; [L30] unsigned char var_1_11 = 0; [L31] float var_1_12 = 128.6; [L32] float var_1_13 = 500.4; [L33] float var_1_14 = 8.5; [L34] double var_1_15 = 255.8; [L35] double var_1_16 = 25.75; [L36] float var_1_17 = 1.2; [L37] float var_1_18 = 9.6; [L94] isInitial = 1 [L95] FCALL initially() [L96] int k_loop; [L97] k_loop = 0 VAL [isInitial=1, k_loop=0, var_1_11=0, var_1_12=643/5, var_1_13=2502/5, var_1_14=17/2, var_1_15=1279/5, var_1_16=103/4, var_1_17=6/5, var_1_18=48/5, var_1_1=5, var_1_2=500, var_1_3=1456677701, var_1_4=1000000000, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0] [L97] COND TRUE k_loop < 1 [L98] FCALL updateLastVariables() [L99] CALL updateVariables() [L60] var_1_2 = __VERIFIER_nondet_ulong() [L61] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=643/5, var_1_13=2502/5, var_1_14=17/2, var_1_15=1279/5, var_1_16=103/4, var_1_17=6/5, var_1_18=48/5, var_1_1=5, var_1_3=1456677701, var_1_4=1000000000, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=643/5, var_1_13=2502/5, var_1_14=17/2, var_1_15=1279/5, var_1_16=103/4, var_1_17=6/5, var_1_18=48/5, var_1_1=5, var_1_3=1456677701, var_1_4=1000000000, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0] [L61] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_11=0, var_1_12=643/5, var_1_13=2502/5, var_1_14=17/2, var_1_15=1279/5, var_1_16=103/4, var_1_17=6/5, var_1_18=48/5, var_1_1=5, var_1_3=1456677701, var_1_4=1000000000, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0] [L62] CALL assume_abort_if_not(var_1_2 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=643/5, var_1_13=2502/5, var_1_14=17/2, var_1_15=1279/5, var_1_16=103/4, var_1_17=6/5, var_1_18=48/5, var_1_1=5, var_1_2=2147483647, var_1_3=1456677701, var_1_4=1000000000, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=643/5, var_1_13=2502/5, var_1_14=17/2, var_1_15=1279/5, var_1_16=103/4, var_1_17=6/5, var_1_18=48/5, var_1_1=5, var_1_2=2147483647, var_1_3=1456677701, var_1_4=1000000000, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0] [L62] RET assume_abort_if_not(var_1_2 <= 2147483647) VAL [isInitial=1, var_1_11=0, var_1_12=643/5, var_1_13=2502/5, var_1_14=17/2, var_1_15=1279/5, var_1_16=103/4, var_1_17=6/5, var_1_18=48/5, var_1_1=5, var_1_2=2147483647, var_1_3=1456677701, var_1_4=1000000000, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0] [L63] var_1_3 = __VERIFIER_nondet_ulong() [L64] CALL assume_abort_if_not(var_1_3 >= 1073741823) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=643/5, var_1_13=2502/5, var_1_14=17/2, var_1_15=1279/5, var_1_16=103/4, var_1_17=6/5, var_1_18=48/5, var_1_1=5, var_1_2=2147483647, var_1_3=1073741823, var_1_4=1000000000, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=643/5, var_1_13=2502/5, var_1_14=17/2, var_1_15=1279/5, var_1_16=103/4, var_1_17=6/5, var_1_18=48/5, var_1_1=5, var_1_2=2147483647, var_1_3=1073741823, var_1_4=1000000000, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0] [L64] RET assume_abort_if_not(var_1_3 >= 1073741823) VAL [isInitial=1, var_1_11=0, var_1_12=643/5, var_1_13=2502/5, var_1_14=17/2, var_1_15=1279/5, var_1_16=103/4, var_1_17=6/5, var_1_18=48/5, var_1_1=5, var_1_2=2147483647, var_1_3=1073741823, var_1_4=1000000000, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0] [L65] CALL assume_abort_if_not(var_1_3 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=643/5, var_1_13=2502/5, var_1_14=17/2, var_1_15=1279/5, var_1_16=103/4, var_1_17=6/5, var_1_18=48/5, var_1_1=5, var_1_2=2147483647, var_1_3=1073741823, var_1_4=1000000000, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=643/5, var_1_13=2502/5, var_1_14=17/2, var_1_15=1279/5, var_1_16=103/4, var_1_17=6/5, var_1_18=48/5, var_1_1=5, var_1_2=2147483647, var_1_3=1073741823, var_1_4=1000000000, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0] [L65] RET assume_abort_if_not(var_1_3 <= 2147483647) VAL [isInitial=1, var_1_11=0, var_1_12=643/5, var_1_13=2502/5, var_1_14=17/2, var_1_15=1279/5, var_1_16=103/4, var_1_17=6/5, var_1_18=48/5, var_1_1=5, var_1_2=2147483647, var_1_3=1073741823, var_1_4=1000000000, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0] [L66] var_1_4 = __VERIFIER_nondet_ulong() [L67] CALL assume_abort_if_not(var_1_4 >= 536870911) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=643/5, var_1_13=2502/5, var_1_14=17/2, var_1_15=1279/5, var_1_16=103/4, var_1_17=6/5, var_1_18=48/5, var_1_1=5, var_1_2=2147483647, var_1_3=1073741823, var_1_4=4831838207, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=643/5, var_1_13=2502/5, var_1_14=17/2, var_1_15=1279/5, var_1_16=103/4, var_1_17=6/5, var_1_18=48/5, var_1_1=5, var_1_2=2147483647, var_1_3=1073741823, var_1_4=4831838207, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0] [L67] RET assume_abort_if_not(var_1_4 >= 536870911) VAL [isInitial=1, var_1_11=0, var_1_12=643/5, var_1_13=2502/5, var_1_14=17/2, var_1_15=1279/5, var_1_16=103/4, var_1_17=6/5, var_1_18=48/5, var_1_1=5, var_1_2=2147483647, var_1_3=1073741823, var_1_4=4831838207, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0] [L68] CALL assume_abort_if_not(var_1_4 <= 1073741823) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=643/5, var_1_13=2502/5, var_1_14=17/2, var_1_15=1279/5, var_1_16=103/4, var_1_17=6/5, var_1_18=48/5, var_1_1=5, var_1_2=2147483647, var_1_3=1073741823, var_1_4=4831838207, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=643/5, var_1_13=2502/5, var_1_14=17/2, var_1_15=1279/5, var_1_16=103/4, var_1_17=6/5, var_1_18=48/5, var_1_1=5, var_1_2=2147483647, var_1_3=1073741823, var_1_4=4831838207, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0] [L68] RET assume_abort_if_not(var_1_4 <= 1073741823) VAL [isInitial=1, var_1_11=0, var_1_12=643/5, var_1_13=2502/5, var_1_14=17/2, var_1_15=1279/5, var_1_16=103/4, var_1_17=6/5, var_1_18=48/5, var_1_1=5, var_1_2=2147483647, var_1_3=1073741823, var_1_4=4831838207, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0] [L69] var_1_5 = __VERIFIER_nondet_ulong() [L70] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=643/5, var_1_13=2502/5, var_1_14=17/2, var_1_15=1279/5, var_1_16=103/4, var_1_17=6/5, var_1_18=48/5, var_1_1=5, var_1_2=2147483647, var_1_3=1073741823, var_1_4=4831838207, var_1_6=0, var_1_7=0, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=643/5, var_1_13=2502/5, var_1_14=17/2, var_1_15=1279/5, var_1_16=103/4, var_1_17=6/5, var_1_18=48/5, var_1_1=5, var_1_2=2147483647, var_1_3=1073741823, var_1_4=4831838207, var_1_6=0, var_1_7=0, var_1_8=0] [L70] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, var_1_11=0, var_1_12=643/5, var_1_13=2502/5, var_1_14=17/2, var_1_15=1279/5, var_1_16=103/4, var_1_17=6/5, var_1_18=48/5, var_1_1=5, var_1_2=2147483647, var_1_3=1073741823, var_1_4=4831838207, var_1_6=0, var_1_7=0, var_1_8=0] [L71] CALL assume_abort_if_not(var_1_5 <= 536870911) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=643/5, var_1_13=2502/5, var_1_14=17/2, var_1_15=1279/5, var_1_16=103/4, var_1_17=6/5, var_1_18=48/5, var_1_1=5, var_1_2=2147483647, var_1_3=1073741823, var_1_4=4831838207, var_1_5=4831838207, var_1_6=0, var_1_7=0, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=643/5, var_1_13=2502/5, var_1_14=17/2, var_1_15=1279/5, var_1_16=103/4, var_1_17=6/5, var_1_18=48/5, var_1_1=5, var_1_2=2147483647, var_1_3=1073741823, var_1_4=4831838207, var_1_5=4831838207, var_1_6=0, var_1_7=0, var_1_8=0] [L71] RET assume_abort_if_not(var_1_5 <= 536870911) VAL [isInitial=1, var_1_11=0, var_1_12=643/5, var_1_13=2502/5, var_1_14=17/2, var_1_15=1279/5, var_1_16=103/4, var_1_17=6/5, var_1_18=48/5, var_1_1=5, var_1_2=2147483647, var_1_3=1073741823, var_1_4=4831838207, var_1_5=4831838207, var_1_6=0, var_1_7=0, var_1_8=0] [L72] var_1_7 = __VERIFIER_nondet_uchar() [L73] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=643/5, var_1_13=2502/5, var_1_14=17/2, var_1_15=1279/5, var_1_16=103/4, var_1_17=6/5, var_1_18=48/5, var_1_1=5, var_1_2=2147483647, var_1_3=1073741823, var_1_4=4831838207, var_1_5=4831838207, var_1_6=0, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=643/5, var_1_13=2502/5, var_1_14=17/2, var_1_15=1279/5, var_1_16=103/4, var_1_17=6/5, var_1_18=48/5, var_1_1=5, var_1_2=2147483647, var_1_3=1073741823, var_1_4=4831838207, var_1_5=4831838207, var_1_6=0, var_1_8=0] [L73] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, var_1_11=0, var_1_12=643/5, var_1_13=2502/5, var_1_14=17/2, var_1_15=1279/5, var_1_16=103/4, var_1_17=6/5, var_1_18=48/5, var_1_1=5, var_1_2=2147483647, var_1_3=1073741823, var_1_4=4831838207, var_1_5=4831838207, var_1_6=0, var_1_8=0] [L74] CALL assume_abort_if_not(var_1_7 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=643/5, var_1_13=2502/5, var_1_14=17/2, var_1_15=1279/5, var_1_16=103/4, var_1_17=6/5, var_1_18=48/5, var_1_1=5, var_1_2=2147483647, var_1_3=1073741823, var_1_4=4831838207, var_1_5=4831838207, var_1_6=0, var_1_7=-256, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=643/5, var_1_13=2502/5, var_1_14=17/2, var_1_15=1279/5, var_1_16=103/4, var_1_17=6/5, var_1_18=48/5, var_1_1=5, var_1_2=2147483647, var_1_3=1073741823, var_1_4=4831838207, var_1_5=4831838207, var_1_6=0, var_1_7=-256, var_1_8=0] [L74] RET assume_abort_if_not(var_1_7 <= 0) VAL [isInitial=1, var_1_11=0, var_1_12=643/5, var_1_13=2502/5, var_1_14=17/2, var_1_15=1279/5, var_1_16=103/4, var_1_17=6/5, var_1_18=48/5, var_1_1=5, var_1_2=2147483647, var_1_3=1073741823, var_1_4=4831838207, var_1_5=4831838207, var_1_6=0, var_1_7=-256, var_1_8=0] [L75] var_1_11 = __VERIFIER_nondet_uchar() [L76] CALL assume_abort_if_not(var_1_11 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_11=1, var_1_12=643/5, var_1_13=2502/5, var_1_14=17/2, var_1_15=1279/5, var_1_16=103/4, var_1_17=6/5, var_1_18=48/5, var_1_1=5, var_1_2=2147483647, var_1_3=1073741823, var_1_4=4831838207, var_1_5=4831838207, var_1_6=0, var_1_7=-256, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=1, var_1_12=643/5, var_1_13=2502/5, var_1_14=17/2, var_1_15=1279/5, var_1_16=103/4, var_1_17=6/5, var_1_18=48/5, var_1_1=5, var_1_2=2147483647, var_1_3=1073741823, var_1_4=4831838207, var_1_5=4831838207, var_1_6=0, var_1_7=-256, var_1_8=0] [L76] RET assume_abort_if_not(var_1_11 >= 1) VAL [isInitial=1, var_1_11=1, var_1_12=643/5, var_1_13=2502/5, var_1_14=17/2, var_1_15=1279/5, var_1_16=103/4, var_1_17=6/5, var_1_18=48/5, var_1_1=5, var_1_2=2147483647, var_1_3=1073741823, var_1_4=4831838207, var_1_5=4831838207, var_1_6=0, var_1_7=-256, var_1_8=0] [L77] CALL assume_abort_if_not(var_1_11 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_11=1, var_1_12=643/5, var_1_13=2502/5, var_1_14=17/2, var_1_15=1279/5, var_1_16=103/4, var_1_17=6/5, var_1_18=48/5, var_1_1=5, var_1_2=2147483647, var_1_3=1073741823, var_1_4=4831838207, var_1_5=4831838207, var_1_6=0, var_1_7=-256, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=1, var_1_12=643/5, var_1_13=2502/5, var_1_14=17/2, var_1_15=1279/5, var_1_16=103/4, var_1_17=6/5, var_1_18=48/5, var_1_1=5, var_1_2=2147483647, var_1_3=1073741823, var_1_4=4831838207, var_1_5=4831838207, var_1_6=0, var_1_7=-256, var_1_8=0] [L77] RET assume_abort_if_not(var_1_11 <= 1) VAL [isInitial=1, var_1_11=1, var_1_12=643/5, var_1_13=2502/5, var_1_14=17/2, var_1_15=1279/5, var_1_16=103/4, var_1_17=6/5, var_1_18=48/5, var_1_1=5, var_1_2=2147483647, var_1_3=1073741823, var_1_4=4831838207, var_1_5=4831838207, var_1_6=0, var_1_7=-256, var_1_8=0] [L78] var_1_13 = __VERIFIER_nondet_float() [L79] CALL assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 4611686.018427382800e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_11=1, var_1_12=643/5, var_1_14=17/2, var_1_15=1279/5, var_1_16=103/4, var_1_17=6/5, var_1_18=48/5, var_1_1=5, var_1_2=2147483647, var_1_3=1073741823, var_1_4=4831838207, var_1_5=4831838207, var_1_6=0, var_1_7=-256, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=1, var_1_12=643/5, var_1_14=17/2, var_1_15=1279/5, var_1_16=103/4, var_1_17=6/5, var_1_18=48/5, var_1_1=5, var_1_2=2147483647, var_1_3=1073741823, var_1_4=4831838207, var_1_5=4831838207, var_1_6=0, var_1_7=-256, var_1_8=0] [L79] RET assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 4611686.018427382800e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, var_1_11=1, var_1_12=643/5, var_1_14=17/2, var_1_15=1279/5, var_1_16=103/4, var_1_17=6/5, var_1_18=48/5, var_1_1=5, var_1_2=2147483647, var_1_3=1073741823, var_1_4=4831838207, var_1_5=4831838207, var_1_6=0, var_1_7=-256, var_1_8=0] [L80] var_1_14 = __VERIFIER_nondet_float() [L81] CALL assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_11=1, var_1_12=643/5, var_1_15=1279/5, var_1_16=103/4, var_1_17=6/5, var_1_18=48/5, var_1_1=5, var_1_2=2147483647, var_1_3=1073741823, var_1_4=4831838207, var_1_5=4831838207, var_1_6=0, var_1_7=-256, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=1, var_1_12=643/5, var_1_15=1279/5, var_1_16=103/4, var_1_17=6/5, var_1_18=48/5, var_1_1=5, var_1_2=2147483647, var_1_3=1073741823, var_1_4=4831838207, var_1_5=4831838207, var_1_6=0, var_1_7=-256, var_1_8=0] [L81] RET assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, var_1_11=1, var_1_12=643/5, var_1_15=1279/5, var_1_16=103/4, var_1_17=6/5, var_1_18=48/5, var_1_1=5, var_1_2=2147483647, var_1_3=1073741823, var_1_4=4831838207, var_1_5=4831838207, var_1_6=0, var_1_7=-256, var_1_8=0] [L82] var_1_16 = __VERIFIER_nondet_double() [L83] CALL assume_abort_if_not((var_1_16 >= -922337.2036854765600e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_11=1, var_1_12=643/5, var_1_15=1279/5, var_1_17=6/5, var_1_18=48/5, var_1_1=5, var_1_2=2147483647, var_1_3=1073741823, var_1_4=4831838207, var_1_5=4831838207, var_1_6=0, var_1_7=-256, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=1, var_1_12=643/5, var_1_15=1279/5, var_1_17=6/5, var_1_18=48/5, var_1_1=5, var_1_2=2147483647, var_1_3=1073741823, var_1_4=4831838207, var_1_5=4831838207, var_1_6=0, var_1_7=-256, var_1_8=0] [L83] RET assume_abort_if_not((var_1_16 >= -922337.2036854765600e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, var_1_11=1, var_1_12=643/5, var_1_15=1279/5, var_1_17=6/5, var_1_18=48/5, var_1_1=5, var_1_2=2147483647, var_1_3=1073741823, var_1_4=4831838207, var_1_5=4831838207, var_1_6=0, var_1_7=-256, var_1_8=0] [L84] var_1_18 = __VERIFIER_nondet_float() [L85] CALL assume_abort_if_not((var_1_18 >= 0.0F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_11=1, var_1_12=643/5, var_1_15=1279/5, var_1_17=6/5, var_1_1=5, var_1_2=2147483647, var_1_3=1073741823, var_1_4=4831838207, var_1_5=4831838207, var_1_6=0, var_1_7=-256, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=1, var_1_12=643/5, var_1_15=1279/5, var_1_17=6/5, var_1_1=5, var_1_2=2147483647, var_1_3=1073741823, var_1_4=4831838207, var_1_5=4831838207, var_1_6=0, var_1_7=-256, var_1_8=0] [L85] RET assume_abort_if_not((var_1_18 >= 0.0F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, var_1_11=1, var_1_12=643/5, var_1_15=1279/5, var_1_17=6/5, var_1_1=5, var_1_2=2147483647, var_1_3=1073741823, var_1_4=4831838207, var_1_5=4831838207, var_1_6=0, var_1_7=-256, var_1_8=0] [L99] RET updateVariables() [L100] CALL step() [L41] var_1_1 = (var_1_2 + (var_1_3 - (var_1_4 - var_1_5))) [L42] var_1_6 = var_1_7 [L43] var_1_12 = ((2.55f + var_1_13) - var_1_14) [L44] var_1_15 = ((((var_1_13) > (((((var_1_14) < (var_1_16)) ? (var_1_14) : (var_1_16))))) ? (var_1_13) : (((((var_1_14) < (var_1_16)) ? (var_1_14) : (var_1_16)))))) VAL [isInitial=1, var_1_11=1, var_1_13=4831838212, var_1_14=4831838212, var_1_15=4831838212, var_1_16=4831838212, var_1_17=6/5, var_1_1=3221225470, var_1_2=2147483647, var_1_3=1073741823, var_1_4=4831838207, var_1_5=4831838207, var_1_6=-256, var_1_7=-256, var_1_8=0] [L45] COND FALSE !(var_1_2 >= var_1_1) VAL [isInitial=1, var_1_11=1, var_1_13=4831838212, var_1_14=4831838212, var_1_15=4831838212, var_1_16=4831838212, var_1_17=6/5, var_1_1=3221225470, var_1_2=2147483647, var_1_3=1073741823, var_1_4=4831838207, var_1_5=4831838207, var_1_6=-256, var_1_7=-256, var_1_8=0] [L48] unsigned long int stepLocal_0 = (((var_1_4) < (var_1_3)) ? (var_1_4) : (var_1_3)); VAL [isInitial=1, stepLocal_0=4831838207, var_1_11=1, var_1_13=4831838212, var_1_14=4831838212, var_1_15=4831838212, var_1_16=4831838212, var_1_17=6/5, var_1_1=3221225470, var_1_2=2147483647, var_1_3=1073741823, var_1_4=4831838207, var_1_5=4831838207, var_1_6=-256, var_1_7=-256, var_1_8=0] [L49] COND FALSE !(((((var_1_1) < (var_1_5)) ? (var_1_1) : (var_1_5))) != stepLocal_0) [L56] var_1_8 = var_1_11 VAL [isInitial=1, var_1_11=1, var_1_13=4831838212, var_1_14=4831838212, var_1_15=4831838212, var_1_16=4831838212, var_1_17=6/5, var_1_1=3221225470, var_1_2=2147483647, var_1_3=1073741823, var_1_4=4831838207, var_1_5=4831838207, var_1_6=-256, var_1_7=-256, var_1_8=1] [L100] RET step() [L101] CALL, EXPR property() [L90-L91] return (((((var_1_1 == ((unsigned long int) (var_1_2 + (var_1_3 - (var_1_4 - var_1_5))))) && (var_1_6 == ((unsigned char) var_1_7))) && ((((((var_1_1) < (var_1_5)) ? (var_1_1) : (var_1_5))) != ((((var_1_4) < (var_1_3)) ? (var_1_4) : (var_1_3)))) ? ((var_1_17 == var_1_12) ? (var_1_6 ? (var_1_8 == ((unsigned char) var_1_11)) : 1) : 1) : (var_1_8 == ((unsigned char) var_1_11)))) && (var_1_12 == ((float) ((2.55f + var_1_13) - var_1_14)))) && (var_1_15 == ((double) ((((var_1_13) > (((((var_1_14) < (var_1_16)) ? (var_1_14) : (var_1_16))))) ? (var_1_13) : (((((var_1_14) < (var_1_16)) ? (var_1_14) : (var_1_16))))))))) && ((var_1_2 >= var_1_1) ? (var_1_17 == ((float) (var_1_14 - ((((var_1_13) > (var_1_18)) ? (var_1_13) : (var_1_18)))))) : 1) ; [L101] RET, EXPR property() [L101] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_11=1, var_1_13=4831838212, var_1_14=4831838212, var_1_15=4831838212, var_1_16=4831838212, var_1_17=6/5, var_1_1=3221225470, var_1_2=2147483647, var_1_3=1073741823, var_1_4=4831838207, var_1_5=4831838207, var_1_6=-256, var_1_7=-256, var_1_8=1] [L19] reach_error() VAL [isInitial=1, var_1_11=1, var_1_13=4831838212, var_1_14=4831838212, var_1_15=4831838212, var_1_16=4831838212, var_1_17=6/5, var_1_1=3221225470, var_1_2=2147483647, var_1_3=1073741823, var_1_4=4831838207, var_1_5=4831838207, var_1_6=-256, var_1_7=-256, var_1_8=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 44 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 84.3s, OverallIterations: 3, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 136 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 134 mSDsluCounter, 371 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 263 mSDsCounter, 17 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 683 IncrementalHoareTripleChecker+Invalid, 700 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 17 mSolverCounterUnsat, 108 mSDtfsCounter, 683 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 278 GetRequests, 227 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 623 ImplicationChecksByTransitivity, 66.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=68occurred in iteration=2, InterpolantAutomatonStates: 35, 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, 2 MinimizatonAttempts, 24 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 77.7s InterpolantComputationTime, 392 NumberOfCodeBlocks, 392 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 291 ConstructedInterpolants, 0 QuantifiedInterpolants, 3980 SizeOfPredicates, 5 NumberOfNonLiveVariables, 231 ConjunctsInSsa, 37 ConjunctsInUnsatCore, 3 InterpolantComputations, 1 PerfectInterpolantSequences, 1122/1440 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:29:27,352 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/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-53.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 9d47886cf593addfb5e45528195520db8a5c30504e46ec7d00ca0344fac955f8 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 09:29:29,479 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 09:29:29,569 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-24 09:29:29,573 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 09:29:29,574 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 09:29:29,601 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 09:29:29,605 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 09:29:29,605 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 09:29:29,605 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 09:29:29,606 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 09:29:29,606 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 09:29:29,606 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 09:29:29,607 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 09:29:29,607 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 09:29:29,608 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 09:29:29,608 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 09:29:29,610 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 09:29:29,612 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 09:29:29,612 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 09:29:29,613 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 09:29:29,614 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 09:29:29,614 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 09:29:29,614 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 09:29:29,615 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 09:29:29,615 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-24 09:29:29,615 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 09:29:29,615 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-24 09:29:29,615 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 09:29:29,615 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 09:29:29,616 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 09:29:29,616 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 09:29:29,616 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 09:29:29,616 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 09:29:29,616 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 09:29:29,617 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 09:29:29,617 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 09:29:29,625 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 09:29:29,625 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 09:29:29,626 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-24 09:29:29,626 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-24 09:29:29,628 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 09:29:29,629 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 09:29:29,629 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 09:29:29,629 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 09:29:29,629 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-24 09:29:29,629 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 -> 9d47886cf593addfb5e45528195520db8a5c30504e46ec7d00ca0344fac955f8 [2024-10-24 09:29:29,973 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 09:29:29,997 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 09:29:30,000 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 09:29:30,002 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 09:29:30,002 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 09:29:30,004 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-53.i [2024-10-24 09:29:31,561 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 09:29:31,755 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 09:29:31,756 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-53.i [2024-10-24 09:29:31,771 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ad144788/6f60547b0e2a46d09095519646c049c1/FLAGac3c8b7d1 [2024-10-24 09:29:31,788 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ad144788/6f60547b0e2a46d09095519646c049c1 [2024-10-24 09:29:31,791 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 09:29:31,793 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 09:29:31,794 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 09:29:31,794 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 09:29:31,801 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 09:29:31,802 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 09:29:31" (1/1) ... [2024-10-24 09:29:31,802 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b87f9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:29:31, skipping insertion in model container [2024-10-24 09:29:31,803 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 09:29:31" (1/1) ... [2024-10-24 09:29:31,828 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 09:29:32,032 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-53.i[915,928] [2024-10-24 09:29:32,089 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 09:29:32,112 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 09:29:32,124 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-53.i[915,928] [2024-10-24 09:29:32,148 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 09:29:32,171 INFO L204 MainTranslator]: Completed translation [2024-10-24 09:29:32,171 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:29:32 WrapperNode [2024-10-24 09:29:32,171 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 09:29:32,172 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 09:29:32,172 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 09:29:32,173 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 09:29:32,179 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:29:32" (1/1) ... [2024-10-24 09:29:32,192 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:29:32" (1/1) ... [2024-10-24 09:29:32,226 INFO L138 Inliner]: procedures = 27, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 113 [2024-10-24 09:29:32,226 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 09:29:32,227 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 09:29:32,227 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 09:29:32,227 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 09:29:32,240 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:29:32" (1/1) ... [2024-10-24 09:29:32,240 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:29:32" (1/1) ... [2024-10-24 09:29:32,246 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:29:32" (1/1) ... [2024-10-24 09:29:32,258 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:29:32,259 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:29:32" (1/1) ... [2024-10-24 09:29:32,259 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:29:32" (1/1) ... [2024-10-24 09:29:32,272 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:29:32" (1/1) ... [2024-10-24 09:29:32,275 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:29:32" (1/1) ... [2024-10-24 09:29:32,277 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:29:32" (1/1) ... [2024-10-24 09:29:32,278 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:29:32" (1/1) ... [2024-10-24 09:29:32,281 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 09:29:32,282 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 09:29:32,282 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 09:29:32,283 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 09:29:32,283 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:29:32" (1/1) ... [2024-10-24 09:29:32,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 09:29:32,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 09:29:32,323 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:29:32,328 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:29:32,372 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 09:29:32,372 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-24 09:29:32,373 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 09:29:32,373 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 09:29:32,373 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 09:29:32,373 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 09:29:32,460 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 09:29:32,462 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation