./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_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-while_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 bc4858d1901c3c90630688f631857e35419d28ea39c5c3a06b704467149a98bd --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-18 23:00:26,265 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-18 23:00:26,331 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-18 23:00:26,347 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-18 23:00:26,347 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-18 23:00:26,364 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-18 23:00:26,366 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-18 23:00:26,366 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-18 23:00:26,367 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-18 23:00:26,368 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-18 23:00:26,369 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-18 23:00:26,369 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-18 23:00:26,369 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-18 23:00:26,370 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-18 23:00:26,370 INFO L153 SettingsManager]: * Use SBE=true [2024-11-18 23:00:26,370 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-18 23:00:26,370 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-18 23:00:26,370 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-18 23:00:26,371 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-18 23:00:26,371 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-18 23:00:26,374 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-18 23:00:26,378 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-18 23:00:26,379 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-18 23:00:26,379 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-18 23:00:26,379 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-18 23:00:26,379 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-18 23:00:26,379 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-18 23:00:26,380 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-18 23:00:26,380 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-18 23:00:26,380 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-18 23:00:26,380 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-18 23:00:26,380 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-18 23:00:26,381 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 23:00:26,381 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-18 23:00:26,381 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-18 23:00:26,381 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-18 23:00:26,381 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-18 23:00:26,381 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-18 23:00:26,382 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-18 23:00:26,382 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-18 23:00:26,382 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-18 23:00:26,383 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-18 23:00:26,384 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 -> bc4858d1901c3c90630688f631857e35419d28ea39c5c3a06b704467149a98bd [2024-11-18 23:00:26,602 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-18 23:00:26,628 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-18 23:00:26,632 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-18 23:00:26,633 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-18 23:00:26,633 INFO L274 PluginConnector]: CDTParser initialized [2024-11-18 23:00:26,634 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-88.i [2024-11-18 23:00:28,006 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-18 23:00:28,187 INFO L384 CDTParser]: Found 1 translation units. [2024-11-18 23:00:28,188 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-88.i [2024-11-18 23:00:28,194 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/04f619da5/b7e327ecb4b14c27b67cacf349f752c1/FLAG7384edeac [2024-11-18 23:00:28,205 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/04f619da5/b7e327ecb4b14c27b67cacf349f752c1 [2024-11-18 23:00:28,206 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-18 23:00:28,207 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-18 23:00:28,209 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-18 23:00:28,209 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-18 23:00:28,214 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-18 23:00:28,220 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 11:00:28" (1/1) ... [2024-11-18 23:00:28,221 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d316330 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:00:28, skipping insertion in model container [2024-11-18 23:00:28,221 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 11:00:28" (1/1) ... [2024-11-18 23:00:28,252 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-18 23:00:28,378 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-88.i[915,928] [2024-11-18 23:00:28,402 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 23:00:28,409 INFO L200 MainTranslator]: Completed pre-run [2024-11-18 23:00:28,417 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-88.i[915,928] [2024-11-18 23:00:28,427 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 23:00:28,443 INFO L204 MainTranslator]: Completed translation [2024-11-18 23:00:28,444 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:00:28 WrapperNode [2024-11-18 23:00:28,444 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-18 23:00:28,445 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-18 23:00:28,445 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-18 23:00:28,445 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-18 23:00:28,450 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:00:28" (1/1) ... [2024-11-18 23:00:28,457 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:00:28" (1/1) ... [2024-11-18 23:00:28,474 INFO L138 Inliner]: procedures = 26, calls = 24, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 107 [2024-11-18 23:00:28,474 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-18 23:00:28,475 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-18 23:00:28,475 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-18 23:00:28,475 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-18 23:00:28,487 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:00:28" (1/1) ... [2024-11-18 23:00:28,487 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:00:28" (1/1) ... [2024-11-18 23:00:28,488 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:00:28" (1/1) ... [2024-11-18 23:00:28,497 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 23:00:28,497 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:00:28" (1/1) ... [2024-11-18 23:00:28,497 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:00:28" (1/1) ... [2024-11-18 23:00:28,500 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:00:28" (1/1) ... [2024-11-18 23:00:28,502 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:00:28" (1/1) ... [2024-11-18 23:00:28,503 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:00:28" (1/1) ... [2024-11-18 23:00:28,504 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:00:28" (1/1) ... [2024-11-18 23:00:28,506 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-18 23:00:28,507 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-18 23:00:28,507 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-18 23:00:28,507 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-18 23:00:28,508 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:00:28" (1/1) ... [2024-11-18 23:00:28,512 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 23:00:28,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 23:00:28,536 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 23:00:28,538 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 23:00:28,572 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-18 23:00:28,572 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-18 23:00:28,572 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-18 23:00:28,572 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-18 23:00:28,572 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-18 23:00:28,572 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-18 23:00:28,625 INFO L238 CfgBuilder]: Building ICFG [2024-11-18 23:00:28,627 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-18 23:00:28,839 INFO L? ?]: Removed 11 outVars from TransFormulas that were not future-live. [2024-11-18 23:00:28,839 INFO L287 CfgBuilder]: Performing block encoding [2024-11-18 23:00:28,852 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-18 23:00:28,854 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-18 23:00:28,854 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 11:00:28 BoogieIcfgContainer [2024-11-18 23:00:28,854 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-18 23:00:28,857 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-18 23:00:28,857 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-18 23:00:28,861 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-18 23:00:28,861 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 11:00:28" (1/3) ... [2024-11-18 23:00:28,862 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38f01f58 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 11:00:28, skipping insertion in model container [2024-11-18 23:00:28,863 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:00:28" (2/3) ... [2024-11-18 23:00:28,863 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38f01f58 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 11:00:28, skipping insertion in model container [2024-11-18 23:00:28,863 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 11:00:28" (3/3) ... [2024-11-18 23:00:28,864 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-88.i [2024-11-18 23:00:28,879 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-18 23:00:28,879 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-18 23:00:28,930 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-18 23:00:28,937 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;@6bb53a76, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-18 23:00:28,937 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-18 23:00:28,941 INFO L276 IsEmpty]: Start isEmpty. Operand has 48 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 35 states have internal predecessors, (47), 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 23:00:28,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-18 23:00:28,949 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 23:00:28,949 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 23:00:28,950 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 23:00:28,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 23:00:28,953 INFO L85 PathProgramCache]: Analyzing trace with hash -2024490382, now seen corresponding path program 1 times [2024-11-18 23:00:28,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 23:00:28,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169439647] [2024-11-18 23:00:28,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 23:00:28,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 23:00:29,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 23:00:29,171 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 23:00:29,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 23:00:29,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169439647] [2024-11-18 23:00:29,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169439647] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 23:00:29,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [84996445] [2024-11-18 23:00:29,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 23:00:29,173 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 23:00:29,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 23:00:29,175 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 23:00:29,176 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 23:00:29,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 23:00:29,282 INFO L255 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-18 23:00:29,287 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 23:00:29,303 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 23:00:29,304 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 23:00:29,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [84996445] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 23:00:29,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-18 23:00:29,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2024-11-18 23:00:29,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709049474] [2024-11-18 23:00:29,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 23:00:29,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-18 23:00:29,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 23:00:29,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-18 23:00:29,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-18 23:00:29,334 INFO L87 Difference]: Start difference. First operand has 48 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 35 states have internal predecessors, (47), 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 23:00:29,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 23:00:29,356 INFO L93 Difference]: Finished difference Result 89 states and 143 transitions. [2024-11-18 23:00:29,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-18 23:00:29,358 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 23:00:29,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 23:00:29,364 INFO L225 Difference]: With dead ends: 89 [2024-11-18 23:00:29,364 INFO L226 Difference]: Without dead ends: 44 [2024-11-18 23:00:29,368 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 23:00:29,372 INFO L432 NwaCegarLoop]: 62 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, 62 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 23:00:29,372 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 23:00:29,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2024-11-18 23:00:29,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2024-11-18 23:00:29,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 31 states have internal predecessors, (40), 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 23:00:29,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 62 transitions. [2024-11-18 23:00:29,452 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 62 transitions. Word has length 76 [2024-11-18 23:00:29,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 23:00:29,453 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 62 transitions. [2024-11-18 23:00:29,453 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 23:00:29,453 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 62 transitions. [2024-11-18 23:00:29,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-18 23:00:29,456 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 23:00:29,456 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 23:00:29,500 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-18 23:00:29,657 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 23:00:29,661 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 23:00:29,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 23:00:29,662 INFO L85 PathProgramCache]: Analyzing trace with hash 243866420, now seen corresponding path program 1 times [2024-11-18 23:00:29,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 23:00:29,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859747231] [2024-11-18 23:00:29,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 23:00:29,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 23:00:29,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-18 23:00:29,742 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-18 23:00:29,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-18 23:00:29,810 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-18 23:00:29,811 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-18 23:00:29,813 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-18 23:00:29,814 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-18 23:00:29,818 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1] [2024-11-18 23:00:29,866 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-18 23:00:29,872 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 11:00:29 BoogieIcfgContainer [2024-11-18 23:00:29,872 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-18 23:00:29,872 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-18 23:00:29,873 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-18 23:00:29,873 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-18 23:00:29,875 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 11:00:28" (3/4) ... [2024-11-18 23:00:29,877 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-18 23:00:29,879 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-18 23:00:29,879 INFO L158 Benchmark]: Toolchain (without parser) took 1671.85ms. Allocated memory is still 222.3MB. Free memory was 153.1MB in the beginning and 167.5MB in the end (delta: -14.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-18 23:00:29,880 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 127.9MB. Free memory is still 92.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-18 23:00:29,880 INFO L158 Benchmark]: CACSL2BoogieTranslator took 235.83ms. Allocated memory is still 222.3MB. Free memory was 153.1MB in the beginning and 139.7MB in the end (delta: 13.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-18 23:00:29,881 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.14ms. Allocated memory is still 222.3MB. Free memory was 139.0MB in the beginning and 137.6MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-18 23:00:29,881 INFO L158 Benchmark]: Boogie Preprocessor took 31.62ms. Allocated memory is still 222.3MB. Free memory was 136.9MB in the beginning and 134.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-18 23:00:29,882 INFO L158 Benchmark]: RCFGBuilder took 347.45ms. Allocated memory is still 222.3MB. Free memory was 134.8MB in the beginning and 118.7MB in the end (delta: 16.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-18 23:00:29,882 INFO L158 Benchmark]: TraceAbstraction took 1015.12ms. Allocated memory is still 222.3MB. Free memory was 118.1MB in the beginning and 167.5MB in the end (delta: -49.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-18 23:00:29,882 INFO L158 Benchmark]: Witness Printer took 6.40ms. Allocated memory is still 222.3MB. Free memory is still 167.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-18 23:00:29,884 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.15ms. Allocated memory is still 127.9MB. Free memory is still 92.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 235.83ms. Allocated memory is still 222.3MB. Free memory was 153.1MB in the beginning and 139.7MB in the end (delta: 13.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 29.14ms. Allocated memory is still 222.3MB. Free memory was 139.0MB in the beginning and 137.6MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 31.62ms. Allocated memory is still 222.3MB. Free memory was 136.9MB in the beginning and 134.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 347.45ms. Allocated memory is still 222.3MB. Free memory was 134.8MB in the beginning and 118.7MB in the end (delta: 16.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 1015.12ms. Allocated memory is still 222.3MB. Free memory was 118.1MB in the beginning and 167.5MB in the end (delta: -49.5MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 6.40ms. Allocated memory is still 222.3MB. Free memory is still 167.5MB. 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] COND TRUE 1 [L87] FCALL updateLastVariables() [L88] 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=-256, 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=-256, 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=-256, 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=-256, 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=-256, 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=-256, 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=-256, 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=-256, 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=-256, 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=-256, 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=-256, 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=-256, 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=-256, 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=-256, 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=-256, 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=-256, 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=-256, 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=-256, 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=-256, 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=-256, 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=-256, 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=-256, 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=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=126, var_1_11=0, var_1_12=-256, 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=4] [L75] RET assume_abort_if_not(var_1_20 <= 4294967294) VAL [isInitial=1, var_1_10=126, var_1_11=0, var_1_12=-256, 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=4] [L88] RET updateVariables() [L89] 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=-256, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=-16, var_1_17=133, var_1_18=133, var_1_19=4, var_1_1=-8, var_1_20=4] [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=-256, var_1_12=-256, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=-16, var_1_17=133, var_1_18=133, var_1_19=4, var_1_1=-8, var_1_20=4] [L43] var_1_16 = var_1_19 VAL [isInitial=1, var_1_10=126, var_1_11=-256, var_1_12=-256, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=4, var_1_17=133, var_1_18=133, var_1_19=4, var_1_1=-8, var_1_20=4] [L44] EXPR var_1_16 | var_1_19 VAL [isInitial=1, var_1_10=126, var_1_11=-256, var_1_12=-256, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=4, var_1_17=133, var_1_18=133, var_1_19=4, var_1_1=-8, var_1_20=4] [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=-256, var_1_12=-256, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=4, var_1_17=133, var_1_18=133, var_1_19=4, var_1_1=126, var_1_20=4] [L89] RET step() [L90] CALL, EXPR property() [L80] EXPR var_1_16 | var_1_19 VAL [isInitial=1, var_1_10=126, var_1_11=-256, var_1_12=-256, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=4, var_1_17=133, var_1_18=133, var_1_19=4, var_1_1=126, var_1_20=4] [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)) ; [L90] RET, EXPR property() [L90] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=126, var_1_11=-256, var_1_12=-256, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=4, var_1_17=133, var_1_18=133, var_1_19=4, var_1_1=126, var_1_20=4] [L19] reach_error() VAL [isInitial=1, var_1_10=126, var_1_11=-256, var_1_12=-256, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=4, var_1_17=133, var_1_18=133, var_1_19=4, var_1_1=126, var_1_20=4] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 48 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.9s, 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, 62 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, 62 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=48occurred 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.1s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 228 NumberOfCodeBlocks, 228 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 150 ConstructedInterpolants, 0 QuantifiedInterpolants, 150 SizeOfPredicates, 0 NumberOfNonLiveVariables, 191 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 23:00:29,909 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-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 bc4858d1901c3c90630688f631857e35419d28ea39c5c3a06b704467149a98bd --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-18 23:00:31,861 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-18 23:00:31,923 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-18 23:00:31,928 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-18 23:00:31,929 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-18 23:00:31,957 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-18 23:00:31,958 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-18 23:00:31,958 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-18 23:00:31,958 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-18 23:00:31,959 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-18 23:00:31,959 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-18 23:00:31,959 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-18 23:00:31,959 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-18 23:00:31,960 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-18 23:00:31,960 INFO L153 SettingsManager]: * Use SBE=true [2024-11-18 23:00:31,962 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-18 23:00:31,963 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-18 23:00:31,963 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-18 23:00:31,963 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-18 23:00:31,965 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-18 23:00:31,965 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-18 23:00:31,966 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-18 23:00:31,967 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-18 23:00:31,967 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-18 23:00:31,967 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-18 23:00:31,967 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-18 23:00:31,968 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-18 23:00:31,968 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-18 23:00:31,968 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-18 23:00:31,969 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-18 23:00:31,969 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-18 23:00:31,970 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-18 23:00:31,971 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-18 23:00:31,971 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-18 23:00:31,971 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 23:00:31,971 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-18 23:00:31,971 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-18 23:00:31,971 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-18 23:00:31,972 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-18 23:00:31,972 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-18 23:00:31,972 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-18 23:00:31,973 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-18 23:00:31,973 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-18 23:00:31,973 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-18 23:00:31,973 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 -> bc4858d1901c3c90630688f631857e35419d28ea39c5c3a06b704467149a98bd [2024-11-18 23:00:32,247 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-18 23:00:32,274 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-18 23:00:32,277 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-18 23:00:32,278 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-18 23:00:32,278 INFO L274 PluginConnector]: CDTParser initialized [2024-11-18 23:00:32,279 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-88.i [2024-11-18 23:00:33,689 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-18 23:00:33,883 INFO L384 CDTParser]: Found 1 translation units. [2024-11-18 23:00:33,885 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-88.i [2024-11-18 23:00:33,894 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/723c5aa93/a6e08626e2704e38a96533a72f38f16a/FLAG50a64a9af [2024-11-18 23:00:34,260 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/723c5aa93/a6e08626e2704e38a96533a72f38f16a [2024-11-18 23:00:34,263 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-18 23:00:34,264 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-18 23:00:34,266 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-18 23:00:34,266 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-18 23:00:34,273 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-18 23:00:34,274 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 11:00:34" (1/1) ... [2024-11-18 23:00:34,274 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b701ece and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:00:34, skipping insertion in model container [2024-11-18 23:00:34,274 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 11:00:34" (1/1) ... [2024-11-18 23:00:34,297 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-18 23:00:34,426 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-88.i[915,928] [2024-11-18 23:00:34,458 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 23:00:34,473 INFO L200 MainTranslator]: Completed pre-run [2024-11-18 23:00:34,486 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-88.i[915,928] [2024-11-18 23:00:34,503 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 23:00:34,520 INFO L204 MainTranslator]: Completed translation [2024-11-18 23:00:34,521 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:00:34 WrapperNode [2024-11-18 23:00:34,521 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-18 23:00:34,522 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-18 23:00:34,523 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-18 23:00:34,523 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-18 23:00:34,529 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:00:34" (1/1) ... [2024-11-18 23:00:34,539 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:00:34" (1/1) ... [2024-11-18 23:00:34,555 INFO L138 Inliner]: procedures = 27, calls = 24, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 88 [2024-11-18 23:00:34,556 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-18 23:00:34,556 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-18 23:00:34,557 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-18 23:00:34,557 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-18 23:00:34,565 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:00:34" (1/1) ... [2024-11-18 23:00:34,565 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:00:34" (1/1) ... [2024-11-18 23:00:34,568 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:00:34" (1/1) ... [2024-11-18 23:00:34,578 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 23:00:34,579 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:00:34" (1/1) ... [2024-11-18 23:00:34,579 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:00:34" (1/1) ... [2024-11-18 23:00:34,585 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:00:34" (1/1) ... [2024-11-18 23:00:34,588 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:00:34" (1/1) ... [2024-11-18 23:00:34,590 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:00:34" (1/1) ... [2024-11-18 23:00:34,591 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:00:34" (1/1) ... [2024-11-18 23:00:34,593 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-18 23:00:34,594 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-18 23:00:34,594 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-18 23:00:34,594 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-18 23:00:34,594 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:00:34" (1/1) ... [2024-11-18 23:00:34,603 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 23:00:34,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 23:00:34,650 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 23:00:34,662 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 23:00:34,701 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-18 23:00:34,701 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-18 23:00:34,701 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-18 23:00:34,701 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-18 23:00:34,701 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-18 23:00:34,702 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-18 23:00:34,765 INFO L238 CfgBuilder]: Building ICFG [2024-11-18 23:00:34,767 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-18 23:00:35,107 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-18 23:00:35,108 INFO L287 CfgBuilder]: Performing block encoding [2024-11-18 23:00:35,123 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-18 23:00:35,124 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-18 23:00:35,124 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 11:00:35 BoogieIcfgContainer [2024-11-18 23:00:35,124 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-18 23:00:35,126 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-18 23:00:35,127 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-18 23:00:35,130 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-18 23:00:35,130 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 11:00:34" (1/3) ... [2024-11-18 23:00:35,131 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a2993f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 11:00:35, skipping insertion in model container [2024-11-18 23:00:35,137 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:00:34" (2/3) ... [2024-11-18 23:00:35,138 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a2993f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 11:00:35, skipping insertion in model container [2024-11-18 23:00:35,138 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 11:00:35" (3/3) ... [2024-11-18 23:00:35,139 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-88.i [2024-11-18 23:00:35,157 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-18 23:00:35,157 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-18 23:00:35,218 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-18 23:00:35,224 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;@6485a859, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-18 23:00:35,226 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-18 23:00:35,229 INFO L276 IsEmpty]: Start isEmpty. Operand has 41 states, 27 states have (on average 1.3333333333333333) internal successors, (36), 28 states have internal predecessors, (36), 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 23:00:35,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-18 23:00:35,238 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 23:00:35,239 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 23:00:35,239 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 23:00:35,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 23:00:35,245 INFO L85 PathProgramCache]: Analyzing trace with hash -2064427227, now seen corresponding path program 1 times [2024-11-18 23:00:35,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 23:00:35,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1711636803] [2024-11-18 23:00:35,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 23:00:35,259 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 23:00:35,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 23:00:35,265 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 23:00:35,267 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 23:00:35,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 23:00:35,414 INFO L255 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-18 23:00:35,422 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 23:00:35,471 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 23:00:35,471 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 23:00:35,472 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-18 23:00:35,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1711636803] [2024-11-18 23:00:35,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1711636803] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 23:00:35,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 23:00:35,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-18 23:00:35,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566888558] [2024-11-18 23:00:35,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 23:00:35,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-18 23:00:35,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-18 23:00:35,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-18 23:00:35,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-18 23:00:35,500 INFO L87 Difference]: Start difference. First operand has 41 states, 27 states have (on average 1.3333333333333333) internal successors, (36), 28 states have internal predecessors, (36), 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 23:00:35,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 23:00:35,521 INFO L93 Difference]: Finished difference Result 75 states and 121 transitions. [2024-11-18 23:00:35,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-18 23:00:35,524 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 23:00:35,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 23:00:35,529 INFO L225 Difference]: With dead ends: 75 [2024-11-18 23:00:35,529 INFO L226 Difference]: Without dead ends: 37 [2024-11-18 23:00:35,532 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 23:00:35,536 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 23:00:35,538 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 23:00:35,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-11-18 23:00:35,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2024-11-18 23:00:35,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 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 23:00:35,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 50 transitions. [2024-11-18 23:00:35,574 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 50 transitions. Word has length 73 [2024-11-18 23:00:35,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 23:00:35,575 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 50 transitions. [2024-11-18 23:00:35,575 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 23:00:35,576 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 50 transitions. [2024-11-18 23:00:35,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-18 23:00:35,579 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 23:00:35,579 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 23:00:35,588 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-18 23:00:35,779 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 23:00:35,780 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 23:00:35,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 23:00:35,781 INFO L85 PathProgramCache]: Analyzing trace with hash -211911261, now seen corresponding path program 1 times [2024-11-18 23:00:35,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 23:00:35,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [808023383] [2024-11-18 23:00:35,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 23:00:35,781 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 23:00:35,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 23:00:35,785 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 23:00:35,798 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 23:00:35,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 23:00:35,927 INFO L255 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-18 23:00:35,936 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 23:00:37,893 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 23:00:37,893 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 23:00:42,349 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 23:00:42,350 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-18 23:00:42,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [808023383] [2024-11-18 23:00:42,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [808023383] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-18 23:00:42,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-18 23:00:42,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [11] total 17 [2024-11-18 23:00:42,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377235606] [2024-11-18 23:00:42,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 23:00:42,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-18 23:00:42,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-18 23:00:42,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-18 23:00:42,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2024-11-18 23:00:42,353 INFO L87 Difference]: Start difference. First operand 37 states and 50 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 23:00:44,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 23:00:44,190 INFO L93 Difference]: Finished difference Result 90 states and 118 transitions. [2024-11-18 23:00:44,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-18 23:00:44,191 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 23:00:44,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 23:00:44,192 INFO L225 Difference]: With dead ends: 90 [2024-11-18 23:00:44,192 INFO L226 Difference]: Without dead ends: 56 [2024-11-18 23:00:44,193 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=73, Invalid=269, Unknown=0, NotChecked=0, Total=342 [2024-11-18 23:00:44,194 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 51 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-18 23:00:44,194 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 177 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-18 23:00:44,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-11-18 23:00:44,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 55. [2024-11-18 23:00:44,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 38 states have (on average 1.105263157894737) internal successors, (42), 39 states have internal predecessors, (42), 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 23:00:44,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 68 transitions. [2024-11-18 23:00:44,203 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 68 transitions. Word has length 73 [2024-11-18 23:00:44,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 23:00:44,203 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 68 transitions. [2024-11-18 23:00:44,204 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 23:00:44,204 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 68 transitions. [2024-11-18 23:00:44,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-18 23:00:44,205 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 23:00:44,205 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 23:00:44,211 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 (3)] Forceful destruction successful, exit code 0 [2024-11-18 23:00:44,409 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 23:00:44,410 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 23:00:44,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 23:00:44,410 INFO L85 PathProgramCache]: Analyzing trace with hash 1563096101, now seen corresponding path program 1 times [2024-11-18 23:00:44,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 23:00:44,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1861475151] [2024-11-18 23:00:44,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 23:00:44,411 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 23:00:44,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 23:00:44,414 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 23:00:44,415 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 23:00:44,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 23:00:44,496 INFO L255 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-18 23:00:44,503 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 23:00:45,952 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 23:00:45,953 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 23:00:51,226 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-18 23:00:51,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1861475151] [2024-11-18 23:00:51,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1861475151] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 23:00:51,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1544019218] [2024-11-18 23:00:51,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 23:00:51,240 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-18 23:00:51,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-18 23:00:51,246 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 23:00:51,251 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 23:00:51,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 23:00:51,497 INFO L255 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-18 23:00:51,501 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 23:00:56,592 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 23:00:56,592 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 23:01:04,234 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 23:01:04,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1544019218] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-18 23:01:04,235 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-18 23:01:04,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 23, 11] total 42 [2024-11-18 23:01:04,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147108008] [2024-11-18 23:01:04,235 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-18 23:01:04,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2024-11-18 23:01:04,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-18 23:01:04,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2024-11-18 23:01:04,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=331, Invalid=1831, Unknown=0, NotChecked=0, Total=2162 [2024-11-18 23:01:04,238 INFO L87 Difference]: Start difference. First operand 55 states and 68 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 23:01:16,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 23:01:16,177 INFO L93 Difference]: Finished difference Result 181 states and 204 transitions. [2024-11-18 23:01:16,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2024-11-18 23:01:16,178 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 23:01:16,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 23:01:16,180 INFO L225 Difference]: With dead ends: 181 [2024-11-18 23:01:16,180 INFO L226 Difference]: Without dead ends: 0 [2024-11-18 23:01:16,187 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 197 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3077 ImplicationChecksByTransitivity, 19.7s TimeCoverageRelationStatistics Valid=1951, Invalid=8761, Unknown=0, NotChecked=0, Total=10712 [2024-11-18 23:01:16,188 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 139 mSDsluCounter, 449 mSDsCounter, 0 mSdLazyCounter, 858 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 509 SdHoareTripleChecker+Invalid, 956 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 858 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2024-11-18 23:01:16,192 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 509 Invalid, 956 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 858 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2024-11-18 23:01:16,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-18 23:01:16,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-18 23:01:16,193 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 23:01:16,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-18 23:01:16,193 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 73 [2024-11-18 23:01:16,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 23:01:16,193 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-18 23:01:16,193 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 23:01:16,194 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-18 23:01:16,194 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-18 23:01:16,201 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-18 23:01:16,211 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 23:01:16,407 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 23:01:16,602 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 23:01:16,605 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-18 23:01:16,607 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-18 23:01:29,427 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-18 23:01:29,442 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-11-18 23:01:29,443 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-11-18 23:01:29,443 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-11-18 23:01:29,443 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-11-18 23:01:29,443 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Missing case for function ~fp.eq~32 [2024-11-18 23:01:29,444 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Missing case for function ~fp.eq~32 [2024-11-18 23:01:29,445 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-11-18 23:01:29,445 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-11-18 23:01:29,445 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2024-11-18 23:01:29,459 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Missing case for function ~fp.eq~32 [2024-11-18 23:01:29,459 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Missing case for function ~fp.eq~32 [2024-11-18 23:01:29,459 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Missing case for function ~fp.eq~32 [2024-11-18 23:01:29,460 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-11-18 23:01:29,460 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-11-18 23:01:29,460 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2024-11-18 23:01:29,460 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Missing case for function ~fp.eq~32 [2024-11-18 23:01:29,460 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-11-18 23:01:29,460 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2024-11-18 23:01:29,460 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-11-18 23:01:29,460 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2024-11-18 23:01:29,461 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Missing case for function ~fp.eq~32 [2024-11-18 23:01:29,461 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Missing case for function ~fp.eq~32 [2024-11-18 23:01:29,461 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Missing case for function ~fp.eq~32 [2024-11-18 23:01:29,461 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-11-18 23:01:29,461 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-11-18 23:01:29,461 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2024-11-18 23:01:29,461 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Missing case for function ~fp.eq~32 [2024-11-18 23:01:29,462 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-11-18 23:01:29,462 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2024-11-18 23:01:29,462 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-11-18 23:01:29,462 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2024-11-18 23:01:29,465 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 11:01:29 BoogieIcfgContainer [2024-11-18 23:01:29,465 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-18 23:01:29,465 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-18 23:01:29,465 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-18 23:01:29,465 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-18 23:01:29,466 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 11:00:35" (3/4) ... [2024-11-18 23:01:29,467 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-18 23:01:29,470 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-11-18 23:01:29,473 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2024-11-18 23:01:29,473 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-18 23:01:29,473 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-18 23:01:29,474 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-18 23:01:29,536 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-18 23:01:29,536 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-18 23:01:29,537 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-18 23:01:29,537 INFO L158 Benchmark]: Toolchain (without parser) took 55273.39ms. Allocated memory was 67.1MB in the beginning and 163.6MB in the end (delta: 96.5MB). Free memory was 47.0MB in the beginning and 66.6MB in the end (delta: -19.6MB). Peak memory consumption was 77.3MB. Max. memory is 16.1GB. [2024-11-18 23:01:29,537 INFO L158 Benchmark]: CDTParser took 1.27ms. Allocated memory is still 67.1MB. Free memory was 43.5MB in the beginning and 43.4MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-18 23:01:29,538 INFO L158 Benchmark]: CACSL2BoogieTranslator took 255.79ms. Allocated memory is still 67.1MB. Free memory was 46.8MB in the beginning and 32.7MB in the end (delta: 14.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-18 23:01:29,538 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.54ms. Allocated memory is still 67.1MB. Free memory was 32.7MB in the beginning and 30.7MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-18 23:01:29,538 INFO L158 Benchmark]: Boogie Preprocessor took 36.51ms. Allocated memory is still 67.1MB. Free memory was 30.7MB in the beginning and 28.4MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-18 23:01:29,538 INFO L158 Benchmark]: RCFGBuilder took 530.68ms. Allocated memory was 67.1MB in the beginning and 94.4MB in the end (delta: 27.3MB). Free memory was 28.2MB in the beginning and 61.3MB in the end (delta: -33.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-18 23:01:29,539 INFO L158 Benchmark]: TraceAbstraction took 54338.44ms. Allocated memory was 94.4MB in the beginning and 163.6MB in the end (delta: 69.2MB). Free memory was 61.0MB in the beginning and 71.9MB in the end (delta: -10.9MB). Peak memory consumption was 84.7MB. Max. memory is 16.1GB. [2024-11-18 23:01:29,539 INFO L158 Benchmark]: Witness Printer took 71.54ms. Allocated memory is still 163.6MB. Free memory was 71.9MB in the beginning and 66.6MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-18 23:01:29,540 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.27ms. Allocated memory is still 67.1MB. Free memory was 43.5MB in the beginning and 43.4MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 255.79ms. Allocated memory is still 67.1MB. Free memory was 46.8MB in the beginning and 32.7MB in the end (delta: 14.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.54ms. Allocated memory is still 67.1MB. Free memory was 32.7MB in the beginning and 30.7MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 36.51ms. Allocated memory is still 67.1MB. Free memory was 30.7MB in the beginning and 28.4MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 530.68ms. Allocated memory was 67.1MB in the beginning and 94.4MB in the end (delta: 27.3MB). Free memory was 28.2MB in the beginning and 61.3MB in the end (delta: -33.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * TraceAbstraction took 54338.44ms. Allocated memory was 94.4MB in the beginning and 163.6MB in the end (delta: 69.2MB). Free memory was 61.0MB in the beginning and 71.9MB in the end (delta: -10.9MB). Peak memory consumption was 84.7MB. Max. memory is 16.1GB. * Witness Printer took 71.54ms. Allocated memory is still 163.6MB. Free memory was 71.9MB in the beginning and 66.6MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. 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, 41 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 41.4s, OverallIterations: 3, TraceHistogramMax: 11, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 13.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 193 SdHoareTripleChecker+Valid, 4.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 190 mSDsluCounter, 736 SdHoareTripleChecker+Invalid, 4.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 577 mSDsCounter, 104 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 943 IncrementalHoareTripleChecker+Invalid, 1047 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 104 mSolverCounterUnsat, 159 mSDtfsCounter, 943 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, 22.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=55occurred 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.4s SatisfiabilityAnalysisTime, 26.0s 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: 86]: 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 23:01:29,675 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE