./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_codestructure_normal_file-52.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d 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_codestructure_normal_file-52.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 8a9514002ed578f0f6e59fc15c007062f6d926230410ac9646815da80f07fd2b --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 00:03:08,672 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 00:03:08,732 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 00:03:08,736 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 00:03:08,737 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 00:03:08,755 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 00:03:08,756 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 00:03:08,757 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 00:03:08,757 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 00:03:08,758 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 00:03:08,758 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 00:03:08,758 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 00:03:08,759 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 00:03:08,759 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 00:03:08,760 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 00:03:08,760 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 00:03:08,761 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 00:03:08,761 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 00:03:08,761 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 00:03:08,762 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 00:03:08,762 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 00:03:08,766 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 00:03:08,767 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 00:03:08,767 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 00:03:08,767 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 00:03:08,767 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 00:03:08,768 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 00:03:08,768 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 00:03:08,768 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 00:03:08,768 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 00:03:08,769 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 00:03:08,769 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 00:03:08,769 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 00:03:08,769 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 00:03:08,770 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 00:03:08,770 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 00:03:08,770 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 00:03:08,771 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 00:03:08,772 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 00:03:08,772 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 00:03:08,772 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 00:03:08,773 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 00:03:08,773 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 -> 8a9514002ed578f0f6e59fc15c007062f6d926230410ac9646815da80f07fd2b [2024-10-13 00:03:09,017 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 00:03:09,044 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 00:03:09,047 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 00:03:09,048 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 00:03:09,049 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 00:03:09,050 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-52.i [2024-10-13 00:03:10,537 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 00:03:10,716 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 00:03:10,717 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-52.i [2024-10-13 00:03:10,726 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4bc40bd03/bafd61e20882446cb2fd7a9f4026e4bd/FLAGaff080849 [2024-10-13 00:03:10,740 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4bc40bd03/bafd61e20882446cb2fd7a9f4026e4bd [2024-10-13 00:03:10,743 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 00:03:10,744 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 00:03:10,746 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 00:03:10,746 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 00:03:10,751 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 00:03:10,752 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:03:10" (1/1) ... [2024-10-13 00:03:10,753 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4cf6a686 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:03:10, skipping insertion in model container [2024-10-13 00:03:10,753 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:03:10" (1/1) ... [2024-10-13 00:03:10,783 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 00:03:10,936 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_codestructure_normal_file-52.i[913,926] [2024-10-13 00:03:11,019 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 00:03:11,033 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 00:03:11,047 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_codestructure_normal_file-52.i[913,926] [2024-10-13 00:03:11,084 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 00:03:11,107 INFO L204 MainTranslator]: Completed translation [2024-10-13 00:03:11,107 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:03:11 WrapperNode [2024-10-13 00:03:11,107 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 00:03:11,108 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 00:03:11,108 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 00:03:11,108 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 00:03:11,118 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:03:11" (1/1) ... [2024-10-13 00:03:11,132 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:03:11" (1/1) ... [2024-10-13 00:03:11,173 INFO L138 Inliner]: procedures = 26, calls = 37, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 143 [2024-10-13 00:03:11,174 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 00:03:11,175 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 00:03:11,175 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 00:03:11,175 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 00:03:11,201 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:03:11" (1/1) ... [2024-10-13 00:03:11,202 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:03:11" (1/1) ... [2024-10-13 00:03:11,204 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:03:11" (1/1) ... [2024-10-13 00:03:11,231 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-13 00:03:11,231 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:03:11" (1/1) ... [2024-10-13 00:03:11,231 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:03:11" (1/1) ... [2024-10-13 00:03:11,239 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:03:11" (1/1) ... [2024-10-13 00:03:11,244 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:03:11" (1/1) ... [2024-10-13 00:03:11,250 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:03:11" (1/1) ... [2024-10-13 00:03:11,256 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:03:11" (1/1) ... [2024-10-13 00:03:11,259 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 00:03:11,264 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 00:03:11,264 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 00:03:11,264 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 00:03:11,265 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:03:11" (1/1) ... [2024-10-13 00:03:11,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 00:03:11,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 00:03:11,331 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-13 00:03:11,337 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-13 00:03:11,383 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 00:03:11,383 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 00:03:11,383 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 00:03:11,384 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 00:03:11,384 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 00:03:11,384 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 00:03:11,448 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 00:03:11,451 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 00:03:11,773 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-10-13 00:03:11,773 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 00:03:11,831 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 00:03:11,832 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 00:03:11,832 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:03:11 BoogieIcfgContainer [2024-10-13 00:03:11,832 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 00:03:11,835 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 00:03:11,835 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 00:03:11,838 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 00:03:11,838 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 12:03:10" (1/3) ... [2024-10-13 00:03:11,839 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1439fb6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 12:03:11, skipping insertion in model container [2024-10-13 00:03:11,840 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:03:11" (2/3) ... [2024-10-13 00:03:11,840 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1439fb6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 12:03:11, skipping insertion in model container [2024-10-13 00:03:11,841 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:03:11" (3/3) ... [2024-10-13 00:03:11,842 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_normal_file-52.i [2024-10-13 00:03:11,858 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 00:03:11,859 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 00:03:11,919 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 00:03:11,925 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;@4ebacdf2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 00:03:11,926 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 00:03:11,931 INFO L276 IsEmpty]: Start isEmpty. Operand has 60 states, 33 states have (on average 1.4545454545454546) internal successors, (48), 34 states have internal predecessors, (48), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-13 00:03:11,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-10-13 00:03:11,946 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 00:03:11,947 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 00:03:11,948 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 00:03:11,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 00:03:11,953 INFO L85 PathProgramCache]: Analyzing trace with hash -1523182916, now seen corresponding path program 1 times [2024-10-13 00:03:11,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 00:03:11,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894798576] [2024-10-13 00:03:11,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:03:11,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 00:03:12,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:03:12,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 00:03:12,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:03:12,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 00:03:12,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:03:12,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 00:03:12,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:03:12,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 00:03:12,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:03:12,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 00:03:12,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:03:12,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 00:03:12,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:03:12,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 00:03:12,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:03:12,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 00:03:12,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:03:12,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 00:03:12,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:03:12,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 00:03:12,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:03:12,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 00:03:12,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:03:12,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 00:03:12,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:03:12,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 00:03:12,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:03:12,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 00:03:12,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:03:12,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 00:03:12,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:03:12,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 00:03:12,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:03:12,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 00:03:12,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:03:12,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-13 00:03:12,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:03:12,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 00:03:12,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:03:12,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-13 00:03:12,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:03:12,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-13 00:03:12,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:03:12,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-13 00:03:12,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:03:12,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-13 00:03:12,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:03:12,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-13 00:03:12,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:03:12,424 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-10-13 00:03:12,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 00:03:12,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894798576] [2024-10-13 00:03:12,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1894798576] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 00:03:12,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 00:03:12,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 00:03:12,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458256276] [2024-10-13 00:03:12,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 00:03:12,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 00:03:12,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 00:03:12,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 00:03:12,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 00:03:12,463 INFO L87 Difference]: Start difference. First operand has 60 states, 33 states have (on average 1.4545454545454546) internal successors, (48), 34 states have internal predecessors, (48), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) [2024-10-13 00:03:12,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 00:03:12,514 INFO L93 Difference]: Finished difference Result 117 states and 214 transitions. [2024-10-13 00:03:12,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 00:03:12,517 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) Word has length 144 [2024-10-13 00:03:12,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 00:03:12,527 INFO L225 Difference]: With dead ends: 117 [2024-10-13 00:03:12,528 INFO L226 Difference]: Without dead ends: 58 [2024-10-13 00:03:12,533 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 74 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-13 00:03:12,536 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 00:03:12,537 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 88 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 00:03:12,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-10-13 00:03:12,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2024-10-13 00:03:12,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 32 states have (on average 1.34375) internal successors, (43), 32 states have internal predecessors, (43), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-13 00:03:12,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 91 transitions. [2024-10-13 00:03:12,601 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 91 transitions. Word has length 144 [2024-10-13 00:03:12,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 00:03:12,603 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 91 transitions. [2024-10-13 00:03:12,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) [2024-10-13 00:03:12,603 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 91 transitions. [2024-10-13 00:03:12,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-10-13 00:03:12,608 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 00:03:12,609 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 00:03:12,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 00:03:12,609 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 00:03:12,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 00:03:12,610 INFO L85 PathProgramCache]: Analyzing trace with hash 1576649404, now seen corresponding path program 1 times [2024-10-13 00:03:12,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 00:03:12,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614711083] [2024-10-13 00:03:12,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:03:12,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 00:03:12,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:03:24,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 00:03:24,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:03:24,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 00:03:24,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:03:24,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 00:03:24,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:03:24,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 00:03:24,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:03:24,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 00:03:24,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:03:24,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 00:03:24,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:03:24,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 00:03:24,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:03:24,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 00:03:24,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:03:24,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 00:03:24,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:03:24,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 00:03:24,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:03:24,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 00:03:24,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:03:24,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 00:03:24,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:03:24,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 00:03:24,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:03:24,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 00:03:24,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:03:24,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 00:03:24,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:03:24,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 00:03:24,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:03:24,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 00:03:24,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:03:24,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-13 00:03:24,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:03:24,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 00:03:24,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:03:24,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-13 00:03:24,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:03:24,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-13 00:03:24,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:03:24,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-13 00:03:24,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:03:24,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-13 00:03:24,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:03:24,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-13 00:03:24,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:03:24,265 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-10-13 00:03:24,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 00:03:24,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614711083] [2024-10-13 00:03:24,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1614711083] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 00:03:24,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 00:03:24,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-13 00:03:24,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021930797] [2024-10-13 00:03:24,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 00:03:24,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-13 00:03:24,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 00:03:24,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-13 00:03:24,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2024-10-13 00:03:24,272 INFO L87 Difference]: Start difference. First operand 58 states and 91 transitions. Second operand has 10 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-13 00:03:25,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 00:03:25,867 INFO L93 Difference]: Finished difference Result 81 states and 124 transitions. [2024-10-13 00:03:25,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-13 00:03:25,868 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 144 [2024-10-13 00:03:25,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 00:03:25,870 INFO L225 Difference]: With dead ends: 81 [2024-10-13 00:03:25,871 INFO L226 Difference]: Without dead ends: 79 [2024-10-13 00:03:25,871 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=102, Invalid=170, Unknown=0, NotChecked=0, Total=272 [2024-10-13 00:03:25,872 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 55 mSDsluCounter, 309 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-13 00:03:25,873 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 384 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-13 00:03:25,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-10-13 00:03:25,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 67. [2024-10-13 00:03:25,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 41 states have (on average 1.4146341463414633) internal successors, (58), 41 states have internal predecessors, (58), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-13 00:03:25,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 106 transitions. [2024-10-13 00:03:25,888 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 106 transitions. Word has length 144 [2024-10-13 00:03:25,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 00:03:25,890 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 106 transitions. [2024-10-13 00:03:25,890 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-13 00:03:25,891 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 106 transitions. [2024-10-13 00:03:25,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-10-13 00:03:25,895 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 00:03:25,896 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 00:03:25,896 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 00:03:25,896 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 00:03:25,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 00:03:25,897 INFO L85 PathProgramCache]: Analyzing trace with hash -1570192452, now seen corresponding path program 1 times [2024-10-13 00:03:25,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 00:03:25,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399916286] [2024-10-13 00:03:25,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:03:25,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 00:03:25,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:03:33,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 00:03:33,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:03:33,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 00:03:33,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:03:33,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 00:03:33,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:03:33,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 00:03:33,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:03:33,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 00:03:33,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:03:33,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 00:03:33,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:03:33,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 00:03:33,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:03:33,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 00:03:33,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:03:33,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 00:03:33,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:03:33,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 00:03:33,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:03:33,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 00:03:33,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:03:33,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 00:03:33,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:03:33,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 00:03:33,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:03:33,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 00:03:33,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:03:33,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 00:03:33,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:03:33,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 00:03:33,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:03:33,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 00:03:33,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:03:33,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-13 00:03:33,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:03:33,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 00:03:33,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:03:33,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-13 00:03:33,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:03:33,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-13 00:03:33,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:03:33,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-13 00:03:33,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:03:33,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-13 00:03:33,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:03:33,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-13 00:03:33,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:03:33,366 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-10-13 00:03:33,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 00:03:33,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399916286] [2024-10-13 00:03:33,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399916286] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 00:03:33,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 00:03:33,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-13 00:03:33,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903124522] [2024-10-13 00:03:33,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 00:03:33,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-13 00:03:33,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 00:03:33,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-13 00:03:33,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2024-10-13 00:03:33,369 INFO L87 Difference]: Start difference. First operand 67 states and 106 transitions. Second operand has 10 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-13 00:03:35,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 00:03:35,484 INFO L93 Difference]: Finished difference Result 87 states and 133 transitions. [2024-10-13 00:03:35,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-13 00:03:35,485 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 144 [2024-10-13 00:03:35,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 00:03:35,487 INFO L225 Difference]: With dead ends: 87 [2024-10-13 00:03:35,487 INFO L226 Difference]: Without dead ends: 85 [2024-10-13 00:03:35,487 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=102, Invalid=170, Unknown=0, NotChecked=0, Total=272 [2024-10-13 00:03:35,488 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 58 mSDsluCounter, 330 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 420 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-13 00:03:35,489 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 420 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 239 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-13 00:03:35,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-10-13 00:03:35,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 61. [2024-10-13 00:03:35,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 35 states have (on average 1.3428571428571427) internal successors, (47), 35 states have internal predecessors, (47), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-13 00:03:35,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 95 transitions. [2024-10-13 00:03:35,498 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 95 transitions. Word has length 144 [2024-10-13 00:03:35,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 00:03:35,498 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 95 transitions. [2024-10-13 00:03:35,499 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-13 00:03:35,499 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 95 transitions. [2024-10-13 00:03:35,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-10-13 00:03:35,501 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 00:03:35,501 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 00:03:35,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 00:03:35,502 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 00:03:35,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 00:03:35,502 INFO L85 PathProgramCache]: Analyzing trace with hash 1680632062, now seen corresponding path program 1 times [2024-10-13 00:03:35,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 00:03:35,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591338292] [2024-10-13 00:03:35,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:03:35,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 00:03:35,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:03:44,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 00:03:44,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:03:44,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 00:03:44,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:03:44,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 00:03:44,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:03:44,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 00:03:44,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:03:44,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 00:03:44,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:03:44,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 00:03:44,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:03:44,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 00:03:44,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:03:44,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 00:03:44,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:03:44,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 00:03:44,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:03:44,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 00:03:44,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:03:44,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 00:03:44,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:03:44,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 00:03:44,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:03:44,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 00:03:44,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:03:44,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 00:03:44,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:03:44,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 00:03:44,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:03:44,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 00:03:44,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:03:44,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 00:03:44,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:03:44,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-13 00:03:44,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:03:44,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 00:03:44,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:03:44,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-13 00:03:44,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:03:44,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-13 00:03:44,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:03:44,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-13 00:03:44,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:03:44,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-13 00:03:44,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:03:44,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-13 00:03:44,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:03:44,075 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-10-13 00:03:44,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 00:03:44,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591338292] [2024-10-13 00:03:44,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591338292] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 00:03:44,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 00:03:44,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-13 00:03:44,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446232919] [2024-10-13 00:03:44,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 00:03:44,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-13 00:03:44,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 00:03:44,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-13 00:03:44,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2024-10-13 00:03:44,080 INFO L87 Difference]: Start difference. First operand 61 states and 95 transitions. Second operand has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 11 states have internal predecessors, (28), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-13 00:03:45,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 00:03:45,525 INFO L93 Difference]: Finished difference Result 82 states and 126 transitions. [2024-10-13 00:03:45,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-13 00:03:45,526 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 11 states have internal predecessors, (28), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 145 [2024-10-13 00:03:45,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 00:03:45,527 INFO L225 Difference]: With dead ends: 82 [2024-10-13 00:03:45,528 INFO L226 Difference]: Without dead ends: 80 [2024-10-13 00:03:45,528 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=126, Invalid=216, Unknown=0, NotChecked=0, Total=342 [2024-10-13 00:03:45,530 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 50 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 369 SdHoareTripleChecker+Invalid, 261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-13 00:03:45,531 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 369 Invalid, 261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-13 00:03:45,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-10-13 00:03:45,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 68. [2024-10-13 00:03:45,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 42 states have (on average 1.4285714285714286) internal successors, (60), 42 states have internal predecessors, (60), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-13 00:03:45,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 108 transitions. [2024-10-13 00:03:45,547 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 108 transitions. Word has length 145 [2024-10-13 00:03:45,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 00:03:45,551 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 108 transitions. [2024-10-13 00:03:45,551 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 11 states have internal predecessors, (28), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-13 00:03:45,551 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 108 transitions. [2024-10-13 00:03:45,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-10-13 00:03:45,553 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 00:03:45,553 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 00:03:45,553 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 00:03:45,553 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 00:03:45,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 00:03:45,554 INFO L85 PathProgramCache]: Analyzing trace with hash -1382184962, now seen corresponding path program 1 times [2024-10-13 00:03:45,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 00:03:45,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133381154] [2024-10-13 00:03:45,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:03:45,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 00:03:45,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:03:52,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 00:03:52,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:03:52,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 00:03:52,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:03:52,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 00:03:52,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:03:52,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 00:03:52,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:03:52,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 00:03:52,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:03:52,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 00:03:52,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:03:52,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 00:03:52,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:03:52,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 00:03:52,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:03:52,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 00:03:52,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:03:52,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 00:03:52,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:03:52,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 00:03:52,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:03:52,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 00:03:52,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:03:52,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 00:03:52,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:03:52,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 00:03:52,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:03:52,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 00:03:52,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:03:52,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 00:03:52,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:03:52,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 00:03:52,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:03:52,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-13 00:03:52,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:03:52,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 00:03:52,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:03:52,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-13 00:03:52,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:03:52,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-13 00:03:52,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:03:52,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-13 00:03:52,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:03:52,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-13 00:03:52,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:03:52,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-13 00:03:52,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:03:52,223 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-10-13 00:03:52,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 00:03:52,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133381154] [2024-10-13 00:03:52,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133381154] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 00:03:52,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 00:03:52,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-13 00:03:52,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738943953] [2024-10-13 00:03:52,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 00:03:52,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-13 00:03:52,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 00:03:52,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-13 00:03:52,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2024-10-13 00:03:52,233 INFO L87 Difference]: Start difference. First operand 68 states and 108 transitions. Second operand has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 11 states have internal predecessors, (28), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-13 00:03:54,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 00:03:54,782 INFO L93 Difference]: Finished difference Result 101 states and 153 transitions. [2024-10-13 00:03:54,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-13 00:03:54,783 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 11 states have internal predecessors, (28), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 145 [2024-10-13 00:03:54,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 00:03:54,784 INFO L225 Difference]: With dead ends: 101 [2024-10-13 00:03:54,784 INFO L226 Difference]: Without dead ends: 99 [2024-10-13 00:03:54,785 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=126, Invalid=216, Unknown=0, NotChecked=0, Total=342 [2024-10-13 00:03:54,786 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 87 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-13 00:03:54,786 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 364 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-13 00:03:54,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-10-13 00:03:54,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 75. [2024-10-13 00:03:54,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 49 states have (on average 1.489795918367347) internal successors, (73), 49 states have internal predecessors, (73), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-13 00:03:54,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 121 transitions. [2024-10-13 00:03:54,796 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 121 transitions. Word has length 145 [2024-10-13 00:03:54,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 00:03:54,797 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 121 transitions. [2024-10-13 00:03:54,797 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 11 states have internal predecessors, (28), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-13 00:03:54,797 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 121 transitions. [2024-10-13 00:03:54,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-10-13 00:03:54,799 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 00:03:54,799 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 00:03:54,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 00:03:54,799 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 00:03:54,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 00:03:54,800 INFO L85 PathProgramCache]: Analyzing trace with hash -1380337920, now seen corresponding path program 1 times [2024-10-13 00:03:54,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 00:03:54,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499369643] [2024-10-13 00:03:54,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:03:54,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 00:03:54,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:04:01,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 00:04:01,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:04:01,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 00:04:01,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:04:01,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 00:04:01,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:04:01,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 00:04:01,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:04:01,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 00:04:01,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:04:01,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 00:04:01,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:04:01,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 00:04:01,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:04:01,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 00:04:01,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:04:01,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 00:04:01,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:04:01,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 00:04:01,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:04:01,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 00:04:01,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:04:01,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 00:04:01,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:04:01,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 00:04:01,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:04:01,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 00:04:01,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:04:01,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 00:04:01,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:04:01,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 00:04:01,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:04:01,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 00:04:01,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:04:01,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-13 00:04:01,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:04:01,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 00:04:01,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:04:01,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-13 00:04:01,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:04:01,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-13 00:04:01,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:04:01,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-13 00:04:01,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:04:01,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-13 00:04:01,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:04:01,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-13 00:04:01,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:04:01,504 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-10-13 00:04:01,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 00:04:01,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499369643] [2024-10-13 00:04:01,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [499369643] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 00:04:01,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 00:04:01,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-13 00:04:01,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833051554] [2024-10-13 00:04:01,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 00:04:01,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-13 00:04:01,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 00:04:01,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-13 00:04:01,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-10-13 00:04:01,507 INFO L87 Difference]: Start difference. First operand 75 states and 121 transitions. Second operand has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 11 states have internal predecessors, (28), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-13 00:04:03,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 00:04:03,280 INFO L93 Difference]: Finished difference Result 90 states and 142 transitions. [2024-10-13 00:04:03,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-13 00:04:03,280 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 11 states have internal predecessors, (28), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 145 [2024-10-13 00:04:03,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 00:04:03,281 INFO L225 Difference]: With dead ends: 90 [2024-10-13 00:04:03,281 INFO L226 Difference]: Without dead ends: 0 [2024-10-13 00:04:03,282 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=128, Invalid=214, Unknown=0, NotChecked=0, Total=342 [2024-10-13 00:04:03,283 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 42 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-13 00:04:03,283 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 346 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-13 00:04:03,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-13 00:04:03,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-13 00:04:03,284 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-13 00:04:03,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-13 00:04:03,285 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 145 [2024-10-13 00:04:03,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 00:04:03,285 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-13 00:04:03,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 11 states have internal predecessors, (28), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-13 00:04:03,286 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-13 00:04:03,286 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-13 00:04:03,288 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-13 00:04:03,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-13 00:04:03,291 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-10-13 00:04:03,293 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-13 00:04:03,317 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 00:04:03,329 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 12:04:03 BoogieIcfgContainer [2024-10-13 00:04:03,329 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 00:04:03,330 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 00:04:03,330 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 00:04:03,330 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 00:04:03,330 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:03:11" (3/4) ... [2024-10-13 00:04:03,332 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-13 00:04:03,335 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-10-13 00:04:03,339 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2024-10-13 00:04:03,340 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2024-10-13 00:04:03,340 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-13 00:04:03,340 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-13 00:04:03,446 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-13 00:04:03,446 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-13 00:04:03,446 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 00:04:03,447 INFO L158 Benchmark]: Toolchain (without parser) took 52702.80ms. Allocated memory was 151.0MB in the beginning and 423.6MB in the end (delta: 272.6MB). Free memory was 83.7MB in the beginning and 238.1MB in the end (delta: -154.4MB). Peak memory consumption was 120.0MB. Max. memory is 16.1GB. [2024-10-13 00:04:03,447 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 113.2MB. Free memory is still 73.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 00:04:03,448 INFO L158 Benchmark]: CACSL2BoogieTranslator took 361.87ms. Allocated memory is still 151.0MB. Free memory was 83.5MB in the beginning and 68.3MB in the end (delta: 15.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-13 00:04:03,448 INFO L158 Benchmark]: Boogie Procedure Inliner took 65.94ms. Allocated memory is still 151.0MB. Free memory was 68.1MB in the beginning and 64.8MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 00:04:03,448 INFO L158 Benchmark]: Boogie Preprocessor took 88.20ms. Allocated memory is still 151.0MB. Free memory was 64.8MB in the beginning and 119.8MB in the end (delta: -55.0MB). Peak memory consumption was 7.1MB. Max. memory is 16.1GB. [2024-10-13 00:04:03,448 INFO L158 Benchmark]: RCFGBuilder took 568.66ms. Allocated memory is still 151.0MB. Free memory was 119.8MB in the beginning and 94.1MB in the end (delta: 25.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-10-13 00:04:03,449 INFO L158 Benchmark]: TraceAbstraction took 51494.72ms. Allocated memory was 151.0MB in the beginning and 423.6MB in the end (delta: 272.6MB). Free memory was 93.5MB in the beginning and 244.4MB in the end (delta: -150.9MB). Peak memory consumption was 123.4MB. Max. memory is 16.1GB. [2024-10-13 00:04:03,449 INFO L158 Benchmark]: Witness Printer took 116.67ms. Allocated memory is still 423.6MB. Free memory was 244.4MB in the beginning and 238.1MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-13 00:04:03,452 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 113.2MB. Free memory is still 73.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 361.87ms. Allocated memory is still 151.0MB. Free memory was 83.5MB in the beginning and 68.3MB in the end (delta: 15.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 65.94ms. Allocated memory is still 151.0MB. Free memory was 68.1MB in the beginning and 64.8MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 88.20ms. Allocated memory is still 151.0MB. Free memory was 64.8MB in the beginning and 119.8MB in the end (delta: -55.0MB). Peak memory consumption was 7.1MB. Max. memory is 16.1GB. * RCFGBuilder took 568.66ms. Allocated memory is still 151.0MB. Free memory was 119.8MB in the beginning and 94.1MB in the end (delta: 25.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 51494.72ms. Allocated memory was 151.0MB in the beginning and 423.6MB in the end (delta: 272.6MB). Free memory was 93.5MB in the beginning and 244.4MB in the end (delta: -150.9MB). Peak memory consumption was 123.4MB. Max. memory is 16.1GB. * Witness Printer took 116.67ms. Allocated memory is still 423.6MB. Free memory was 244.4MB in the beginning and 238.1MB 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, 60 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 51.4s, OverallIterations: 6, TraceHistogramMax: 24, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 9.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 292 SdHoareTripleChecker+Valid, 3.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 292 mSDsluCounter, 1971 SdHoareTripleChecker+Invalid, 3.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1465 mSDsCounter, 38 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1160 IncrementalHoareTripleChecker+Invalid, 1198 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 38 mSolverCounterUnsat, 506 mSDtfsCounter, 1160 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 411 GetRequests, 330 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 14.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=75occurred in iteration=5, InterpolantAutomatonStates: 55, 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, 6 MinimizatonAttempts, 72 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 40.9s InterpolantComputationTime, 867 NumberOfCodeBlocks, 867 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 861 ConstructedInterpolants, 0 QuantifiedInterpolants, 9115 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 6624/6624 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: 135]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2024-10-13 00:04:03,594 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE