./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-88.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3061b6dc 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-1loop_file-88.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 f035a0122bb8479800c2d26320f8fd4e217fb16ba8ab6223925657fc49ea1993 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-18 22:49:35,707 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-18 22:49:35,801 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-18 22:49:35,819 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-18 22:49:35,819 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-18 22:49:35,847 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-18 22:49:35,848 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-18 22:49:35,848 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-18 22:49:35,849 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-18 22:49:35,849 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-18 22:49:35,849 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-18 22:49:35,850 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-18 22:49:35,851 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-18 22:49:35,853 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-18 22:49:35,853 INFO L153 SettingsManager]: * Use SBE=true [2024-11-18 22:49:35,853 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-18 22:49:35,853 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-18 22:49:35,854 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-18 22:49:35,854 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-18 22:49:35,854 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-18 22:49:35,855 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-18 22:49:35,858 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-18 22:49:35,858 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-18 22:49:35,858 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-18 22:49:35,858 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-18 22:49:35,858 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-18 22:49:35,859 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-18 22:49:35,859 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-18 22:49:35,859 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-18 22:49:35,859 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-18 22:49:35,859 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-18 22:49:35,860 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-18 22:49:35,860 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 22:49:35,860 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-18 22:49:35,860 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-18 22:49:35,860 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-18 22:49:35,861 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-18 22:49:35,861 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-18 22:49:35,861 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-18 22:49:35,862 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-18 22:49:35,863 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-18 22:49:35,864 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-18 22:49:35,864 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 -> f035a0122bb8479800c2d26320f8fd4e217fb16ba8ab6223925657fc49ea1993 [2024-11-18 22:49:36,120 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-18 22:49:36,140 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-18 22:49:36,143 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-18 22:49:36,144 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-18 22:49:36,144 INFO L274 PluginConnector]: CDTParser initialized [2024-11-18 22:49:36,145 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-88.i [2024-11-18 22:49:37,544 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-18 22:49:37,766 INFO L384 CDTParser]: Found 1 translation units. [2024-11-18 22:49:37,767 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-88.i [2024-11-18 22:49:37,781 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/067567c01/614d9574e12849fca34a1e65d05a0360/FLAG828c2c610 [2024-11-18 22:49:38,136 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/067567c01/614d9574e12849fca34a1e65d05a0360 [2024-11-18 22:49:38,139 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-18 22:49:38,141 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-18 22:49:38,143 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-18 22:49:38,143 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-18 22:49:38,149 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-18 22:49:38,149 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 10:49:38" (1/1) ... [2024-11-18 22:49:38,150 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@711666 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:49:38, skipping insertion in model container [2024-11-18 22:49:38,150 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 10:49:38" (1/1) ... [2024-11-18 22:49:38,176 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-18 22:49:38,372 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-1loop_file-88.i[915,928] [2024-11-18 22:49:38,428 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 22:49:38,439 INFO L200 MainTranslator]: Completed pre-run [2024-11-18 22:49:38,484 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-1loop_file-88.i[915,928] [2024-11-18 22:49:38,523 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 22:49:38,571 INFO L204 MainTranslator]: Completed translation [2024-11-18 22:49:38,571 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:49:38 WrapperNode [2024-11-18 22:49:38,572 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-18 22:49:38,573 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-18 22:49:38,574 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-18 22:49:38,574 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-18 22:49:38,581 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:49:38" (1/1) ... [2024-11-18 22:49:38,596 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:49:38" (1/1) ... [2024-11-18 22:49:38,643 INFO L138 Inliner]: procedures = 26, calls = 24, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 112 [2024-11-18 22:49:38,643 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-18 22:49:38,644 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-18 22:49:38,648 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-18 22:49:38,648 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-18 22:49:38,660 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:49:38" (1/1) ... [2024-11-18 22:49:38,666 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:49:38" (1/1) ... [2024-11-18 22:49:38,669 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:49:38" (1/1) ... [2024-11-18 22:49:38,691 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-18 22:49:38,691 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:49:38" (1/1) ... [2024-11-18 22:49:38,692 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:49:38" (1/1) ... [2024-11-18 22:49:38,701 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:49:38" (1/1) ... [2024-11-18 22:49:38,708 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:49:38" (1/1) ... [2024-11-18 22:49:38,710 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:49:38" (1/1) ... [2024-11-18 22:49:38,711 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:49:38" (1/1) ... [2024-11-18 22:49:38,715 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-18 22:49:38,720 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-18 22:49:38,720 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-18 22:49:38,720 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-18 22:49:38,721 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:49:38" (1/1) ... [2024-11-18 22:49:38,729 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 22:49:38,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 22:49:38,761 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-18 22:49:38,768 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-18 22:49:38,812 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-18 22:49:38,812 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-18 22:49:38,813 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-18 22:49:38,814 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-18 22:49:38,814 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-18 22:49:38,814 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-18 22:49:38,879 INFO L238 CfgBuilder]: Building ICFG [2024-11-18 22:49:38,881 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-18 22:49:39,162 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-11-18 22:49:39,162 INFO L287 CfgBuilder]: Performing block encoding [2024-11-18 22:49:39,176 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-18 22:49:39,177 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-18 22:49:39,177 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:49:39 BoogieIcfgContainer [2024-11-18 22:49:39,178 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-18 22:49:39,179 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-18 22:49:39,179 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-18 22:49:39,182 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-18 22:49:39,183 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 10:49:38" (1/3) ... [2024-11-18 22:49:39,184 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@217b9a2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 10:49:39, skipping insertion in model container [2024-11-18 22:49:39,184 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:49:38" (2/3) ... [2024-11-18 22:49:39,184 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@217b9a2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 10:49:39, skipping insertion in model container [2024-11-18 22:49:39,184 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:49:39" (3/3) ... [2024-11-18 22:49:39,185 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-88.i [2024-11-18 22:49:39,203 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-18 22:49:39,204 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-18 22:49:39,271 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-18 22:49:39,279 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;@22cafe01, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-18 22:49:39,279 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-18 22:49:39,285 INFO L276 IsEmpty]: Start isEmpty. Operand has 49 states, 35 states have (on average 1.3714285714285714) internal successors, (48), 36 states have internal predecessors, (48), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-18 22:49:39,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-18 22:49:39,296 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 22:49:39,297 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 22:49:39,297 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 22:49:39,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 22:49:39,302 INFO L85 PathProgramCache]: Analyzing trace with hash 1043986355, now seen corresponding path program 1 times [2024-11-18 22:49:39,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 22:49:39,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273799227] [2024-11-18 22:49:39,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 22:49:39,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 22:49:39,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 22:49:39,557 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2024-11-18 22:49:39,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 22:49:39,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273799227] [2024-11-18 22:49:39,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1273799227] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 22:49:39,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1314782024] [2024-11-18 22:49:39,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 22:49:39,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 22:49:39,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 22:49:39,570 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-18 22:49:39,572 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-18 22:49:39,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 22:49:39,670 INFO L255 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-18 22:49:39,677 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 22:49:39,698 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2024-11-18 22:49:39,699 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 22:49:39,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1314782024] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 22:49:39,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-18 22:49:39,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2024-11-18 22:49:39,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581641646] [2024-11-18 22:49:39,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 22:49:39,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-18 22:49:39,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 22:49:39,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-18 22:49:39,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-18 22:49:39,734 INFO L87 Difference]: Start difference. First operand has 49 states, 35 states have (on average 1.3714285714285714) internal successors, (48), 36 states have internal predecessors, (48), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) 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, (11), 2 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-18 22:49:39,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 22:49:39,757 INFO L93 Difference]: Finished difference Result 95 states and 148 transitions. [2024-11-18 22:49:39,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-18 22:49:39,759 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, (11), 2 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) Word has length 76 [2024-11-18 22:49:39,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 22:49:39,765 INFO L225 Difference]: With dead ends: 95 [2024-11-18 22:49:39,765 INFO L226 Difference]: Without dead ends: 45 [2024-11-18 22:49:39,768 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 77 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-18 22:49:39,771 INFO L432 NwaCegarLoop]: 67 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, 67 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-18 22:49:39,772 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 22:49:39,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2024-11-18 22:49:39,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2024-11-18 22:49:39,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 32 states have (on average 1.28125) internal successors, (41), 32 states have internal predecessors, (41), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-18 22:49:39,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 63 transitions. [2024-11-18 22:49:39,810 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 63 transitions. Word has length 76 [2024-11-18 22:49:39,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 22:49:39,811 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 63 transitions. [2024-11-18 22:49:39,811 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, (11), 2 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-18 22:49:39,811 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 63 transitions. [2024-11-18 22:49:39,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-18 22:49:39,814 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 22:49:39,814 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 22:49:39,828 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-18 22:49:40,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-11-18 22:49:40,016 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 22:49:40,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 22:49:40,017 INFO L85 PathProgramCache]: Analyzing trace with hash -982624139, now seen corresponding path program 1 times [2024-11-18 22:49:40,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 22:49:40,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667964475] [2024-11-18 22:49:40,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 22:49:40,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 22:49:40,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-18 22:49:40,178 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-18 22:49:40,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-18 22:49:40,264 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-18 22:49:40,265 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-18 22:49:40,266 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-18 22:49:40,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-18 22:49:40,273 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1] [2024-11-18 22:49:40,348 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-18 22:49:40,355 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 10:49:40 BoogieIcfgContainer [2024-11-18 22:49:40,356 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-18 22:49:40,357 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-18 22:49:40,357 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-18 22:49:40,357 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-18 22:49:40,358 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:49:39" (3/4) ... [2024-11-18 22:49:40,361 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-18 22:49:40,362 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-18 22:49:40,364 INFO L158 Benchmark]: Toolchain (without parser) took 2222.29ms. Allocated memory is still 167.8MB. Free memory was 113.6MB in the beginning and 59.7MB in the end (delta: 53.8MB). Peak memory consumption was 52.4MB. Max. memory is 16.1GB. [2024-11-18 22:49:40,366 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 96.5MB. Free memory is still 51.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-18 22:49:40,366 INFO L158 Benchmark]: CACSL2BoogieTranslator took 429.61ms. Allocated memory is still 167.8MB. Free memory was 113.6MB in the beginning and 139.3MB in the end (delta: -25.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-18 22:49:40,367 INFO L158 Benchmark]: Boogie Procedure Inliner took 70.15ms. Allocated memory is still 167.8MB. Free memory was 139.3MB in the beginning and 137.3MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-18 22:49:40,367 INFO L158 Benchmark]: Boogie Preprocessor took 75.01ms. Allocated memory is still 167.8MB. Free memory was 137.3MB in the beginning and 135.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-18 22:49:40,367 INFO L158 Benchmark]: RCFGBuilder took 457.77ms. Allocated memory is still 167.8MB. Free memory was 135.2MB in the beginning and 118.4MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-18 22:49:40,368 INFO L158 Benchmark]: TraceAbstraction took 1176.89ms. Allocated memory is still 167.8MB. Free memory was 117.6MB in the beginning and 60.6MB in the end (delta: 57.0MB). Peak memory consumption was 56.6MB. Max. memory is 16.1GB. [2024-11-18 22:49:40,368 INFO L158 Benchmark]: Witness Printer took 5.37ms. Allocated memory is still 167.8MB. Free memory is still 59.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-18 22:49:40,370 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 96.5MB. Free memory is still 51.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 429.61ms. Allocated memory is still 167.8MB. Free memory was 113.6MB in the beginning and 139.3MB in the end (delta: -25.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 70.15ms. Allocated memory is still 167.8MB. Free memory was 139.3MB in the beginning and 137.3MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 75.01ms. Allocated memory is still 167.8MB. Free memory was 137.3MB in the beginning and 135.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 457.77ms. Allocated memory is still 167.8MB. Free memory was 135.2MB in the beginning and 118.4MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1176.89ms. Allocated memory is still 167.8MB. Free memory was 117.6MB in the beginning and 60.6MB in the end (delta: 57.0MB). Peak memory consumption was 56.6MB. Max. memory is 16.1GB. * Witness Printer took 5.37ms. Allocated memory is still 167.8MB. Free memory is still 59.7MB. 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 80. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed char var_1_1 = -8; [L23] signed char var_1_10 = -64; [L24] unsigned char var_1_11 = 0; [L25] unsigned char var_1_12 = 0; [L26] unsigned char var_1_13 = 1; [L27] unsigned char var_1_14 = 0; [L28] unsigned char var_1_15 = 0; [L29] signed long int var_1_16 = -16; [L30] float var_1_17 = 3.5; [L31] float var_1_18 = 128.45; [L32] unsigned long int var_1_19 = 50; [L33] unsigned long int var_1_20 = 25; VAL [isInitial=0, var_1_10=-64, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=-16, var_1_17=7/2, var_1_18=2569/20, var_1_19=50, var_1_1=-8, var_1_20=25] [L84] isInitial = 1 [L85] FCALL initially() [L86] int k_loop; [L87] k_loop = 0 VAL [isInitial=1, k_loop=0, var_1_10=-64, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=-16, var_1_17=7/2, var_1_18=2569/20, var_1_19=50, var_1_1=-8, var_1_20=25] [L87] COND TRUE k_loop < 1 [L88] FCALL updateLastVariables() [L89] CALL updateVariables() [L59] var_1_10 = __VERIFIER_nondet_char() [L60] CALL assume_abort_if_not(var_1_10 >= -127) VAL [\old(cond)=1, isInitial=1, var_1_10=126, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=-16, var_1_17=7/2, var_1_18=2569/20, var_1_19=50, var_1_1=-8, var_1_20=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=126, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=-16, var_1_17=7/2, var_1_18=2569/20, var_1_19=50, var_1_1=-8, var_1_20=25] [L60] RET assume_abort_if_not(var_1_10 >= -127) VAL [isInitial=1, var_1_10=126, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=-16, var_1_17=7/2, var_1_18=2569/20, var_1_19=50, var_1_1=-8, var_1_20=25] [L61] CALL assume_abort_if_not(var_1_10 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=126, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=-16, var_1_17=7/2, var_1_18=2569/20, var_1_19=50, var_1_1=-8, var_1_20=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=126, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=-16, var_1_17=7/2, var_1_18=2569/20, var_1_19=50, var_1_1=-8, var_1_20=25] [L61] RET assume_abort_if_not(var_1_10 <= 126) VAL [isInitial=1, var_1_10=126, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=-16, var_1_17=7/2, var_1_18=2569/20, var_1_19=50, var_1_1=-8, var_1_20=25] [L62] var_1_12 = __VERIFIER_nondet_uchar() [L63] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=126, var_1_11=0, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=-16, var_1_17=7/2, var_1_18=2569/20, var_1_19=50, var_1_1=-8, var_1_20=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=126, var_1_11=0, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=-16, var_1_17=7/2, var_1_18=2569/20, var_1_19=50, var_1_1=-8, var_1_20=25] [L63] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, var_1_10=126, var_1_11=0, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=-16, var_1_17=7/2, var_1_18=2569/20, var_1_19=50, var_1_1=-8, var_1_20=25] [L64] CALL assume_abort_if_not(var_1_12 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=126, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=-16, var_1_17=7/2, var_1_18=2569/20, var_1_19=50, var_1_1=-8, var_1_20=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=126, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=-16, var_1_17=7/2, var_1_18=2569/20, var_1_19=50, var_1_1=-8, var_1_20=25] [L64] RET assume_abort_if_not(var_1_12 <= 0) VAL [isInitial=1, var_1_10=126, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=-16, var_1_17=7/2, var_1_18=2569/20, var_1_19=50, var_1_1=-8, var_1_20=25] [L65] var_1_14 = __VERIFIER_nondet_uchar() [L66] CALL assume_abort_if_not(var_1_14 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=126, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=0, var_1_16=-16, var_1_17=7/2, var_1_18=2569/20, var_1_19=50, var_1_1=-8, var_1_20=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=126, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=0, var_1_16=-16, var_1_17=7/2, var_1_18=2569/20, var_1_19=50, var_1_1=-8, var_1_20=25] [L66] RET assume_abort_if_not(var_1_14 >= 1) VAL [isInitial=1, var_1_10=126, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=0, var_1_16=-16, var_1_17=7/2, var_1_18=2569/20, var_1_19=50, var_1_1=-8, var_1_20=25] [L67] CALL assume_abort_if_not(var_1_14 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=126, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=0, var_1_16=-16, var_1_17=7/2, var_1_18=2569/20, var_1_19=50, var_1_1=-8, var_1_20=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=126, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=0, var_1_16=-16, var_1_17=7/2, var_1_18=2569/20, var_1_19=50, var_1_1=-8, var_1_20=25] [L67] RET assume_abort_if_not(var_1_14 <= 1) VAL [isInitial=1, var_1_10=126, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=0, var_1_16=-16, var_1_17=7/2, var_1_18=2569/20, var_1_19=50, var_1_1=-8, var_1_20=25] [L68] var_1_15 = __VERIFIER_nondet_uchar() [L69] CALL assume_abort_if_not(var_1_15 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=126, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=-16, var_1_17=7/2, var_1_18=2569/20, var_1_19=50, var_1_1=-8, var_1_20=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=126, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=-16, var_1_17=7/2, var_1_18=2569/20, var_1_19=50, var_1_1=-8, var_1_20=25] [L69] RET assume_abort_if_not(var_1_15 >= 1) VAL [isInitial=1, var_1_10=126, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=-16, var_1_17=7/2, var_1_18=2569/20, var_1_19=50, var_1_1=-8, var_1_20=25] [L70] CALL assume_abort_if_not(var_1_15 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=126, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=-16, var_1_17=7/2, var_1_18=2569/20, var_1_19=50, var_1_1=-8, var_1_20=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=126, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=-16, var_1_17=7/2, var_1_18=2569/20, var_1_19=50, var_1_1=-8, var_1_20=25] [L70] RET assume_abort_if_not(var_1_15 <= 1) VAL [isInitial=1, var_1_10=126, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=-16, var_1_17=7/2, var_1_18=2569/20, var_1_19=50, var_1_1=-8, var_1_20=25] [L71] var_1_18 = __VERIFIER_nondet_float() [L72] CALL assume_abort_if_not((var_1_18 >= -922337.2036854765600e+13F && 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_10=126, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=-16, var_1_17=7/2, var_1_19=50, var_1_1=-8, var_1_20=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=126, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=-16, var_1_17=7/2, var_1_19=50, var_1_1=-8, var_1_20=25] [L72] RET assume_abort_if_not((var_1_18 >= -922337.2036854765600e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=126, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=-16, var_1_17=7/2, var_1_19=50, var_1_1=-8, var_1_20=25] [L73] var_1_20 = __VERIFIER_nondet_ulong() [L74] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=126, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=-16, var_1_17=7/2, var_1_19=50, var_1_1=-8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=126, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=-16, var_1_17=7/2, var_1_19=50, var_1_1=-8] [L74] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, var_1_10=126, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=-16, var_1_17=7/2, var_1_19=50, var_1_1=-8] [L75] CALL assume_abort_if_not(var_1_20 <= 4294967294) VAL [\old(cond)=1, isInitial=1, var_1_10=126, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=-16, var_1_17=7/2, var_1_19=50, var_1_1=-8, var_1_20=4294967294] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=126, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=-16, var_1_17=7/2, var_1_19=50, var_1_1=-8, var_1_20=4294967294] [L75] RET assume_abort_if_not(var_1_20 <= 4294967294) VAL [isInitial=1, var_1_10=126, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=-16, var_1_17=7/2, var_1_19=50, var_1_1=-8, var_1_20=4294967294] [L89] RET updateVariables() [L90] CALL step() [L37] var_1_13 = (var_1_14 && var_1_15) [L38] var_1_17 = var_1_18 [L39] var_1_19 = var_1_20 VAL [isInitial=1, var_1_10=126, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=-16, var_1_17=4294967299, var_1_18=4294967299, var_1_19=4294967294, var_1_1=-8, var_1_20=4294967294] [L40] COND TRUE (- (var_1_17 + var_1_17)) > var_1_17 [L41] var_1_11 = var_1_12 VAL [isInitial=1, var_1_10=126, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=-16, var_1_17=4294967299, var_1_18=4294967299, var_1_19=4294967294, var_1_1=-8, var_1_20=4294967294] [L43] var_1_16 = var_1_19 VAL [isInitial=1, var_1_10=126, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=-2, var_1_17=4294967299, var_1_18=4294967299, var_1_19=4294967294, var_1_1=-8, var_1_20=4294967294] [L44] EXPR var_1_16 | var_1_19 VAL [isInitial=1, var_1_10=126, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=-2, var_1_17=4294967299, var_1_18=4294967299, var_1_19=4294967294, var_1_1=-8, var_1_20=4294967294] [L44] COND FALSE !(((var_1_16 | var_1_19) > var_1_16) && var_1_11) [L55] var_1_1 = var_1_10 VAL [isInitial=1, var_1_10=126, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=-2, var_1_17=4294967299, var_1_18=4294967299, var_1_19=4294967294, var_1_1=126, var_1_20=4294967294] [L90] RET step() [L91] CALL, EXPR property() [L80] EXPR var_1_16 | var_1_19 VAL [isInitial=1, var_1_10=126, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=-2, var_1_17=4294967299, var_1_18=4294967299, var_1_19=4294967294, var_1_1=126, var_1_20=4294967294] [L80-L81] return ((((((((var_1_16 | var_1_19) > var_1_16) && var_1_11) ? (((var_1_19 != -16) && (var_1_17 <= (var_1_17 + var_1_17))) ? ((var_1_17 > var_1_17) ? (var_1_1 == ((signed char) var_1_10)) : (var_1_1 == ((signed char) var_1_10))) : (var_1_1 == ((signed char) var_1_10))) : (var_1_1 == ((signed char) var_1_10))) && (((- (var_1_17 + var_1_17)) > var_1_17) ? (var_1_11 == ((unsigned char) var_1_12)) : 1)) && (var_1_13 == ((unsigned char) (var_1_14 && var_1_15)))) && (var_1_16 == ((signed long int) var_1_19))) && (var_1_17 == ((float) var_1_18))) && (var_1_19 == ((unsigned long int) var_1_20)) ; [L91] RET, EXPR property() [L91] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=126, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=-2, var_1_17=4294967299, var_1_18=4294967299, var_1_19=4294967294, var_1_1=126, var_1_20=4294967294] [L19] reach_error() VAL [isInitial=1, var_1_10=126, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=-2, var_1_17=4294967299, var_1_18=4294967299, var_1_19=4294967294, var_1_1=126, var_1_20=4294967294] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 49 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.0s, OverallIterations: 2, TraceHistogramMax: 11, 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, 67 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, 67 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 77 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=49occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 228 NumberOfCodeBlocks, 228 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 150 ConstructedInterpolants, 0 QuantifiedInterpolants, 150 SizeOfPredicates, 0 NumberOfNonLiveVariables, 192 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 2 InterpolantComputations, 1 PerfectInterpolantSequences, 420/440 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-18 22:49:40,411 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-88.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 f035a0122bb8479800c2d26320f8fd4e217fb16ba8ab6223925657fc49ea1993 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-18 22:49:42,818 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-18 22:49:42,895 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-18 22:49:42,902 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-18 22:49:42,903 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-18 22:49:42,947 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-18 22:49:42,948 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-18 22:49:42,948 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-18 22:49:42,948 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-18 22:49:42,949 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-18 22:49:42,952 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-18 22:49:42,952 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-18 22:49:42,953 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-18 22:49:42,954 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-18 22:49:42,955 INFO L153 SettingsManager]: * Use SBE=true [2024-11-18 22:49:42,955 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-18 22:49:42,956 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-18 22:49:42,956 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-18 22:49:42,956 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-18 22:49:42,957 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-18 22:49:42,960 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-18 22:49:42,960 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-18 22:49:42,961 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-18 22:49:42,961 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-18 22:49:42,961 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-18 22:49:42,961 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-18 22:49:42,962 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-18 22:49:42,962 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-18 22:49:42,962 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-18 22:49:42,962 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-18 22:49:42,963 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-18 22:49:42,963 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-18 22:49:42,963 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-18 22:49:42,963 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-18 22:49:42,964 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 22:49:42,964 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-18 22:49:42,968 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-18 22:49:42,968 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-18 22:49:42,968 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-18 22:49:42,969 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-18 22:49:42,969 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-18 22:49:42,970 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-18 22:49:42,970 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-18 22:49:42,970 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-18 22:49:42,970 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 -> f035a0122bb8479800c2d26320f8fd4e217fb16ba8ab6223925657fc49ea1993 [2024-11-18 22:49:43,310 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-18 22:49:43,337 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-18 22:49:43,341 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-18 22:49:43,343 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-18 22:49:43,343 INFO L274 PluginConnector]: CDTParser initialized [2024-11-18 22:49:43,345 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-88.i [2024-11-18 22:49:44,989 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-18 22:49:45,189 INFO L384 CDTParser]: Found 1 translation units. [2024-11-18 22:49:45,190 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-88.i [2024-11-18 22:49:45,202 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/58490786c/c31e596e9fbb4a1995ba48ed78b94191/FLAG5a9036995 [2024-11-18 22:49:45,217 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/58490786c/c31e596e9fbb4a1995ba48ed78b94191 [2024-11-18 22:49:45,219 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-18 22:49:45,220 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-18 22:49:45,221 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-18 22:49:45,221 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-18 22:49:45,226 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-18 22:49:45,227 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 10:49:45" (1/1) ... [2024-11-18 22:49:45,228 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40fcfa2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:49:45, skipping insertion in model container [2024-11-18 22:49:45,228 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 10:49:45" (1/1) ... [2024-11-18 22:49:45,252 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-18 22:49:45,437 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-1loop_file-88.i[915,928] [2024-11-18 22:49:45,488 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 22:49:45,509 INFO L200 MainTranslator]: Completed pre-run [2024-11-18 22:49:45,525 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-1loop_file-88.i[915,928] [2024-11-18 22:49:45,553 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 22:49:45,577 INFO L204 MainTranslator]: Completed translation [2024-11-18 22:49:45,578 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:49:45 WrapperNode [2024-11-18 22:49:45,578 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-18 22:49:45,579 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-18 22:49:45,580 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-18 22:49:45,580 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-18 22:49:45,587 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:49:45" (1/1) ... [2024-11-18 22:49:45,603 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:49:45" (1/1) ... [2024-11-18 22:49:45,636 INFO L138 Inliner]: procedures = 27, calls = 24, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 93 [2024-11-18 22:49:45,638 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-18 22:49:45,639 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-18 22:49:45,639 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-18 22:49:45,640 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-18 22:49:45,651 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:49:45" (1/1) ... [2024-11-18 22:49:45,652 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:49:45" (1/1) ... [2024-11-18 22:49:45,656 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:49:45" (1/1) ... [2024-11-18 22:49:45,674 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-18 22:49:45,678 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:49:45" (1/1) ... [2024-11-18 22:49:45,678 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:49:45" (1/1) ... [2024-11-18 22:49:45,684 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:49:45" (1/1) ... [2024-11-18 22:49:45,694 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:49:45" (1/1) ... [2024-11-18 22:49:45,696 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:49:45" (1/1) ... [2024-11-18 22:49:45,701 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:49:45" (1/1) ... [2024-11-18 22:49:45,707 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-18 22:49:45,709 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-18 22:49:45,709 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-18 22:49:45,709 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-18 22:49:45,710 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:49:45" (1/1) ... [2024-11-18 22:49:45,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 22:49:45,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 22:49:45,747 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-18 22:49:45,750 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-18 22:49:45,799 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-18 22:49:45,799 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-18 22:49:45,799 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-18 22:49:45,800 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-18 22:49:45,800 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-18 22:49:45,802 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-18 22:49:45,894 INFO L238 CfgBuilder]: Building ICFG [2024-11-18 22:49:45,896 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-18 22:49:46,271 INFO L? ?]: Removed 9 outVars from TransFormulas that were not future-live. [2024-11-18 22:49:46,272 INFO L287 CfgBuilder]: Performing block encoding [2024-11-18 22:49:46,289 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-18 22:49:46,289 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-18 22:49:46,290 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:49:46 BoogieIcfgContainer [2024-11-18 22:49:46,290 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-18 22:49:46,292 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-18 22:49:46,292 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-18 22:49:46,296 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-18 22:49:46,297 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 10:49:45" (1/3) ... [2024-11-18 22:49:46,298 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cee2935 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 10:49:46, skipping insertion in model container [2024-11-18 22:49:46,299 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:49:45" (2/3) ... [2024-11-18 22:49:46,299 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cee2935 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 10:49:46, skipping insertion in model container [2024-11-18 22:49:46,299 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:49:46" (3/3) ... [2024-11-18 22:49:46,300 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-88.i [2024-11-18 22:49:46,315 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-18 22:49:46,315 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-18 22:49:46,373 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-18 22:49:46,378 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;@1d304c8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-18 22:49:46,379 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-18 22:49:46,383 INFO L276 IsEmpty]: Start isEmpty. Operand has 42 states, 28 states have (on average 1.3214285714285714) internal successors, (37), 29 states have internal predecessors, (37), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-18 22:49:46,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-18 22:49:46,393 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 22:49:46,394 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 22:49:46,396 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 22:49:46,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 22:49:46,402 INFO L85 PathProgramCache]: Analyzing trace with hash -797935293, now seen corresponding path program 1 times [2024-11-18 22:49:46,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 22:49:46,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2136327339] [2024-11-18 22:49:46,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 22:49:46,415 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-18 22:49:46,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 22:49:46,418 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-18 22:49:46,419 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-18 22:49:46,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 22:49:46,595 INFO L255 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-18 22:49:46,603 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 22:49:46,639 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 116 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2024-11-18 22:49:46,639 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 22:49:46,640 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-18 22:49:46,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2136327339] [2024-11-18 22:49:46,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2136327339] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 22:49:46,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 22:49:46,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-18 22:49:46,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058844475] [2024-11-18 22:49:46,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 22:49:46,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-18 22:49:46,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-18 22:49:46,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-18 22:49:46,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-18 22:49:46,679 INFO L87 Difference]: Start difference. First operand has 42 states, 28 states have (on average 1.3214285714285714) internal successors, (37), 29 states have internal predecessors, (37), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-18 22:49:46,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 22:49:46,707 INFO L93 Difference]: Finished difference Result 81 states and 126 transitions. [2024-11-18 22:49:46,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-18 22:49:46,711 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 73 [2024-11-18 22:49:46,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 22:49:46,717 INFO L225 Difference]: With dead ends: 81 [2024-11-18 22:49:46,718 INFO L226 Difference]: Without dead ends: 38 [2024-11-18 22:49:46,722 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 72 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-18 22:49:46,728 INFO L432 NwaCegarLoop]: 55 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, 55 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-18 22:49:46,729 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 22:49:46,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-11-18 22:49:46,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2024-11-18 22:49:46,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 25 states have (on average 1.16) internal successors, (29), 25 states have internal predecessors, (29), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-18 22:49:46,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 51 transitions. [2024-11-18 22:49:46,774 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 51 transitions. Word has length 73 [2024-11-18 22:49:46,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 22:49:46,776 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 51 transitions. [2024-11-18 22:49:46,776 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-18 22:49:46,777 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 51 transitions. [2024-11-18 22:49:46,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-18 22:49:46,780 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 22:49:46,780 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 22:49:46,788 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-18 22:49:46,984 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-18 22:49:46,985 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 22:49:46,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 22:49:46,986 INFO L85 PathProgramCache]: Analyzing trace with hash 1054580673, now seen corresponding path program 1 times [2024-11-18 22:49:46,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 22:49:46,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1398546618] [2024-11-18 22:49:46,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 22:49:46,987 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-18 22:49:46,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 22:49:46,989 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-18 22:49:46,991 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-18 22:49:47,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 22:49:47,137 INFO L255 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-18 22:49:47,144 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 22:49:49,685 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 90 proven. 6 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2024-11-18 22:49:49,687 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 22:49:55,372 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-18 22:49:55,373 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-18 22:49:55,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1398546618] [2024-11-18 22:49:55,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1398546618] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-18 22:49:55,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-18 22:49:55,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [11] total 17 [2024-11-18 22:49:55,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001904794] [2024-11-18 22:49:55,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 22:49:55,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-18 22:49:55,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-18 22:49:55,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-18 22:49:55,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2024-11-18 22:49:55,380 INFO L87 Difference]: Start difference. First operand 38 states and 51 transitions. Second operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-18 22:49:57,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 22:49:57,388 INFO L93 Difference]: Finished difference Result 93 states and 121 transitions. [2024-11-18 22:49:57,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-18 22:49:57,391 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 73 [2024-11-18 22:49:57,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 22:49:57,393 INFO L225 Difference]: With dead ends: 93 [2024-11-18 22:49:57,393 INFO L226 Difference]: Without dead ends: 58 [2024-11-18 22:49:57,394 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=73, Invalid=269, Unknown=0, NotChecked=0, Total=342 [2024-11-18 22:49:57,395 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 53 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-18 22:49:57,395 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 186 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-18 22:49:57,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-11-18 22:49:57,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 57. [2024-11-18 22:49:57,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 40 states have (on average 1.1) internal successors, (44), 41 states have internal predecessors, (44), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-18 22:49:57,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 70 transitions. [2024-11-18 22:49:57,408 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 70 transitions. Word has length 73 [2024-11-18 22:49:57,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 22:49:57,409 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 70 transitions. [2024-11-18 22:49:57,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-18 22:49:57,410 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 70 transitions. [2024-11-18 22:49:57,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-18 22:49:57,411 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 22:49:57,412 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 22:49:57,421 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 (3)] Ended with exit code 0 [2024-11-18 22:49:57,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /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-18 22:49:57,613 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 22:49:57,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 22:49:57,614 INFO L85 PathProgramCache]: Analyzing trace with hash -1465379261, now seen corresponding path program 1 times [2024-11-18 22:49:57,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 22:49:57,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1549596604] [2024-11-18 22:49:57,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 22:49:57,615 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-18 22:49:57,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 22:49:57,617 INFO L229 MonitoredProcess]: Starting monitored process 4 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-18 22:49:57,619 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 (4)] Waiting until timeout for monitored process [2024-11-18 22:49:57,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 22:49:57,717 INFO L255 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-18 22:49:57,721 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 22:49:59,541 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 149 proven. 24 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2024-11-18 22:49:59,541 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 22:50:04,598 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-18 22:50:04,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1549596604] [2024-11-18 22:50:04,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1549596604] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 22:50:04,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [464345816] [2024-11-18 22:50:04,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 22:50:04,599 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-18 22:50:04,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-18 22:50:04,604 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-18 22:50:04,611 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Waiting until timeout for monitored process [2024-11-18 22:50:04,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 22:50:04,924 INFO L255 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-18 22:50:04,928 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 22:50:10,259 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 158 proven. 30 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-11-18 22:50:10,259 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 22:50:17,443 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 24 proven. 6 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-11-18 22:50:17,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [464345816] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-18 22:50:17,444 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-18 22:50:17,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 23, 11] total 42 [2024-11-18 22:50:17,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427344822] [2024-11-18 22:50:17,444 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-18 22:50:17,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2024-11-18 22:50:17,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-18 22:50:17,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2024-11-18 22:50:17,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=331, Invalid=1831, Unknown=0, NotChecked=0, Total=2162 [2024-11-18 22:50:17,448 INFO L87 Difference]: Start difference. First operand 57 states and 70 transitions. Second operand has 42 states, 42 states have (on average 1.9523809523809523) internal successors, (82), 40 states have internal predecessors, (82), 10 states have call successors, (28), 9 states have call predecessors, (28), 13 states have return successors, (29), 10 states have call predecessors, (29), 10 states have call successors, (29) [2024-11-18 22:50:29,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 22:50:29,976 INFO L93 Difference]: Finished difference Result 185 states and 208 transitions. [2024-11-18 22:50:29,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2024-11-18 22:50:29,977 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 1.9523809523809523) internal successors, (82), 40 states have internal predecessors, (82), 10 states have call successors, (28), 9 states have call predecessors, (28), 13 states have return successors, (29), 10 states have call predecessors, (29), 10 states have call successors, (29) Word has length 73 [2024-11-18 22:50:29,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 22:50:29,978 INFO L225 Difference]: With dead ends: 185 [2024-11-18 22:50:29,978 INFO L226 Difference]: Without dead ends: 0 [2024-11-18 22:50:29,983 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 197 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3077 ImplicationChecksByTransitivity, 18.4s TimeCoverageRelationStatistics Valid=1951, Invalid=8761, Unknown=0, NotChecked=0, Total=10712 [2024-11-18 22:50:29,984 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 106 mSDsluCounter, 564 mSDsCounter, 0 mSdLazyCounter, 1198 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 626 SdHoareTripleChecker+Invalid, 1264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 1198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2024-11-18 22:50:29,984 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 626 Invalid, 1264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 1198 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2024-11-18 22:50:29,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-18 22:50:29,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-18 22:50:29,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 22:50:29,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-18 22:50:29,986 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 73 [2024-11-18 22:50:29,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 22:50:29,986 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-18 22:50:29,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 1.9523809523809523) internal successors, (82), 40 states have internal predecessors, (82), 10 states have call successors, (28), 9 states have call predecessors, (28), 13 states have return successors, (29), 10 states have call predecessors, (29), 10 states have call successors, (29) [2024-11-18 22:50:29,986 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-18 22:50:29,987 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-18 22:50:29,989 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-18 22:50:29,997 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 (4)] Ended with exit code 0 [2024-11-18 22:50:30,195 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Ended with exit code 0 [2024-11-18 22:50:30,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /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,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-11-18 22:50:30,394 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-18 22:50:30,396 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-18 22:50:42,341 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-18 22:50:42,354 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-11-18 22:50:42,354 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-11-18 22:50:42,354 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-11-18 22:50:42,354 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-11-18 22:50:42,356 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Missing case for function ~fp.eq~32 [2024-11-18 22:50:42,356 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Missing case for function ~fp.eq~32 [2024-11-18 22:50:42,357 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-11-18 22:50:42,358 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-11-18 22:50:42,358 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2024-11-18 22:50:42,383 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Missing case for function ~fp.eq~32 [2024-11-18 22:50:42,384 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Missing case for function ~fp.eq~32 [2024-11-18 22:50:42,384 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Missing case for function ~fp.eq~32 [2024-11-18 22:50:42,384 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-11-18 22:50:42,385 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-11-18 22:50:42,385 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2024-11-18 22:50:42,385 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Missing case for function ~fp.eq~32 [2024-11-18 22:50:42,385 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-11-18 22:50:42,385 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2024-11-18 22:50:42,386 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-11-18 22:50:42,386 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2024-11-18 22:50:42,386 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Missing case for function ~fp.eq~32 [2024-11-18 22:50:42,386 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Missing case for function ~fp.eq~32 [2024-11-18 22:50:42,386 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Missing case for function ~fp.eq~32 [2024-11-18 22:50:42,387 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-11-18 22:50:42,387 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-11-18 22:50:42,387 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2024-11-18 22:50:42,387 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Missing case for function ~fp.eq~32 [2024-11-18 22:50:42,387 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-11-18 22:50:42,388 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2024-11-18 22:50:42,388 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-11-18 22:50:42,388 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2024-11-18 22:50:42,392 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 10:50:42 BoogieIcfgContainer [2024-11-18 22:50:42,395 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-18 22:50:42,395 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-18 22:50:42,395 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-18 22:50:42,396 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-18 22:50:42,396 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:49:46" (3/4) ... [2024-11-18 22:50:42,398 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-18 22:50:42,402 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-11-18 22:50:42,408 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2024-11-18 22:50:42,408 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-18 22:50:42,409 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-18 22:50:42,409 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-18 22:50:42,500 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-18 22:50:42,503 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-18 22:50:42,503 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-18 22:50:42,504 INFO L158 Benchmark]: Toolchain (without parser) took 57284.14ms. Allocated memory was 62.9MB in the beginning and 136.3MB in the end (delta: 73.4MB). Free memory was 35.3MB in the beginning and 100.8MB in the end (delta: -65.4MB). Peak memory consumption was 6.6MB. Max. memory is 16.1GB. [2024-11-18 22:50:42,504 INFO L158 Benchmark]: CDTParser took 1.36ms. Allocated memory is still 44.0MB. Free memory was 25.7MB in the beginning and 25.7MB in the end (delta: 42.1kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-18 22:50:42,505 INFO L158 Benchmark]: CACSL2BoogieTranslator took 357.84ms. Allocated memory is still 62.9MB. Free memory was 35.0MB in the beginning and 37.0MB in the end (delta: -2.0MB). Peak memory consumption was 8.9MB. Max. memory is 16.1GB. [2024-11-18 22:50:42,505 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.50ms. Allocated memory is still 62.9MB. Free memory was 37.0MB in the beginning and 35.0MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-18 22:50:42,505 INFO L158 Benchmark]: Boogie Preprocessor took 69.32ms. Allocated memory is still 62.9MB. Free memory was 35.0MB in the beginning and 32.6MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-18 22:50:42,505 INFO L158 Benchmark]: RCFGBuilder took 581.47ms. Allocated memory was 62.9MB in the beginning and 77.6MB in the end (delta: 14.7MB). Free memory was 32.4MB in the beginning and 49.9MB in the end (delta: -17.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-18 22:50:42,506 INFO L158 Benchmark]: TraceAbstraction took 56102.49ms. Allocated memory was 77.6MB in the beginning and 136.3MB in the end (delta: 58.7MB). Free memory was 49.2MB in the beginning and 107.1MB in the end (delta: -57.8MB). Peak memory consumption was 75.8MB. Max. memory is 16.1GB. [2024-11-18 22:50:42,506 INFO L158 Benchmark]: Witness Printer took 108.13ms. Allocated memory is still 136.3MB. Free memory was 106.0MB in the beginning and 100.8MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-18 22:50:42,508 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.36ms. Allocated memory is still 44.0MB. Free memory was 25.7MB in the beginning and 25.7MB in the end (delta: 42.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 357.84ms. Allocated memory is still 62.9MB. Free memory was 35.0MB in the beginning and 37.0MB in the end (delta: -2.0MB). Peak memory consumption was 8.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 58.50ms. Allocated memory is still 62.9MB. Free memory was 37.0MB in the beginning and 35.0MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 69.32ms. Allocated memory is still 62.9MB. Free memory was 35.0MB in the beginning and 32.6MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 581.47ms. Allocated memory was 62.9MB in the beginning and 77.6MB in the end (delta: 14.7MB). Free memory was 32.4MB in the beginning and 49.9MB in the end (delta: -17.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 56102.49ms. Allocated memory was 77.6MB in the beginning and 136.3MB in the end (delta: 58.7MB). Free memory was 49.2MB in the beginning and 107.1MB in the end (delta: -57.8MB). Peak memory consumption was 75.8MB. Max. memory is 16.1GB. * Witness Printer took 108.13ms. Allocated memory is still 136.3MB. Free memory was 106.0MB in the beginning and 100.8MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Missing case for function ~fp.eq~32 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Missing case for function ~fp.eq~32 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Missing case for function ~fp.eq~32 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Missing case for function ~fp.eq~32 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Missing case for function ~fp.eq~32 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Missing case for function ~fp.eq~32 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Missing case for function ~fp.eq~32 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Missing case for function ~fp.eq~32 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Missing case for function ~fp.eq~32 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Missing case for function ~fp.eq~32 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven * 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 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 42 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 44.0s, OverallIterations: 3, TraceHistogramMax: 11, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 14.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 162 SdHoareTripleChecker+Valid, 6.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 159 mSDsluCounter, 867 SdHoareTripleChecker+Invalid, 5.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 700 mSDsCounter, 72 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1292 IncrementalHoareTripleChecker+Invalid, 1364 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 72 mSolverCounterUnsat, 167 mSDtfsCounter, 1292 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 517 GetRequests, 398 SyntacticMatches, 0 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3133 ImplicationChecksByTransitivity, 21.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=57occurred in iteration=2, InterpolantAutomatonStates: 70, 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, 3 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 27.7s InterpolantComputationTime, 292 NumberOfCodeBlocks, 292 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 432 ConstructedInterpolants, 0 QuantifiedInterpolants, 3507 SizeOfPredicates, 47 NumberOfNonLiveVariables, 502 ConjunctsInSsa, 63 ConjunctsInUnsatCore, 6 InterpolantComputations, 2 PerfectInterpolantSequences, 1254/1320 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 87]: Loop Invariant Derived loop invariant: ((0 == var_1_11) && (var_1_12 <= 0)) - ProcedureContractResult [Line: 20]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Requires: (((0 == var_1_11) || ((0 == var_1_11) && (var_1_12 <= 0))) || ((((((var_1_15 <= 1) && (0 == var_1_11)) && (var_1_14 >= 1)) && (var_1_14 <= 1)) && (var_1_12 <= 0)) && (var_1_15 >= 1))) Ensures: (((0 != cond) && (((0 == var_1_11) || ((0 == var_1_11) && (var_1_12 <= 0))) || ((((((var_1_15 <= 1) && (0 == var_1_11)) && (var_1_14 >= 1)) && (var_1_14 <= 1)) && (var_1_12 <= 0)) && (var_1_15 >= 1)))) && (((((((((((((isInitial == \old(isInitial)) && (var_1_1 == \old(var_1_1))) && (var_1_10 == \old(var_1_10))) && (var_1_11 == \old(var_1_11))) && (var_1_12 == \old(var_1_12))) && (var_1_13 == \old(var_1_13))) && (var_1_14 == \old(var_1_14))) && (var_1_15 == \old(var_1_15))) && (var_1_16 == \old(var_1_16))) && (var_1_17 == \old(var_1_17))) && (var_1_18 == \old(var_1_18))) && (var_1_19 == \old(var_1_19))) && (var_1_20 == \old(var_1_20)))) RESULT: Ultimate proved your program to be correct! [2024-11-18 22:50:42,651 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 Writing output log to file Ultimate.log Result: TRUE