./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-86.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-86.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d32ec5a50162e1277d5b8e9598dff8d55e883556c57a5fb919336a65433989f7 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 23:55:05,224 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 23:55:05,307 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-12 23:55:05,311 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 23:55:05,312 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 23:55:05,331 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 23:55:05,332 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 23:55:05,332 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 23:55:05,333 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 23:55:05,333 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 23:55:05,333 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 23:55:05,334 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 23:55:05,334 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 23:55:05,335 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 23:55:05,335 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 23:55:05,335 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 23:55:05,336 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 23:55:05,336 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 23:55:05,336 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 23:55:05,337 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 23:55:05,337 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 23:55:05,338 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 23:55:05,338 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 23:55:05,338 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 23:55:05,339 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 23:55:05,339 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 23:55:05,339 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 23:55:05,340 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 23:55:05,340 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 23:55:05,340 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 23:55:05,341 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 23:55:05,341 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 23:55:05,341 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 23:55:05,342 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 23:55:05,342 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 23:55:05,343 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 23:55:05,343 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 23:55:05,343 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 23:55:05,343 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 23:55:05,344 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 23:55:05,344 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 23:55:05,345 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 23:55:05,345 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d32ec5a50162e1277d5b8e9598dff8d55e883556c57a5fb919336a65433989f7 [2024-10-12 23:55:05,632 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 23:55:05,659 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 23:55:05,662 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 23:55:05,665 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 23:55:05,665 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 23:55:05,666 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-86.i [2024-10-12 23:55:07,165 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 23:55:07,398 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 23:55:07,399 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-86.i [2024-10-12 23:55:07,411 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9fa3ee43e/366c70c1a5344b4c9068f1f93ef60135/FLAG2f07fafe2 [2024-10-12 23:55:07,745 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9fa3ee43e/366c70c1a5344b4c9068f1f93ef60135 [2024-10-12 23:55:07,747 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 23:55:07,748 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 23:55:07,750 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 23:55:07,751 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 23:55:07,757 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 23:55:07,758 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 11:55:07" (1/1) ... [2024-10-12 23:55:07,759 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22b0473c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:55:07, skipping insertion in model container [2024-10-12 23:55:07,759 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 11:55:07" (1/1) ... [2024-10-12 23:55:07,788 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 23:55:07,946 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-86.i[919,932] [2024-10-12 23:55:08,019 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 23:55:08,036 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 23:55:08,049 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-86.i[919,932] [2024-10-12 23:55:08,088 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 23:55:08,113 INFO L204 MainTranslator]: Completed translation [2024-10-12 23:55:08,114 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:55:08 WrapperNode [2024-10-12 23:55:08,114 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 23:55:08,115 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 23:55:08,116 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 23:55:08,116 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 23:55:08,124 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:55:08" (1/1) ... [2024-10-12 23:55:08,138 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:55:08" (1/1) ... [2024-10-12 23:55:08,185 INFO L138 Inliner]: procedures = 26, calls = 28, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 121 [2024-10-12 23:55:08,185 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 23:55:08,186 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 23:55:08,186 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 23:55:08,187 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 23:55:08,201 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:55:08" (1/1) ... [2024-10-12 23:55:08,201 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:55:08" (1/1) ... [2024-10-12 23:55:08,204 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:55:08" (1/1) ... [2024-10-12 23:55:08,232 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-12 23:55:08,232 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:55:08" (1/1) ... [2024-10-12 23:55:08,233 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:55:08" (1/1) ... [2024-10-12 23:55:08,244 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:55:08" (1/1) ... [2024-10-12 23:55:08,251 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:55:08" (1/1) ... [2024-10-12 23:55:08,257 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:55:08" (1/1) ... [2024-10-12 23:55:08,263 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:55:08" (1/1) ... [2024-10-12 23:55:08,271 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 23:55:08,273 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 23:55:08,273 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 23:55:08,273 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 23:55:08,274 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:55:08" (1/1) ... [2024-10-12 23:55:08,279 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 23:55:08,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 23:55:08,309 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-12 23:55:08,312 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-12 23:55:08,357 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 23:55:08,357 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-12 23:55:08,357 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-12 23:55:08,357 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 23:55:08,358 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 23:55:08,358 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 23:55:08,425 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 23:55:08,428 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 23:55:08,770 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-10-12 23:55:08,771 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 23:55:08,845 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 23:55:08,845 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-12 23:55:08,846 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 11:55:08 BoogieIcfgContainer [2024-10-12 23:55:08,846 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 23:55:08,861 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 23:55:08,861 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 23:55:08,866 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 23:55:08,866 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 11:55:07" (1/3) ... [2024-10-12 23:55:08,867 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21767ff0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 11:55:08, skipping insertion in model container [2024-10-12 23:55:08,867 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:55:08" (2/3) ... [2024-10-12 23:55:08,867 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21767ff0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 11:55:08, skipping insertion in model container [2024-10-12 23:55:08,867 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 11:55:08" (3/3) ... [2024-10-12 23:55:08,869 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_dependencies_file-86.i [2024-10-12 23:55:08,884 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 23:55:08,884 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-12 23:55:08,946 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 23:55:08,952 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;@310d620b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 23:55:08,953 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-12 23:55:08,957 INFO L276 IsEmpty]: Start isEmpty. Operand has 46 states, 28 states have (on average 1.5357142857142858) internal successors, (43), 29 states have internal predecessors, (43), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-12 23:55:08,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-10-12 23:55:08,974 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:55:08,975 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 23:55:08,975 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:55:08,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:55:08,982 INFO L85 PathProgramCache]: Analyzing trace with hash 550717282, now seen corresponding path program 1 times [2024-10-12 23:55:08,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 23:55:08,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254771132] [2024-10-12 23:55:08,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:55:08,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 23:55:09,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:55:09,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 23:55:09,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:55:09,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 23:55:09,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:55:09,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-12 23:55:09,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:55:09,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-12 23:55:09,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:55:09,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-12 23:55:09,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:55:09,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-12 23:55:09,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:55:09,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-12 23:55:09,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:55:09,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-12 23:55:09,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:55:09,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-12 23:55:09,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:55:09,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-12 23:55:09,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:55:09,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-12 23:55:09,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:55:09,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-12 23:55:09,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:55:09,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-12 23:55:09,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:55:09,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-12 23:55:09,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:55:09,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-12 23:55:09,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:55:09,381 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-12 23:55:09,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 23:55:09,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254771132] [2024-10-12 23:55:09,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254771132] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 23:55:09,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 23:55:09,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 23:55:09,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617686747] [2024-10-12 23:55:09,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 23:55:09,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-12 23:55:09,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 23:55:09,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-12 23:55:09,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-12 23:55:09,418 INFO L87 Difference]: Start difference. First operand has 46 states, 28 states have (on average 1.5357142857142858) internal successors, (43), 29 states have internal predecessors, (43), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-12 23:55:09,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 23:55:09,461 INFO L93 Difference]: Finished difference Result 89 states and 159 transitions. [2024-10-12 23:55:09,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-12 23:55:09,466 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 94 [2024-10-12 23:55:09,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 23:55:09,475 INFO L225 Difference]: With dead ends: 89 [2024-10-12 23:55:09,475 INFO L226 Difference]: Without dead ends: 44 [2024-10-12 23:55:09,479 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 47 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-12 23:55:09,485 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 23:55:09,486 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 64 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 23:55:09,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2024-10-12 23:55:09,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2024-10-12 23:55:09,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 27 states have (on average 1.3703703703703705) internal successors, (37), 27 states have internal predecessors, (37), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-12 23:55:09,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 67 transitions. [2024-10-12 23:55:09,527 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 67 transitions. Word has length 94 [2024-10-12 23:55:09,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 23:55:09,527 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 67 transitions. [2024-10-12 23:55:09,528 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-12 23:55:09,529 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 67 transitions. [2024-10-12 23:55:09,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-10-12 23:55:09,533 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:55:09,533 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 23:55:09,534 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 23:55:09,534 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:55:09,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:55:09,535 INFO L85 PathProgramCache]: Analyzing trace with hash -851374044, now seen corresponding path program 1 times [2024-10-12 23:55:09,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 23:55:09,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491130110] [2024-10-12 23:55:09,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:55:09,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 23:55:09,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:55:09,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 23:55:09,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:55:09,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 23:55:09,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:55:09,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-12 23:55:09,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:55:09,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-12 23:55:09,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:55:09,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-12 23:55:09,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:55:09,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-12 23:55:09,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:55:09,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-12 23:55:09,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:55:09,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-12 23:55:09,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:55:09,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-12 23:55:09,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:55:09,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-12 23:55:09,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:55:09,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-12 23:55:09,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:55:09,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-12 23:55:09,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:55:09,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-12 23:55:09,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:55:09,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-12 23:55:09,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:55:09,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-12 23:55:10,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:55:10,009 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-12 23:55:10,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 23:55:10,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491130110] [2024-10-12 23:55:10,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491130110] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 23:55:10,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 23:55:10,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 23:55:10,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54768268] [2024-10-12 23:55:10,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 23:55:10,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 23:55:10,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 23:55:10,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 23:55:10,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-12 23:55:10,018 INFO L87 Difference]: Start difference. First operand 44 states and 67 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-12 23:55:10,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 23:55:10,243 INFO L93 Difference]: Finished difference Result 131 states and 200 transitions. [2024-10-12 23:55:10,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 23:55:10,245 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 94 [2024-10-12 23:55:10,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 23:55:10,247 INFO L225 Difference]: With dead ends: 131 [2024-10-12 23:55:10,247 INFO L226 Difference]: Without dead ends: 88 [2024-10-12 23:55:10,248 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-12 23:55:10,250 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 54 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 23:55:10,250 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 242 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 23:55:10,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-10-12 23:55:10,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 75. [2024-10-12 23:55:10,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 42 states have (on average 1.3095238095238095) internal successors, (55), 42 states have internal predecessors, (55), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-12 23:55:10,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 115 transitions. [2024-10-12 23:55:10,277 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 115 transitions. Word has length 94 [2024-10-12 23:55:10,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 23:55:10,278 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 115 transitions. [2024-10-12 23:55:10,279 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-12 23:55:10,279 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 115 transitions. [2024-10-12 23:55:10,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-10-12 23:55:10,281 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:55:10,281 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 23:55:10,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 23:55:10,282 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:55:10,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:55:10,283 INFO L85 PathProgramCache]: Analyzing trace with hash -1660720670, now seen corresponding path program 1 times [2024-10-12 23:55:10,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 23:55:10,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914672807] [2024-10-12 23:55:10,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:55:10,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 23:55:10,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:55:19,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 23:55:19,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:55:19,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 23:55:19,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:55:19,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-12 23:55:19,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:55:19,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-12 23:55:19,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:55:19,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-12 23:55:19,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:55:19,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-12 23:55:19,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:55:19,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-12 23:55:19,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:55:19,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-12 23:55:19,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:55:19,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-12 23:55:19,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:55:19,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-12 23:55:19,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:55:19,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-12 23:55:19,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:55:19,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-12 23:55:19,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:55:19,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-12 23:55:19,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:55:19,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-12 23:55:19,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:55:19,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-12 23:55:19,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:55:19,714 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-12 23:55:19,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 23:55:19,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914672807] [2024-10-12 23:55:19,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914672807] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 23:55:19,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 23:55:19,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-12 23:55:19,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224818467] [2024-10-12 23:55:19,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 23:55:19,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-12 23:55:19,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 23:55:19,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-12 23:55:19,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-10-12 23:55:19,718 INFO L87 Difference]: Start difference. First operand 75 states and 115 transitions. Second operand has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-12 23:55:23,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 23:55:23,739 INFO L93 Difference]: Finished difference Result 173 states and 256 transitions. [2024-10-12 23:55:23,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-12 23:55:23,741 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 94 [2024-10-12 23:55:23,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 23:55:23,744 INFO L225 Difference]: With dead ends: 173 [2024-10-12 23:55:23,744 INFO L226 Difference]: Without dead ends: 130 [2024-10-12 23:55:23,745 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=79, Invalid=131, Unknown=0, NotChecked=0, Total=210 [2024-10-12 23:55:23,746 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 98 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-12 23:55:23,747 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 230 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-12 23:55:23,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2024-10-12 23:55:23,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 91. [2024-10-12 23:55:23,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 58 states have (on average 1.3448275862068966) internal successors, (78), 58 states have internal predecessors, (78), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-12 23:55:23,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 138 transitions. [2024-10-12 23:55:23,763 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 138 transitions. Word has length 94 [2024-10-12 23:55:23,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 23:55:23,763 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 138 transitions. [2024-10-12 23:55:23,764 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-12 23:55:23,764 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 138 transitions. [2024-10-12 23:55:23,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-10-12 23:55:23,766 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:55:23,766 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 23:55:23,767 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-12 23:55:23,767 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:55:23,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:55:23,767 INFO L85 PathProgramCache]: Analyzing trace with hash -980662300, now seen corresponding path program 1 times [2024-10-12 23:55:23,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 23:55:23,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924680968] [2024-10-12 23:55:23,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:55:23,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 23:55:23,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:55:23,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 23:55:23,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:55:23,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 23:55:23,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:55:23,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-12 23:55:23,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:55:23,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-12 23:55:23,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:55:23,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-12 23:55:23,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:55:23,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-12 23:55:23,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:55:23,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-12 23:55:23,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:55:23,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-12 23:55:23,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:55:23,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-12 23:55:23,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:55:23,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-12 23:55:23,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:55:23,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-12 23:55:23,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:55:23,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-12 23:55:23,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:55:23,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-12 23:55:23,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:55:23,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-12 23:55:23,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:55:23,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-12 23:55:23,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:55:23,873 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-12 23:55:23,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 23:55:23,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924680968] [2024-10-12 23:55:23,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924680968] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 23:55:23,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 23:55:23,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 23:55:23,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125993535] [2024-10-12 23:55:23,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 23:55:23,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 23:55:23,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 23:55:23,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 23:55:23,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 23:55:23,876 INFO L87 Difference]: Start difference. First operand 91 states and 138 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-12 23:55:23,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 23:55:23,920 INFO L93 Difference]: Finished difference Result 193 states and 292 transitions. [2024-10-12 23:55:23,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 23:55:23,921 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 94 [2024-10-12 23:55:23,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 23:55:23,923 INFO L225 Difference]: With dead ends: 193 [2024-10-12 23:55:23,923 INFO L226 Difference]: Without dead ends: 135 [2024-10-12 23:55:23,924 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 32 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-12 23:55:23,925 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 59 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 23:55:23,928 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 128 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 23:55:23,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2024-10-12 23:55:23,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 133. [2024-10-12 23:55:23,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 84 states have (on average 1.3095238095238095) internal successors, (110), 84 states have internal predecessors, (110), 45 states have call successors, (45), 3 states have call predecessors, (45), 3 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2024-10-12 23:55:23,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 200 transitions. [2024-10-12 23:55:23,954 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 200 transitions. Word has length 94 [2024-10-12 23:55:23,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 23:55:23,955 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 200 transitions. [2024-10-12 23:55:23,955 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-12 23:55:23,959 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 200 transitions. [2024-10-12 23:55:23,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-10-12 23:55:23,961 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:55:23,961 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 23:55:23,961 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-12 23:55:23,961 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:55:23,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:55:23,961 INFO L85 PathProgramCache]: Analyzing trace with hash 57202437, now seen corresponding path program 1 times [2024-10-12 23:55:23,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 23:55:23,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866251122] [2024-10-12 23:55:23,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:55:23,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 23:55:24,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:55:31,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 23:55:31,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:55:31,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 23:55:31,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:55:31,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-12 23:55:31,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:55:31,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-12 23:55:31,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:55:31,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-12 23:55:31,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:55:31,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-12 23:55:31,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:55:31,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-12 23:55:31,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:55:31,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-12 23:55:31,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:55:31,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-12 23:55:31,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:55:31,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-12 23:55:31,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:55:31,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-12 23:55:31,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:55:31,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-12 23:55:31,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:55:31,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-12 23:55:31,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:55:31,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-12 23:55:31,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:55:31,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-12 23:55:31,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:55:31,212 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-12 23:55:31,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 23:55:31,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866251122] [2024-10-12 23:55:31,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [866251122] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 23:55:31,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 23:55:31,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-12 23:55:31,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289471721] [2024-10-12 23:55:31,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 23:55:31,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-12 23:55:31,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 23:55:31,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-12 23:55:31,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2024-10-12 23:55:31,218 INFO L87 Difference]: Start difference. First operand 133 states and 200 transitions. Second operand has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-12 23:55:35,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 23:55:35,346 INFO L93 Difference]: Finished difference Result 172 states and 244 transitions. [2024-10-12 23:55:35,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-12 23:55:35,347 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 95 [2024-10-12 23:55:35,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 23:55:35,349 INFO L225 Difference]: With dead ends: 172 [2024-10-12 23:55:35,349 INFO L226 Difference]: Without dead ends: 170 [2024-10-12 23:55:35,349 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=130, Invalid=212, Unknown=0, NotChecked=0, Total=342 [2024-10-12 23:55:35,351 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 93 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-12 23:55:35,352 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 216 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-12 23:55:35,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2024-10-12 23:55:35,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 134. [2024-10-12 23:55:35,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 85 states have (on average 1.3058823529411765) internal successors, (111), 85 states have internal predecessors, (111), 45 states have call successors, (45), 3 states have call predecessors, (45), 3 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2024-10-12 23:55:35,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 201 transitions. [2024-10-12 23:55:35,382 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 201 transitions. Word has length 95 [2024-10-12 23:55:35,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 23:55:35,383 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 201 transitions. [2024-10-12 23:55:35,383 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-12 23:55:35,383 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 201 transitions. [2024-10-12 23:55:35,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-10-12 23:55:35,385 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:55:35,385 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 23:55:35,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-12 23:55:35,385 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:55:35,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:55:35,386 INFO L85 PathProgramCache]: Analyzing trace with hash 108770658, now seen corresponding path program 1 times [2024-10-12 23:55:35,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 23:55:35,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043230360] [2024-10-12 23:55:35,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:55:35,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 23:55:35,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:55:40,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 23:55:40,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:55:40,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 23:55:40,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:55:40,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-12 23:55:40,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:55:40,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-12 23:55:40,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:55:40,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-12 23:55:40,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:55:40,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-12 23:55:40,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:55:40,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-12 23:55:40,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:55:40,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-12 23:55:40,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:55:40,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-12 23:55:40,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:55:40,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-12 23:55:40,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:55:40,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-12 23:55:40,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:55:40,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-12 23:55:40,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:55:40,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-12 23:55:40,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:55:40,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-12 23:55:40,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:55:40,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-12 23:55:40,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:55:40,846 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-12 23:55:40,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 23:55:40,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043230360] [2024-10-12 23:55:40,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043230360] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 23:55:40,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 23:55:40,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-12 23:55:40,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053597546] [2024-10-12 23:55:40,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 23:55:40,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-12 23:55:40,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 23:55:40,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-12 23:55:40,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-10-12 23:55:40,853 INFO L87 Difference]: Start difference. First operand 134 states and 201 transitions. Second operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-12 23:55:45,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 23:55:45,780 INFO L93 Difference]: Finished difference Result 172 states and 244 transitions. [2024-10-12 23:55:45,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-12 23:55:45,781 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 95 [2024-10-12 23:55:45,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 23:55:45,783 INFO L225 Difference]: With dead ends: 172 [2024-10-12 23:55:45,783 INFO L226 Difference]: Without dead ends: 170 [2024-10-12 23:55:45,783 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=108, Invalid=198, Unknown=0, NotChecked=0, Total=306 [2024-10-12 23:55:45,784 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 154 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 381 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 382 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-10-12 23:55:45,786 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 152 Invalid, 382 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 381 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-10-12 23:55:45,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2024-10-12 23:55:45,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 136. [2024-10-12 23:55:45,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 87 states have (on average 1.3103448275862069) internal successors, (114), 87 states have internal predecessors, (114), 45 states have call successors, (45), 3 states have call predecessors, (45), 3 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2024-10-12 23:55:45,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 204 transitions. [2024-10-12 23:55:45,825 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 204 transitions. Word has length 95 [2024-10-12 23:55:45,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 23:55:45,826 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 204 transitions. [2024-10-12 23:55:45,826 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-12 23:55:45,826 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 204 transitions. [2024-10-12 23:55:45,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-10-12 23:55:45,828 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:55:45,829 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 23:55:45,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-12 23:55:45,833 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:55:45,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:55:45,833 INFO L85 PathProgramCache]: Analyzing trace with hash 885961279, now seen corresponding path program 1 times [2024-10-12 23:55:45,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 23:55:45,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979480297] [2024-10-12 23:55:45,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:55:45,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 23:55:45,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:55:51,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 23:55:51,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:55:51,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 23:55:51,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:55:51,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-12 23:55:51,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:55:51,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-12 23:55:51,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:55:51,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-12 23:55:51,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:55:51,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-12 23:55:51,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:55:51,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-12 23:55:51,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:55:51,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-12 23:55:51,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:55:51,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-12 23:55:51,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:55:51,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-12 23:55:51,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:55:51,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-12 23:55:51,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:55:51,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-12 23:55:51,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:55:51,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-12 23:55:51,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:55:51,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-12 23:55:51,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:55:51,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-12 23:55:51,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:55:51,770 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-12 23:55:51,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 23:55:51,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979480297] [2024-10-12 23:55:51,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979480297] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 23:55:51,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 23:55:51,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-12 23:55:51,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935385535] [2024-10-12 23:55:51,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 23:55:51,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-12 23:55:51,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 23:55:51,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-12 23:55:51,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2024-10-12 23:55:51,773 INFO L87 Difference]: Start difference. First operand 136 states and 204 transitions. Second operand has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-12 23:55:53,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 23:55:53,648 INFO L93 Difference]: Finished difference Result 184 states and 260 transitions. [2024-10-12 23:55:53,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-12 23:55:53,648 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 95 [2024-10-12 23:55:53,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 23:55:53,650 INFO L225 Difference]: With dead ends: 184 [2024-10-12 23:55:53,650 INFO L226 Difference]: Without dead ends: 182 [2024-10-12 23:55:53,650 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2024-10-12 23:55:53,651 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 83 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-12 23:55:53,651 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 193 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-12 23:55:53,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2024-10-12 23:55:53,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 145. [2024-10-12 23:55:53,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 96 states have (on average 1.3229166666666667) internal successors, (127), 96 states have internal predecessors, (127), 45 states have call successors, (45), 3 states have call predecessors, (45), 3 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2024-10-12 23:55:53,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 217 transitions. [2024-10-12 23:55:53,668 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 217 transitions. Word has length 95 [2024-10-12 23:55:53,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 23:55:53,668 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 217 transitions. [2024-10-12 23:55:53,669 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-12 23:55:53,669 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 217 transitions. [2024-10-12 23:55:53,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-10-12 23:55:53,670 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:55:53,670 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 23:55:53,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-12 23:55:53,670 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:55:53,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:55:53,671 INFO L85 PathProgramCache]: Analyzing trace with hash -2094822518, now seen corresponding path program 1 times [2024-10-12 23:55:53,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 23:55:53,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906859356] [2024-10-12 23:55:53,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:55:53,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 23:55:53,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:55:53,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 23:55:53,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:55:53,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 23:55:53,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:55:53,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-12 23:55:53,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:55:53,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-12 23:55:53,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:55:53,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-12 23:55:53,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:55:53,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-12 23:55:53,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:55:53,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-12 23:55:53,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:55:53,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-12 23:55:53,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:55:53,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-12 23:55:53,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:55:53,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-12 23:55:53,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:55:53,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-12 23:55:53,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:55:53,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-12 23:55:53,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:55:53,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-12 23:55:53,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:55:53,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-12 23:55:53,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:55:53,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-12 23:55:53,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:55:53,841 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-12 23:55:53,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 23:55:53,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906859356] [2024-10-12 23:55:53,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906859356] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 23:55:53,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 23:55:53,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 23:55:53,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291770193] [2024-10-12 23:55:53,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 23:55:53,842 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 23:55:53,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 23:55:53,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 23:55:53,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 23:55:53,844 INFO L87 Difference]: Start difference. First operand 145 states and 217 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-12 23:55:53,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 23:55:53,937 INFO L93 Difference]: Finished difference Result 328 states and 485 transitions. [2024-10-12 23:55:53,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 23:55:53,938 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 95 [2024-10-12 23:55:53,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 23:55:53,940 INFO L225 Difference]: With dead ends: 328 [2024-10-12 23:55:53,941 INFO L226 Difference]: Without dead ends: 217 [2024-10-12 23:55:53,943 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 33 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-12 23:55:53,945 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 58 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 23:55:53,945 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 200 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 23:55:53,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2024-10-12 23:55:53,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 193. [2024-10-12 23:55:53,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 128 states have (on average 1.3125) internal successors, (168), 128 states have internal predecessors, (168), 60 states have call successors, (60), 4 states have call predecessors, (60), 4 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-10-12 23:55:53,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 288 transitions. [2024-10-12 23:55:53,966 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 288 transitions. Word has length 95 [2024-10-12 23:55:53,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 23:55:53,967 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 288 transitions. [2024-10-12 23:55:53,968 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-12 23:55:53,968 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 288 transitions. [2024-10-12 23:55:53,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-10-12 23:55:53,969 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:55:53,969 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 23:55:53,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-12 23:55:53,970 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:55:53,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:55:53,970 INFO L85 PathProgramCache]: Analyzing trace with hash -923141243, now seen corresponding path program 1 times [2024-10-12 23:55:53,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 23:55:53,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648731823] [2024-10-12 23:55:53,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:55:53,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 23:55:54,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:56:01,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 23:56:01,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:56:01,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 23:56:01,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:56:01,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-12 23:56:01,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:56:01,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-12 23:56:01,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:56:01,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-12 23:56:01,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:56:01,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-12 23:56:01,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:56:01,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-12 23:56:01,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:56:01,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-12 23:56:01,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:56:01,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-12 23:56:01,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:56:01,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-12 23:56:01,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:56:01,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-12 23:56:01,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:56:01,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-12 23:56:01,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:56:01,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-12 23:56:01,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:56:01,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-12 23:56:01,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:56:01,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-12 23:56:01,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:56:01,417 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-12 23:56:01,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 23:56:01,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648731823] [2024-10-12 23:56:01,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648731823] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 23:56:01,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 23:56:01,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-12 23:56:01,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283248966] [2024-10-12 23:56:01,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 23:56:01,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-12 23:56:01,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 23:56:01,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-12 23:56:01,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2024-10-12 23:56:01,420 INFO L87 Difference]: Start difference. First operand 193 states and 288 transitions. Second operand has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-12 23:56:05,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 23:56:05,667 INFO L93 Difference]: Finished difference Result 236 states and 338 transitions. [2024-10-12 23:56:05,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-12 23:56:05,668 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 96 [2024-10-12 23:56:05,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 23:56:05,670 INFO L225 Difference]: With dead ends: 236 [2024-10-12 23:56:05,670 INFO L226 Difference]: Without dead ends: 234 [2024-10-12 23:56:05,671 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=160, Invalid=260, Unknown=0, NotChecked=0, Total=420 [2024-10-12 23:56:05,671 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 69 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-12 23:56:05,672 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 197 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-12 23:56:05,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2024-10-12 23:56:05,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 192. [2024-10-12 23:56:05,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 127 states have (on average 1.3070866141732282) internal successors, (166), 127 states have internal predecessors, (166), 60 states have call successors, (60), 4 states have call predecessors, (60), 4 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-10-12 23:56:05,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 286 transitions. [2024-10-12 23:56:05,690 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 286 transitions. Word has length 96 [2024-10-12 23:56:05,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 23:56:05,690 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 286 transitions. [2024-10-12 23:56:05,690 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-12 23:56:05,691 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 286 transitions. [2024-10-12 23:56:05,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-10-12 23:56:05,692 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:56:05,692 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 23:56:05,692 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-12 23:56:05,692 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:56:05,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:56:05,693 INFO L85 PathProgramCache]: Analyzing trace with hash 1694991110, now seen corresponding path program 1 times [2024-10-12 23:56:05,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 23:56:05,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081352521] [2024-10-12 23:56:05,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:56:05,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 23:56:05,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:56:12,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 23:56:12,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:56:12,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 23:56:12,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:56:12,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-12 23:56:12,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:56:12,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-12 23:56:12,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:56:12,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-12 23:56:12,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:56:12,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-12 23:56:12,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:56:12,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-12 23:56:12,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:56:12,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-12 23:56:12,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:56:12,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-12 23:56:12,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:56:12,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-12 23:56:12,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:56:12,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-12 23:56:12,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:56:12,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-12 23:56:12,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:56:12,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-12 23:56:12,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:56:12,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-12 23:56:12,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:56:12,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-12 23:56:12,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:56:12,695 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-12 23:56:12,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 23:56:12,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081352521] [2024-10-12 23:56:12,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081352521] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 23:56:12,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 23:56:12,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-12 23:56:12,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105539813] [2024-10-12 23:56:12,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 23:56:12,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-12 23:56:12,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 23:56:12,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-12 23:56:12,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2024-10-12 23:56:12,697 INFO L87 Difference]: Start difference. First operand 192 states and 286 transitions. Second operand has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-12 23:56:17,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 23:56:17,162 INFO L93 Difference]: Finished difference Result 254 states and 359 transitions. [2024-10-12 23:56:17,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-12 23:56:17,164 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 96 [2024-10-12 23:56:17,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 23:56:17,166 INFO L225 Difference]: With dead ends: 254 [2024-10-12 23:56:17,166 INFO L226 Difference]: Without dead ends: 252 [2024-10-12 23:56:17,166 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=79, Invalid=103, Unknown=0, NotChecked=0, Total=182 [2024-10-12 23:56:17,167 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 82 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-12 23:56:17,169 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 175 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-12 23:56:17,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2024-10-12 23:56:17,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 194. [2024-10-12 23:56:17,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 129 states have (on average 1.302325581395349) internal successors, (168), 129 states have internal predecessors, (168), 60 states have call successors, (60), 4 states have call predecessors, (60), 4 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-10-12 23:56:17,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 288 transitions. [2024-10-12 23:56:17,197 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 288 transitions. Word has length 96 [2024-10-12 23:56:17,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 23:56:17,198 INFO L471 AbstractCegarLoop]: Abstraction has 194 states and 288 transitions. [2024-10-12 23:56:17,198 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-12 23:56:17,198 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 288 transitions. [2024-10-12 23:56:17,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-10-12 23:56:17,199 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:56:17,199 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 23:56:17,199 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-12 23:56:17,199 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:56:17,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:56:17,200 INFO L85 PathProgramCache]: Analyzing trace with hash 1746499749, now seen corresponding path program 1 times [2024-10-12 23:56:17,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 23:56:17,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917894414] [2024-10-12 23:56:17,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:56:17,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 23:56:17,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:56:23,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 23:56:23,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:56:23,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 23:56:23,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:56:23,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-12 23:56:23,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:56:23,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-12 23:56:23,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:56:23,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-12 23:56:23,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:56:23,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-12 23:56:23,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:56:23,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-12 23:56:23,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:56:23,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-12 23:56:23,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:56:23,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-12 23:56:23,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:56:23,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-12 23:56:23,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:56:23,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-12 23:56:23,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:56:23,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-12 23:56:23,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:56:23,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-12 23:56:23,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:56:23,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-12 23:56:23,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:56:23,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-12 23:56:23,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:56:23,539 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-12 23:56:23,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 23:56:23,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917894414] [2024-10-12 23:56:23,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917894414] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 23:56:23,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 23:56:23,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-12 23:56:23,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668297923] [2024-10-12 23:56:23,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 23:56:23,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-12 23:56:23,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 23:56:23,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-12 23:56:23,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2024-10-12 23:56:23,541 INFO L87 Difference]: Start difference. First operand 194 states and 288 transitions. Second operand has 12 states, 12 states have (on average 2.0) internal successors, (24), 12 states have internal predecessors, (24), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-12 23:56:27,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 23:56:27,777 INFO L93 Difference]: Finished difference Result 254 states and 359 transitions. [2024-10-12 23:56:27,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-12 23:56:27,778 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.0) internal successors, (24), 12 states have internal predecessors, (24), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 96 [2024-10-12 23:56:27,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 23:56:27,782 INFO L225 Difference]: With dead ends: 254 [2024-10-12 23:56:27,782 INFO L226 Difference]: Without dead ends: 252 [2024-10-12 23:56:27,782 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=79, Invalid=131, Unknown=0, NotChecked=0, Total=210 [2024-10-12 23:56:27,783 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 159 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-12 23:56:27,783 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 138 Invalid, 277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 275 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-10-12 23:56:27,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2024-10-12 23:56:27,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 198. [2024-10-12 23:56:27,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 133 states have (on average 1.3082706766917294) internal successors, (174), 133 states have internal predecessors, (174), 60 states have call successors, (60), 4 states have call predecessors, (60), 4 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-10-12 23:56:27,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 294 transitions. [2024-10-12 23:56:27,804 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 294 transitions. Word has length 96 [2024-10-12 23:56:27,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 23:56:27,805 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 294 transitions. [2024-10-12 23:56:27,805 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.0) internal successors, (24), 12 states have internal predecessors, (24), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-12 23:56:27,805 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 294 transitions. [2024-10-12 23:56:27,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-10-12 23:56:27,806 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:56:27,806 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 23:56:27,807 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-12 23:56:27,807 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:56:27,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:56:27,807 INFO L85 PathProgramCache]: Analyzing trace with hash 1014770457, now seen corresponding path program 1 times [2024-10-12 23:56:27,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 23:56:27,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111029214] [2024-10-12 23:56:27,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:56:27,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 23:56:27,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat