./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-22.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-22.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 9851c0f9ab930af20c037ab1e499f4c9a2b58cea1e3329cd85ff2166a0e5d289 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 11:25:20,622 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 11:25:20,691 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 11:25:20,699 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 11:25:20,700 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 11:25:20,732 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 11:25:20,733 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 11:25:20,733 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 11:25:20,734 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 11:25:20,736 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 11:25:20,736 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 11:25:20,737 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 11:25:20,738 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 11:25:20,740 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 11:25:20,740 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 11:25:20,740 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 11:25:20,741 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 11:25:20,741 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 11:25:20,741 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 11:25:20,741 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 11:25:20,742 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 11:25:20,746 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 11:25:20,746 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 11:25:20,746 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 11:25:20,746 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 11:25:20,747 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 11:25:20,747 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 11:25:20,747 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 11:25:20,747 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 11:25:20,748 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 11:25:20,748 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 11:25:20,748 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 11:25:20,748 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 11:25:20,748 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 11:25:20,749 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 11:25:20,749 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 11:25:20,749 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 11:25:20,749 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 11:25:20,750 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 11:25:20,750 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 11:25:20,750 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 11:25:20,750 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 11:25:20,751 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-clean/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-clean/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 -> 9851c0f9ab930af20c037ab1e499f4c9a2b58cea1e3329cd85ff2166a0e5d289 [2024-10-11 11:25:20,991 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 11:25:21,019 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 11:25:21,023 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 11:25:21,024 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 11:25:21,024 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 11:25:21,026 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-22.i [2024-10-11 11:25:22,538 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 11:25:22,760 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 11:25:22,761 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-22.i [2024-10-11 11:25:22,774 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/64e0bdedc/1632c5fdbd824c3d90cd501d60a1d9ee/FLAG8b3c56c54 [2024-10-11 11:25:22,793 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/64e0bdedc/1632c5fdbd824c3d90cd501d60a1d9ee [2024-10-11 11:25:22,795 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 11:25:22,798 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 11:25:22,801 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 11:25:22,802 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 11:25:22,808 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 11:25:22,809 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 11:25:22" (1/1) ... [2024-10-11 11:25:22,810 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@519c478b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:25:22, skipping insertion in model container [2024-10-11 11:25:22,811 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 11:25:22" (1/1) ... [2024-10-11 11:25:22,837 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 11:25:23,036 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-22.i[915,928] [2024-10-11 11:25:23,084 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 11:25:23,097 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 11:25:23,108 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-22.i[915,928] [2024-10-11 11:25:23,127 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 11:25:23,148 INFO L204 MainTranslator]: Completed translation [2024-10-11 11:25:23,149 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:25:23 WrapperNode [2024-10-11 11:25:23,149 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 11:25:23,150 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 11:25:23,151 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 11:25:23,151 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 11:25:23,159 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:25:23" (1/1) ... [2024-10-11 11:25:23,173 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:25:23" (1/1) ... [2024-10-11 11:25:23,212 INFO L138 Inliner]: procedures = 26, calls = 20, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 112 [2024-10-11 11:25:23,212 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 11:25:23,213 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 11:25:23,213 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 11:25:23,213 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 11:25:23,225 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:25:23" (1/1) ... [2024-10-11 11:25:23,225 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:25:23" (1/1) ... [2024-10-11 11:25:23,228 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:25:23" (1/1) ... [2024-10-11 11:25:23,253 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-11 11:25:23,253 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:25:23" (1/1) ... [2024-10-11 11:25:23,253 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:25:23" (1/1) ... [2024-10-11 11:25:23,262 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:25:23" (1/1) ... [2024-10-11 11:25:23,269 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:25:23" (1/1) ... [2024-10-11 11:25:23,272 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:25:23" (1/1) ... [2024-10-11 11:25:23,277 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:25:23" (1/1) ... [2024-10-11 11:25:23,281 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 11:25:23,282 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 11:25:23,282 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 11:25:23,282 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 11:25:23,283 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:25:23" (1/1) ... [2024-10-11 11:25:23,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 11:25:23,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 11:25:23,319 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 11:25:23,326 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 11:25:23,374 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 11:25:23,375 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 11:25:23,376 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 11:25:23,376 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 11:25:23,376 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 11:25:23,376 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 11:25:23,454 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 11:25:23,457 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 11:25:23,707 INFO L? ?]: Removed 15 outVars from TransFormulas that were not future-live. [2024-10-11 11:25:23,707 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 11:25:23,743 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 11:25:23,744 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 11:25:23,745 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:25:23 BoogieIcfgContainer [2024-10-11 11:25:23,746 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 11:25:23,748 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 11:25:23,748 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 11:25:23,752 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 11:25:23,753 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 11:25:22" (1/3) ... [2024-10-11 11:25:23,755 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41c15ef0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 11:25:23, skipping insertion in model container [2024-10-11 11:25:23,755 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:25:23" (2/3) ... [2024-10-11 11:25:23,755 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41c15ef0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 11:25:23, skipping insertion in model container [2024-10-11 11:25:23,756 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:25:23" (3/3) ... [2024-10-11 11:25:23,758 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-22.i [2024-10-11 11:25:23,775 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 11:25:23,776 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 11:25:23,841 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 11:25:23,849 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;@47594dcd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 11:25:23,850 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 11:25:23,854 INFO L276 IsEmpty]: Start isEmpty. Operand has 42 states, 32 states have (on average 1.5) internal successors, (48), 33 states have internal predecessors, (48), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-11 11:25:23,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-10-11 11:25:23,866 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:25:23,866 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 11:25:23,867 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:25:23,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:25:23,872 INFO L85 PathProgramCache]: Analyzing trace with hash 441313021, now seen corresponding path program 1 times [2024-10-11 11:25:23,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:25:23,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901876250] [2024-10-11 11:25:23,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:25:23,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:25:24,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:25:24,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:25:24,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:25:24,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:25:24,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:25:24,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 11:25:24,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:25:24,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 11:25:24,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:25:24,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 11:25:24,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:25:24,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 11:25:24,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:25:24,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 11:25:24,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:25:24,201 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-10-11 11:25:24,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:25:24,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901876250] [2024-10-11 11:25:24,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [901876250] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:25:24,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:25:24,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 11:25:24,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650105309] [2024-10-11 11:25:24,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:25:24,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 11:25:24,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:25:24,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 11:25:24,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 11:25:24,236 INFO L87 Difference]: Start difference. First operand has 42 states, 32 states have (on average 1.5) internal successors, (48), 33 states have internal predecessors, (48), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-11 11:25:24,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:25:24,279 INFO L93 Difference]: Finished difference Result 81 states and 128 transitions. [2024-10-11 11:25:24,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 11:25:24,282 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) Word has length 54 [2024-10-11 11:25:24,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:25:24,292 INFO L225 Difference]: With dead ends: 81 [2024-10-11 11:25:24,292 INFO L226 Difference]: Without dead ends: 38 [2024-10-11 11:25:24,296 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 23 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-11 11:25:24,300 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 11:25:24,301 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 49 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 11:25:24,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-10-11 11:25:24,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2024-10-11 11:25:24,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 29 states have (on average 1.3103448275862069) internal successors, (38), 29 states have internal predecessors, (38), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-11 11:25:24,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 52 transitions. [2024-10-11 11:25:24,345 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 52 transitions. Word has length 54 [2024-10-11 11:25:24,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:25:24,346 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 52 transitions. [2024-10-11 11:25:24,347 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-11 11:25:24,347 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 52 transitions. [2024-10-11 11:25:24,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-10-11 11:25:24,351 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:25:24,351 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 11:25:24,351 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 11:25:24,352 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:25:24,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:25:24,354 INFO L85 PathProgramCache]: Analyzing trace with hash -195092491, now seen corresponding path program 1 times [2024-10-11 11:25:24,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:25:24,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379073258] [2024-10-11 11:25:24,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:25:24,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:25:24,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:25:25,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:25:25,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:25:25,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:25:25,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:25:25,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 11:25:25,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:25:25,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 11:25:25,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:25:25,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 11:25:25,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:25:25,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 11:25:25,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:25:25,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 11:25:25,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:25:25,223 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-10-11 11:25:25,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:25:25,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379073258] [2024-10-11 11:25:25,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1379073258] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:25:25,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:25:25,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 11:25:25,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362127091] [2024-10-11 11:25:25,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:25:25,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 11:25:25,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:25:25,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 11:25:25,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 11:25:25,231 INFO L87 Difference]: Start difference. First operand 38 states and 52 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-11 11:25:25,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:25:25,483 INFO L93 Difference]: Finished difference Result 132 states and 180 transitions. [2024-10-11 11:25:25,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 11:25:25,483 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 54 [2024-10-11 11:25:25,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:25:25,485 INFO L225 Difference]: With dead ends: 132 [2024-10-11 11:25:25,487 INFO L226 Difference]: Without dead ends: 95 [2024-10-11 11:25:25,488 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-11 11:25:25,489 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 84 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 11:25:25,490 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 157 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 11:25:25,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-10-11 11:25:25,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 67. [2024-10-11 11:25:25,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 50 states have (on average 1.28) internal successors, (64), 50 states have internal predecessors, (64), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-11 11:25:25,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 92 transitions. [2024-10-11 11:25:25,522 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 92 transitions. Word has length 54 [2024-10-11 11:25:25,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:25:25,522 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 92 transitions. [2024-10-11 11:25:25,522 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-11 11:25:25,523 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 92 transitions. [2024-10-11 11:25:25,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-10-11 11:25:25,524 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:25:25,525 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 11:25:25,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 11:25:25,525 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:25:25,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:25:25,527 INFO L85 PathProgramCache]: Analyzing trace with hash -1183440784, now seen corresponding path program 1 times [2024-10-11 11:25:25,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:25:25,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484122582] [2024-10-11 11:25:25,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:25:25,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:25:25,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:25:25,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:25:25,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:25:25,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:25:25,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:25:25,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 11:25:25,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:25:25,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 11:25:25,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:25:25,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 11:25:25,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:25:25,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 11:25:25,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:25:25,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 11:25:25,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:25:25,928 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-10-11 11:25:25,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:25:25,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484122582] [2024-10-11 11:25:25,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484122582] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:25:25,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:25:25,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 11:25:25,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877969125] [2024-10-11 11:25:25,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:25:25,932 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 11:25:25,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:25:25,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 11:25:25,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 11:25:25,933 INFO L87 Difference]: Start difference. First operand 67 states and 92 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-11 11:25:26,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:25:26,216 INFO L93 Difference]: Finished difference Result 200 states and 269 transitions. [2024-10-11 11:25:26,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 11:25:26,220 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 55 [2024-10-11 11:25:26,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:25:26,222 INFO L225 Difference]: With dead ends: 200 [2024-10-11 11:25:26,222 INFO L226 Difference]: Without dead ends: 163 [2024-10-11 11:25:26,222 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-11 11:25:26,223 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 83 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 11:25:26,224 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 184 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 11:25:26,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2024-10-11 11:25:26,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 110. [2024-10-11 11:25:26,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 85 states have (on average 1.2941176470588236) internal successors, (110), 85 states have internal predecessors, (110), 21 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-11 11:25:26,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 152 transitions. [2024-10-11 11:25:26,258 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 152 transitions. Word has length 55 [2024-10-11 11:25:26,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:25:26,259 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 152 transitions. [2024-10-11 11:25:26,260 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-11 11:25:26,260 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 152 transitions. [2024-10-11 11:25:26,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-10-11 11:25:26,261 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:25:26,261 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 11:25:26,261 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 11:25:26,262 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:25:26,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:25:26,262 INFO L85 PathProgramCache]: Analyzing trace with hash -925275346, now seen corresponding path program 1 times [2024-10-11 11:25:26,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:25:26,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563146829] [2024-10-11 11:25:26,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:25:26,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:25:26,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:25:26,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:25:26,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:25:26,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:25:26,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:25:26,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 11:25:26,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:25:26,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 11:25:26,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:25:26,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 11:25:26,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:25:26,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 11:25:26,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:25:26,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 11:25:26,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:25:26,338 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-10-11 11:25:26,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:25:26,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563146829] [2024-10-11 11:25:26,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563146829] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:25:26,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:25:26,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 11:25:26,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590975265] [2024-10-11 11:25:26,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:25:26,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 11:25:26,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:25:26,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 11:25:26,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 11:25:26,341 INFO L87 Difference]: Start difference. First operand 110 states and 152 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-11 11:25:26,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:25:26,379 INFO L93 Difference]: Finished difference Result 175 states and 239 transitions. [2024-10-11 11:25:26,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 11:25:26,380 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 55 [2024-10-11 11:25:26,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:25:26,382 INFO L225 Difference]: With dead ends: 175 [2024-10-11 11:25:26,384 INFO L226 Difference]: Without dead ends: 138 [2024-10-11 11:25:26,384 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 11:25:26,385 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 21 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 11:25:26,386 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 102 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 11:25:26,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2024-10-11 11:25:26,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 114. [2024-10-11 11:25:26,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 89 states have (on average 1.2808988764044944) internal successors, (114), 89 states have internal predecessors, (114), 21 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-11 11:25:26,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 156 transitions. [2024-10-11 11:25:26,411 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 156 transitions. Word has length 55 [2024-10-11 11:25:26,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:25:26,412 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 156 transitions. [2024-10-11 11:25:26,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-11 11:25:26,414 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 156 transitions. [2024-10-11 11:25:26,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-10-11 11:25:26,416 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:25:26,416 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 11:25:26,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 11:25:26,416 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:25:26,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:25:26,417 INFO L85 PathProgramCache]: Analyzing trace with hash 1026934436, now seen corresponding path program 1 times [2024-10-11 11:25:26,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:25:26,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106258783] [2024-10-11 11:25:26,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:25:26,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:25:26,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:25:26,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:25:26,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:25:26,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:25:26,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:25:26,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 11:25:26,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:25:26,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 11:25:26,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:25:26,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 11:25:26,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:25:26,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 11:25:26,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:25:26,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 11:25:26,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:25:26,703 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-10-11 11:25:26,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:25:26,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106258783] [2024-10-11 11:25:26,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106258783] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:25:26,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:25:26,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 11:25:26,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443301469] [2024-10-11 11:25:26,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:25:26,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 11:25:26,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:25:26,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 11:25:26,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 11:25:26,707 INFO L87 Difference]: Start difference. First operand 114 states and 156 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-11 11:25:26,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:25:26,842 INFO L93 Difference]: Finished difference Result 262 states and 356 transitions. [2024-10-11 11:25:26,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 11:25:26,843 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 55 [2024-10-11 11:25:26,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:25:26,845 INFO L225 Difference]: With dead ends: 262 [2024-10-11 11:25:26,845 INFO L226 Difference]: Without dead ends: 167 [2024-10-11 11:25:26,849 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 11:25:26,850 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 50 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 11:25:26,850 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 131 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 11:25:26,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2024-10-11 11:25:26,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 114. [2024-10-11 11:25:26,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 89 states have (on average 1.2696629213483146) internal successors, (113), 89 states have internal predecessors, (113), 21 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-11 11:25:26,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 155 transitions. [2024-10-11 11:25:26,893 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 155 transitions. Word has length 55 [2024-10-11 11:25:26,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:25:26,895 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 155 transitions. [2024-10-11 11:25:26,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-11 11:25:26,896 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 155 transitions. [2024-10-11 11:25:26,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-10-11 11:25:26,897 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:25:26,897 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 11:25:26,900 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 11:25:26,900 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:25:26,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:25:26,901 INFO L85 PathProgramCache]: Analyzing trace with hash 452908425, now seen corresponding path program 1 times [2024-10-11 11:25:26,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:25:26,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767449455] [2024-10-11 11:25:26,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:25:26,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:25:26,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:25:28,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:25:28,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:25:28,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:25:28,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:25:28,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 11:25:28,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:25:28,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 11:25:28,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:25:28,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 11:25:28,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:25:28,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 11:25:28,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:25:28,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 11:25:28,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:25:28,655 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-10-11 11:25:28,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:25:28,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767449455] [2024-10-11 11:25:28,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [767449455] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:25:28,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:25:28,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 11:25:28,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500996954] [2024-10-11 11:25:28,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:25:28,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 11:25:28,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:25:28,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 11:25:28,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-11 11:25:28,658 INFO L87 Difference]: Start difference. First operand 114 states and 155 transitions. Second operand has 8 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-11 11:25:29,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:25:29,099 INFO L93 Difference]: Finished difference Result 293 states and 394 transitions. [2024-10-11 11:25:29,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 11:25:29,100 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 56 [2024-10-11 11:25:29,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:25:29,101 INFO L225 Difference]: With dead ends: 293 [2024-10-11 11:25:29,102 INFO L226 Difference]: Without dead ends: 198 [2024-10-11 11:25:29,102 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2024-10-11 11:25:29,103 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 258 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 258 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 11:25:29,108 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [258 Valid, 261 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 11:25:29,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2024-10-11 11:25:29,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 139. [2024-10-11 11:25:29,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 106 states have (on average 1.2358490566037736) internal successors, (131), 106 states have internal predecessors, (131), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-11 11:25:29,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 187 transitions. [2024-10-11 11:25:29,132 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 187 transitions. Word has length 56 [2024-10-11 11:25:29,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:25:29,133 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 187 transitions. [2024-10-11 11:25:29,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-11 11:25:29,133 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 187 transitions. [2024-10-11 11:25:29,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-10-11 11:25:29,134 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:25:29,134 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 11:25:29,134 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 11:25:29,134 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:25:29,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:25:29,135 INFO L85 PathProgramCache]: Analyzing trace with hash 1283414639, now seen corresponding path program 1 times [2024-10-11 11:25:29,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:25:29,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964413779] [2024-10-11 11:25:29,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:25:29,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:25:29,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:25:29,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:25:29,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:25:29,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:25:29,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:25:29,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 11:25:29,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:25:29,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 11:25:29,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:25:29,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 11:25:29,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:25:29,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 11:25:29,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:25:29,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 11:25:29,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:25:29,200 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-10-11 11:25:29,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:25:29,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964413779] [2024-10-11 11:25:29,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1964413779] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:25:29,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:25:29,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 11:25:29,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697576317] [2024-10-11 11:25:29,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:25:29,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 11:25:29,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:25:29,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 11:25:29,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 11:25:29,205 INFO L87 Difference]: Start difference. First operand 139 states and 187 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-11 11:25:29,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:25:29,252 INFO L93 Difference]: Finished difference Result 232 states and 311 transitions. [2024-10-11 11:25:29,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 11:25:29,253 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 56 [2024-10-11 11:25:29,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:25:29,254 INFO L225 Difference]: With dead ends: 232 [2024-10-11 11:25:29,254 INFO L226 Difference]: Without dead ends: 112 [2024-10-11 11:25:29,255 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 11:25:29,255 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 8 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 11:25:29,256 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 70 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 11:25:29,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-10-11 11:25:29,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 103. [2024-10-11 11:25:29,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 78 states have (on average 1.205128205128205) internal successors, (94), 78 states have internal predecessors, (94), 21 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-11 11:25:29,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 136 transitions. [2024-10-11 11:25:29,295 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 136 transitions. Word has length 56 [2024-10-11 11:25:29,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:25:29,295 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 136 transitions. [2024-10-11 11:25:29,296 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-11 11:25:29,296 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 136 transitions. [2024-10-11 11:25:29,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-10-11 11:25:29,296 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:25:29,297 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 11:25:29,297 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 11:25:29,297 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:25:29,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:25:29,297 INFO L85 PathProgramCache]: Analyzing trace with hash 1676441649, now seen corresponding path program 1 times [2024-10-11 11:25:29,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:25:29,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006282930] [2024-10-11 11:25:29,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:25:29,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:25:29,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:25:29,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:25:29,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:25:29,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:25:29,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:25:29,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 11:25:29,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:25:29,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 11:25:29,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:25:29,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 11:25:29,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:25:29,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 11:25:29,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:25:29,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 11:25:29,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:25:29,356 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-10-11 11:25:29,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:25:29,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006282930] [2024-10-11 11:25:29,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006282930] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:25:29,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:25:29,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 11:25:29,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578392279] [2024-10-11 11:25:29,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:25:29,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 11:25:29,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:25:29,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 11:25:29,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 11:25:29,359 INFO L87 Difference]: Start difference. First operand 103 states and 136 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-11 11:25:29,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:25:29,411 INFO L93 Difference]: Finished difference Result 179 states and 237 transitions. [2024-10-11 11:25:29,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 11:25:29,411 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 56 [2024-10-11 11:25:29,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:25:29,412 INFO L225 Difference]: With dead ends: 179 [2024-10-11 11:25:29,413 INFO L226 Difference]: Without dead ends: 140 [2024-10-11 11:25:29,413 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 11:25:29,414 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 26 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 11:25:29,414 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 81 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 11:25:29,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2024-10-11 11:25:29,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 138. [2024-10-11 11:25:29,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 105 states have (on average 1.2) internal successors, (126), 105 states have internal predecessors, (126), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-11 11:25:29,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 182 transitions. [2024-10-11 11:25:29,433 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 182 transitions. Word has length 56 [2024-10-11 11:25:29,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:25:29,433 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 182 transitions. [2024-10-11 11:25:29,434 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-11 11:25:29,434 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 182 transitions. [2024-10-11 11:25:29,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-10-11 11:25:29,435 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:25:29,435 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 11:25:29,435 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 11:25:29,435 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:25:29,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:25:29,436 INFO L85 PathProgramCache]: Analyzing trace with hash -1085049368, now seen corresponding path program 1 times [2024-10-11 11:25:29,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:25:29,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221681320] [2024-10-11 11:25:29,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:25:29,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:25:29,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:25:30,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:25:30,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:25:30,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:25:30,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:25:30,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 11:25:30,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:25:30,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 11:25:30,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:25:30,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 11:25:30,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:25:30,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 11:25:30,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:25:30,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 11:25:30,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:25:30,334 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-10-11 11:25:30,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:25:30,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221681320] [2024-10-11 11:25:30,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [221681320] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:25:30,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:25:30,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 11:25:30,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249738864] [2024-10-11 11:25:30,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:25:30,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 11:25:30,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:25:30,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 11:25:30,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-11 11:25:30,336 INFO L87 Difference]: Start difference. First operand 138 states and 182 transitions. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-11 11:25:30,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:25:30,525 INFO L93 Difference]: Finished difference Result 247 states and 324 transitions. [2024-10-11 11:25:30,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 11:25:30,526 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 57 [2024-10-11 11:25:30,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:25:30,529 INFO L225 Difference]: With dead ends: 247 [2024-10-11 11:25:30,529 INFO L226 Difference]: Without dead ends: 173 [2024-10-11 11:25:30,529 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-11 11:25:30,530 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 59 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 11:25:30,531 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 125 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 11:25:30,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2024-10-11 11:25:30,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 148. [2024-10-11 11:25:30,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 115 states have (on average 1.2) internal successors, (138), 115 states have internal predecessors, (138), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-11 11:25:30,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 194 transitions. [2024-10-11 11:25:30,554 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 194 transitions. Word has length 57 [2024-10-11 11:25:30,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:25:30,555 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 194 transitions. [2024-10-11 11:25:30,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-11 11:25:30,555 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 194 transitions. [2024-10-11 11:25:30,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-11 11:25:30,555 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:25:30,556 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 11:25:30,556 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 11:25:30,556 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:25:30,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:25:30,558 INFO L85 PathProgramCache]: Analyzing trace with hash -84533515, now seen corresponding path program 1 times [2024-10-11 11:25:30,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:25:30,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544506280] [2024-10-11 11:25:30,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:25:30,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:25:30,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:25:31,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:25:31,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:25:31,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:25:31,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:25:31,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 11:25:31,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:25:31,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 11:25:31,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:25:31,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 11:25:31,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:25:31,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 11:25:31,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:25:31,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 11:25:31,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:25:31,359 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-10-11 11:25:31,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:25:31,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544506280] [2024-10-11 11:25:31,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544506280] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:25:31,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:25:31,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-11 11:25:31,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435197554] [2024-10-11 11:25:31,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:25:31,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 11:25:31,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:25:31,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 11:25:31,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-10-11 11:25:31,363 INFO L87 Difference]: Start difference. First operand 148 states and 194 transitions. Second operand has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-11 11:25:32,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:25:32,173 INFO L93 Difference]: Finished difference Result 231 states and 297 transitions. [2024-10-11 11:25:32,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 11:25:32,174 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 59 [2024-10-11 11:25:32,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:25:32,175 INFO L225 Difference]: With dead ends: 231 [2024-10-11 11:25:32,177 INFO L226 Difference]: Without dead ends: 229 [2024-10-11 11:25:32,178 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=107, Invalid=355, Unknown=0, NotChecked=0, Total=462 [2024-10-11 11:25:32,178 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 201 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 410 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 495 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 410 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 11:25:32,179 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 355 Invalid, 495 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 410 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 11:25:32,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2024-10-11 11:25:32,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 163. [2024-10-11 11:25:32,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 130 states have (on average 1.1923076923076923) internal successors, (155), 130 states have internal predecessors, (155), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-11 11:25:32,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 211 transitions. [2024-10-11 11:25:32,198 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 211 transitions. Word has length 59 [2024-10-11 11:25:32,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:25:32,200 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 211 transitions. [2024-10-11 11:25:32,200 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-11 11:25:32,200 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 211 transitions. [2024-10-11 11:25:32,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-11 11:25:32,201 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:25:32,201 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 11:25:32,201 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 11:25:32,202 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:25:32,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:25:32,204 INFO L85 PathProgramCache]: Analyzing trace with hash 1325968950, now seen corresponding path program 1 times [2024-10-11 11:25:32,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:25:32,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476063484] [2024-10-11 11:25:32,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:25:32,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:25:32,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:25:32,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:25:32,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:25:32,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:25:32,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:25:32,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 11:25:32,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:25:32,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 11:25:32,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:25:32,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 11:25:32,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:25:32,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 11:25:32,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:25:32,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 11:25:32,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:25:32,649 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-10-11 11:25:32,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:25:32,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476063484] [2024-10-11 11:25:32,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476063484] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:25:32,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:25:32,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 11:25:32,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506571004] [2024-10-11 11:25:32,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:25:32,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 11:25:32,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:25:32,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 11:25:32,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 11:25:32,652 INFO L87 Difference]: Start difference. First operand 163 states and 211 transitions. Second operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-11 11:25:32,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:25:32,886 INFO L93 Difference]: Finished difference Result 172 states and 220 transitions. [2024-10-11 11:25:32,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 11:25:32,887 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 60 [2024-10-11 11:25:32,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:25:32,889 INFO L225 Difference]: With dead ends: 172 [2024-10-11 11:25:32,889 INFO L226 Difference]: Without dead ends: 170 [2024-10-11 11:25:32,890 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2024-10-11 11:25:32,891 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 42 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 11:25:32,891 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 286 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 11:25:32,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2024-10-11 11:25:32,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 163. [2024-10-11 11:25:32,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 130 states have (on average 1.1846153846153846) internal successors, (154), 130 states have internal predecessors, (154), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-11 11:25:32,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 210 transitions. [2024-10-11 11:25:32,910 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 210 transitions. Word has length 60 [2024-10-11 11:25:32,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:25:32,910 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 210 transitions. [2024-10-11 11:25:32,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-11 11:25:32,910 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 210 transitions. [2024-10-11 11:25:32,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-11 11:25:32,913 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:25:32,913 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:25:32,913 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 11:25:32,913 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:25:32,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:25:32,914 INFO L85 PathProgramCache]: Analyzing trace with hash -230762674, now seen corresponding path program 1 times [2024-10-11 11:25:32,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:25:32,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574482011] [2024-10-11 11:25:32,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:25:32,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:25:32,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:25:32,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:25:32,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:25:32,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:25:32,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:25:32,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 11:25:32,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:25:33,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 11:25:33,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:25:33,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 11:25:33,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:25:33,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 11:25:33,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:25:33,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 11:25:33,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:25:33,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-11 11:25:33,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:25:33,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 11:25:33,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:25:33,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 11:25:33,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:25:33,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-11 11:25:33,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:25:33,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-11 11:25:33,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:25:33,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-11 11:25:33,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:25:33,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-11 11:25:33,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:25:33,041 INFO L134 CoverageAnalysis]: Checked inductivity of 388 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-11 11:25:33,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:25:33,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574482011] [2024-10-11 11:25:33,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574482011] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:25:33,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:25:33,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 11:25:33,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927098659] [2024-10-11 11:25:33,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:25:33,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 11:25:33,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:25:33,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 11:25:33,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 11:25:33,043 INFO L87 Difference]: Start difference. First operand 163 states and 210 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-11 11:25:33,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:25:33,070 INFO L93 Difference]: Finished difference Result 186 states and 234 transitions. [2024-10-11 11:25:33,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 11:25:33,071 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 112 [2024-10-11 11:25:33,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:25:33,071 INFO L225 Difference]: With dead ends: 186 [2024-10-11 11:25:33,071 INFO L226 Difference]: Without dead ends: 0 [2024-10-11 11:25:33,072 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 11:25:33,072 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 4 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 11:25:33,073 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 75 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 11:25:33,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-11 11:25:33,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-11 11:25:33,073 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-11 11:25:33,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-11 11:25:33,073 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 112 [2024-10-11 11:25:33,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:25:33,074 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-11 11:25:33,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-11 11:25:33,074 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-11 11:25:33,074 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-11 11:25:33,077 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 11:25:33,077 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 11:25:33,080 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:25:33,082 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-11 11:25:33,864 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 11:25:33,896 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 11:25:33 BoogieIcfgContainer [2024-10-11 11:25:33,897 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 11:25:33,897 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 11:25:33,897 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 11:25:33,897 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 11:25:33,898 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:25:23" (3/4) ... [2024-10-11 11:25:33,900 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-11 11:25:33,903 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-10-11 11:25:33,909 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2024-10-11 11:25:33,909 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2024-10-11 11:25:33,910 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-11 11:25:33,910 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-11 11:25:34,018 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-11 11:25:34,019 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-11 11:25:34,019 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 11:25:34,020 INFO L158 Benchmark]: Toolchain (without parser) took 11222.04ms. Allocated memory was 180.4MB in the beginning and 327.2MB in the end (delta: 146.8MB). Free memory was 111.6MB in the beginning and 198.6MB in the end (delta: -87.0MB). Peak memory consumption was 61.7MB. Max. memory is 16.1GB. [2024-10-11 11:25:34,020 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 121.6MB. Free memory is still 82.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 11:25:34,020 INFO L158 Benchmark]: CACSL2BoogieTranslator took 348.21ms. Allocated memory is still 180.4MB. Free memory was 111.2MB in the beginning and 97.4MB in the end (delta: 13.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-11 11:25:34,021 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.15ms. Allocated memory is still 180.4MB. Free memory was 97.4MB in the beginning and 94.8MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 11:25:34,021 INFO L158 Benchmark]: Boogie Preprocessor took 67.62ms. Allocated memory is still 180.4MB. Free memory was 94.8MB in the beginning and 91.8MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 11:25:34,022 INFO L158 Benchmark]: RCFGBuilder took 464.15ms. Allocated memory is still 180.4MB. Free memory was 91.8MB in the beginning and 73.0MB in the end (delta: 18.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-11 11:25:34,022 INFO L158 Benchmark]: TraceAbstraction took 10148.87ms. Allocated memory was 180.4MB in the beginning and 327.2MB in the end (delta: 146.8MB). Free memory was 72.2MB in the beginning and 203.9MB in the end (delta: -131.7MB). Peak memory consumption was 15.6MB. Max. memory is 16.1GB. [2024-10-11 11:25:34,022 INFO L158 Benchmark]: Witness Printer took 122.03ms. Allocated memory is still 327.2MB. Free memory was 203.9MB in the beginning and 198.6MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-11 11:25:34,024 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 121.6MB. Free memory is still 82.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 348.21ms. Allocated memory is still 180.4MB. Free memory was 111.2MB in the beginning and 97.4MB in the end (delta: 13.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 62.15ms. Allocated memory is still 180.4MB. Free memory was 97.4MB in the beginning and 94.8MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 67.62ms. Allocated memory is still 180.4MB. Free memory was 94.8MB in the beginning and 91.8MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 464.15ms. Allocated memory is still 180.4MB. Free memory was 91.8MB in the beginning and 73.0MB in the end (delta: 18.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 10148.87ms. Allocated memory was 180.4MB in the beginning and 327.2MB in the end (delta: 146.8MB). Free memory was 72.2MB in the beginning and 203.9MB in the end (delta: -131.7MB). Peak memory consumption was 15.6MB. Max. memory is 16.1GB. * Witness Printer took 122.03ms. Allocated memory is still 327.2MB. Free memory was 203.9MB in the beginning and 198.6MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 42 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 9.3s, OverallIterations: 12, TraceHistogramMax: 14, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 836 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 836 mSDsluCounter, 1876 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1253 mSDsCounter, 201 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1195 IncrementalHoareTripleChecker+Invalid, 1396 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 201 mSolverCounterUnsat, 623 mSDtfsCounter, 1195 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 284 GetRequests, 220 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=163occurred in iteration=10, InterpolantAutomatonStates: 69, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 12 MinimizatonAttempts, 326 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 5.6s InterpolantComputationTime, 729 NumberOfCodeBlocks, 729 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 717 ConstructedInterpolants, 0 QuantifiedInterpolants, 5154 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 1312/1312 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 87]: Loop Invariant Derived loop invariant: ((((((((((((0 != last_1_var_1_5) && (0 <= 0)) && ((0 < 0) || (((long long) 247 + last_1_var_1_11) < last_1_var_1_5))) && (last_1_var_1_5 <= 256)) && (0 <= k_loop)) && ((0 < 1) || (last_1_var_1_5 < ((long long) 249 + last_1_var_1_11)))) && ((5 + var_1_1) == 0)) && (0 == var_1_4)) && (256 == var_1_5)) && (8 == var_1_11)) || ((((((1 <= k_loop) && (((long long) 5 + var_1_11) == 0)) && ((5 + var_1_1) == 0)) && (0 == var_1_4)) && ((((var_1_5 + 8) == var_1_6) && ((8 + last_1_var_1_5) <= var_1_6)) || ((var_1_6 <= (7 + last_1_var_1_5)) && (var_1_5 == last_1_var_1_5)))) && ((last_1_var_1_11 != last_1_var_1_5) || ((65536 * ((last_1_var_1_11 + 4294967280) / 65536)) == (4294901749 + last_1_var_1_11))))) || ((((((((var_1_1 == last_1_var_1_5) && (1 <= k_loop)) && (0 <= 0)) && (last_1_var_1_5 <= 256)) && (var_1_5 == last_1_var_1_5)) && (last_1_var_1_11 != last_1_var_1_5)) && (0 != var_1_4)) && (var_1_1 == var_1_11))) - ProcedureContractResult [Line: 20]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Requires: ((((((((0 != last_1_var_1_5) && (0 <= 0)) && ((0 < 0) || (((long long) 247 + last_1_var_1_11) < last_1_var_1_5))) && (last_1_var_1_5 <= 256)) && ((0 < 1) || (last_1_var_1_5 < ((long long) 249 + last_1_var_1_11)))) && ((5 + var_1_1) == 0)) && (256 == var_1_5)) && (8 == var_1_11)) Ensures: ((((((((0 != last_1_var_1_5) && (0 <= 0)) && ((0 < 0) || (((long long) 247 + last_1_var_1_11) < last_1_var_1_5))) && (last_1_var_1_5 <= 256)) && ((0 < 1) || (last_1_var_1_5 < ((long long) 249 + last_1_var_1_11)))) && ((5 + var_1_1) == 0)) && (256 == var_1_5)) && (8 == var_1_11)) RESULT: Ultimate proved your program to be correct! [2024-10-11 11:25:34,061 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE