./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_fillercode_fillercodesize_ps-cn-10_file-34.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_fillercode_fillercodesize_ps-cn-10_file-34.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 a356de088718b875f6f2396a50433e83aa6fe2b03aff9fb8f00ce9106af95d3b --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 00:44:50,331 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 00:44:50,412 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 00:44:50,416 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 00:44:50,418 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 00:44:50,460 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 00:44:50,461 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 00:44:50,461 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 00:44:50,462 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 00:44:50,463 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 00:44:50,463 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 00:44:50,463 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 00:44:50,464 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 00:44:50,465 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 00:44:50,466 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 00:44:50,467 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 00:44:50,467 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 00:44:50,467 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 00:44:50,468 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 00:44:50,468 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 00:44:50,468 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 00:44:50,472 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 00:44:50,472 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 00:44:50,472 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 00:44:50,472 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 00:44:50,473 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 00:44:50,473 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 00:44:50,473 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 00:44:50,473 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 00:44:50,473 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 00:44:50,473 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 00:44:50,474 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 00:44:50,474 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 00:44:50,474 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 00:44:50,474 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 00:44:50,474 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 00:44:50,475 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 00:44:50,475 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 00:44:50,475 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 00:44:50,477 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 00:44:50,477 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 00:44:50,478 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 00:44:50,478 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 -> a356de088718b875f6f2396a50433e83aa6fe2b03aff9fb8f00ce9106af95d3b [2024-10-13 00:44:50,725 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 00:44:50,746 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 00:44:50,750 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 00:44:50,751 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 00:44:50,751 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 00:44:50,752 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-34.i [2024-10-13 00:44:52,180 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 00:44:52,384 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 00:44:52,385 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-34.i [2024-10-13 00:44:52,395 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d6deaf2aa/6993b78e3d8f4b29b7df0ce35604a7e7/FLAG11764db6b [2024-10-13 00:44:52,409 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d6deaf2aa/6993b78e3d8f4b29b7df0ce35604a7e7 [2024-10-13 00:44:52,411 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 00:44:52,412 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 00:44:52,413 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 00:44:52,413 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 00:44:52,420 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 00:44:52,421 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:44:52" (1/1) ... [2024-10-13 00:44:52,422 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7adbc8f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:44:52, skipping insertion in model container [2024-10-13 00:44:52,422 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:44:52" (1/1) ... [2024-10-13 00:44:52,454 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 00:44:52,618 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_fillercode_fillercodesize_ps-cn-10_file-34.i[915,928] [2024-10-13 00:44:52,691 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 00:44:52,702 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 00:44:52,712 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_fillercode_fillercodesize_ps-cn-10_file-34.i[915,928] [2024-10-13 00:44:52,740 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 00:44:52,757 INFO L204 MainTranslator]: Completed translation [2024-10-13 00:44:52,758 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:44:52 WrapperNode [2024-10-13 00:44:52,758 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 00:44:52,759 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 00:44:52,759 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 00:44:52,760 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 00:44:52,766 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:44:52" (1/1) ... [2024-10-13 00:44:52,796 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:44:52" (1/1) ... [2024-10-13 00:44:52,873 INFO L138 Inliner]: procedures = 26, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 224 [2024-10-13 00:44:52,877 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 00:44:52,878 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 00:44:52,879 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 00:44:52,879 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 00:44:52,891 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:44:52" (1/1) ... [2024-10-13 00:44:52,892 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:44:52" (1/1) ... [2024-10-13 00:44:52,895 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:44:52" (1/1) ... [2024-10-13 00:44:52,912 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-13 00:44:52,912 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:44:52" (1/1) ... [2024-10-13 00:44:52,912 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:44:52" (1/1) ... [2024-10-13 00:44:52,921 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:44:52" (1/1) ... [2024-10-13 00:44:52,924 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:44:52" (1/1) ... [2024-10-13 00:44:52,926 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:44:52" (1/1) ... [2024-10-13 00:44:52,928 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:44:52" (1/1) ... [2024-10-13 00:44:52,933 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 00:44:52,934 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 00:44:52,936 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 00:44:52,936 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 00:44:52,937 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:44:52" (1/1) ... [2024-10-13 00:44:52,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 00:44:52,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 00:44:52,983 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 00:44:52,990 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 00:44:53,033 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 00:44:53,034 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 00:44:53,035 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 00:44:53,035 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 00:44:53,035 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 00:44:53,035 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 00:44:53,130 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 00:44:53,132 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 00:44:53,526 INFO L? ?]: Removed 30 outVars from TransFormulas that were not future-live. [2024-10-13 00:44:53,526 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 00:44:53,561 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 00:44:53,561 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 00:44:53,562 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:44:53 BoogieIcfgContainer [2024-10-13 00:44:53,562 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 00:44:53,566 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 00:44:53,566 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 00:44:53,570 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 00:44:53,570 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 12:44:52" (1/3) ... [2024-10-13 00:44:53,572 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@485e1404 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 12:44:53, skipping insertion in model container [2024-10-13 00:44:53,572 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:44:52" (2/3) ... [2024-10-13 00:44:53,572 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@485e1404 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 12:44:53, skipping insertion in model container [2024-10-13 00:44:53,573 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:44:53" (3/3) ... [2024-10-13 00:44:53,574 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-34.i [2024-10-13 00:44:53,588 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 00:44:53,589 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 00:44:53,651 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 00:44:53,657 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;@602f5182, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 00:44:53,657 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 00:44:53,661 INFO L276 IsEmpty]: Start isEmpty. Operand has 80 states, 55 states have (on average 1.490909090909091) internal successors, (82), 56 states have internal predecessors, (82), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-13 00:44:53,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-10-13 00:44:53,678 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 00:44:53,679 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 00:44:53,680 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 00:44:53,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 00:44:53,685 INFO L85 PathProgramCache]: Analyzing trace with hash -1717883666, now seen corresponding path program 1 times [2024-10-13 00:44:53,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 00:44:53,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881692983] [2024-10-13 00:44:53,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:44:53,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 00:44:53,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:44:53,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 00:44:53,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:44:53,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 00:44:53,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:44:53,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-13 00:44:53,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:44:54,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 00:44:54,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:44:54,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-13 00:44:54,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:44:54,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 00:44:54,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:44:54,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-13 00:44:54,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:44:54,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 00:44:54,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:44:54,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-13 00:44:54,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:44:54,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 00:44:54,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:44:54,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 00:44:54,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:44:54,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 00:44:54,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:44:54,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-13 00:44:54,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:44:54,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 00:44:54,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:44:54,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 00:44:54,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:44:54,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 00:44:54,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:44:54,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 00:44:54,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:44:54,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 00:44:54,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:44:54,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 00:44:54,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:44:54,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 00:44:54,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:44:54,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 00:44:54,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:44:54,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-13 00:44:54,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:44:54,209 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-10-13 00:44:54,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 00:44:54,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881692983] [2024-10-13 00:44:54,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881692983] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 00:44:54,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 00:44:54,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 00:44:54,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609200917] [2024-10-13 00:44:54,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 00:44:54,219 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 00:44:54,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 00:44:54,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 00:44:54,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 00:44:54,251 INFO L87 Difference]: Start difference. First operand has 80 states, 55 states have (on average 1.490909090909091) internal successors, (82), 56 states have internal predecessors, (82), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2024-10-13 00:44:54,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 00:44:54,302 INFO L93 Difference]: Finished difference Result 157 states and 272 transitions. [2024-10-13 00:44:54,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 00:44:54,305 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) Word has length 141 [2024-10-13 00:44:54,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 00:44:54,314 INFO L225 Difference]: With dead ends: 157 [2024-10-13 00:44:54,314 INFO L226 Difference]: Without dead ends: 78 [2024-10-13 00:44:54,319 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 00:44:54,325 INFO L432 NwaCegarLoop]: 118 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, 118 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 00:44:54,326 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 118 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 00:44:54,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-10-13 00:44:54,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2024-10-13 00:44:54,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 54 states have (on average 1.4259259259259258) internal successors, (77), 54 states have internal predecessors, (77), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-13 00:44:54,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 121 transitions. [2024-10-13 00:44:54,381 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 121 transitions. Word has length 141 [2024-10-13 00:44:54,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 00:44:54,383 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 121 transitions. [2024-10-13 00:44:54,383 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2024-10-13 00:44:54,383 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 121 transitions. [2024-10-13 00:44:54,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-10-13 00:44:54,386 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 00:44:54,386 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 00:44:54,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 00:44:54,387 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 00:44:54,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 00:44:54,391 INFO L85 PathProgramCache]: Analyzing trace with hash -998555542, now seen corresponding path program 1 times [2024-10-13 00:44:54,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 00:44:54,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357537698] [2024-10-13 00:44:54,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:44:54,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 00:44:54,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:44:54,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 00:44:54,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:44:54,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 00:44:54,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:44:54,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-13 00:44:54,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:44:54,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 00:44:54,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:44:54,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-13 00:44:55,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:44:55,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 00:44:55,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:44:55,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-13 00:44:55,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:44:55,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 00:44:55,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:44:55,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-13 00:44:55,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:44:55,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 00:44:55,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:44:55,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 00:44:55,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:44:55,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 00:44:55,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:44:55,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-13 00:44:55,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:44:55,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 00:44:55,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:44:55,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 00:44:55,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:44:55,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 00:44:55,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:44:55,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 00:44:55,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:44:55,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 00:44:55,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:44:55,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 00:44:55,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:44:55,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 00:44:55,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:44:55,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 00:44:55,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:44:55,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-13 00:44:55,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:44:55,143 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-10-13 00:44:55,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 00:44:55,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357537698] [2024-10-13 00:44:55,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357537698] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 00:44:55,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 00:44:55,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 00:44:55,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566601857] [2024-10-13 00:44:55,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 00:44:55,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 00:44:55,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 00:44:55,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 00:44:55,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 00:44:55,149 INFO L87 Difference]: Start difference. First operand 78 states and 121 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-13 00:44:55,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 00:44:55,368 INFO L93 Difference]: Finished difference Result 261 states and 405 transitions. [2024-10-13 00:44:55,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 00:44:55,369 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 141 [2024-10-13 00:44:55,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 00:44:55,377 INFO L225 Difference]: With dead ends: 261 [2024-10-13 00:44:55,377 INFO L226 Difference]: Without dead ends: 184 [2024-10-13 00:44:55,378 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 47 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-13 00:44:55,379 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 130 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 00:44:55,380 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 381 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 00:44:55,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2024-10-13 00:44:55,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 155. [2024-10-13 00:44:55,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 108 states have (on average 1.4166666666666667) internal successors, (153), 108 states have internal predecessors, (153), 44 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2024-10-13 00:44:55,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 241 transitions. [2024-10-13 00:44:55,421 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 241 transitions. Word has length 141 [2024-10-13 00:44:55,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 00:44:55,422 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 241 transitions. [2024-10-13 00:44:55,422 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-13 00:44:55,423 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 241 transitions. [2024-10-13 00:44:55,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-10-13 00:44:55,427 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 00:44:55,427 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 00:44:55,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 00:44:55,428 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 00:44:55,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 00:44:55,429 INFO L85 PathProgramCache]: Analyzing trace with hash 2127617783, now seen corresponding path program 1 times [2024-10-13 00:44:55,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 00:44:55,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311316735] [2024-10-13 00:44:55,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:44:55,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 00:44:55,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:44:55,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 00:44:55,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:44:55,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 00:44:55,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:44:55,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-13 00:44:55,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:44:55,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 00:44:55,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:44:55,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-13 00:44:55,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:44:55,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 00:44:55,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:44:55,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-13 00:44:55,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:44:55,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 00:44:55,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:44:55,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-13 00:44:55,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:44:55,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 00:44:55,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:44:55,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 00:44:55,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:44:55,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 00:44:55,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:44:55,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-13 00:44:55,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:44:55,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 00:44:55,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:44:55,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 00:44:55,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:44:55,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 00:44:55,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:44:55,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 00:44:55,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:44:55,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 00:44:55,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:44:55,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 00:44:55,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:44:55,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 00:44:55,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:44:55,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 00:44:55,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:44:55,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-13 00:44:55,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:44:55,982 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-10-13 00:44:55,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 00:44:55,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311316735] [2024-10-13 00:44:55,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1311316735] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 00:44:55,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 00:44:55,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 00:44:55,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627007797] [2024-10-13 00:44:55,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 00:44:55,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 00:44:55,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 00:44:55,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 00:44:55,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-13 00:44:55,989 INFO L87 Difference]: Start difference. First operand 155 states and 241 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-13 00:44:56,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 00:44:56,297 INFO L93 Difference]: Finished difference Result 458 states and 710 transitions. [2024-10-13 00:44:56,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 00:44:56,298 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 142 [2024-10-13 00:44:56,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 00:44:56,305 INFO L225 Difference]: With dead ends: 458 [2024-10-13 00:44:56,306 INFO L226 Difference]: Without dead ends: 304 [2024-10-13 00:44:56,308 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-13 00:44:56,311 INFO L432 NwaCegarLoop]: 191 mSDtfsCounter, 186 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 00:44:56,311 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 356 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 00:44:56,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2024-10-13 00:44:56,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 159. [2024-10-13 00:44:56,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 112 states have (on average 1.4017857142857142) internal successors, (157), 112 states have internal predecessors, (157), 44 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2024-10-13 00:44:56,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 245 transitions. [2024-10-13 00:44:56,364 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 245 transitions. Word has length 142 [2024-10-13 00:44:56,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 00:44:56,365 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 245 transitions. [2024-10-13 00:44:56,366 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-13 00:44:56,366 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 245 transitions. [2024-10-13 00:44:56,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-10-13 00:44:56,372 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 00:44:56,372 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 00:44:56,372 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 00:44:56,373 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 00:44:56,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 00:44:56,373 INFO L85 PathProgramCache]: Analyzing trace with hash 978123106, now seen corresponding path program 1 times [2024-10-13 00:44:56,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 00:44:56,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962965435] [2024-10-13 00:44:56,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:44:56,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 00:44:56,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:06,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 00:45:06,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:06,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 00:45:06,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:06,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-13 00:45:06,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:06,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 00:45:06,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:06,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-13 00:45:06,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:06,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 00:45:06,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:06,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-13 00:45:06,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:06,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 00:45:06,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:06,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-13 00:45:06,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:06,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 00:45:06,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:06,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 00:45:06,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:06,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 00:45:06,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:06,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-13 00:45:06,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:06,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 00:45:06,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:06,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 00:45:06,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:06,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 00:45:06,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:06,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 00:45:06,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:06,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 00:45:06,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:06,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 00:45:06,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:06,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 00:45:06,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:06,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 00:45:06,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:06,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-13 00:45:06,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:06,583 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-10-13 00:45:06,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 00:45:06,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962965435] [2024-10-13 00:45:06,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962965435] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 00:45:06,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 00:45:06,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-10-13 00:45:06,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167413501] [2024-10-13 00:45:06,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 00:45:06,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-13 00:45:06,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 00:45:06,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-13 00:45:06,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2024-10-13 00:45:06,587 INFO L87 Difference]: Start difference. First operand 159 states and 245 transitions. Second operand has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-13 00:45:09,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 00:45:09,080 INFO L93 Difference]: Finished difference Result 587 states and 883 transitions. [2024-10-13 00:45:09,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-13 00:45:09,081 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 143 [2024-10-13 00:45:09,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 00:45:09,086 INFO L225 Difference]: With dead ends: 587 [2024-10-13 00:45:09,086 INFO L226 Difference]: Without dead ends: 429 [2024-10-13 00:45:09,088 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=141, Invalid=411, Unknown=0, NotChecked=0, Total=552 [2024-10-13 00:45:09,090 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 541 mSDsluCounter, 480 mSDsCounter, 0 mSdLazyCounter, 818 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 541 SdHoareTripleChecker+Valid, 576 SdHoareTripleChecker+Invalid, 900 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 818 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-13 00:45:09,090 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [541 Valid, 576 Invalid, 900 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 818 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-13 00:45:09,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2024-10-13 00:45:09,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 287. [2024-10-13 00:45:09,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 217 states have (on average 1.400921658986175) internal successors, (304), 217 states have internal predecessors, (304), 66 states have call successors, (66), 3 states have call predecessors, (66), 3 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2024-10-13 00:45:09,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 436 transitions. [2024-10-13 00:45:09,120 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 436 transitions. Word has length 143 [2024-10-13 00:45:09,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 00:45:09,120 INFO L471 AbstractCegarLoop]: Abstraction has 287 states and 436 transitions. [2024-10-13 00:45:09,121 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-13 00:45:09,121 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 436 transitions. [2024-10-13 00:45:09,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-10-13 00:45:09,122 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 00:45:09,123 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 00:45:09,123 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 00:45:09,127 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 00:45:09,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 00:45:09,127 INFO L85 PathProgramCache]: Analyzing trace with hash 1035381408, now seen corresponding path program 1 times [2024-10-13 00:45:09,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 00:45:09,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715876703] [2024-10-13 00:45:09,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:45:09,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 00:45:09,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:12,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 00:45:12,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:12,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 00:45:12,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:12,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-13 00:45:12,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:12,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 00:45:12,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:12,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-13 00:45:12,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:12,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 00:45:12,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:12,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-13 00:45:12,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:12,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 00:45:12,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:12,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-13 00:45:12,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:12,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 00:45:12,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:12,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 00:45:12,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:12,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 00:45:12,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:12,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-13 00:45:12,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:12,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 00:45:12,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:12,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 00:45:12,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:12,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 00:45:12,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:12,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 00:45:12,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:12,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 00:45:12,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:12,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 00:45:12,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:12,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 00:45:12,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:12,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 00:45:12,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:12,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-13 00:45:12,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:12,184 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-10-13 00:45:12,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 00:45:12,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715876703] [2024-10-13 00:45:12,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715876703] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 00:45:12,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 00:45:12,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-13 00:45:12,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471666765] [2024-10-13 00:45:12,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 00:45:12,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-13 00:45:12,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 00:45:12,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-13 00:45:12,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-10-13 00:45:12,188 INFO L87 Difference]: Start difference. First operand 287 states and 436 transitions. Second operand has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-13 00:45:13,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 00:45:13,342 INFO L93 Difference]: Finished difference Result 666 states and 1012 transitions. [2024-10-13 00:45:13,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-13 00:45:13,342 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 143 [2024-10-13 00:45:13,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 00:45:13,346 INFO L225 Difference]: With dead ends: 666 [2024-10-13 00:45:13,346 INFO L226 Difference]: Without dead ends: 492 [2024-10-13 00:45:13,348 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2024-10-13 00:45:13,349 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 354 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 438 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 354 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 513 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 438 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-13 00:45:13,350 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [354 Valid, 412 Invalid, 513 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 438 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-13 00:45:13,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 492 states. [2024-10-13 00:45:13,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 492 to 332. [2024-10-13 00:45:13,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 332 states, 262 states have (on average 1.400763358778626) internal successors, (367), 262 states have internal predecessors, (367), 66 states have call successors, (66), 3 states have call predecessors, (66), 3 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2024-10-13 00:45:13,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 499 transitions. [2024-10-13 00:45:13,386 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 499 transitions. Word has length 143 [2024-10-13 00:45:13,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 00:45:13,387 INFO L471 AbstractCegarLoop]: Abstraction has 332 states and 499 transitions. [2024-10-13 00:45:13,387 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-13 00:45:13,387 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 499 transitions. [2024-10-13 00:45:13,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-10-13 00:45:13,389 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 00:45:13,389 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 00:45:13,389 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 00:45:13,390 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 00:45:13,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 00:45:13,390 INFO L85 PathProgramCache]: Analyzing trace with hash 168776480, now seen corresponding path program 1 times [2024-10-13 00:45:13,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 00:45:13,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602732893] [2024-10-13 00:45:13,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:45:13,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 00:45:13,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:15,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 00:45:15,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:15,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 00:45:15,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:15,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-13 00:45:15,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:15,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 00:45:15,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:15,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-13 00:45:15,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:15,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 00:45:15,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:15,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-13 00:45:15,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:15,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 00:45:15,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:15,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-13 00:45:15,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:15,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 00:45:15,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:15,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 00:45:15,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:15,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 00:45:15,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:15,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-13 00:45:15,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:15,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 00:45:15,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:15,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 00:45:15,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:15,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 00:45:15,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:15,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 00:45:15,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:15,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 00:45:15,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:15,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 00:45:15,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:15,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 00:45:15,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:15,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 00:45:15,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:15,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-13 00:45:15,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:15,745 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-10-13 00:45:15,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 00:45:15,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602732893] [2024-10-13 00:45:15,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602732893] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 00:45:15,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 00:45:15,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-13 00:45:15,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992325417] [2024-10-13 00:45:15,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 00:45:15,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-13 00:45:15,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 00:45:15,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-13 00:45:15,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-10-13 00:45:15,749 INFO L87 Difference]: Start difference. First operand 332 states and 499 transitions. Second operand has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-13 00:45:16,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 00:45:16,400 INFO L93 Difference]: Finished difference Result 638 states and 956 transitions. [2024-10-13 00:45:16,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-13 00:45:16,401 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 143 [2024-10-13 00:45:16,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 00:45:16,404 INFO L225 Difference]: With dead ends: 638 [2024-10-13 00:45:16,404 INFO L226 Difference]: Without dead ends: 462 [2024-10-13 00:45:16,405 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 48 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2024-10-13 00:45:16,406 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 324 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 324 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-13 00:45:16,407 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [324 Valid, 384 Invalid, 427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 352 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-13 00:45:16,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2024-10-13 00:45:16,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 352. [2024-10-13 00:45:16,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 352 states, 282 states have (on average 1.4219858156028369) internal successors, (401), 282 states have internal predecessors, (401), 66 states have call successors, (66), 3 states have call predecessors, (66), 3 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2024-10-13 00:45:16,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 533 transitions. [2024-10-13 00:45:16,447 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 533 transitions. Word has length 143 [2024-10-13 00:45:16,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 00:45:16,447 INFO L471 AbstractCegarLoop]: Abstraction has 352 states and 533 transitions. [2024-10-13 00:45:16,449 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-13 00:45:16,449 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 533 transitions. [2024-10-13 00:45:16,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-10-13 00:45:16,450 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 00:45:16,450 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 00:45:16,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-13 00:45:16,451 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 00:45:16,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 00:45:16,451 INFO L85 PathProgramCache]: Analyzing trace with hash -1695248239, now seen corresponding path program 1 times [2024-10-13 00:45:16,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 00:45:16,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614243310] [2024-10-13 00:45:16,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:45:16,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 00:45:16,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:17,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 00:45:17,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:17,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 00:45:17,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:17,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-13 00:45:17,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:17,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 00:45:17,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:17,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-13 00:45:17,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:17,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 00:45:17,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:17,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-13 00:45:17,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:17,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 00:45:17,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:17,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-13 00:45:17,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:17,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 00:45:17,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:17,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 00:45:17,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:17,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 00:45:17,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:17,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-13 00:45:17,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:17,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 00:45:17,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:17,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 00:45:17,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:17,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 00:45:17,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:17,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 00:45:17,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:17,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 00:45:17,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:17,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 00:45:17,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:17,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 00:45:17,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:17,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 00:45:17,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:17,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-13 00:45:17,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:17,543 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-10-13 00:45:17,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 00:45:17,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614243310] [2024-10-13 00:45:17,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614243310] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 00:45:17,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 00:45:17,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 00:45:17,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665017402] [2024-10-13 00:45:17,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 00:45:17,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 00:45:17,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 00:45:17,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 00:45:17,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-13 00:45:17,545 INFO L87 Difference]: Start difference. First operand 352 states and 533 transitions. Second operand has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-13 00:45:17,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 00:45:17,933 INFO L93 Difference]: Finished difference Result 660 states and 991 transitions. [2024-10-13 00:45:17,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 00:45:17,934 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 143 [2024-10-13 00:45:17,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 00:45:17,937 INFO L225 Difference]: With dead ends: 660 [2024-10-13 00:45:17,937 INFO L226 Difference]: Without dead ends: 456 [2024-10-13 00:45:17,938 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-10-13 00:45:17,939 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 173 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 405 SdHoareTripleChecker+Invalid, 302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 00:45:17,939 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 405 Invalid, 302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 00:45:17,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2024-10-13 00:45:17,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 358. [2024-10-13 00:45:17,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 358 states, 288 states have (on average 1.40625) internal successors, (405), 288 states have internal predecessors, (405), 66 states have call successors, (66), 3 states have call predecessors, (66), 3 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2024-10-13 00:45:17,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 537 transitions. [2024-10-13 00:45:17,969 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 537 transitions. Word has length 143 [2024-10-13 00:45:17,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 00:45:17,969 INFO L471 AbstractCegarLoop]: Abstraction has 358 states and 537 transitions. [2024-10-13 00:45:17,969 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-13 00:45:17,970 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 537 transitions. [2024-10-13 00:45:17,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-10-13 00:45:17,971 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 00:45:17,971 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 00:45:17,971 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-13 00:45:17,972 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 00:45:17,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 00:45:17,972 INFO L85 PathProgramCache]: Analyzing trace with hash 391317092, now seen corresponding path program 1 times [2024-10-13 00:45:17,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 00:45:17,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4893835] [2024-10-13 00:45:17,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:45:17,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 00:45:18,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:18,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 00:45:18,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:18,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 00:45:18,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:18,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-13 00:45:18,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:18,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 00:45:18,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:18,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-13 00:45:18,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:18,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 00:45:18,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:18,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-13 00:45:18,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:18,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 00:45:18,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:18,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-13 00:45:18,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:18,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 00:45:18,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:18,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 00:45:18,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:18,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 00:45:18,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:18,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-13 00:45:18,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:18,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 00:45:18,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:18,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 00:45:18,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:18,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 00:45:18,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:18,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 00:45:18,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:18,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 00:45:18,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:18,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 00:45:18,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:18,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 00:45:18,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:18,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 00:45:18,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:18,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-13 00:45:18,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:18,456 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-10-13 00:45:18,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 00:45:18,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4893835] [2024-10-13 00:45:18,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [4893835] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 00:45:18,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 00:45:18,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 00:45:18,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181070766] [2024-10-13 00:45:18,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 00:45:18,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 00:45:18,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 00:45:18,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 00:45:18,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 00:45:18,459 INFO L87 Difference]: Start difference. First operand 358 states and 537 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-13 00:45:18,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 00:45:18,681 INFO L93 Difference]: Finished difference Result 574 states and 864 transitions. [2024-10-13 00:45:18,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 00:45:18,682 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 143 [2024-10-13 00:45:18,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 00:45:18,685 INFO L225 Difference]: With dead ends: 574 [2024-10-13 00:45:18,686 INFO L226 Difference]: Without dead ends: 356 [2024-10-13 00:45:18,687 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 47 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-13 00:45:18,688 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 83 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 00:45:18,688 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 291 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 00:45:18,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2024-10-13 00:45:18,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 330. [2024-10-13 00:45:18,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 330 states, 260 states have (on average 1.3653846153846154) internal successors, (355), 260 states have internal predecessors, (355), 66 states have call successors, (66), 3 states have call predecessors, (66), 3 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2024-10-13 00:45:18,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 487 transitions. [2024-10-13 00:45:18,722 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 487 transitions. Word has length 143 [2024-10-13 00:45:18,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 00:45:18,722 INFO L471 AbstractCegarLoop]: Abstraction has 330 states and 487 transitions. [2024-10-13 00:45:18,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-13 00:45:18,723 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 487 transitions. [2024-10-13 00:45:18,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-10-13 00:45:18,725 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 00:45:18,725 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 00:45:18,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-13 00:45:18,726 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 00:45:18,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 00:45:18,726 INFO L85 PathProgramCache]: Analyzing trace with hash -1154216670, now seen corresponding path program 1 times [2024-10-13 00:45:18,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 00:45:18,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714149821] [2024-10-13 00:45:18,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:45:18,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 00:45:18,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:21,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 00:45:21,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:21,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 00:45:21,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:21,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-13 00:45:21,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:21,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 00:45:21,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:21,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-13 00:45:21,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:21,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 00:45:21,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:21,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-13 00:45:21,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:21,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 00:45:21,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:21,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-13 00:45:21,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:21,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 00:45:21,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:21,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 00:45:21,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:21,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 00:45:21,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:21,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-13 00:45:21,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:21,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 00:45:21,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:21,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 00:45:21,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:21,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 00:45:21,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:21,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 00:45:21,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:21,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 00:45:21,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:21,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 00:45:21,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:21,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 00:45:21,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:21,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 00:45:21,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:21,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-13 00:45:21,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:21,455 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-10-13 00:45:21,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 00:45:21,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714149821] [2024-10-13 00:45:21,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [714149821] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 00:45:21,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 00:45:21,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-13 00:45:21,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770303969] [2024-10-13 00:45:21,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 00:45:21,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-13 00:45:21,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 00:45:21,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-13 00:45:21,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-10-13 00:45:21,457 INFO L87 Difference]: Start difference. First operand 330 states and 487 transitions. Second operand has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-13 00:45:23,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 00:45:23,201 INFO L93 Difference]: Finished difference Result 666 states and 976 transitions. [2024-10-13 00:45:23,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-13 00:45:23,202 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 144 [2024-10-13 00:45:23,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 00:45:23,205 INFO L225 Difference]: With dead ends: 666 [2024-10-13 00:45:23,206 INFO L226 Difference]: Without dead ends: 508 [2024-10-13 00:45:23,206 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=80, Invalid=130, Unknown=0, NotChecked=0, Total=210 [2024-10-13 00:45:23,207 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 236 mSDsluCounter, 466 mSDsCounter, 0 mSdLazyCounter, 374 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 593 SdHoareTripleChecker+Invalid, 377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 374 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-13 00:45:23,207 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [236 Valid, 593 Invalid, 377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 374 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-13 00:45:23,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 508 states. [2024-10-13 00:45:23,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 508 to 358. [2024-10-13 00:45:23,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 358 states, 286 states have (on average 1.3461538461538463) internal successors, (385), 286 states have internal predecessors, (385), 66 states have call successors, (66), 5 states have call predecessors, (66), 5 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2024-10-13 00:45:23,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 517 transitions. [2024-10-13 00:45:23,240 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 517 transitions. Word has length 144 [2024-10-13 00:45:23,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 00:45:23,240 INFO L471 AbstractCegarLoop]: Abstraction has 358 states and 517 transitions. [2024-10-13 00:45:23,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-13 00:45:23,241 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 517 transitions. [2024-10-13 00:45:23,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-10-13 00:45:23,242 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 00:45:23,242 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 00:45:23,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-13 00:45:23,243 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 00:45:23,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 00:45:23,243 INFO L85 PathProgramCache]: Analyzing trace with hash 1866886190, now seen corresponding path program 1 times [2024-10-13 00:45:23,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 00:45:23,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624857312] [2024-10-13 00:45:23,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:45:23,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 00:45:23,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:27,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 00:45:27,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:27,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 00:45:27,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:27,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-13 00:45:27,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:27,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 00:45:27,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:27,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-13 00:45:27,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:27,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 00:45:27,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:27,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-13 00:45:27,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:27,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 00:45:27,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:27,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-13 00:45:27,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:27,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 00:45:27,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:27,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 00:45:27,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:27,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 00:45:27,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:27,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-13 00:45:27,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:27,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 00:45:27,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:27,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 00:45:27,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:27,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 00:45:27,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:27,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 00:45:27,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:27,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 00:45:27,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:27,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 00:45:27,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:27,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 00:45:27,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:27,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 00:45:27,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:27,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-13 00:45:27,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:27,396 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-10-13 00:45:27,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 00:45:27,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624857312] [2024-10-13 00:45:27,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [624857312] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 00:45:27,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 00:45:27,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-10-13 00:45:27,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068765575] [2024-10-13 00:45:27,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 00:45:27,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-13 00:45:27,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 00:45:27,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-13 00:45:27,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2024-10-13 00:45:27,399 INFO L87 Difference]: Start difference. First operand 358 states and 517 transitions. Second operand has 14 states, 14 states have (on average 2.642857142857143) internal successors, (37), 14 states have internal predecessors, (37), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-13 00:45:29,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 00:45:29,292 INFO L93 Difference]: Finished difference Result 774 states and 1105 transitions. [2024-10-13 00:45:29,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-13 00:45:29,292 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.642857142857143) internal successors, (37), 14 states have internal predecessors, (37), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 144 [2024-10-13 00:45:29,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 00:45:29,295 INFO L225 Difference]: With dead ends: 774 [2024-10-13 00:45:29,295 INFO L226 Difference]: Without dead ends: 503 [2024-10-13 00:45:29,296 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=132, Invalid=420, Unknown=0, NotChecked=0, Total=552 [2024-10-13 00:45:29,297 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 351 mSDsluCounter, 530 mSDsCounter, 0 mSdLazyCounter, 884 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 351 SdHoareTripleChecker+Valid, 644 SdHoareTripleChecker+Invalid, 963 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 884 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-13 00:45:29,297 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [351 Valid, 644 Invalid, 963 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 884 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-13 00:45:29,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 503 states. [2024-10-13 00:45:29,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 503 to 399. [2024-10-13 00:45:29,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 399 states, 327 states have (on average 1.3577981651376148) internal successors, (444), 327 states have internal predecessors, (444), 66 states have call successors, (66), 5 states have call predecessors, (66), 5 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2024-10-13 00:45:29,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 576 transitions. [2024-10-13 00:45:29,334 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 576 transitions. Word has length 144 [2024-10-13 00:45:29,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 00:45:29,335 INFO L471 AbstractCegarLoop]: Abstraction has 399 states and 576 transitions. [2024-10-13 00:45:29,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.642857142857143) internal successors, (37), 14 states have internal predecessors, (37), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-13 00:45:29,335 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 576 transitions. [2024-10-13 00:45:29,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-10-13 00:45:29,336 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 00:45:29,337 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 00:45:29,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-13 00:45:29,337 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 00:45:29,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 00:45:29,337 INFO L85 PathProgramCache]: Analyzing trace with hash 1057539564, now seen corresponding path program 1 times [2024-10-13 00:45:29,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 00:45:29,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306787944] [2024-10-13 00:45:29,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:45:29,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 00:45:29,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:33,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 00:45:33,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:33,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 00:45:33,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:33,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-13 00:45:33,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:33,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 00:45:33,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:33,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-13 00:45:33,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:33,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 00:45:33,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:33,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-13 00:45:33,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:33,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 00:45:33,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:33,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-13 00:45:33,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:33,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 00:45:33,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:33,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 00:45:33,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:33,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 00:45:33,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:33,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-13 00:45:33,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:33,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 00:45:33,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:33,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 00:45:33,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:33,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 00:45:33,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:33,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 00:45:33,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:33,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 00:45:33,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:33,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 00:45:33,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:33,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 00:45:33,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:33,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 00:45:33,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:33,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-13 00:45:33,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:33,402 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-10-13 00:45:33,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 00:45:33,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306787944] [2024-10-13 00:45:33,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306787944] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 00:45:33,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 00:45:33,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-10-13 00:45:33,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547798981] [2024-10-13 00:45:33,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 00:45:33,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-13 00:45:33,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 00:45:33,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-13 00:45:33,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2024-10-13 00:45:33,404 INFO L87 Difference]: Start difference. First operand 399 states and 576 transitions. Second operand has 14 states, 14 states have (on average 2.642857142857143) internal successors, (37), 14 states have internal predecessors, (37), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-13 00:45:35,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 00:45:35,395 INFO L93 Difference]: Finished difference Result 673 states and 960 transitions. [2024-10-13 00:45:35,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-13 00:45:35,396 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.642857142857143) internal successors, (37), 14 states have internal predecessors, (37), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 144 [2024-10-13 00:45:35,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 00:45:35,399 INFO L225 Difference]: With dead ends: 673 [2024-10-13 00:45:35,399 INFO L226 Difference]: Without dead ends: 495 [2024-10-13 00:45:35,400 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=137, Invalid=415, Unknown=0, NotChecked=0, Total=552 [2024-10-13 00:45:35,401 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 182 mSDsluCounter, 741 mSDsCounter, 0 mSdLazyCounter, 1159 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 868 SdHoareTripleChecker+Invalid, 1234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 1159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-13 00:45:35,401 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 868 Invalid, 1234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 1159 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-13 00:45:35,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2024-10-13 00:45:35,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 391. [2024-10-13 00:45:35,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 391 states, 319 states have (on average 1.347962382445141) internal successors, (430), 319 states have internal predecessors, (430), 66 states have call successors, (66), 5 states have call predecessors, (66), 5 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2024-10-13 00:45:35,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 562 transitions. [2024-10-13 00:45:35,438 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 562 transitions. Word has length 144 [2024-10-13 00:45:35,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 00:45:35,439 INFO L471 AbstractCegarLoop]: Abstraction has 391 states and 562 transitions. [2024-10-13 00:45:35,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.642857142857143) internal successors, (37), 14 states have internal predecessors, (37), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-13 00:45:35,439 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 562 transitions. [2024-10-13 00:45:35,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-10-13 00:45:35,440 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 00:45:35,441 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 00:45:35,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-13 00:45:35,441 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 00:45:35,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 00:45:35,441 INFO L85 PathProgramCache]: Analyzing trace with hash -1974497129, now seen corresponding path program 1 times [2024-10-13 00:45:35,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 00:45:35,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122436905] [2024-10-13 00:45:35,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:45:35,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 00:45:35,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:38,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 00:45:38,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:38,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 00:45:38,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:38,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-13 00:45:38,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:38,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 00:45:38,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:38,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-13 00:45:38,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:38,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 00:45:38,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:38,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-13 00:45:38,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:38,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 00:45:38,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:38,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-13 00:45:38,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:38,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 00:45:38,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:38,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 00:45:38,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:38,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 00:45:38,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:38,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-13 00:45:38,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:38,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 00:45:38,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:38,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 00:45:38,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:38,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 00:45:38,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:38,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 00:45:38,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:38,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 00:45:38,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:38,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 00:45:38,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:38,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 00:45:38,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:38,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 00:45:38,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:38,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-13 00:45:38,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:38,740 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-10-13 00:45:38,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 00:45:38,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122436905] [2024-10-13 00:45:38,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122436905] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 00:45:38,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 00:45:38,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-10-13 00:45:38,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013971952] [2024-10-13 00:45:38,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 00:45:38,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-13 00:45:38,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 00:45:38,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-13 00:45:38,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2024-10-13 00:45:38,743 INFO L87 Difference]: Start difference. First operand 391 states and 562 transitions. Second operand has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 13 states have internal predecessors, (38), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-13 00:45:41,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 00:45:41,018 INFO L93 Difference]: Finished difference Result 1083 states and 1570 transitions. [2024-10-13 00:45:41,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-13 00:45:41,019 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 13 states have internal predecessors, (38), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 145 [2024-10-13 00:45:41,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 00:45:41,037 INFO L225 Difference]: With dead ends: 1083 [2024-10-13 00:45:41,037 INFO L226 Difference]: Without dead ends: 909 [2024-10-13 00:45:41,038 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=139, Invalid=281, Unknown=0, NotChecked=0, Total=420 [2024-10-13 00:45:41,039 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 544 mSDsluCounter, 468 mSDsCounter, 0 mSdLazyCounter, 530 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 544 SdHoareTripleChecker+Valid, 582 SdHoareTripleChecker+Invalid, 612 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 530 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-13 00:45:41,039 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [544 Valid, 582 Invalid, 612 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 530 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-13 00:45:41,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 909 states. [2024-10-13 00:45:41,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 909 to 603. [2024-10-13 00:45:41,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 603 states, 483 states have (on average 1.3519668737060042) internal successors, (653), 483 states have internal predecessors, (653), 110 states have call successors, (110), 9 states have call predecessors, (110), 9 states have return successors, (110), 110 states have call predecessors, (110), 110 states have call successors, (110) [2024-10-13 00:45:41,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 603 states to 603 states and 873 transitions. [2024-10-13 00:45:41,095 INFO L78 Accepts]: Start accepts. Automaton has 603 states and 873 transitions. Word has length 145 [2024-10-13 00:45:41,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 00:45:41,095 INFO L471 AbstractCegarLoop]: Abstraction has 603 states and 873 transitions. [2024-10-13 00:45:41,095 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 13 states have internal predecessors, (38), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-13 00:45:41,095 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states and 873 transitions. [2024-10-13 00:45:41,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-10-13 00:45:41,097 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 00:45:41,097 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 00:45:41,097 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-13 00:45:41,098 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 00:45:41,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 00:45:41,098 INFO L85 PathProgramCache]: Analyzing trace with hash 1172580707, now seen corresponding path program 1 times [2024-10-13 00:45:41,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 00:45:41,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306645598] [2024-10-13 00:45:41,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:45:41,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 00:45:41,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:44,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 00:45:44,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:44,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 00:45:44,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:44,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-13 00:45:44,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:44,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 00:45:44,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:44,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-13 00:45:44,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:44,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 00:45:44,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:44,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-13 00:45:44,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:44,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 00:45:44,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:44,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-13 00:45:44,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:44,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 00:45:44,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:44,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 00:45:44,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:44,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 00:45:44,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:44,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-13 00:45:44,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:44,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 00:45:44,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:44,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 00:45:44,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:44,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 00:45:44,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:44,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 00:45:44,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:44,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 00:45:44,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:44,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 00:45:44,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:44,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 00:45:44,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:44,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 00:45:44,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:44,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-13 00:45:44,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:44,111 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-10-13 00:45:44,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 00:45:44,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306645598] [2024-10-13 00:45:44,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306645598] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 00:45:44,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 00:45:44,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-13 00:45:44,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735803285] [2024-10-13 00:45:44,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 00:45:44,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-13 00:45:44,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 00:45:44,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-13 00:45:44,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2024-10-13 00:45:44,113 INFO L87 Difference]: Start difference. First operand 603 states and 873 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 12 states have internal predecessors, (38), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-13 00:45:45,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 00:45:45,715 INFO L93 Difference]: Finished difference Result 1285 states and 1864 transitions. [2024-10-13 00:45:45,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-13 00:45:45,716 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 12 states have internal predecessors, (38), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 145 [2024-10-13 00:45:45,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 00:45:45,721 INFO L225 Difference]: With dead ends: 1285 [2024-10-13 00:45:45,721 INFO L226 Difference]: Without dead ends: 929 [2024-10-13 00:45:45,722 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=135, Invalid=245, Unknown=0, NotChecked=0, Total=380 [2024-10-13 00:45:45,723 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 331 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 346 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 331 SdHoareTripleChecker+Valid, 375 SdHoareTripleChecker+Invalid, 354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-13 00:45:45,724 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [331 Valid, 375 Invalid, 354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 346 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-13 00:45:45,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 929 states. [2024-10-13 00:45:45,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 929 to 609. [2024-10-13 00:45:45,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 609 states, 489 states have (on average 1.359918200408998) internal successors, (665), 489 states have internal predecessors, (665), 110 states have call successors, (110), 9 states have call predecessors, (110), 9 states have return successors, (110), 110 states have call predecessors, (110), 110 states have call successors, (110) [2024-10-13 00:45:45,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 609 states to 609 states and 885 transitions. [2024-10-13 00:45:45,782 INFO L78 Accepts]: Start accepts. Automaton has 609 states and 885 transitions. Word has length 145 [2024-10-13 00:45:45,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 00:45:45,782 INFO L471 AbstractCegarLoop]: Abstraction has 609 states and 885 transitions. [2024-10-13 00:45:45,783 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 12 states have internal predecessors, (38), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-13 00:45:45,783 INFO L276 IsEmpty]: Start isEmpty. Operand 609 states and 885 transitions. [2024-10-13 00:45:45,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-10-13 00:45:45,784 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 00:45:45,784 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 00:45:45,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-13 00:45:45,785 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 00:45:45,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 00:45:45,785 INFO L85 PathProgramCache]: Analyzing trace with hash 305975779, now seen corresponding path program 1 times [2024-10-13 00:45:45,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 00:45:45,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104523872] [2024-10-13 00:45:45,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:45:45,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 00:45:45,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:49,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 00:45:49,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:49,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 00:45:49,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:49,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-13 00:45:49,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:49,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 00:45:49,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:49,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-13 00:45:49,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:49,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 00:45:49,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:49,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-13 00:45:49,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:49,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 00:45:49,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:49,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-13 00:45:49,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:49,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 00:45:49,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:49,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 00:45:49,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:49,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 00:45:49,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:49,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-13 00:45:49,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:49,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 00:45:49,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:49,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 00:45:49,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:49,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 00:45:49,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:49,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 00:45:49,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:49,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 00:45:49,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:49,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 00:45:49,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:49,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 00:45:49,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:49,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 00:45:49,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:49,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-13 00:45:49,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:49,454 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-10-13 00:45:49,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 00:45:49,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104523872] [2024-10-13 00:45:49,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [104523872] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 00:45:49,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 00:45:49,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-10-13 00:45:49,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318180947] [2024-10-13 00:45:49,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 00:45:49,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-13 00:45:49,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 00:45:49,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-13 00:45:49,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2024-10-13 00:45:49,458 INFO L87 Difference]: Start difference. First operand 609 states and 885 transitions. Second operand has 14 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 14 states have internal predecessors, (38), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2024-10-13 00:45:51,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 00:45:51,754 INFO L93 Difference]: Finished difference Result 1422 states and 2045 transitions. [2024-10-13 00:45:51,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-13 00:45:51,754 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 14 states have internal predecessors, (38), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 145 [2024-10-13 00:45:51,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 00:45:51,760 INFO L225 Difference]: With dead ends: 1422 [2024-10-13 00:45:51,760 INFO L226 Difference]: Without dead ends: 969 [2024-10-13 00:45:51,762 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=165, Invalid=485, Unknown=0, NotChecked=0, Total=650 [2024-10-13 00:45:51,762 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 587 mSDsluCounter, 486 mSDsCounter, 0 mSdLazyCounter, 989 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 587 SdHoareTripleChecker+Valid, 570 SdHoareTripleChecker+Invalid, 1109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 989 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-13 00:45:51,763 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [587 Valid, 570 Invalid, 1109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 989 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-13 00:45:51,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 969 states. [2024-10-13 00:45:51,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 969 to 669. [2024-10-13 00:45:51,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 669 states, 549 states have (on average 1.3570127504553735) internal successors, (745), 549 states have internal predecessors, (745), 110 states have call successors, (110), 9 states have call predecessors, (110), 9 states have return successors, (110), 110 states have call predecessors, (110), 110 states have call successors, (110) [2024-10-13 00:45:51,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 669 states to 669 states and 965 transitions. [2024-10-13 00:45:51,825 INFO L78 Accepts]: Start accepts. Automaton has 669 states and 965 transitions. Word has length 145 [2024-10-13 00:45:51,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 00:45:51,825 INFO L471 AbstractCegarLoop]: Abstraction has 669 states and 965 transitions. [2024-10-13 00:45:51,825 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 14 states have internal predecessors, (38), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2024-10-13 00:45:51,825 INFO L276 IsEmpty]: Start isEmpty. Operand 669 states and 965 transitions. [2024-10-13 00:45:51,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-10-13 00:45:51,827 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 00:45:51,827 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 00:45:51,827 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-13 00:45:51,827 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 00:45:51,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 00:45:51,828 INFO L85 PathProgramCache]: Analyzing trace with hash 363234081, now seen corresponding path program 1 times [2024-10-13 00:45:51,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 00:45:51,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915799769] [2024-10-13 00:45:51,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:45:51,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 00:45:51,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:58,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 00:45:58,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:58,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 00:45:58,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:58,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-13 00:45:58,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:58,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 00:45:58,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:58,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-13 00:45:58,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:58,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 00:45:58,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:58,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-13 00:45:58,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:58,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 00:45:58,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:58,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-13 00:45:58,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:58,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 00:45:58,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:58,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 00:45:58,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:58,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 00:45:58,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:58,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-13 00:45:58,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:58,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 00:45:58,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:58,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 00:45:58,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:58,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 00:45:58,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:58,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 00:45:58,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:58,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 00:45:58,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:58,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 00:45:58,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:58,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 00:45:58,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:58,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 00:45:58,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:58,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-13 00:45:58,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:45:58,443 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-10-13 00:45:58,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 00:45:58,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915799769] [2024-10-13 00:45:58,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1915799769] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 00:45:58,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 00:45:58,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-10-13 00:45:58,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546828409] [2024-10-13 00:45:58,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 00:45:58,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-13 00:45:58,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 00:45:58,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-13 00:45:58,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2024-10-13 00:45:58,445 INFO L87 Difference]: Start difference. First operand 669 states and 965 transitions. Second operand has 14 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 14 states have internal predecessors, (38), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-13 00:45:59,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 00:45:59,939 INFO L93 Difference]: Finished difference Result 1137 states and 1640 transitions. [2024-10-13 00:45:59,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-13 00:45:59,940 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 14 states have internal predecessors, (38), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 145 [2024-10-13 00:45:59,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 00:45:59,946 INFO L225 Difference]: With dead ends: 1137 [2024-10-13 00:45:59,946 INFO L226 Difference]: Without dead ends: 775 [2024-10-13 00:45:59,949 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=135, Invalid=417, Unknown=0, NotChecked=0, Total=552 [2024-10-13 00:45:59,949 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 210 mSDsluCounter, 486 mSDsCounter, 0 mSdLazyCounter, 667 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 584 SdHoareTripleChecker+Invalid, 738 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 667 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-13 00:45:59,950 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 584 Invalid, 738 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 667 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-13 00:45:59,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 775 states. [2024-10-13 00:46:00,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 775 to 669. [2024-10-13 00:46:00,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 669 states, 549 states have (on average 1.3533697632058288) internal successors, (743), 549 states have internal predecessors, (743), 110 states have call successors, (110), 9 states have call predecessors, (110), 9 states have return successors, (110), 110 states have call predecessors, (110), 110 states have call successors, (110) [2024-10-13 00:46:00,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 669 states to 669 states and 963 transitions. [2024-10-13 00:46:00,018 INFO L78 Accepts]: Start accepts. Automaton has 669 states and 963 transitions. Word has length 145 [2024-10-13 00:46:00,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 00:46:00,019 INFO L471 AbstractCegarLoop]: Abstraction has 669 states and 963 transitions. [2024-10-13 00:46:00,019 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 14 states have internal predecessors, (38), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-13 00:46:00,019 INFO L276 IsEmpty]: Start isEmpty. Operand 669 states and 963 transitions. [2024-10-13 00:46:00,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-10-13 00:46:00,020 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 00:46:00,020 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 00:46:00,021 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-13 00:46:00,021 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 00:46:00,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 00:46:00,021 INFO L85 PathProgramCache]: Analyzing trace with hash -1076322328, now seen corresponding path program 1 times [2024-10-13 00:46:00,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 00:46:00,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621059554] [2024-10-13 00:46:00,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:46:00,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 00:46:00,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat