./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-48.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-48.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 319f011cae72478203405f42ef6464e03fdd2e10cc0b39ba03a47237381f0057 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 04:49:34,028 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 04:49:34,102 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-12 04:49:34,107 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 04:49:34,108 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 04:49:34,140 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 04:49:34,141 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 04:49:34,141 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 04:49:34,141 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 04:49:34,142 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 04:49:34,143 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 04:49:34,143 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 04:49:34,145 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 04:49:34,150 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 04:49:34,150 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 04:49:34,151 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 04:49:34,151 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 04:49:34,151 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 04:49:34,151 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 04:49:34,152 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 04:49:34,152 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 04:49:34,153 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 04:49:34,154 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 04:49:34,154 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 04:49:34,154 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 04:49:34,154 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 04:49:34,155 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 04:49:34,155 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 04:49:34,155 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 04:49:34,156 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 04:49:34,156 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 04:49:34,157 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 04:49:34,157 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 04:49:34,157 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 04:49:34,158 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 04:49:34,158 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 04:49:34,158 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 04:49:34,159 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 04:49:34,159 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 04:49:34,159 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 04:49:34,159 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 04:49:34,160 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 04:49:34,160 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 -> 319f011cae72478203405f42ef6464e03fdd2e10cc0b39ba03a47237381f0057 [2024-11-12 04:49:34,418 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 04:49:34,446 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 04:49:34,449 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 04:49:34,450 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 04:49:34,451 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 04:49:34,452 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-48.i [2024-11-12 04:49:36,000 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 04:49:36,206 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 04:49:36,207 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-48.i [2024-11-12 04:49:36,217 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/124ed745e/5f865d2b650e493b99d4a55610a6d7ad/FLAGf72da6851 [2024-11-12 04:49:36,235 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/124ed745e/5f865d2b650e493b99d4a55610a6d7ad [2024-11-12 04:49:36,237 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 04:49:36,238 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 04:49:36,239 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 04:49:36,239 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 04:49:36,244 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 04:49:36,244 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 04:49:36" (1/1) ... [2024-11-12 04:49:36,245 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18c16d7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:49:36, skipping insertion in model container [2024-11-12 04:49:36,245 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 04:49:36" (1/1) ... [2024-11-12 04:49:36,273 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 04:49:36,470 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_floatingpointinfluence_no-floats_file-48.i[916,929] [2024-11-12 04:49:36,542 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 04:49:36,559 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 04:49:36,589 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_floatingpointinfluence_no-floats_file-48.i[916,929] [2024-11-12 04:49:36,613 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 04:49:36,632 INFO L204 MainTranslator]: Completed translation [2024-11-12 04:49:36,632 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:49:36 WrapperNode [2024-11-12 04:49:36,632 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 04:49:36,633 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 04:49:36,633 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 04:49:36,633 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 04:49:36,638 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:49:36" (1/1) ... [2024-11-12 04:49:36,648 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:49:36" (1/1) ... [2024-11-12 04:49:36,686 INFO L138 Inliner]: procedures = 26, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 141 [2024-11-12 04:49:36,687 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 04:49:36,691 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 04:49:36,691 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 04:49:36,691 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 04:49:36,703 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:49:36" (1/1) ... [2024-11-12 04:49:36,703 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:49:36" (1/1) ... [2024-11-12 04:49:36,706 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:49:36" (1/1) ... [2024-11-12 04:49:36,719 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-12 04:49:36,719 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:49:36" (1/1) ... [2024-11-12 04:49:36,720 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:49:36" (1/1) ... [2024-11-12 04:49:36,730 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:49:36" (1/1) ... [2024-11-12 04:49:36,734 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:49:36" (1/1) ... [2024-11-12 04:49:36,735 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:49:36" (1/1) ... [2024-11-12 04:49:36,737 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:49:36" (1/1) ... [2024-11-12 04:49:36,743 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 04:49:36,744 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 04:49:36,744 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 04:49:36,745 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 04:49:36,746 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:49:36" (1/1) ... [2024-11-12 04:49:36,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 04:49:36,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 04:49:36,780 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-12 04:49:36,783 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-12 04:49:36,830 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 04:49:36,831 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 04:49:36,832 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 04:49:36,832 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 04:49:36,832 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 04:49:36,832 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 04:49:36,919 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 04:49:36,925 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 04:49:37,232 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-12 04:49:37,234 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 04:49:37,252 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 04:49:37,254 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 04:49:37,254 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 04:49:37 BoogieIcfgContainer [2024-11-12 04:49:37,254 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 04:49:37,257 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 04:49:37,258 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 04:49:37,262 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 04:49:37,262 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 04:49:36" (1/3) ... [2024-11-12 04:49:37,264 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5eaf9f6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 04:49:37, skipping insertion in model container [2024-11-12 04:49:37,264 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:49:36" (2/3) ... [2024-11-12 04:49:37,265 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5eaf9f6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 04:49:37, skipping insertion in model container [2024-11-12 04:49:37,265 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 04:49:37" (3/3) ... [2024-11-12 04:49:37,266 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-48.i [2024-11-12 04:49:37,284 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 04:49:37,284 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 04:49:37,360 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 04:49:37,366 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;@40efaf4b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 04:49:37,368 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 04:49:37,374 INFO L276 IsEmpty]: Start isEmpty. Operand has 64 states, 35 states have (on average 1.2857142857142858) internal successors, (45), 36 states have internal predecessors, (45), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-12 04:49:37,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-12 04:49:37,391 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:49:37,392 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 04:49:37,393 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:49:37,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:49:37,401 INFO L85 PathProgramCache]: Analyzing trace with hash -403830734, now seen corresponding path program 1 times [2024-11-12 04:49:37,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 04:49:37,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533498874] [2024-11-12 04:49:37,411 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:49:37,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 04:49:37,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:49:38,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 04:49:38,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:49:38,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 04:49:38,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:49:38,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 04:49:38,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:49:38,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 04:49:38,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:49:38,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 04:49:38,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:49:38,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 04:49:38,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:49:38,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 04:49:38,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:49:38,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 04:49:38,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:49:38,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 04:49:38,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:49:38,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 04:49:38,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:49:38,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 04:49:38,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:49:38,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 04:49:38,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:49:38,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 04:49:38,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:49:38,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 04:49:38,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:49:38,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 04:49:38,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:49:38,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 04:49:38,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:49:38,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 04:49:38,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:49:38,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 04:49:38,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:49:38,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 04:49:38,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:49:38,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-12 04:49:38,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:49:38,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-12 04:49:38,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:49:38,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-12 04:49:38,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:49:38,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-12 04:49:38,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:49:38,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-12 04:49:38,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:49:38,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-12 04:49:38,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:49:38,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-12 04:49:38,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:49:38,358 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-12 04:49:38,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 04:49:38,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533498874] [2024-11-12 04:49:38,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533498874] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 04:49:38,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 04:49:38,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 04:49:38,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133601935] [2024-11-12 04:49:38,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 04:49:38,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 04:49:38,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 04:49:38,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 04:49:38,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 04:49:38,403 INFO L87 Difference]: Start difference. First operand has 64 states, 35 states have (on average 1.2857142857142858) internal successors, (45), 36 states have internal predecessors, (45), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-12 04:49:38,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 04:49:38,465 INFO L93 Difference]: Finished difference Result 121 states and 214 transitions. [2024-11-12 04:49:38,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 04:49:38,469 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 156 [2024-11-12 04:49:38,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 04:49:38,479 INFO L225 Difference]: With dead ends: 121 [2024-11-12 04:49:38,481 INFO L226 Difference]: Without dead ends: 60 [2024-11-12 04:49:38,486 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 04:49:38,490 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 0 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 04:49:38,494 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 168 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 04:49:38,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2024-11-12 04:49:38,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2024-11-12 04:49:38,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 32 states have (on average 1.125) internal successors, (36), 32 states have internal predecessors, (36), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-12 04:49:38,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 88 transitions. [2024-11-12 04:49:38,556 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 88 transitions. Word has length 156 [2024-11-12 04:49:38,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 04:49:38,560 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 88 transitions. [2024-11-12 04:49:38,560 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-12 04:49:38,561 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 88 transitions. [2024-11-12 04:49:38,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-12 04:49:38,565 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:49:38,565 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 04:49:38,566 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 04:49:38,566 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:49:38,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:49:38,567 INFO L85 PathProgramCache]: Analyzing trace with hash -346572432, now seen corresponding path program 1 times [2024-11-12 04:49:38,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 04:49:38,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318328337] [2024-11-12 04:49:38,568 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:49:38,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 04:49:38,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:49:55,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 04:49:55,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:49:55,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 04:49:55,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:49:55,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 04:49:55,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:49:55,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 04:49:55,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:49:55,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 04:49:55,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:49:55,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 04:49:55,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:49:55,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 04:49:55,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:49:55,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 04:49:55,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:49:55,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 04:49:55,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:49:55,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 04:49:55,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:49:55,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 04:49:55,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:49:55,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 04:49:55,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:49:55,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 04:49:55,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:49:55,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 04:49:55,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:49:55,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 04:49:55,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:49:55,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 04:49:55,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:49:55,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 04:49:55,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:49:55,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 04:49:55,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:49:55,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 04:49:55,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:49:55,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-12 04:49:55,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:49:55,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-12 04:49:55,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:49:55,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-12 04:49:55,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:49:55,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-12 04:49:55,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:49:55,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-12 04:49:55,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:49:55,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-12 04:49:55,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:49:55,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-12 04:49:55,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:49:55,961 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-12 04:49:55,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 04:49:55,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318328337] [2024-11-12 04:49:55,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318328337] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 04:49:55,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 04:49:55,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-12 04:49:55,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55102393] [2024-11-12 04:49:55,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 04:49:55,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-12 04:49:55,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 04:49:55,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-12 04:49:55,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-12 04:49:55,966 INFO L87 Difference]: Start difference. First operand 60 states and 88 transitions. Second operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-12 04:49:56,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 04:49:56,591 INFO L93 Difference]: Finished difference Result 102 states and 144 transitions. [2024-11-12 04:49:56,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-12 04:49:56,592 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 156 [2024-11-12 04:49:56,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 04:49:56,595 INFO L225 Difference]: With dead ends: 102 [2024-11-12 04:49:56,595 INFO L226 Difference]: Without dead ends: 100 [2024-11-12 04:49:56,595 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2024-11-12 04:49:56,597 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 58 mSDsluCounter, 463 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 568 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-12 04:49:56,597 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 568 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-12 04:49:56,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-11-12 04:49:56,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 80. [2024-11-12 04:49:56,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 43 states have (on average 1.0930232558139534) internal successors, (47), 44 states have internal predecessors, (47), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-12 04:49:56,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 115 transitions. [2024-11-12 04:49:56,630 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 115 transitions. Word has length 156 [2024-11-12 04:49:56,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 04:49:56,631 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 115 transitions. [2024-11-12 04:49:56,632 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-12 04:49:56,632 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 115 transitions. [2024-11-12 04:49:56,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-12 04:49:56,634 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:49:56,635 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 04:49:56,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 04:49:56,635 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:49:56,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:49:56,636 INFO L85 PathProgramCache]: Analyzing trace with hash 1907443250, now seen corresponding path program 1 times [2024-11-12 04:49:56,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 04:49:56,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788372467] [2024-11-12 04:49:56,637 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:49:56,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 04:49:56,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:50:05,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 04:50:05,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:50:05,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 04:50:05,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:50:05,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 04:50:05,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:50:05,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 04:50:05,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:50:05,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 04:50:05,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:50:05,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 04:50:05,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:50:05,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 04:50:05,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:50:05,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 04:50:05,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:50:05,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 04:50:05,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:50:05,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 04:50:05,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:50:05,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 04:50:05,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:50:05,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 04:50:05,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:50:05,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 04:50:05,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:50:05,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 04:50:05,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:50:05,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 04:50:05,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:50:05,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 04:50:05,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:50:05,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 04:50:05,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:50:05,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 04:50:05,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:50:05,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 04:50:05,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:50:05,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-12 04:50:05,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:50:05,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-12 04:50:05,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:50:05,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-12 04:50:05,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:50:05,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-12 04:50:05,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:50:05,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-12 04:50:05,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:50:05,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-12 04:50:05,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:50:05,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-12 04:50:05,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:50:05,865 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-12 04:50:05,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 04:50:05,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788372467] [2024-11-12 04:50:05,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [788372467] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 04:50:05,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 04:50:05,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-12 04:50:05,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364826857] [2024-11-12 04:50:05,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 04:50:05,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-12 04:50:05,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 04:50:05,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-12 04:50:05,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-12 04:50:05,868 INFO L87 Difference]: Start difference. First operand 80 states and 115 transitions. Second operand has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-12 04:50:06,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 04:50:06,449 INFO L93 Difference]: Finished difference Result 100 states and 142 transitions. [2024-11-12 04:50:06,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-12 04:50:06,450 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 157 [2024-11-12 04:50:06,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 04:50:06,451 INFO L225 Difference]: With dead ends: 100 [2024-11-12 04:50:06,451 INFO L226 Difference]: Without dead ends: 0 [2024-11-12 04:50:06,452 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2024-11-12 04:50:06,453 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 64 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 460 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 04:50:06,454 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 460 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 04:50:06,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-12 04:50:06,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-12 04:50:06,455 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-12 04:50:06,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-12 04:50:06,455 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 157 [2024-11-12 04:50:06,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 04:50:06,456 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-12 04:50:06,456 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-12 04:50:06,456 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-12 04:50:06,456 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-12 04:50:06,460 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-12 04:50:06,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-12 04:50:06,467 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-12 04:50:06,470 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-12 04:50:06,752 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-12 04:50:06,781 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 04:50:06 BoogieIcfgContainer [2024-11-12 04:50:06,781 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-12 04:50:06,782 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 04:50:06,782 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 04:50:06,782 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 04:50:06,783 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 04:49:37" (3/4) ... [2024-11-12 04:50:06,785 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-12 04:50:06,790 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-11-12 04:50:06,796 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2024-11-12 04:50:06,797 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-12 04:50:06,797 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-12 04:50:06,797 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-12 04:50:06,896 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-12 04:50:06,896 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-12 04:50:06,896 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 04:50:06,897 INFO L158 Benchmark]: Toolchain (without parser) took 30658.68ms. Allocated memory was 161.5MB in the beginning and 1.1GB in the end (delta: 906.0MB). Free memory was 94.7MB in the beginning and 925.6MB in the end (delta: -830.9MB). Peak memory consumption was 76.0MB. Max. memory is 16.1GB. [2024-11-12 04:50:06,897 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 102.8MB. Free memory is still 64.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 04:50:06,898 INFO L158 Benchmark]: CACSL2BoogieTranslator took 393.27ms. Allocated memory is still 161.5MB. Free memory was 94.5MB in the beginning and 132.7MB in the end (delta: -38.2MB). Peak memory consumption was 15.5MB. Max. memory is 16.1GB. [2024-11-12 04:50:06,898 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.05ms. Allocated memory is still 161.5MB. Free memory was 132.7MB in the beginning and 129.2MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-12 04:50:06,898 INFO L158 Benchmark]: Boogie Preprocessor took 52.53ms. Allocated memory is still 161.5MB. Free memory was 129.2MB in the beginning and 124.9MB in the end (delta: 4.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 04:50:06,898 INFO L158 Benchmark]: RCFGBuilder took 510.44ms. Allocated memory is still 161.5MB. Free memory was 124.9MB in the beginning and 106.1MB in the end (delta: 18.8MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-11-12 04:50:06,899 INFO L158 Benchmark]: TraceAbstraction took 29524.60ms. Allocated memory was 161.5MB in the beginning and 1.1GB in the end (delta: 906.0MB). Free memory was 105.5MB in the beginning and 931.9MB in the end (delta: -826.4MB). Peak memory consumption was 618.4MB. Max. memory is 16.1GB. [2024-11-12 04:50:06,899 INFO L158 Benchmark]: Witness Printer took 114.44ms. Allocated memory is still 1.1GB. Free memory was 931.9MB in the beginning and 925.6MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-12 04:50:06,900 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.18ms. Allocated memory is still 102.8MB. Free memory is still 64.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 393.27ms. Allocated memory is still 161.5MB. Free memory was 94.5MB in the beginning and 132.7MB in the end (delta: -38.2MB). Peak memory consumption was 15.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 57.05ms. Allocated memory is still 161.5MB. Free memory was 132.7MB in the beginning and 129.2MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 52.53ms. Allocated memory is still 161.5MB. Free memory was 129.2MB in the beginning and 124.9MB in the end (delta: 4.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 510.44ms. Allocated memory is still 161.5MB. Free memory was 124.9MB in the beginning and 106.1MB in the end (delta: 18.8MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 29524.60ms. Allocated memory was 161.5MB in the beginning and 1.1GB in the end (delta: 906.0MB). Free memory was 105.5MB in the beginning and 931.9MB in the end (delta: -826.4MB). Peak memory consumption was 618.4MB. Max. memory is 16.1GB. * Witness Printer took 114.44ms. Allocated memory is still 1.1GB. Free memory was 931.9MB in the beginning and 925.6MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. 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 - 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, 64 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 29.1s, OverallIterations: 3, TraceHistogramMax: 26, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 122 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 122 mSDsluCounter, 1196 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 876 mSDsCounter, 149 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 198 IncrementalHoareTripleChecker+Invalid, 347 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 149 mSolverCounterUnsat, 320 mSDtfsCounter, 198 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 201 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=80occurred in iteration=2, InterpolantAutomatonStates: 23, 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, 3 MinimizatonAttempts, 20 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 27.1s InterpolantComputationTime, 469 NumberOfCodeBlocks, 469 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 466 ConstructedInterpolants, 0 QuantifiedInterpolants, 964 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 3900/3900 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: 122]: Loop Invariant Derived loop invariant: 1 - ProcedureContractResult [Line: 20]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Ensures: (((((((((((((((((((((isInitial == \old(isInitial)) && (var_1_1 == \old(var_1_1))) && (var_1_2 == \old(var_1_2))) && (var_1_3 == \old(var_1_3))) && (var_1_4 == \old(var_1_4))) && (var_1_5 == \old(var_1_5))) && (var_1_6 == \old(var_1_6))) && (var_1_7 == \old(var_1_7))) && (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))) && (var_1_21 == \old(var_1_21))) && (var_1_22 == \old(var_1_22))) && (last_1_var_1_7 == \old(last_1_var_1_7))) RESULT: Ultimate proved your program to be correct! [2024-11-12 04:50:06,959 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE