./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-86.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-86.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d32ec5a50162e1277d5b8e9598dff8d55e883556c57a5fb919336a65433989f7 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 07:14:11,587 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 07:14:11,641 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 07:14:11,647 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 07:14:11,649 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 07:14:11,671 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 07:14:11,672 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 07:14:11,672 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 07:14:11,673 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 07:14:11,674 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 07:14:11,674 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 07:14:11,675 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 07:14:11,675 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 07:14:11,675 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 07:14:11,677 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 07:14:11,677 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 07:14:11,677 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 07:14:11,678 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 07:14:11,678 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 07:14:11,678 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 07:14:11,678 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 07:14:11,679 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 07:14:11,679 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 07:14:11,681 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 07:14:11,681 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 07:14:11,681 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 07:14:11,681 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 07:14:11,682 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 07:14:11,682 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 07:14:11,682 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 07:14:11,682 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 07:14:11,682 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 07:14:11,682 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 07:14:11,683 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 07:14:11,683 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 07:14:11,683 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 07:14:11,683 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 07:14:11,683 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 07:14:11,683 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 07:14:11,684 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 07:14:11,684 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 07:14:11,685 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 07:14:11,685 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d32ec5a50162e1277d5b8e9598dff8d55e883556c57a5fb919336a65433989f7 [2024-10-11 07:14:11,920 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 07:14:11,941 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 07:14:11,944 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 07:14:11,945 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 07:14:11,945 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 07:14:11,946 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-86.i [2024-10-11 07:14:13,349 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 07:14:13,551 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 07:14:13,552 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-86.i [2024-10-11 07:14:13,563 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/090772241/0b480da128a747b388b4f08933d117f2/FLAG2e832ea86 [2024-10-11 07:14:13,580 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/090772241/0b480da128a747b388b4f08933d117f2 [2024-10-11 07:14:13,582 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 07:14:13,584 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 07:14:13,586 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 07:14:13,587 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 07:14:13,592 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 07:14:13,592 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:14:13" (1/1) ... [2024-10-11 07:14:13,593 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b438941 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:14:13, skipping insertion in model container [2024-10-11 07:14:13,594 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:14:13" (1/1) ... [2024-10-11 07:14:13,623 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 07:14:13,778 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-86.i[919,932] [2024-10-11 07:14:13,838 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 07:14:13,851 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 07:14:13,864 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-86.i[919,932] [2024-10-11 07:14:13,924 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 07:14:13,959 INFO L204 MainTranslator]: Completed translation [2024-10-11 07:14:13,983 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:14:13 WrapperNode [2024-10-11 07:14:13,983 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 07:14:13,984 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 07:14:13,985 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 07:14:13,985 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 07:14:13,999 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:14:13" (1/1) ... [2024-10-11 07:14:14,013 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:14:13" (1/1) ... [2024-10-11 07:14:14,058 INFO L138 Inliner]: procedures = 26, calls = 28, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 121 [2024-10-11 07:14:14,061 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 07:14:14,062 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 07:14:14,065 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 07:14:14,066 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 07:14:14,074 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:14:13" (1/1) ... [2024-10-11 07:14:14,074 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:14:13" (1/1) ... [2024-10-11 07:14:14,082 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:14:13" (1/1) ... [2024-10-11 07:14:14,103 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 07:14:14,105 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:14:13" (1/1) ... [2024-10-11 07:14:14,105 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:14:13" (1/1) ... [2024-10-11 07:14:14,112 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:14:13" (1/1) ... [2024-10-11 07:14:14,121 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:14:13" (1/1) ... [2024-10-11 07:14:14,122 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:14:13" (1/1) ... [2024-10-11 07:14:14,127 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:14:13" (1/1) ... [2024-10-11 07:14:14,135 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 07:14:14,135 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 07:14:14,136 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 07:14:14,136 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 07:14:14,136 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:14:13" (1/1) ... [2024-10-11 07:14:14,141 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 07:14:14,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 07:14:14,164 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 07:14:14,169 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 07:14:14,224 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 07:14:14,224 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 07:14:14,225 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 07:14:14,225 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 07:14:14,225 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 07:14:14,225 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 07:14:14,310 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 07:14:14,312 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 07:14:14,659 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-10-11 07:14:14,661 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 07:14:14,705 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 07:14:14,706 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 07:14:14,706 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:14:14 BoogieIcfgContainer [2024-10-11 07:14:14,706 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 07:14:14,708 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 07:14:14,709 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 07:14:14,712 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 07:14:14,712 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 07:14:13" (1/3) ... [2024-10-11 07:14:14,713 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5da5e7b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 07:14:14, skipping insertion in model container [2024-10-11 07:14:14,713 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:14:13" (2/3) ... [2024-10-11 07:14:14,714 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5da5e7b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 07:14:14, skipping insertion in model container [2024-10-11 07:14:14,714 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:14:14" (3/3) ... [2024-10-11 07:14:14,715 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_dependencies_file-86.i [2024-10-11 07:14:14,730 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 07:14:14,730 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 07:14:14,789 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 07:14:14,797 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;@35ac2416, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 07:14:14,797 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 07:14:14,801 INFO L276 IsEmpty]: Start isEmpty. Operand has 46 states, 28 states have (on average 1.5357142857142858) internal successors, (43), 29 states have internal predecessors, (43), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-11 07:14:14,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-10-11 07:14:14,811 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:14:14,812 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 07:14:14,812 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:14:14,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:14:14,818 INFO L85 PathProgramCache]: Analyzing trace with hash 550717282, now seen corresponding path program 1 times [2024-10-11 07:14:14,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:14:14,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087980799] [2024-10-11 07:14:14,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:14:14,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:14:14,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:14:15,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 07:14:15,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:14:15,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 07:14:15,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:14:15,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 07:14:15,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:14:15,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 07:14:15,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:14:15,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 07:14:15,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:14:15,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 07:14:15,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:14:15,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 07:14:15,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:14:15,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 07:14:15,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:14:15,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 07:14:15,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:14:15,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 07:14:15,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:14:15,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 07:14:15,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:14:15,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 07:14:15,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:14:15,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 07:14:15,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:14:15,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 07:14:15,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:14:15,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 07:14:15,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:14:15,116 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-11 07:14:15,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 07:14:15,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087980799] [2024-10-11 07:14:15,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087980799] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:14:15,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:14:15,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 07:14:15,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90452063] [2024-10-11 07:14:15,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:14:15,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 07:14:15,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 07:14:15,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 07:14:15,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 07:14:15,148 INFO L87 Difference]: Start difference. First operand has 46 states, 28 states have (on average 1.5357142857142858) internal successors, (43), 29 states have internal predecessors, (43), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-11 07:14:15,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:14:15,183 INFO L93 Difference]: Finished difference Result 89 states and 159 transitions. [2024-10-11 07:14:15,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 07:14:15,187 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 94 [2024-10-11 07:14:15,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:14:15,193 INFO L225 Difference]: With dead ends: 89 [2024-10-11 07:14:15,193 INFO L226 Difference]: Without dead ends: 44 [2024-10-11 07:14:15,196 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 07:14:15,201 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 07:14:15,203 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 64 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 07:14:15,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2024-10-11 07:14:15,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2024-10-11 07:14:15,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 27 states have (on average 1.3703703703703705) internal successors, (37), 27 states have internal predecessors, (37), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-11 07:14:15,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 67 transitions. [2024-10-11 07:14:15,233 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 67 transitions. Word has length 94 [2024-10-11 07:14:15,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:14:15,233 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 67 transitions. [2024-10-11 07:14:15,234 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-11 07:14:15,234 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 67 transitions. [2024-10-11 07:14:15,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-10-11 07:14:15,237 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:14:15,237 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 07:14:15,237 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 07:14:15,238 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:14:15,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:14:15,238 INFO L85 PathProgramCache]: Analyzing trace with hash -851374044, now seen corresponding path program 1 times [2024-10-11 07:14:15,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:14:15,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926482225] [2024-10-11 07:14:15,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:14:15,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:14:15,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:14:15,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 07:14:15,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:14:15,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 07:14:15,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:14:15,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 07:14:15,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:14:15,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 07:14:15,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:14:15,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 07:14:15,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:14:15,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 07:14:15,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:14:15,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 07:14:15,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:14:15,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 07:14:15,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:14:15,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 07:14:15,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:14:15,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 07:14:15,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:14:15,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 07:14:15,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:14:15,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 07:14:15,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:14:15,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 07:14:15,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:14:15,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 07:14:15,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:14:15,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 07:14:15,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:14:15,719 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-11 07:14:15,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 07:14:15,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926482225] [2024-10-11 07:14:15,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926482225] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:14:15,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:14:15,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 07:14:15,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258956586] [2024-10-11 07:14:15,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:14:15,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 07:14:15,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 07:14:15,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 07:14:15,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 07:14:15,722 INFO L87 Difference]: Start difference. First operand 44 states and 67 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-11 07:14:15,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:14:15,873 INFO L93 Difference]: Finished difference Result 131 states and 200 transitions. [2024-10-11 07:14:15,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 07:14:15,874 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 94 [2024-10-11 07:14:15,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:14:15,876 INFO L225 Difference]: With dead ends: 131 [2024-10-11 07:14:15,876 INFO L226 Difference]: Without dead ends: 88 [2024-10-11 07:14:15,877 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-11 07:14:15,877 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 54 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 07:14:15,878 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 242 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 07:14:15,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-10-11 07:14:15,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 75. [2024-10-11 07:14:15,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 42 states have (on average 1.3095238095238095) internal successors, (55), 42 states have internal predecessors, (55), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-11 07:14:15,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 115 transitions. [2024-10-11 07:14:15,892 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 115 transitions. Word has length 94 [2024-10-11 07:14:15,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:14:15,892 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 115 transitions. [2024-10-11 07:14:15,893 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-11 07:14:15,893 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 115 transitions. [2024-10-11 07:14:15,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-10-11 07:14:15,895 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:14:15,895 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 07:14:15,895 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 07:14:15,895 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:14:15,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:14:15,896 INFO L85 PathProgramCache]: Analyzing trace with hash -1660720670, now seen corresponding path program 1 times [2024-10-11 07:14:15,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:14:15,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128330384] [2024-10-11 07:14:15,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:14:15,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:14:16,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:14:21,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 07:14:21,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:14:21,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 07:14:21,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:14:21,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 07:14:21,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:14:21,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 07:14:21,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:14:21,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 07:14:21,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:14:21,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 07:14:21,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:14:21,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 07:14:21,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:14:21,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 07:14:21,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:14:21,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 07:14:21,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:14:21,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 07:14:21,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:14:21,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 07:14:21,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:14:21,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 07:14:21,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:14:21,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 07:14:21,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:14:21,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 07:14:21,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:14:21,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 07:14:21,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:14:21,927 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-11 07:14:21,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 07:14:21,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128330384] [2024-10-11 07:14:21,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2128330384] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:14:21,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:14:21,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 07:14:21,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295460656] [2024-10-11 07:14:21,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:14:21,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 07:14:21,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 07:14:21,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 07:14:21,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-10-11 07:14:21,929 INFO L87 Difference]: Start difference. First operand 75 states and 115 transitions. Second operand has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-11 07:14:24,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:14:24,733 INFO L93 Difference]: Finished difference Result 173 states and 256 transitions. [2024-10-11 07:14:24,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 07:14:24,735 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 94 [2024-10-11 07:14:24,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:14:24,737 INFO L225 Difference]: With dead ends: 173 [2024-10-11 07:14:24,738 INFO L226 Difference]: Without dead ends: 130 [2024-10-11 07:14:24,738 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=79, Invalid=131, Unknown=0, NotChecked=0, Total=210 [2024-10-11 07:14:24,739 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 98 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-11 07:14:24,740 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 230 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-11 07:14:24,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2024-10-11 07:14:24,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 91. [2024-10-11 07:14:24,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 58 states have (on average 1.3448275862068966) internal successors, (78), 58 states have internal predecessors, (78), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-11 07:14:24,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 138 transitions. [2024-10-11 07:14:24,757 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 138 transitions. Word has length 94 [2024-10-11 07:14:24,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:14:24,757 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 138 transitions. [2024-10-11 07:14:24,757 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-11 07:14:24,758 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 138 transitions. [2024-10-11 07:14:24,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-10-11 07:14:24,759 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:14:24,760 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 07:14:24,760 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 07:14:24,760 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:14:24,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:14:24,760 INFO L85 PathProgramCache]: Analyzing trace with hash -980662300, now seen corresponding path program 1 times [2024-10-11 07:14:24,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:14:24,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137405305] [2024-10-11 07:14:24,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:14:24,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:14:24,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:14:24,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 07:14:24,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:14:24,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 07:14:24,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:14:24,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 07:14:24,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:14:24,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 07:14:24,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:14:24,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 07:14:24,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:14:24,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 07:14:24,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:14:24,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 07:14:24,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:14:24,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 07:14:24,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:14:24,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 07:14:24,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:14:24,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 07:14:24,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:14:24,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 07:14:24,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:14:24,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 07:14:24,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:14:24,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 07:14:24,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:14:24,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 07:14:24,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:14:24,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 07:14:24,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:14:24,848 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-11 07:14:24,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 07:14:24,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137405305] [2024-10-11 07:14:24,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137405305] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:14:24,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:14:24,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 07:14:24,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224100333] [2024-10-11 07:14:24,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:14:24,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 07:14:24,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 07:14:24,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 07:14:24,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 07:14:24,853 INFO L87 Difference]: Start difference. First operand 91 states and 138 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-11 07:14:24,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:14:24,891 INFO L93 Difference]: Finished difference Result 193 states and 292 transitions. [2024-10-11 07:14:24,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 07:14:24,892 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 94 [2024-10-11 07:14:24,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:14:24,893 INFO L225 Difference]: With dead ends: 193 [2024-10-11 07:14:24,893 INFO L226 Difference]: Without dead ends: 135 [2024-10-11 07:14:24,894 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 07:14:24,895 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 59 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 07:14:24,897 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 128 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 07:14:24,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2024-10-11 07:14:24,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 133. [2024-10-11 07:14:24,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 84 states have (on average 1.3095238095238095) internal successors, (110), 84 states have internal predecessors, (110), 45 states have call successors, (45), 3 states have call predecessors, (45), 3 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2024-10-11 07:14:24,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 200 transitions. [2024-10-11 07:14:24,921 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 200 transitions. Word has length 94 [2024-10-11 07:14:24,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:14:24,921 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 200 transitions. [2024-10-11 07:14:24,922 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-11 07:14:24,923 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 200 transitions. [2024-10-11 07:14:24,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-10-11 07:14:24,924 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:14:24,924 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 07:14:24,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 07:14:24,926 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:14:24,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:14:24,927 INFO L85 PathProgramCache]: Analyzing trace with hash 57202437, now seen corresponding path program 1 times [2024-10-11 07:14:24,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:14:24,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141749004] [2024-10-11 07:14:24,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:14:24,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:14:24,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:14:29,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 07:14:29,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:14:29,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 07:14:29,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:14:29,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 07:14:29,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:14:29,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 07:14:29,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:14:29,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 07:14:29,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:14:29,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 07:14:29,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:14:29,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 07:14:29,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:14:29,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 07:14:29,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:14:29,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 07:14:29,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:14:29,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 07:14:29,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:14:29,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 07:14:29,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:14:29,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 07:14:29,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:14:29,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 07:14:29,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:14:29,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 07:14:29,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:14:29,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 07:14:29,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:14:29,863 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-11 07:14:29,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 07:14:29,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141749004] [2024-10-11 07:14:29,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2141749004] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:14:29,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:14:29,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 07:14:29,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825210867] [2024-10-11 07:14:29,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:14:29,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 07:14:29,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 07:14:29,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 07:14:29,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2024-10-11 07:14:29,867 INFO L87 Difference]: Start difference. First operand 133 states and 200 transitions. Second operand has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-11 07:14:33,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:14:33,989 INFO L93 Difference]: Finished difference Result 172 states and 244 transitions. [2024-10-11 07:14:33,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 07:14:33,989 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 95 [2024-10-11 07:14:33,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:14:33,991 INFO L225 Difference]: With dead ends: 172 [2024-10-11 07:14:33,991 INFO L226 Difference]: Without dead ends: 170 [2024-10-11 07:14:33,993 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=130, Invalid=212, Unknown=0, NotChecked=0, Total=342 [2024-10-11 07:14:33,994 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 93 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-11 07:14:33,997 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 216 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-11 07:14:33,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2024-10-11 07:14:34,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 134. [2024-10-11 07:14:34,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 85 states have (on average 1.3058823529411765) internal successors, (111), 85 states have internal predecessors, (111), 45 states have call successors, (45), 3 states have call predecessors, (45), 3 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2024-10-11 07:14:34,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 201 transitions. [2024-10-11 07:14:34,024 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 201 transitions. Word has length 95 [2024-10-11 07:14:34,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:14:34,025 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 201 transitions. [2024-10-11 07:14:34,025 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-11 07:14:34,025 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 201 transitions. [2024-10-11 07:14:34,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-10-11 07:14:34,026 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:14:34,026 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 07:14:34,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 07:14:34,027 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:14:34,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:14:34,027 INFO L85 PathProgramCache]: Analyzing trace with hash 108770658, now seen corresponding path program 1 times [2024-10-11 07:14:34,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:14:34,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714127613] [2024-10-11 07:14:34,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:14:34,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:14:34,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:14:38,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 07:14:38,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:14:38,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 07:14:38,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:14:38,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 07:14:38,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:14:38,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 07:14:38,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:14:38,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 07:14:38,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:14:38,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 07:14:38,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:14:38,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 07:14:38,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:14:38,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 07:14:38,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:14:38,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 07:14:38,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:14:38,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 07:14:38,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:14:38,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 07:14:38,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:14:38,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 07:14:38,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:14:38,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 07:14:38,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:14:38,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 07:14:38,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:14:38,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 07:14:38,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:14:38,380 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-11 07:14:38,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 07:14:38,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714127613] [2024-10-11 07:14:38,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [714127613] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:14:38,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:14:38,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-11 07:14:38,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043866794] [2024-10-11 07:14:38,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:14:38,381 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 07:14:38,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 07:14:38,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 07:14:38,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-10-11 07:14:38,382 INFO L87 Difference]: Start difference. First operand 134 states and 201 transitions. Second operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-11 07:14:42,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:14:42,910 INFO L93 Difference]: Finished difference Result 172 states and 244 transitions. [2024-10-11 07:14:42,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 07:14:42,912 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 95 [2024-10-11 07:14:42,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:14:42,914 INFO L225 Difference]: With dead ends: 172 [2024-10-11 07:14:42,914 INFO L226 Difference]: Without dead ends: 170 [2024-10-11 07:14:42,915 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=108, Invalid=198, Unknown=0, NotChecked=0, Total=306 [2024-10-11 07:14:42,916 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 154 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 381 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 382 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-10-11 07:14:42,916 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 152 Invalid, 382 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 381 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-10-11 07:14:42,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2024-10-11 07:14:42,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 136. [2024-10-11 07:14:42,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 87 states have (on average 1.3103448275862069) internal successors, (114), 87 states have internal predecessors, (114), 45 states have call successors, (45), 3 states have call predecessors, (45), 3 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2024-10-11 07:14:42,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 204 transitions. [2024-10-11 07:14:42,931 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 204 transitions. Word has length 95 [2024-10-11 07:14:42,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:14:42,932 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 204 transitions. [2024-10-11 07:14:42,932 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-11 07:14:42,932 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 204 transitions. [2024-10-11 07:14:42,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-10-11 07:14:42,933 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:14:42,933 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 07:14:42,933 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 07:14:42,933 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:14:42,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:14:42,933 INFO L85 PathProgramCache]: Analyzing trace with hash 885961279, now seen corresponding path program 1 times [2024-10-11 07:14:42,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:14:42,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010866585] [2024-10-11 07:14:42,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:14:42,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:14:42,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:14:51,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 07:14:51,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:14:51,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 07:14:51,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:14:51,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 07:14:51,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:14:51,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 07:14:51,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:14:51,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 07:14:51,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:14:51,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 07:14:51,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:14:51,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 07:14:51,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:14:51,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 07:14:51,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:14:51,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 07:14:51,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:14:51,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 07:14:51,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:14:51,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 07:14:51,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:14:51,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 07:14:51,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:14:51,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 07:14:51,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:14:51,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 07:14:51,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:14:51,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 07:14:51,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:14:51,087 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-11 07:14:51,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 07:14:51,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010866585] [2024-10-11 07:14:51,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2010866585] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:14:51,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:14:51,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 07:14:51,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298868807] [2024-10-11 07:14:51,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:14:51,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 07:14:51,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 07:14:51,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 07:14:51,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2024-10-11 07:14:51,089 INFO L87 Difference]: Start difference. First operand 136 states and 204 transitions. Second operand has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-11 07:14:53,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:14:53,905 INFO L93 Difference]: Finished difference Result 184 states and 260 transitions. [2024-10-11 07:14:53,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 07:14:53,905 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 95 [2024-10-11 07:14:53,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:14:53,907 INFO L225 Difference]: With dead ends: 184 [2024-10-11 07:14:53,907 INFO L226 Difference]: Without dead ends: 182 [2024-10-11 07:14:53,907 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2024-10-11 07:14:53,908 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 83 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-11 07:14:53,908 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 193 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-10-11 07:14:53,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2024-10-11 07:14:53,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 145. [2024-10-11 07:14:53,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 96 states have (on average 1.3229166666666667) internal successors, (127), 96 states have internal predecessors, (127), 45 states have call successors, (45), 3 states have call predecessors, (45), 3 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2024-10-11 07:14:53,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 217 transitions. [2024-10-11 07:14:53,928 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 217 transitions. Word has length 95 [2024-10-11 07:14:53,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:14:53,928 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 217 transitions. [2024-10-11 07:14:53,928 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-11 07:14:53,929 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 217 transitions. [2024-10-11 07:14:53,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-10-11 07:14:53,929 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:14:53,929 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 07:14:53,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 07:14:53,930 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:14:53,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:14:53,930 INFO L85 PathProgramCache]: Analyzing trace with hash -2094822518, now seen corresponding path program 1 times [2024-10-11 07:14:53,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:14:53,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871276320] [2024-10-11 07:14:53,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:14:53,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:14:53,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:14:54,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 07:14:54,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:14:54,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 07:14:54,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:14:54,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 07:14:54,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:14:54,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 07:14:54,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:14:54,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 07:14:54,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:14:54,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 07:14:54,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:14:54,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 07:14:54,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:14:54,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 07:14:54,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:14:54,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 07:14:54,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:14:54,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 07:14:54,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:14:54,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 07:14:54,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:14:54,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 07:14:54,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:14:54,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 07:14:54,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:14:54,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 07:14:54,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:14:54,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 07:14:54,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:14:54,045 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-11 07:14:54,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 07:14:54,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871276320] [2024-10-11 07:14:54,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871276320] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:14:54,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:14:54,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 07:14:54,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319838456] [2024-10-11 07:14:54,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:14:54,046 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 07:14:54,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 07:14:54,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 07:14:54,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 07:14:54,047 INFO L87 Difference]: Start difference. First operand 145 states and 217 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-11 07:14:54,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:14:54,119 INFO L93 Difference]: Finished difference Result 328 states and 485 transitions. [2024-10-11 07:14:54,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 07:14:54,120 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 95 [2024-10-11 07:14:54,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:14:54,123 INFO L225 Difference]: With dead ends: 328 [2024-10-11 07:14:54,123 INFO L226 Difference]: Without dead ends: 217 [2024-10-11 07:14:54,125 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 07:14:54,126 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 58 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 07:14:54,126 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 200 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 07:14:54,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2024-10-11 07:14:54,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 193. [2024-10-11 07:14:54,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 128 states have (on average 1.3125) internal successors, (168), 128 states have internal predecessors, (168), 60 states have call successors, (60), 4 states have call predecessors, (60), 4 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-10-11 07:14:54,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 288 transitions. [2024-10-11 07:14:54,147 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 288 transitions. Word has length 95 [2024-10-11 07:14:54,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:14:54,148 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 288 transitions. [2024-10-11 07:14:54,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-11 07:14:54,148 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 288 transitions. [2024-10-11 07:14:54,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-10-11 07:14:54,149 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:14:54,149 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 07:14:54,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 07:14:54,150 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:14:54,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:14:54,150 INFO L85 PathProgramCache]: Analyzing trace with hash -923141243, now seen corresponding path program 1 times [2024-10-11 07:14:54,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:14:54,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127884211] [2024-10-11 07:14:54,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:14:54,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:14:54,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:14:58,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 07:14:58,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:14:58,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 07:14:58,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:14:58,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 07:14:58,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:14:58,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 07:14:58,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:14:58,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 07:14:58,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:14:58,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 07:14:58,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:14:58,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 07:14:58,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:14:58,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 07:14:58,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:14:58,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 07:14:58,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:14:58,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 07:14:58,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:14:58,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 07:14:58,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:14:58,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 07:14:58,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:14:58,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 07:14:58,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:14:58,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 07:14:58,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:14:58,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 07:14:58,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:14:58,877 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-11 07:14:58,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 07:14:58,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127884211] [2024-10-11 07:14:58,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [127884211] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:14:58,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:14:58,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-11 07:14:58,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826048156] [2024-10-11 07:14:58,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:14:58,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 07:14:58,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 07:14:58,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 07:14:58,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2024-10-11 07:14:58,879 INFO L87 Difference]: Start difference. First operand 193 states and 288 transitions. Second operand has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-11 07:15:02,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:15:02,994 INFO L93 Difference]: Finished difference Result 236 states and 338 transitions. [2024-10-11 07:15:02,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 07:15:02,995 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 96 [2024-10-11 07:15:02,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:15:02,996 INFO L225 Difference]: With dead ends: 236 [2024-10-11 07:15:02,996 INFO L226 Difference]: Without dead ends: 234 [2024-10-11 07:15:02,997 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=160, Invalid=260, Unknown=0, NotChecked=0, Total=420 [2024-10-11 07:15:02,997 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 69 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-11 07:15:02,997 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 197 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-11 07:15:02,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2024-10-11 07:15:03,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 192. [2024-10-11 07:15:03,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 127 states have (on average 1.3070866141732282) internal successors, (166), 127 states have internal predecessors, (166), 60 states have call successors, (60), 4 states have call predecessors, (60), 4 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-10-11 07:15:03,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 286 transitions. [2024-10-11 07:15:03,017 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 286 transitions. Word has length 96 [2024-10-11 07:15:03,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:15:03,018 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 286 transitions. [2024-10-11 07:15:03,018 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-11 07:15:03,018 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 286 transitions. [2024-10-11 07:15:03,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-10-11 07:15:03,019 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:15:03,019 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 07:15:03,019 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 07:15:03,019 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:15:03,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:15:03,020 INFO L85 PathProgramCache]: Analyzing trace with hash 1694991110, now seen corresponding path program 1 times [2024-10-11 07:15:03,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:15:03,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487487321] [2024-10-11 07:15:03,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:15:03,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:15:03,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:15:14,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 07:15:14,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:15:14,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 07:15:14,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:15:14,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 07:15:14,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:15:14,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 07:15:14,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:15:14,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 07:15:14,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:15:14,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 07:15:14,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:15:14,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 07:15:14,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:15:14,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 07:15:14,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:15:14,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 07:15:14,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:15:14,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 07:15:14,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:15:14,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 07:15:14,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:15:14,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 07:15:14,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:15:14,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 07:15:14,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:15:14,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 07:15:14,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:15:14,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 07:15:14,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:15:14,046 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-11 07:15:14,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 07:15:14,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487487321] [2024-10-11 07:15:14,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1487487321] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:15:14,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:15:14,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-11 07:15:14,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510712436] [2024-10-11 07:15:14,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:15:14,047 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 07:15:14,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 07:15:14,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 07:15:14,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2024-10-11 07:15:14,048 INFO L87 Difference]: Start difference. First operand 192 states and 286 transitions. Second operand has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-11 07:15:18,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:15:18,673 INFO L93 Difference]: Finished difference Result 254 states and 359 transitions. [2024-10-11 07:15:18,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 07:15:18,674 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 96 [2024-10-11 07:15:18,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:15:18,676 INFO L225 Difference]: With dead ends: 254 [2024-10-11 07:15:18,676 INFO L226 Difference]: Without dead ends: 252 [2024-10-11 07:15:18,676 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=79, Invalid=103, Unknown=0, NotChecked=0, Total=182 [2024-10-11 07:15:18,676 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 82 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-11 07:15:18,677 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 175 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-11 07:15:18,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2024-10-11 07:15:18,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 194. [2024-10-11 07:15:18,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 129 states have (on average 1.302325581395349) internal successors, (168), 129 states have internal predecessors, (168), 60 states have call successors, (60), 4 states have call predecessors, (60), 4 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-10-11 07:15:18,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 288 transitions. [2024-10-11 07:15:18,692 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 288 transitions. Word has length 96 [2024-10-11 07:15:18,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:15:18,692 INFO L471 AbstractCegarLoop]: Abstraction has 194 states and 288 transitions. [2024-10-11 07:15:18,693 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-11 07:15:18,693 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 288 transitions. [2024-10-11 07:15:18,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-10-11 07:15:18,693 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:15:18,693 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 07:15:18,694 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 07:15:18,694 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:15:18,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:15:18,694 INFO L85 PathProgramCache]: Analyzing trace with hash 1746499749, now seen corresponding path program 1 times [2024-10-11 07:15:18,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:15:18,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549095804] [2024-10-11 07:15:18,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:15:18,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:15:18,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:15:27,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 07:15:27,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:15:27,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 07:15:27,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:15:27,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 07:15:27,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:15:27,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 07:15:27,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:15:27,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 07:15:27,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:15:27,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 07:15:27,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:15:27,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 07:15:27,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:15:27,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 07:15:27,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:15:27,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 07:15:27,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:15:27,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 07:15:27,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:15:27,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 07:15:27,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:15:27,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 07:15:27,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:15:27,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 07:15:27,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:15:27,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 07:15:27,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:15:27,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 07:15:27,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:15:27,277 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-11 07:15:27,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 07:15:27,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549095804] [2024-10-11 07:15:27,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549095804] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:15:27,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:15:27,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-11 07:15:27,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640962674] [2024-10-11 07:15:27,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:15:27,311 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 07:15:27,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 07:15:27,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 07:15:27,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2024-10-11 07:15:27,311 INFO L87 Difference]: Start difference. First operand 194 states and 288 transitions. Second operand has 12 states, 12 states have (on average 2.0) internal successors, (24), 12 states have internal predecessors, (24), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-11 07:15:32,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:15:32,100 INFO L93 Difference]: Finished difference Result 254 states and 359 transitions. [2024-10-11 07:15:32,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 07:15:32,100 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.0) internal successors, (24), 12 states have internal predecessors, (24), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 96 [2024-10-11 07:15:32,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:15:32,105 INFO L225 Difference]: With dead ends: 254 [2024-10-11 07:15:32,110 INFO L226 Difference]: Without dead ends: 252 [2024-10-11 07:15:32,110 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=79, Invalid=131, Unknown=0, NotChecked=0, Total=210 [2024-10-11 07:15:32,111 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 159 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-10-11 07:15:32,111 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 138 Invalid, 277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 275 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-10-11 07:15:32,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2024-10-11 07:15:32,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 198. [2024-10-11 07:15:32,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 133 states have (on average 1.3082706766917294) internal successors, (174), 133 states have internal predecessors, (174), 60 states have call successors, (60), 4 states have call predecessors, (60), 4 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-10-11 07:15:32,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 294 transitions. [2024-10-11 07:15:32,136 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 294 transitions. Word has length 96 [2024-10-11 07:15:32,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:15:32,136 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 294 transitions. [2024-10-11 07:15:32,137 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.0) internal successors, (24), 12 states have internal predecessors, (24), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-11 07:15:32,137 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 294 transitions. [2024-10-11 07:15:32,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-10-11 07:15:32,138 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:15:32,138 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 07:15:32,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 07:15:32,138 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:15:32,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:15:32,139 INFO L85 PathProgramCache]: Analyzing trace with hash 1014770457, now seen corresponding path program 1 times [2024-10-11 07:15:32,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:15:32,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306966042] [2024-10-11 07:15:32,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:15:32,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:15:32,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:15:39,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 07:15:39,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:15:39,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 07:15:39,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:15:39,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 07:15:39,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:15:39,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 07:15:39,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:15:39,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 07:15:39,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:15:39,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 07:15:39,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:15:39,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 07:15:39,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:15:39,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 07:15:39,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:15:39,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 07:15:39,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:15:39,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 07:15:39,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:15:39,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 07:15:39,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:15:39,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 07:15:39,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:15:39,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 07:15:39,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:15:39,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 07:15:39,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:15:39,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 07:15:39,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:15:39,079 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-11 07:15:39,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 07:15:39,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306966042] [2024-10-11 07:15:39,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306966042] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:15:39,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:15:39,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-11 07:15:39,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625033918] [2024-10-11 07:15:39,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:15:39,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 07:15:39,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 07:15:39,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 07:15:39,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2024-10-11 07:15:39,081 INFO L87 Difference]: Start difference. First operand 198 states and 294 transitions. Second operand has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-11 07:15:43,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:15:43,738 INFO L93 Difference]: Finished difference Result 282 states and 399 transitions. [2024-10-11 07:15:43,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 07:15:43,739 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 96 [2024-10-11 07:15:43,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:15:43,741 INFO L225 Difference]: With dead ends: 282 [2024-10-11 07:15:43,741 INFO L226 Difference]: Without dead ends: 280 [2024-10-11 07:15:43,741 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2024-10-11 07:15:43,742 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 91 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-10-11 07:15:43,742 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 184 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-10-11 07:15:43,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2024-10-11 07:15:43,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 208. [2024-10-11 07:15:43,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 143 states have (on average 1.3286713286713288) internal successors, (190), 143 states have internal predecessors, (190), 60 states have call successors, (60), 4 states have call predecessors, (60), 4 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-10-11 07:15:43,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 310 transitions. [2024-10-11 07:15:43,756 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 310 transitions. Word has length 96 [2024-10-11 07:15:43,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:15:43,756 INFO L471 AbstractCegarLoop]: Abstraction has 208 states and 310 transitions. [2024-10-11 07:15:43,756 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-11 07:15:43,756 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 310 transitions. [2024-10-11 07:15:43,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-10-11 07:15:43,757 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:15:43,757 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 07:15:43,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 07:15:43,757 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:15:43,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:15:43,758 INFO L85 PathProgramCache]: Analyzing trace with hash -1693087392, now seen corresponding path program 1 times [2024-10-11 07:15:43,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:15:43,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438475791] [2024-10-11 07:15:43,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:15:43,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:15:43,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat