./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-27.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-27.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 47e63b013ba5a4bad17f0c24c4a898ba0d6a9a1edaa8e8eb07c4e72f0000c552 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 09:25:03,091 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 09:25:03,155 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 09:25:03,160 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 09:25:03,161 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 09:25:03,191 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 09:25:03,192 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 09:25:03,192 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 09:25:03,192 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 09:25:03,193 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 09:25:03,194 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 09:25:03,194 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 09:25:03,195 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 09:25:03,199 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 09:25:03,199 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 09:25:03,199 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 09:25:03,199 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 09:25:03,200 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 09:25:03,200 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 09:25:03,200 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 09:25:03,200 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 09:25:03,201 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 09:25:03,201 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 09:25:03,201 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 09:25:03,201 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 09:25:03,202 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 09:25:03,202 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 09:25:03,202 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 09:25:03,202 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 09:25:03,203 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 09:25:03,203 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 09:25:03,203 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 09:25:03,203 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 09:25:03,204 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 09:25:03,204 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 09:25:03,204 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 09:25:03,205 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 09:25:03,205 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 09:25:03,205 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 09:25:03,205 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 09:25:03,206 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 09:25:03,207 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 09:25:03,207 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 -> 47e63b013ba5a4bad17f0c24c4a898ba0d6a9a1edaa8e8eb07c4e72f0000c552 [2024-10-24 09:25:03,476 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 09:25:03,499 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 09:25:03,503 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 09:25:03,504 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 09:25:03,506 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 09:25:03,507 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-27.i [2024-10-24 09:25:04,902 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 09:25:05,118 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 09:25:05,119 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-27.i [2024-10-24 09:25:05,126 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ee7abd16b/f2ab6c016de54b7281c8e65bf7fb9ab5/FLAG3ed20d9f7 [2024-10-24 09:25:05,478 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ee7abd16b/f2ab6c016de54b7281c8e65bf7fb9ab5 [2024-10-24 09:25:05,481 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 09:25:05,482 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 09:25:05,483 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 09:25:05,483 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 09:25:05,489 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 09:25:05,490 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 09:25:05" (1/1) ... [2024-10-24 09:25:05,491 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6bb93e57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:25:05, skipping insertion in model container [2024-10-24 09:25:05,491 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 09:25:05" (1/1) ... [2024-10-24 09:25:05,518 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 09:25:05,690 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-27.i[915,928] [2024-10-24 09:25:05,727 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 09:25:05,739 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 09:25:05,751 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-27.i[915,928] [2024-10-24 09:25:05,769 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 09:25:05,787 INFO L204 MainTranslator]: Completed translation [2024-10-24 09:25:05,791 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:25:05 WrapperNode [2024-10-24 09:25:05,791 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 09:25:05,793 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 09:25:05,793 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 09:25:05,793 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 09:25:05,800 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:25:05" (1/1) ... [2024-10-24 09:25:05,811 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:25:05" (1/1) ... [2024-10-24 09:25:05,854 INFO L138 Inliner]: procedures = 26, calls = 30, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 113 [2024-10-24 09:25:05,854 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 09:25:05,855 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 09:25:05,855 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 09:25:05,855 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 09:25:05,865 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:25:05" (1/1) ... [2024-10-24 09:25:05,866 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:25:05" (1/1) ... [2024-10-24 09:25:05,868 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:25:05" (1/1) ... [2024-10-24 09:25:05,889 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-24 09:25:05,889 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:25:05" (1/1) ... [2024-10-24 09:25:05,890 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:25:05" (1/1) ... [2024-10-24 09:25:05,895 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:25:05" (1/1) ... [2024-10-24 09:25:05,898 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:25:05" (1/1) ... [2024-10-24 09:25:05,899 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:25:05" (1/1) ... [2024-10-24 09:25:05,901 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:25:05" (1/1) ... [2024-10-24 09:25:05,903 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 09:25:05,904 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 09:25:05,904 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 09:25:05,904 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 09:25:05,905 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:25:05" (1/1) ... [2024-10-24 09:25:05,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 09:25:05,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 09:25:05,953 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 09:25:05,956 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 09:25:06,008 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 09:25:06,009 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 09:25:06,010 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 09:25:06,010 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 09:25:06,010 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 09:25:06,010 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 09:25:06,088 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 09:25:06,093 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 09:25:06,426 INFO L? ?]: Removed 17 outVars from TransFormulas that were not future-live. [2024-10-24 09:25:06,426 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 09:25:06,475 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 09:25:06,476 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 09:25:06,477 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 09:25:06 BoogieIcfgContainer [2024-10-24 09:25:06,478 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 09:25:06,481 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 09:25:06,481 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 09:25:06,485 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 09:25:06,485 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 09:25:05" (1/3) ... [2024-10-24 09:25:06,487 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b47dbd2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 09:25:06, skipping insertion in model container [2024-10-24 09:25:06,487 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:25:05" (2/3) ... [2024-10-24 09:25:06,488 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b47dbd2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 09:25:06, skipping insertion in model container [2024-10-24 09:25:06,488 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 09:25:06" (3/3) ... [2024-10-24 09:25:06,490 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-27.i [2024-10-24 09:25:06,512 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 09:25:06,512 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 09:25:06,579 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 09:25:06,586 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;@8791b97, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 09:25:06,586 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 09:25:06,590 INFO L276 IsEmpty]: Start isEmpty. Operand has 44 states, 24 states have (on average 1.375) internal successors, (33), 25 states have internal predecessors, (33), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-24 09:25:06,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-24 09:25:06,599 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:25:06,599 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 09:25:06,600 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:25:06,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:25:06,605 INFO L85 PathProgramCache]: Analyzing trace with hash 774957483, now seen corresponding path program 1 times [2024-10-24 09:25:06,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 09:25:06,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780468880] [2024-10-24 09:25:06,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:25:06,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 09:25:06,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:06,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 09:25:06,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:06,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 09:25:06,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:06,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 09:25:06,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:06,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 09:25:06,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:06,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 09:25:06,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:06,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 09:25:06,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:06,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 09:25:06,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:06,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 09:25:06,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:06,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 09:25:06,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:06,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 09:25:06,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:06,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 09:25:06,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:06,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 09:25:06,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:06,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 09:25:06,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:06,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 09:25:06,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:06,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 09:25:07,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:07,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 09:25:07,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:07,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 09:25:07,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:07,020 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-24 09:25:07,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 09:25:07,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780468880] [2024-10-24 09:25:07,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780468880] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 09:25:07,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 09:25:07,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 09:25:07,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13146950] [2024-10-24 09:25:07,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 09:25:07,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 09:25:07,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 09:25:07,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 09:25:07,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 09:25:07,060 INFO L87 Difference]: Start difference. First operand has 44 states, 24 states have (on average 1.375) internal successors, (33), 25 states have internal predecessors, (33), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-24 09:25:07,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 09:25:07,118 INFO L93 Difference]: Finished difference Result 87 states and 150 transitions. [2024-10-24 09:25:07,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 09:25:07,121 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 103 [2024-10-24 09:25:07,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 09:25:07,128 INFO L225 Difference]: With dead ends: 87 [2024-10-24 09:25:07,129 INFO L226 Difference]: Without dead ends: 42 [2024-10-24 09:25:07,133 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 09:25:07,139 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 09:25:07,140 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 59 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 09:25:07,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-10-24 09:25:07,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2024-10-24 09:25:07,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-24 09:25:07,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 62 transitions. [2024-10-24 09:25:07,181 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 62 transitions. Word has length 103 [2024-10-24 09:25:07,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 09:25:07,182 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 62 transitions. [2024-10-24 09:25:07,182 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-24 09:25:07,183 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 62 transitions. [2024-10-24 09:25:07,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-24 09:25:07,186 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:25:07,186 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 09:25:07,186 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 09:25:07,187 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:25:07,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:25:07,188 INFO L85 PathProgramCache]: Analyzing trace with hash 1463489641, now seen corresponding path program 1 times [2024-10-24 09:25:07,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 09:25:07,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372289605] [2024-10-24 09:25:07,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:25:07,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 09:25:07,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:09,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 09:25:09,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:09,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 09:25:09,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:09,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 09:25:09,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:09,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 09:25:09,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:09,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 09:25:09,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:09,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 09:25:09,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:09,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 09:25:09,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:09,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 09:25:09,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:09,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 09:25:09,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:09,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 09:25:09,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:09,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 09:25:09,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:09,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 09:25:09,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:09,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 09:25:09,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:09,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 09:25:09,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:09,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 09:25:09,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:09,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 09:25:09,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:09,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 09:25:09,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:09,835 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-24 09:25:09,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 09:25:09,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372289605] [2024-10-24 09:25:09,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372289605] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 09:25:09,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 09:25:09,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-24 09:25:09,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736527003] [2024-10-24 09:25:09,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 09:25:09,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 09:25:09,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 09:25:09,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 09:25:09,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-24 09:25:09,841 INFO L87 Difference]: Start difference. First operand 42 states and 62 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-24 09:25:11,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 09:25:11,004 INFO L93 Difference]: Finished difference Result 125 states and 171 transitions. [2024-10-24 09:25:11,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-24 09:25:11,005 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 103 [2024-10-24 09:25:11,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 09:25:11,008 INFO L225 Difference]: With dead ends: 125 [2024-10-24 09:25:11,008 INFO L226 Difference]: Without dead ends: 123 [2024-10-24 09:25:11,009 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2024-10-24 09:25:11,010 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 105 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-24 09:25:11,010 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 252 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-24 09:25:11,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2024-10-24 09:25:11,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 89. [2024-10-24 09:25:11,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 52 states have (on average 1.2307692307692308) internal successors, (64), 52 states have internal predecessors, (64), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-24 09:25:11,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 132 transitions. [2024-10-24 09:25:11,032 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 132 transitions. Word has length 103 [2024-10-24 09:25:11,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 09:25:11,035 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 132 transitions. [2024-10-24 09:25:11,035 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-24 09:25:11,035 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 132 transitions. [2024-10-24 09:25:11,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-24 09:25:11,037 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:25:11,037 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 09:25:11,037 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 09:25:11,038 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:25:11,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:25:11,039 INFO L85 PathProgramCache]: Analyzing trace with hash 1520747943, now seen corresponding path program 1 times [2024-10-24 09:25:11,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 09:25:11,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796047649] [2024-10-24 09:25:11,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:25:11,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 09:25:11,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:13,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 09:25:13,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:13,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 09:25:13,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:13,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 09:25:13,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:13,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 09:25:13,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:13,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 09:25:13,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:13,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 09:25:13,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:13,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 09:25:13,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:13,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 09:25:13,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:13,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 09:25:13,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:13,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 09:25:13,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:13,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 09:25:13,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:13,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 09:25:13,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:13,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 09:25:13,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:13,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 09:25:13,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:13,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 09:25:13,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:13,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 09:25:13,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:13,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 09:25:13,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:13,171 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-24 09:25:13,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 09:25:13,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796047649] [2024-10-24 09:25:13,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796047649] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 09:25:13,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 09:25:13,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-24 09:25:13,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483976814] [2024-10-24 09:25:13,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 09:25:13,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 09:25:13,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 09:25:13,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 09:25:13,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-24 09:25:13,175 INFO L87 Difference]: Start difference. First operand 89 states and 132 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-24 09:25:14,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 09:25:14,124 INFO L93 Difference]: Finished difference Result 121 states and 167 transitions. [2024-10-24 09:25:14,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-24 09:25:14,125 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 103 [2024-10-24 09:25:14,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 09:25:14,127 INFO L225 Difference]: With dead ends: 121 [2024-10-24 09:25:14,127 INFO L226 Difference]: Without dead ends: 119 [2024-10-24 09:25:14,128 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2024-10-24 09:25:14,129 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 82 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-24 09:25:14,129 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 258 Invalid, 274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-24 09:25:14,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-10-24 09:25:14,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 89. [2024-10-24 09:25:14,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 52 states have (on average 1.2307692307692308) internal successors, (64), 52 states have internal predecessors, (64), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-24 09:25:14,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 132 transitions. [2024-10-24 09:25:14,154 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 132 transitions. Word has length 103 [2024-10-24 09:25:14,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 09:25:14,154 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 132 transitions. [2024-10-24 09:25:14,155 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-24 09:25:14,155 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 132 transitions. [2024-10-24 09:25:14,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-24 09:25:14,158 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:25:14,158 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 09:25:14,158 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 09:25:14,159 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:25:14,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:25:14,160 INFO L85 PathProgramCache]: Analyzing trace with hash 654143015, now seen corresponding path program 1 times [2024-10-24 09:25:14,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 09:25:14,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808827521] [2024-10-24 09:25:14,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:25:14,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 09:25:14,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:14,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 09:25:14,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:14,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 09:25:14,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:14,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 09:25:14,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:14,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 09:25:14,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:14,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 09:25:14,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:14,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 09:25:14,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:14,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 09:25:14,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:14,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 09:25:14,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:14,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 09:25:14,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:14,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 09:25:14,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:14,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 09:25:14,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:14,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 09:25:14,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:14,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 09:25:14,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:14,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 09:25:14,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:14,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 09:25:14,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:14,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 09:25:14,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:14,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 09:25:14,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:14,295 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-24 09:25:14,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 09:25:14,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808827521] [2024-10-24 09:25:14,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [808827521] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 09:25:14,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 09:25:14,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 09:25:14,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815282886] [2024-10-24 09:25:14,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 09:25:14,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 09:25:14,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 09:25:14,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 09:25:14,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 09:25:14,298 INFO L87 Difference]: Start difference. First operand 89 states and 132 transitions. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-24 09:25:14,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 09:25:14,433 INFO L93 Difference]: Finished difference Result 179 states and 262 transitions. [2024-10-24 09:25:14,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 09:25:14,434 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 103 [2024-10-24 09:25:14,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 09:25:14,436 INFO L225 Difference]: With dead ends: 179 [2024-10-24 09:25:14,436 INFO L226 Difference]: Without dead ends: 91 [2024-10-24 09:25:14,437 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-24 09:25:14,438 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 47 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 09:25:14,439 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 225 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 09:25:14,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-10-24 09:25:14,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 85. [2024-10-24 09:25:14,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 48 states have (on average 1.1875) internal successors, (57), 48 states have internal predecessors, (57), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-24 09:25:14,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 125 transitions. [2024-10-24 09:25:14,453 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 125 transitions. Word has length 103 [2024-10-24 09:25:14,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 09:25:14,454 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 125 transitions. [2024-10-24 09:25:14,454 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-24 09:25:14,454 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 125 transitions. [2024-10-24 09:25:14,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-10-24 09:25:14,457 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:25:14,457 INFO L215 NwaCegarLoop]: trace histogram [34, 34, 34, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 09:25:14,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 09:25:14,458 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:25:14,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:25:14,458 INFO L85 PathProgramCache]: Analyzing trace with hash -2121523076, now seen corresponding path program 1 times [2024-10-24 09:25:14,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 09:25:14,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143733424] [2024-10-24 09:25:14,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:25:14,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 09:25:14,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:14,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 09:25:14,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:14,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 09:25:14,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:14,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 09:25:14,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:14,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 09:25:14,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:14,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 09:25:14,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:14,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 09:25:14,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:14,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 09:25:14,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:14,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 09:25:14,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:14,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 09:25:14,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:14,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 09:25:14,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:14,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 09:25:14,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:14,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 09:25:14,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:14,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 09:25:14,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:14,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 09:25:14,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:14,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 09:25:14,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:14,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 09:25:14,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:14,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 09:25:14,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:14,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-24 09:25:14,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:14,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-24 09:25:14,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:14,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-24 09:25:14,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:14,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-24 09:25:14,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:14,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-24 09:25:14,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:14,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-10-24 09:25:14,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:14,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-24 09:25:14,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:14,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-10-24 09:25:14,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:14,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-10-24 09:25:14,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:14,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-10-24 09:25:14,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:14,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-10-24 09:25:14,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:14,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-10-24 09:25:14,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:14,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-10-24 09:25:14,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:14,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-10-24 09:25:14,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:14,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-10-24 09:25:14,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:14,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2024-10-24 09:25:14,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:14,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2024-10-24 09:25:14,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:14,674 INFO L134 CoverageAnalysis]: Checked inductivity of 2277 backedges. 32 proven. 1 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2024-10-24 09:25:14,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 09:25:14,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143733424] [2024-10-24 09:25:14,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143733424] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 09:25:14,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [27830711] [2024-10-24 09:25:14,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:25:14,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 09:25:14,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 09:25:14,680 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 09:25:14,682 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-24 09:25:14,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:25:14,795 INFO L255 TraceCheckSpWp]: Trace formula consists of 441 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-24 09:25:14,812 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 09:25:15,087 INFO L134 CoverageAnalysis]: Checked inductivity of 2277 backedges. 1187 proven. 0 refuted. 0 times theorem prover too weak. 1090 trivial. 0 not checked. [2024-10-24 09:25:15,087 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 09:25:15,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [27830711] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 09:25:15,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 09:25:15,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 7 [2024-10-24 09:25:15,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524906424] [2024-10-24 09:25:15,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 09:25:15,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 09:25:15,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 09:25:15,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 09:25:15,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-24 09:25:15,090 INFO L87 Difference]: Start difference. First operand 85 states and 125 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) [2024-10-24 09:25:15,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 09:25:15,197 INFO L93 Difference]: Finished difference Result 123 states and 181 transitions. [2024-10-24 09:25:15,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 09:25:15,198 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) Word has length 206 [2024-10-24 09:25:15,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 09:25:15,200 INFO L225 Difference]: With dead ends: 123 [2024-10-24 09:25:15,201 INFO L226 Difference]: Without dead ends: 0 [2024-10-24 09:25:15,202 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 271 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-10-24 09:25:15,206 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 26 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 09:25:15,206 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 65 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 09:25:15,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-24 09:25:15,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-24 09:25:15,207 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-10-24 09:25:15,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-24 09:25:15,208 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 206 [2024-10-24 09:25:15,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 09:25:15,208 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-24 09:25:15,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) [2024-10-24 09:25:15,208 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-24 09:25:15,209 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-24 09:25:15,211 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-24 09:25:15,231 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-24 09:25:15,415 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 09:25:15,419 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-10-24 09:25:15,421 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-24 09:25:15,532 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 09:25:15,551 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 09:25:15 BoogieIcfgContainer [2024-10-24 09:25:15,551 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 09:25:15,552 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 09:25:15,552 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 09:25:15,552 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 09:25:15,553 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 09:25:06" (3/4) ... [2024-10-24 09:25:15,554 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-24 09:25:15,558 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-10-24 09:25:15,562 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2024-10-24 09:25:15,562 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2024-10-24 09:25:15,563 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-24 09:25:15,563 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-24 09:25:15,649 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-24 09:25:15,649 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-24 09:25:15,649 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 09:25:15,650 INFO L158 Benchmark]: Toolchain (without parser) took 10167.62ms. Allocated memory was 148.9MB in the beginning and 264.2MB in the end (delta: 115.3MB). Free memory was 118.3MB in the beginning and 105.2MB in the end (delta: 13.1MB). Peak memory consumption was 128.4MB. Max. memory is 16.1GB. [2024-10-24 09:25:15,652 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 104.9MB. Free memory is still 78.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 09:25:15,652 INFO L158 Benchmark]: CACSL2BoogieTranslator took 308.45ms. Allocated memory is still 148.9MB. Free memory was 117.3MB in the beginning and 103.8MB in the end (delta: 13.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-24 09:25:15,653 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.77ms. Allocated memory is still 148.9MB. Free memory was 103.8MB in the beginning and 100.5MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 09:25:15,653 INFO L158 Benchmark]: Boogie Preprocessor took 48.25ms. Allocated memory is still 148.9MB. Free memory was 100.5MB in the beginning and 97.5MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 09:25:15,653 INFO L158 Benchmark]: RCFGBuilder took 573.65ms. Allocated memory is still 148.9MB. Free memory was 97.5MB in the beginning and 110.2MB in the end (delta: -12.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-24 09:25:15,653 INFO L158 Benchmark]: TraceAbstraction took 9070.17ms. Allocated memory was 148.9MB in the beginning and 264.2MB in the end (delta: 115.3MB). Free memory was 110.2MB in the beginning and 111.5MB in the end (delta: -1.2MB). Peak memory consumption was 115.1MB. Max. memory is 16.1GB. [2024-10-24 09:25:15,654 INFO L158 Benchmark]: Witness Printer took 97.23ms. Allocated memory is still 264.2MB. Free memory was 111.5MB in the beginning and 105.2MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-24 09:25:15,655 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.16ms. Allocated memory is still 104.9MB. Free memory is still 78.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 308.45ms. Allocated memory is still 148.9MB. Free memory was 117.3MB in the beginning and 103.8MB in the end (delta: 13.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 61.77ms. Allocated memory is still 148.9MB. Free memory was 103.8MB in the beginning and 100.5MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 48.25ms. Allocated memory is still 148.9MB. Free memory was 100.5MB in the beginning and 97.5MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 573.65ms. Allocated memory is still 148.9MB. Free memory was 97.5MB in the beginning and 110.2MB in the end (delta: -12.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 9070.17ms. Allocated memory was 148.9MB in the beginning and 264.2MB in the end (delta: 115.3MB). Free memory was 110.2MB in the beginning and 111.5MB in the end (delta: -1.2MB). Peak memory consumption was 115.1MB. Max. memory is 16.1GB. * Witness Printer took 97.23ms. Allocated memory is still 264.2MB. Free memory was 111.5MB in the beginning and 105.2MB 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, 44 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 8.9s, OverallIterations: 5, TraceHistogramMax: 34, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 260 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 260 mSDsluCounter, 859 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 590 mSDsCounter, 204 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 486 IncrementalHoareTripleChecker+Invalid, 690 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 204 mSolverCounterUnsat, 269 mSDtfsCounter, 486 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 472 GetRequests, 433 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=89occurred in iteration=2, InterpolantAutomatonStates: 36, 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, 5 MinimizatonAttempts, 70 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 5.5s InterpolantComputationTime, 824 NumberOfCodeBlocks, 824 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 818 ConstructedInterpolants, 0 QuantifiedInterpolants, 3170 SizeOfPredicates, 2 NumberOfNonLiveVariables, 441 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 6 InterpolantComputations, 5 PerfectInterpolantSequences, 6729/6730 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: 99]: Loop Invariant Derived loop invariant: ((((long long) 128 + last_1_var_1_13) <= 0) && (((long long) 128 + var_1_13) <= 0)) - ProcedureContractResult [Line: 20]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Requires: ((((long long) 128 + last_1_var_1_13) <= 0) && (((long long) 128 + var_1_13) <= 0)) Ensures: (((((long long) 128 + last_1_var_1_13) <= 0) && (((long long) 128 + var_1_13) <= 0)) && ((((((((((((((isInitial == \old(isInitial)) && (var_1_1 == \old(var_1_1))) && (var_1_3 == \old(var_1_3))) && (var_1_5 == \old(var_1_5))) && (var_1_7 == \old(var_1_7))) && (var_1_8 == \old(var_1_8))) && (var_1_9 == \old(var_1_9))) && (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))) && (last_1_var_1_9 == \old(last_1_var_1_9))) && (last_1_var_1_13 == \old(last_1_var_1_13)))) RESULT: Ultimate proved your program to be correct! [2024-10-24 09:25:15,684 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