./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-1.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 ae547c4902f7e11f87d7994462416820855bf00f967c780d5442969e651ce2e2 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 05:27:08,915 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 05:27:09,005 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-12 05:27:09,012 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 05:27:09,013 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 05:27:09,051 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 05:27:09,051 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 05:27:09,052 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 05:27:09,052 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 05:27:09,053 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 05:27:09,053 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 05:27:09,053 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 05:27:09,054 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 05:27:09,056 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 05:27:09,056 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 05:27:09,056 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 05:27:09,057 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 05:27:09,057 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 05:27:09,058 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 05:27:09,058 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 05:27:09,058 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 05:27:09,062 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 05:27:09,062 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 05:27:09,062 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 05:27:09,063 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 05:27:09,063 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 05:27:09,063 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 05:27:09,063 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 05:27:09,064 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 05:27:09,064 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 05:27:09,065 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 05:27:09,065 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 05:27:09,066 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 05:27:09,066 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 05:27:09,066 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 05:27:09,067 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 05:27:09,067 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 05:27:09,067 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 05:27:09,067 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 05:27:09,068 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 05:27:09,068 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 05:27:09,069 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 05:27:09,069 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 -> ae547c4902f7e11f87d7994462416820855bf00f967c780d5442969e651ce2e2 [2024-11-12 05:27:09,319 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 05:27:09,344 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 05:27:09,346 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 05:27:09,347 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 05:27:09,348 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 05:27:09,349 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-1.i [2024-11-12 05:27:10,752 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 05:27:10,937 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 05:27:10,938 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-1.i [2024-11-12 05:27:10,946 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f8ce5d5b/a5d5d2fdcc0d4f9f957f3b278aacdebb/FLAG810a684e3 [2024-11-12 05:27:11,325 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f8ce5d5b/a5d5d2fdcc0d4f9f957f3b278aacdebb [2024-11-12 05:27:11,327 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 05:27:11,329 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 05:27:11,330 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 05:27:11,330 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 05:27:11,334 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 05:27:11,335 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 05:27:11" (1/1) ... [2024-11-12 05:27:11,336 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39523b0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:27:11, skipping insertion in model container [2024-11-12 05:27:11,336 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 05:27:11" (1/1) ... [2024-11-12 05:27:11,359 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 05:27:11,549 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-1.i[914,927] [2024-11-12 05:27:11,599 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 05:27:11,609 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 05:27:11,620 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-1.i[914,927] [2024-11-12 05:27:11,640 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 05:27:11,656 INFO L204 MainTranslator]: Completed translation [2024-11-12 05:27:11,657 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:27:11 WrapperNode [2024-11-12 05:27:11,657 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 05:27:11,658 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 05:27:11,659 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 05:27:11,659 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 05:27:11,667 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:27:11" (1/1) ... [2024-11-12 05:27:11,676 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:27:11" (1/1) ... [2024-11-12 05:27:11,701 INFO L138 Inliner]: procedures = 26, calls = 22, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 122 [2024-11-12 05:27:11,701 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 05:27:11,702 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 05:27:11,702 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 05:27:11,703 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 05:27:11,714 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:27:11" (1/1) ... [2024-11-12 05:27:11,714 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:27:11" (1/1) ... [2024-11-12 05:27:11,717 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:27:11" (1/1) ... [2024-11-12 05:27:11,737 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-12 05:27:11,738 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:27:11" (1/1) ... [2024-11-12 05:27:11,738 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:27:11" (1/1) ... [2024-11-12 05:27:11,743 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:27:11" (1/1) ... [2024-11-12 05:27:11,746 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:27:11" (1/1) ... [2024-11-12 05:27:11,747 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:27:11" (1/1) ... [2024-11-12 05:27:11,748 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:27:11" (1/1) ... [2024-11-12 05:27:11,755 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 05:27:11,756 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 05:27:11,756 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 05:27:11,756 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 05:27:11,757 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:27:11" (1/1) ... [2024-11-12 05:27:11,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 05:27:11,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 05:27:11,795 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-12 05:27:11,798 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-12 05:27:11,851 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 05:27:11,851 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 05:27:11,851 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 05:27:11,851 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 05:27:11,852 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 05:27:11,852 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 05:27:11,931 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 05:27:11,934 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 05:27:12,233 INFO L? ?]: Removed 11 outVars from TransFormulas that were not future-live. [2024-11-12 05:27:12,233 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 05:27:12,250 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 05:27:12,250 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 05:27:12,251 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 05:27:12 BoogieIcfgContainer [2024-11-12 05:27:12,251 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 05:27:12,256 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 05:27:12,256 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 05:27:12,259 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 05:27:12,259 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 05:27:11" (1/3) ... [2024-11-12 05:27:12,261 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51f87834 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 05:27:12, skipping insertion in model container [2024-11-12 05:27:12,261 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:27:11" (2/3) ... [2024-11-12 05:27:12,262 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51f87834 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 05:27:12, skipping insertion in model container [2024-11-12 05:27:12,262 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 05:27:12" (3/3) ... [2024-11-12 05:27:12,264 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-1.i [2024-11-12 05:27:12,281 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 05:27:12,281 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 05:27:12,350 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 05:27:12,356 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;@208f99dd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 05:27:12,356 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 05:27:12,360 INFO L276 IsEmpty]: Start isEmpty. Operand has 54 states, 42 states have (on average 1.4523809523809523) internal successors, (61), 43 states have internal predecessors, (61), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-12 05:27:12,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-12 05:27:12,370 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:27:12,371 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 05:27:12,372 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:27:12,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:27:12,376 INFO L85 PathProgramCache]: Analyzing trace with hash 587340486, now seen corresponding path program 1 times [2024-11-12 05:27:12,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 05:27:12,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598341604] [2024-11-12 05:27:12,386 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:27:12,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 05:27:12,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:27:12,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 05:27:12,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:27:12,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 05:27:12,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:27:12,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 05:27:12,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:27:12,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-12 05:27:12,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:27:12,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 05:27:12,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:27:12,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-12 05:27:12,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:27:12,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 05:27:12,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:27:12,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-12 05:27:12,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:27:12,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 05:27:12,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:27:12,645 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-12 05:27:12,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 05:27:12,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598341604] [2024-11-12 05:27:12,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598341604] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 05:27:12,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 05:27:12,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 05:27:12,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074272004] [2024-11-12 05:27:12,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 05:27:12,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 05:27:12,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 05:27:12,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 05:27:12,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 05:27:12,679 INFO L87 Difference]: Start difference. First operand has 54 states, 42 states have (on average 1.4523809523809523) internal successors, (61), 43 states have internal predecessors, (61), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-12 05:27:12,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 05:27:12,707 INFO L93 Difference]: Finished difference Result 101 states and 161 transitions. [2024-11-12 05:27:12,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 05:27:12,710 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) Word has length 66 [2024-11-12 05:27:12,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 05:27:12,716 INFO L225 Difference]: With dead ends: 101 [2024-11-12 05:27:12,716 INFO L226 Difference]: Without dead ends: 50 [2024-11-12 05:27:12,719 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 05:27:12,723 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 05:27:12,725 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 05:27:12,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-11-12 05:27:12,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2024-11-12 05:27:12,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 39 states have (on average 1.3846153846153846) internal successors, (54), 39 states have internal predecessors, (54), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-12 05:27:12,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 72 transitions. [2024-11-12 05:27:12,760 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 72 transitions. Word has length 66 [2024-11-12 05:27:12,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 05:27:12,761 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 72 transitions. [2024-11-12 05:27:12,761 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-12 05:27:12,761 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 72 transitions. [2024-11-12 05:27:12,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-12 05:27:12,764 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:27:12,764 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 05:27:12,764 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 05:27:12,764 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:27:12,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:27:12,765 INFO L85 PathProgramCache]: Analyzing trace with hash -1190058936, now seen corresponding path program 1 times [2024-11-12 05:27:12,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 05:27:12,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65399883] [2024-11-12 05:27:12,766 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:27:12,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 05:27:12,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 05:27:12,911 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 05:27:12,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 05:27:13,003 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 05:27:13,003 INFO L339 BasicCegarLoop]: Counterexample is feasible [2024-11-12 05:27:13,005 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-12 05:27:13,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 05:27:13,014 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1] [2024-11-12 05:27:13,093 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-12 05:27:13,096 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 05:27:13 BoogieIcfgContainer [2024-11-12 05:27:13,097 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-12 05:27:13,098 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 05:27:13,098 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 05:27:13,098 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 05:27:13,098 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 05:27:12" (3/4) ... [2024-11-12 05:27:13,101 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-12 05:27:13,102 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 05:27:13,103 INFO L158 Benchmark]: Toolchain (without parser) took 1774.05ms. Allocated memory is still 165.7MB. Free memory was 111.0MB in the beginning and 121.4MB in the end (delta: -10.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 05:27:13,104 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 165.7MB. Free memory is still 130.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 05:27:13,104 INFO L158 Benchmark]: CACSL2BoogieTranslator took 327.94ms. Allocated memory is still 165.7MB. Free memory was 111.0MB in the beginning and 96.8MB in the end (delta: 14.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-12 05:27:13,106 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.11ms. Allocated memory is still 165.7MB. Free memory was 96.8MB in the beginning and 94.3MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 05:27:13,106 INFO L158 Benchmark]: Boogie Preprocessor took 52.79ms. Allocated memory is still 165.7MB. Free memory was 94.3MB in the beginning and 92.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 05:27:13,106 INFO L158 Benchmark]: RCFGBuilder took 495.47ms. Allocated memory is still 165.7MB. Free memory was 92.2MB in the beginning and 75.8MB in the end (delta: 16.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-12 05:27:13,107 INFO L158 Benchmark]: TraceAbstraction took 841.23ms. Allocated memory is still 165.7MB. Free memory was 75.4MB in the beginning and 121.4MB in the end (delta: -46.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 05:27:13,107 INFO L158 Benchmark]: Witness Printer took 4.53ms. Allocated memory is still 165.7MB. Free memory is still 121.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 05:27:13,112 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.21ms. Allocated memory is still 165.7MB. Free memory is still 130.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 327.94ms. Allocated memory is still 165.7MB. Free memory was 111.0MB in the beginning and 96.8MB in the end (delta: 14.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.11ms. Allocated memory is still 165.7MB. Free memory was 96.8MB in the beginning and 94.3MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 52.79ms. Allocated memory is still 165.7MB. Free memory was 94.3MB in the beginning and 92.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 495.47ms. Allocated memory is still 165.7MB. Free memory was 92.2MB in the beginning and 75.8MB in the end (delta: 16.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 841.23ms. Allocated memory is still 165.7MB. Free memory was 75.4MB in the beginning and 121.4MB in the end (delta: -46.0MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 4.53ms. Allocated memory is still 165.7MB. Free memory is still 121.4MB. 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 86, overapproximation of someUnaryFLOAToperation at line 55. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] float var_1_1 = 5.5; [L23] float var_1_4 = 256.2; [L24] unsigned char var_1_5 = 128; [L25] unsigned char var_1_9 = 25; [L26] signed char var_1_10 = 4; [L27] unsigned char var_1_11 = 0; [L28] unsigned char var_1_12 = 1; [L29] signed char var_1_13 = -1; [L30] signed long int var_1_14 = 256; [L31] float var_1_15 = 127.2; [L32] signed char last_1_var_1_10 = 4; [L33] signed long int last_1_var_1_14 = 256; [L34] float last_1_var_1_15 = 127.2; VAL [isInitial=0, last_1_var_1_10=4, last_1_var_1_14=256, last_1_var_1_15=636/5, var_1_10=4, var_1_11=0, var_1_12=1, var_1_13=-1, var_1_14=256, var_1_15=636/5, var_1_1=11/2, var_1_4=1281/5, var_1_5=128, var_1_9=25] [L90] isInitial = 1 [L91] FCALL initially() [L92] COND TRUE 1 [L93] CALL updateLastVariables() [L81] last_1_var_1_10 = var_1_10 [L82] last_1_var_1_14 = var_1_14 [L83] last_1_var_1_15 = var_1_15 VAL [isInitial=1, last_1_var_1_10=4, last_1_var_1_14=256, last_1_var_1_15=636/5, var_1_10=4, var_1_11=0, var_1_12=1, var_1_13=-1, var_1_14=256, var_1_15=636/5, var_1_1=11/2, var_1_4=1281/5, var_1_5=128, var_1_9=25] [L93] RET updateLastVariables() [L94] CALL updateVariables() [L65] var_1_4 = __VERIFIER_nondet_float() [L66] CALL assume_abort_if_not((var_1_4 >= -922337.2036854765600e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=4, last_1_var_1_14=256, last_1_var_1_15=636/5, var_1_10=4, var_1_11=0, var_1_12=1, var_1_13=-1, var_1_14=256, var_1_15=636/5, var_1_1=11/2, var_1_5=128, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=4, last_1_var_1_14=256, last_1_var_1_15=636/5, var_1_10=4, var_1_11=0, var_1_12=1, var_1_13=-1, var_1_14=256, var_1_15=636/5, var_1_1=11/2, var_1_5=128, var_1_9=25] [L66] RET assume_abort_if_not((var_1_4 >= -922337.2036854765600e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=4, last_1_var_1_14=256, last_1_var_1_15=636/5, var_1_10=4, var_1_11=0, var_1_12=1, var_1_13=-1, var_1_14=256, var_1_15=636/5, var_1_1=11/2, var_1_5=128, var_1_9=25] [L67] var_1_9 = __VERIFIER_nondet_uchar() [L68] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=4, last_1_var_1_14=256, last_1_var_1_15=636/5, var_1_10=4, var_1_11=0, var_1_12=1, var_1_13=-1, var_1_14=256, var_1_15=636/5, var_1_1=11/2, var_1_5=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=4, last_1_var_1_14=256, last_1_var_1_15=636/5, var_1_10=4, var_1_11=0, var_1_12=1, var_1_13=-1, var_1_14=256, var_1_15=636/5, var_1_1=11/2, var_1_5=128] [L68] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, last_1_var_1_10=4, last_1_var_1_14=256, last_1_var_1_15=636/5, var_1_10=4, var_1_11=0, var_1_12=1, var_1_13=-1, var_1_14=256, var_1_15=636/5, var_1_1=11/2, var_1_5=128] [L69] CALL assume_abort_if_not(var_1_9 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=4, last_1_var_1_14=256, last_1_var_1_15=636/5, var_1_10=4, var_1_11=0, var_1_12=1, var_1_13=-1, var_1_14=256, var_1_15=636/5, var_1_1=11/2, var_1_5=128, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=4, last_1_var_1_14=256, last_1_var_1_15=636/5, var_1_10=4, var_1_11=0, var_1_12=1, var_1_13=-1, var_1_14=256, var_1_15=636/5, var_1_1=11/2, var_1_5=128, var_1_9=-2] [L69] RET assume_abort_if_not(var_1_9 <= 254) VAL [isInitial=1, last_1_var_1_10=4, last_1_var_1_14=256, last_1_var_1_15=636/5, var_1_10=4, var_1_11=0, var_1_12=1, var_1_13=-1, var_1_14=256, var_1_15=636/5, var_1_1=11/2, var_1_5=128, var_1_9=-2] [L70] var_1_11 = __VERIFIER_nondet_uchar() [L71] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=4, last_1_var_1_14=256, last_1_var_1_15=636/5, var_1_10=4, var_1_12=1, var_1_13=-1, var_1_14=256, var_1_15=636/5, var_1_1=11/2, var_1_5=128, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=4, last_1_var_1_14=256, last_1_var_1_15=636/5, var_1_10=4, var_1_12=1, var_1_13=-1, var_1_14=256, var_1_15=636/5, var_1_1=11/2, var_1_5=128, var_1_9=-2] [L71] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_10=4, last_1_var_1_14=256, last_1_var_1_15=636/5, var_1_10=4, var_1_12=1, var_1_13=-1, var_1_14=256, var_1_15=636/5, var_1_1=11/2, var_1_5=128, var_1_9=-2] [L72] CALL assume_abort_if_not(var_1_11 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=4, last_1_var_1_14=256, last_1_var_1_15=636/5, var_1_10=4, var_1_11=0, var_1_12=1, var_1_13=-1, var_1_14=256, var_1_15=636/5, var_1_1=11/2, var_1_5=128, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=4, last_1_var_1_14=256, last_1_var_1_15=636/5, var_1_10=4, var_1_11=0, var_1_12=1, var_1_13=-1, var_1_14=256, var_1_15=636/5, var_1_1=11/2, var_1_5=128, var_1_9=-2] [L72] RET assume_abort_if_not(var_1_11 <= 1) VAL [isInitial=1, last_1_var_1_10=4, last_1_var_1_14=256, last_1_var_1_15=636/5, var_1_10=4, var_1_11=0, var_1_12=1, var_1_13=-1, var_1_14=256, var_1_15=636/5, var_1_1=11/2, var_1_5=128, var_1_9=-2] [L73] var_1_12 = __VERIFIER_nondet_uchar() [L74] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=4, last_1_var_1_14=256, last_1_var_1_15=636/5, var_1_10=4, var_1_11=0, var_1_13=-1, var_1_14=256, var_1_15=636/5, var_1_1=11/2, var_1_5=128, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=4, last_1_var_1_14=256, last_1_var_1_15=636/5, var_1_10=4, var_1_11=0, var_1_13=-1, var_1_14=256, var_1_15=636/5, var_1_1=11/2, var_1_5=128, var_1_9=-2] [L74] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_10=4, last_1_var_1_14=256, last_1_var_1_15=636/5, var_1_10=4, var_1_11=0, var_1_13=-1, var_1_14=256, var_1_15=636/5, var_1_1=11/2, var_1_5=128, var_1_9=-2] [L75] CALL assume_abort_if_not(var_1_12 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=4, last_1_var_1_14=256, last_1_var_1_15=636/5, var_1_10=4, var_1_11=0, var_1_12=1, var_1_13=-1, var_1_14=256, var_1_15=636/5, var_1_1=11/2, var_1_5=128, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=4, last_1_var_1_14=256, last_1_var_1_15=636/5, var_1_10=4, var_1_11=0, var_1_12=1, var_1_13=-1, var_1_14=256, var_1_15=636/5, var_1_1=11/2, var_1_5=128, var_1_9=-2] [L75] RET assume_abort_if_not(var_1_12 <= 1) VAL [isInitial=1, last_1_var_1_10=4, last_1_var_1_14=256, last_1_var_1_15=636/5, var_1_10=4, var_1_11=0, var_1_12=1, var_1_13=-1, var_1_14=256, var_1_15=636/5, var_1_1=11/2, var_1_5=128, var_1_9=-2] [L76] var_1_13 = __VERIFIER_nondet_char() [L77] CALL assume_abort_if_not(var_1_13 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=4, last_1_var_1_14=256, last_1_var_1_15=636/5, var_1_10=4, var_1_11=0, var_1_12=1, var_1_13=126, var_1_14=256, var_1_15=636/5, var_1_1=11/2, var_1_5=128, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=4, last_1_var_1_14=256, last_1_var_1_15=636/5, var_1_10=4, var_1_11=0, var_1_12=1, var_1_13=126, var_1_14=256, var_1_15=636/5, var_1_1=11/2, var_1_5=128, var_1_9=-2] [L77] RET assume_abort_if_not(var_1_13 >= -127) VAL [isInitial=1, last_1_var_1_10=4, last_1_var_1_14=256, last_1_var_1_15=636/5, var_1_10=4, var_1_11=0, var_1_12=1, var_1_13=126, var_1_14=256, var_1_15=636/5, var_1_1=11/2, var_1_5=128, var_1_9=-2] [L78] CALL assume_abort_if_not(var_1_13 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=4, last_1_var_1_14=256, last_1_var_1_15=636/5, var_1_10=4, var_1_11=0, var_1_12=1, var_1_13=126, var_1_14=256, var_1_15=636/5, var_1_1=11/2, var_1_5=128, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=4, last_1_var_1_14=256, last_1_var_1_15=636/5, var_1_10=4, var_1_11=0, var_1_12=1, var_1_13=126, var_1_14=256, var_1_15=636/5, var_1_1=11/2, var_1_5=128, var_1_9=-2] [L78] RET assume_abort_if_not(var_1_13 <= 126) VAL [isInitial=1, last_1_var_1_10=4, last_1_var_1_14=256, last_1_var_1_15=636/5, var_1_10=4, var_1_11=0, var_1_12=1, var_1_13=126, var_1_14=256, var_1_15=636/5, var_1_1=11/2, var_1_5=128, var_1_9=-2] [L94] RET updateVariables() [L95] CALL step() [L38] COND FALSE !(last_1_var_1_15 < ((((25.2f) < 0 ) ? -(25.2f) : (25.2f)))) [L45] var_1_5 = var_1_9 VAL [isInitial=1, last_1_var_1_10=4, last_1_var_1_14=256, last_1_var_1_15=636/5, var_1_10=4, var_1_11=0, var_1_12=1, var_1_13=126, var_1_14=256, var_1_15=636/5, var_1_1=11/2, var_1_5=-2, var_1_9=-2] [L47] var_1_14 = var_1_5 VAL [isInitial=1, last_1_var_1_10=4, last_1_var_1_14=256, last_1_var_1_15=636/5, var_1_10=4, var_1_11=0, var_1_12=1, var_1_13=126, var_1_14=254, var_1_15=636/5, var_1_1=11/2, var_1_5=-2, var_1_9=-2] [L48] COND FALSE !(\read(var_1_11)) VAL [isInitial=1, last_1_var_1_10=4, last_1_var_1_14=256, last_1_var_1_15=636/5, var_1_10=4, var_1_11=0, var_1_12=1, var_1_13=126, var_1_14=254, var_1_15=636/5, var_1_1=11/2, var_1_5=-2, var_1_9=-2] [L53] var_1_15 = var_1_4 VAL [isInitial=1, last_1_var_1_10=4, last_1_var_1_14=256, last_1_var_1_15=636/5, var_1_10=4, var_1_11=0, var_1_12=1, var_1_13=126, var_1_14=254, var_1_15=261, var_1_1=11/2, var_1_4=261, var_1_5=-2, var_1_9=-2] [L54] COND TRUE var_1_15 <= (- var_1_15) [L55] var_1_1 = ((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))) VAL [isInitial=1, last_1_var_1_10=4, last_1_var_1_14=256, last_1_var_1_15=636/5, var_1_10=4, var_1_11=0, var_1_12=1, var_1_13=126, var_1_14=254, var_1_15=261, var_1_1=261, var_1_4=261, var_1_5=-2, var_1_9=-2] [L95] RET step() [L96] CALL, EXPR property() [L86] EXPR ((var_1_15 <= (- var_1_15)) ? (var_1_1 == ((float) ((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))))) : ((var_1_15 > var_1_15) ? (var_1_1 == ((float) var_1_4)) : (var_1_1 == ((float) var_1_4)))) && ((last_1_var_1_15 < ((((25.2f) < 0 ) ? -(25.2f) : (25.2f)))) ? ((((4 + last_1_var_1_10) ^ last_1_var_1_14) >= last_1_var_1_10) ? (var_1_5 == ((unsigned char) 0)) : (var_1_5 == ((unsigned char) var_1_9))) : (var_1_5 == ((unsigned char) var_1_9))) VAL [isInitial=1, last_1_var_1_10=4, last_1_var_1_14=256, last_1_var_1_15=636/5, var_1_10=4, var_1_11=0, var_1_12=1, var_1_13=126, var_1_14=254, var_1_15=261, var_1_1=261, var_1_4=261, var_1_5=-2, var_1_9=-2] [L86-L87] return (((((var_1_15 <= (- var_1_15)) ? (var_1_1 == ((float) ((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))))) : ((var_1_15 > var_1_15) ? (var_1_1 == ((float) var_1_4)) : (var_1_1 == ((float) var_1_4)))) && ((last_1_var_1_15 < ((((25.2f) < 0 ) ? -(25.2f) : (25.2f)))) ? ((((4 + last_1_var_1_10) ^ last_1_var_1_14) >= last_1_var_1_10) ? (var_1_5 == ((unsigned char) 0)) : (var_1_5 == ((unsigned char) var_1_9))) : (var_1_5 == ((unsigned char) var_1_9)))) && (var_1_11 ? ((! var_1_12) ? (var_1_10 == ((signed char) var_1_13)) : 1) : 1)) && (var_1_14 == ((signed long int) var_1_5))) && (var_1_15 == ((float) var_1_4)) ; [L96] RET, EXPR property() [L96] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_10=4, last_1_var_1_14=256, last_1_var_1_15=636/5, var_1_10=4, var_1_11=0, var_1_12=1, var_1_13=126, var_1_14=254, var_1_15=261, var_1_1=261, var_1_4=261, var_1_5=-2, var_1_9=-2] [L19] reach_error() VAL [isInitial=1, last_1_var_1_10=4, last_1_var_1_14=256, last_1_var_1_15=636/5, var_1_10=4, var_1_11=0, var_1_12=1, var_1_13=126, var_1_14=254, var_1_15=261, var_1_1=261, var_1_4=261, var_1_5=-2, var_1_9=-2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 54 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.7s, OverallIterations: 2, TraceHistogramMax: 9, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 72 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 0 IncrementalHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 72 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 29 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=54occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 132 NumberOfCodeBlocks, 132 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 65 ConstructedInterpolants, 0 QuantifiedInterpolants, 65 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 144/144 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-12 05:27:13,141 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-1.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 ae547c4902f7e11f87d7994462416820855bf00f967c780d5442969e651ce2e2 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 05:27:15,408 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 05:27:15,498 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-12 05:27:15,505 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 05:27:15,505 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 05:27:15,535 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 05:27:15,537 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 05:27:15,537 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 05:27:15,538 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 05:27:15,539 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 05:27:15,540 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 05:27:15,540 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 05:27:15,541 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 05:27:15,541 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 05:27:15,544 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 05:27:15,545 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 05:27:15,545 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 05:27:15,545 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 05:27:15,545 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 05:27:15,545 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 05:27:15,546 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 05:27:15,546 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 05:27:15,546 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 05:27:15,547 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-12 05:27:15,547 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-12 05:27:15,547 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 05:27:15,547 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-12 05:27:15,547 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 05:27:15,547 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 05:27:15,548 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 05:27:15,548 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 05:27:15,548 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 05:27:15,548 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 05:27:15,549 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 05:27:15,549 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 05:27:15,550 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 05:27:15,551 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 05:27:15,552 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 05:27:15,552 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-12 05:27:15,552 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-12 05:27:15,552 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 05:27:15,553 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 05:27:15,553 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 05:27:15,553 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 05:27:15,553 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 -> ae547c4902f7e11f87d7994462416820855bf00f967c780d5442969e651ce2e2 [2024-11-12 05:27:15,917 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 05:27:15,942 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 05:27:15,946 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 05:27:15,947 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 05:27:15,947 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 05:27:15,949 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-1.i [2024-11-12 05:27:17,534 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 05:27:17,768 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 05:27:17,768 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-1.i [2024-11-12 05:27:17,776 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5071dd7e0/2792fd85ec2e482e8b35ef29fe5205b0/FLAG0e2f23f57 [2024-11-12 05:27:17,788 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5071dd7e0/2792fd85ec2e482e8b35ef29fe5205b0 [2024-11-12 05:27:17,790 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 05:27:17,791 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 05:27:17,792 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 05:27:17,792 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 05:27:17,797 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 05:27:17,798 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 05:27:17" (1/1) ... [2024-11-12 05:27:17,799 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a23b33d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:27:17, skipping insertion in model container [2024-11-12 05:27:17,799 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 05:27:17" (1/1) ... [2024-11-12 05:27:17,823 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 05:27:17,999 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-1.i[914,927] [2024-11-12 05:27:18,044 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 05:27:18,067 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 05:27:18,081 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-1.i[914,927] [2024-11-12 05:27:18,104 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 05:27:18,132 INFO L204 MainTranslator]: Completed translation [2024-11-12 05:27:18,132 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:27:18 WrapperNode [2024-11-12 05:27:18,133 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 05:27:18,134 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 05:27:18,134 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 05:27:18,134 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 05:27:18,141 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:27:18" (1/1) ... [2024-11-12 05:27:18,155 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:27:18" (1/1) ... [2024-11-12 05:27:18,184 INFO L138 Inliner]: procedures = 27, calls = 22, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 89 [2024-11-12 05:27:18,186 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 05:27:18,186 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 05:27:18,187 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 05:27:18,187 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 05:27:18,197 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:27:18" (1/1) ... [2024-11-12 05:27:18,198 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:27:18" (1/1) ... [2024-11-12 05:27:18,201 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:27:18" (1/1) ... [2024-11-12 05:27:18,234 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-12 05:27:18,235 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:27:18" (1/1) ... [2024-11-12 05:27:18,235 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:27:18" (1/1) ... [2024-11-12 05:27:18,246 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:27:18" (1/1) ... [2024-11-12 05:27:18,253 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:27:18" (1/1) ... [2024-11-12 05:27:18,255 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:27:18" (1/1) ... [2024-11-12 05:27:18,256 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:27:18" (1/1) ... [2024-11-12 05:27:18,263 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 05:27:18,264 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 05:27:18,264 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 05:27:18,264 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 05:27:18,265 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:27:18" (1/1) ... [2024-11-12 05:27:18,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 05:27:18,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 05:27:18,301 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-12 05:27:18,304 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-12 05:27:18,350 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 05:27:18,351 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-12 05:27:18,351 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 05:27:18,351 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 05:27:18,351 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 05:27:18,352 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 05:27:18,437 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 05:27:18,440 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 05:27:18,663 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-12 05:27:18,663 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 05:27:18,674 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 05:27:18,677 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 05:27:18,678 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 05:27:18 BoogieIcfgContainer [2024-11-12 05:27:18,678 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 05:27:18,680 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 05:27:18,681 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 05:27:18,684 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 05:27:18,684 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 05:27:17" (1/3) ... [2024-11-12 05:27:18,686 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f8ab548 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 05:27:18, skipping insertion in model container [2024-11-12 05:27:18,686 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:27:18" (2/3) ... [2024-11-12 05:27:18,687 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f8ab548 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 05:27:18, skipping insertion in model container [2024-11-12 05:27:18,687 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 05:27:18" (3/3) ... [2024-11-12 05:27:18,688 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-1.i [2024-11-12 05:27:18,703 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 05:27:18,704 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 05:27:18,766 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 05:27:18,772 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;@77b6837f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 05:27:18,772 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 05:27:18,776 INFO L276 IsEmpty]: Start isEmpty. Operand has 41 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 30 states have internal predecessors, (40), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-12 05:27:18,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-12 05:27:18,790 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:27:18,790 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 05:27:18,791 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:27:18,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:27:18,796 INFO L85 PathProgramCache]: Analyzing trace with hash -1768703162, now seen corresponding path program 1 times [2024-11-12 05:27:18,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 05:27:18,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1523713789] [2024-11-12 05:27:18,807 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:27:18,808 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 05:27:18,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 05:27:18,811 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 05:27:18,812 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-12 05:27:18,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:27:18,991 INFO L256 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-12 05:27:18,999 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 05:27:19,030 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-11-12 05:27:19,030 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 05:27:19,031 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 05:27:19,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1523713789] [2024-11-12 05:27:19,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1523713789] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 05:27:19,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 05:27:19,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 05:27:19,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352562671] [2024-11-12 05:27:19,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 05:27:19,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 05:27:19,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 05:27:19,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 05:27:19,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 05:27:19,065 INFO L87 Difference]: Start difference. First operand has 41 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 30 states have internal predecessors, (40), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-12 05:27:19,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 05:27:19,084 INFO L93 Difference]: Finished difference Result 75 states and 119 transitions. [2024-11-12 05:27:19,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 05:27:19,088 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 64 [2024-11-12 05:27:19,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 05:27:19,094 INFO L225 Difference]: With dead ends: 75 [2024-11-12 05:27:19,095 INFO L226 Difference]: Without dead ends: 37 [2024-11-12 05:27:19,099 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 05:27:19,105 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 05:27:19,106 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 05:27:19,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-11-12 05:27:19,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2024-11-12 05:27:19,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 26 states have internal predecessors, (32), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-12 05:27:19,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 50 transitions. [2024-11-12 05:27:19,149 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 50 transitions. Word has length 64 [2024-11-12 05:27:19,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 05:27:19,149 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 50 transitions. [2024-11-12 05:27:19,151 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-12 05:27:19,152 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 50 transitions. [2024-11-12 05:27:19,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-12 05:27:19,154 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:27:19,155 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 05:27:19,163 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-12 05:27:19,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 05:27:19,356 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:27:19,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:27:19,357 INFO L85 PathProgramCache]: Analyzing trace with hash 142294344, now seen corresponding path program 1 times [2024-11-12 05:27:19,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 05:27:19,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1473641161] [2024-11-12 05:27:19,358 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:27:19,358 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 05:27:19,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 05:27:19,360 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 05:27:19,362 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-12 05:27:19,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:27:19,495 INFO L256 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-12 05:27:19,502 INFO L279 TraceCheckSpWp]: Computing forward predicates...