./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem03_label59.c --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/eca-rers2012/Problem03_label59.c -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 2d68e7262b60a12a6597b15e2848fbc8314c4945758acd933fd69212a55e4a41 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-10 22:39:47,548 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-10 22:39:47,621 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-10 22:39:47,626 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-10 22:39:47,626 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-10 22:39:47,648 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-10 22:39:47,648 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-10 22:39:47,649 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-10 22:39:47,649 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-10 22:39:47,653 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-10 22:39:47,653 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-10 22:39:47,653 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-10 22:39:47,654 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-10 22:39:47,654 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-10 22:39:47,654 INFO L153 SettingsManager]: * Use SBE=true [2024-10-10 22:39:47,654 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-10 22:39:47,655 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-10 22:39:47,655 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-10 22:39:47,655 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-10 22:39:47,655 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-10 22:39:47,656 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-10 22:39:47,657 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-10 22:39:47,657 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-10 22:39:47,659 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-10 22:39:47,660 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-10 22:39:47,660 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-10 22:39:47,660 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-10 22:39:47,671 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-10 22:39:47,672 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-10 22:39:47,672 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-10 22:39:47,672 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-10 22:39:47,672 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-10 22:39:47,672 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 22:39:47,672 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-10 22:39:47,673 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-10 22:39:47,673 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-10 22:39:47,673 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-10 22:39:47,673 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-10 22:39:47,673 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-10 22:39:47,673 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-10 22:39:47,673 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-10 22:39:47,677 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-10 22:39:47,677 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 -> 2d68e7262b60a12a6597b15e2848fbc8314c4945758acd933fd69212a55e4a41 [2024-10-10 22:39:47,889 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-10 22:39:47,907 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-10 22:39:47,909 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-10 22:39:47,910 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-10 22:39:47,911 INFO L274 PluginConnector]: CDTParser initialized [2024-10-10 22:39:47,912 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem03_label59.c [2024-10-10 22:39:49,155 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-10 22:39:49,417 INFO L384 CDTParser]: Found 1 translation units. [2024-10-10 22:39:49,417 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem03_label59.c [2024-10-10 22:39:49,435 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/8e88dded9/e7ce665be27c4c4e88ba816ace08c9f0/FLAGcbe2da187 [2024-10-10 22:39:49,711 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/8e88dded9/e7ce665be27c4c4e88ba816ace08c9f0 [2024-10-10 22:39:49,713 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-10 22:39:49,714 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-10 22:39:49,715 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-10 22:39:49,715 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-10 22:39:49,719 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-10 22:39:49,720 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 10:39:49" (1/1) ... [2024-10-10 22:39:49,721 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6de5912d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:39:49, skipping insertion in model container [2024-10-10 22:39:49,721 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 10:39:49" (1/1) ... [2024-10-10 22:39:49,773 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-10 22:39:50,148 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/eca-rers2012/Problem03_label59.c[57711,57724] [2024-10-10 22:39:50,181 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 22:39:50,190 INFO L200 MainTranslator]: Completed pre-run [2024-10-10 22:39:50,315 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/eca-rers2012/Problem03_label59.c[57711,57724] [2024-10-10 22:39:50,324 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 22:39:50,340 INFO L204 MainTranslator]: Completed translation [2024-10-10 22:39:50,340 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:39:50 WrapperNode [2024-10-10 22:39:50,340 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-10 22:39:50,341 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-10 22:39:50,341 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-10 22:39:50,343 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-10 22:39:50,348 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:39:50" (1/1) ... [2024-10-10 22:39:50,372 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:39:50" (1/1) ... [2024-10-10 22:39:50,490 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1772 [2024-10-10 22:39:50,490 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-10 22:39:50,491 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-10 22:39:50,491 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-10 22:39:50,491 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-10 22:39:50,499 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:39:50" (1/1) ... [2024-10-10 22:39:50,500 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:39:50" (1/1) ... [2024-10-10 22:39:50,511 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:39:50" (1/1) ... [2024-10-10 22:39:50,560 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-10 22:39:50,560 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:39:50" (1/1) ... [2024-10-10 22:39:50,561 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:39:50" (1/1) ... [2024-10-10 22:39:50,609 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:39:50" (1/1) ... [2024-10-10 22:39:50,621 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:39:50" (1/1) ... [2024-10-10 22:39:50,635 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:39:50" (1/1) ... [2024-10-10 22:39:50,640 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:39:50" (1/1) ... [2024-10-10 22:39:50,648 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-10 22:39:50,650 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-10 22:39:50,650 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-10 22:39:50,650 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-10 22:39:50,651 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:39:50" (1/1) ... [2024-10-10 22:39:50,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 22:39:50,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:39:50,677 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-10 22:39:50,682 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-10 22:39:50,717 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-10 22:39:50,717 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-10 22:39:50,718 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-10 22:39:50,718 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-10 22:39:50,782 INFO L238 CfgBuilder]: Building ICFG [2024-10-10 22:39:50,783 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-10 22:39:52,031 INFO L? ?]: Removed 147 outVars from TransFormulas that were not future-live. [2024-10-10 22:39:52,031 INFO L287 CfgBuilder]: Performing block encoding [2024-10-10 22:39:52,073 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-10 22:39:52,074 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-10 22:39:52,074 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 10:39:52 BoogieIcfgContainer [2024-10-10 22:39:52,074 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-10 22:39:52,076 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-10 22:39:52,076 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-10 22:39:52,084 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-10 22:39:52,084 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.10 10:39:49" (1/3) ... [2024-10-10 22:39:52,084 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6829a728 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 10:39:52, skipping insertion in model container [2024-10-10 22:39:52,084 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:39:50" (2/3) ... [2024-10-10 22:39:52,084 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6829a728 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 10:39:52, skipping insertion in model container [2024-10-10 22:39:52,085 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 10:39:52" (3/3) ... [2024-10-10 22:39:52,085 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem03_label59.c [2024-10-10 22:39:52,097 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-10 22:39:52,097 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-10 22:39:52,152 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-10 22:39:52,158 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;@22578fb8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-10 22:39:52,159 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-10 22:39:52,164 INFO L276 IsEmpty]: Start isEmpty. Operand has 240 states, 238 states have (on average 1.9201680672268908) internal successors, (457), 239 states have internal predecessors, (457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:39:52,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-10-10 22:39:52,173 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:39:52,174 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 22:39:52,174 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:39:52,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:39:52,178 INFO L85 PathProgramCache]: Analyzing trace with hash 554871622, now seen corresponding path program 1 times [2024-10-10 22:39:52,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:39:52,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043062095] [2024-10-10 22:39:52,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:39:52,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:39:52,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:39:52,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:39:52,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:39:52,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043062095] [2024-10-10 22:39:52,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043062095] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:39:52,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:39:52,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 22:39:52,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895759252] [2024-10-10 22:39:52,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:39:52,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-10 22:39:52,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:39:52,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-10 22:39:52,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-10 22:39:52,682 INFO L87 Difference]: Start difference. First operand has 240 states, 238 states have (on average 1.9201680672268908) internal successors, (457), 239 states have internal predecessors, (457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 86.5) internal successors, (173), 2 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:39:52,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:39:52,719 INFO L93 Difference]: Finished difference Result 479 states and 913 transitions. [2024-10-10 22:39:52,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-10 22:39:52,723 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 86.5) internal successors, (173), 2 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 173 [2024-10-10 22:39:52,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:39:52,732 INFO L225 Difference]: With dead ends: 479 [2024-10-10 22:39:52,733 INFO L226 Difference]: Without dead ends: 238 [2024-10-10 22:39:52,736 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 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-10 22:39:52,738 INFO L432 NwaCegarLoop]: 392 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 392 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 22:39:52,740 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 392 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 22:39:52,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2024-10-10 22:39:52,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 238. [2024-10-10 22:39:52,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 237 states have (on average 1.6540084388185654) internal successors, (392), 237 states have internal predecessors, (392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:39:52,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 392 transitions. [2024-10-10 22:39:52,776 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 392 transitions. Word has length 173 [2024-10-10 22:39:52,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:39:52,780 INFO L471 AbstractCegarLoop]: Abstraction has 238 states and 392 transitions. [2024-10-10 22:39:52,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 86.5) internal successors, (173), 2 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:39:52,780 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 392 transitions. [2024-10-10 22:39:52,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-10-10 22:39:52,783 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:39:52,783 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 22:39:52,784 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-10 22:39:52,784 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:39:52,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:39:52,785 INFO L85 PathProgramCache]: Analyzing trace with hash 707037559, now seen corresponding path program 1 times [2024-10-10 22:39:52,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:39:52,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092117153] [2024-10-10 22:39:52,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:39:52,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:39:52,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:39:53,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:39:53,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:39:53,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092117153] [2024-10-10 22:39:53,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2092117153] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:39:53,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:39:53,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 22:39:53,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057770464] [2024-10-10 22:39:53,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:39:53,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:39:53,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:39:53,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:39:53,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:39:53,233 INFO L87 Difference]: Start difference. First operand 238 states and 392 transitions. Second operand has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 2 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:39:53,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:39:53,919 INFO L93 Difference]: Finished difference Result 704 states and 1166 transitions. [2024-10-10 22:39:53,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:39:53,919 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 2 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 173 [2024-10-10 22:39:53,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:39:53,925 INFO L225 Difference]: With dead ends: 704 [2024-10-10 22:39:53,925 INFO L226 Difference]: Without dead ends: 467 [2024-10-10 22:39:53,926 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-10 22:39:53,927 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 71 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 626 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 703 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 626 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-10 22:39:53,928 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 129 Invalid, 703 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 626 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-10 22:39:53,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467 states. [2024-10-10 22:39:53,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467 to 453. [2024-10-10 22:39:53,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 453 states, 452 states have (on average 1.6283185840707965) internal successors, (736), 452 states have internal predecessors, (736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:39:53,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 736 transitions. [2024-10-10 22:39:53,951 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 736 transitions. Word has length 173 [2024-10-10 22:39:53,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:39:53,952 INFO L471 AbstractCegarLoop]: Abstraction has 453 states and 736 transitions. [2024-10-10 22:39:53,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 2 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:39:53,952 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 736 transitions. [2024-10-10 22:39:53,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-10-10 22:39:53,955 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:39:53,955 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 22:39:53,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-10 22:39:53,955 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:39:53,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:39:53,959 INFO L85 PathProgramCache]: Analyzing trace with hash 1838677037, now seen corresponding path program 1 times [2024-10-10 22:39:53,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:39:53,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720830881] [2024-10-10 22:39:53,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:39:53,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:39:53,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:39:54,180 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:39:54,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:39:54,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720830881] [2024-10-10 22:39:54,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1720830881] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:39:54,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:39:54,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 22:39:54,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772349385] [2024-10-10 22:39:54,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:39:54,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:39:54,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:39:54,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:39:54,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:39:54,186 INFO L87 Difference]: Start difference. First operand 453 states and 736 transitions. Second operand has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 2 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:39:54,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:39:54,830 INFO L93 Difference]: Finished difference Result 1329 states and 2168 transitions. [2024-10-10 22:39:54,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:39:54,831 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 2 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 178 [2024-10-10 22:39:54,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:39:54,833 INFO L225 Difference]: With dead ends: 1329 [2024-10-10 22:39:54,834 INFO L226 Difference]: Without dead ends: 877 [2024-10-10 22:39:54,835 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-10 22:39:54,836 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 251 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 610 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 714 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 610 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-10 22:39:54,836 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [251 Valid, 161 Invalid, 714 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 610 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-10 22:39:54,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 877 states. [2024-10-10 22:39:54,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 877 to 873. [2024-10-10 22:39:54,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 873 states, 872 states have (on average 1.5229357798165137) internal successors, (1328), 872 states have internal predecessors, (1328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:39:54,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 1328 transitions. [2024-10-10 22:39:54,856 INFO L78 Accepts]: Start accepts. Automaton has 873 states and 1328 transitions. Word has length 178 [2024-10-10 22:39:54,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:39:54,856 INFO L471 AbstractCegarLoop]: Abstraction has 873 states and 1328 transitions. [2024-10-10 22:39:54,857 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 2 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:39:54,857 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 1328 transitions. [2024-10-10 22:39:54,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2024-10-10 22:39:54,864 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:39:54,864 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 22:39:54,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-10 22:39:54,865 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:39:54,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:39:54,865 INFO L85 PathProgramCache]: Analyzing trace with hash -809045034, now seen corresponding path program 1 times [2024-10-10 22:39:54,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:39:54,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074016592] [2024-10-10 22:39:54,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:39:54,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:39:54,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:39:54,998 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:39:54,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:39:54,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074016592] [2024-10-10 22:39:54,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074016592] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:39:54,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:39:54,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 22:39:54,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967989146] [2024-10-10 22:39:55,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:39:55,000 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:39:55,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:39:55,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:39:55,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:39:55,002 INFO L87 Difference]: Start difference. First operand 873 states and 1328 transitions. Second operand has 3 states, 3 states have (on average 60.333333333333336) internal successors, (181), 2 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:39:55,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:39:55,631 INFO L93 Difference]: Finished difference Result 2574 states and 3934 transitions. [2024-10-10 22:39:55,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:39:55,632 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 60.333333333333336) internal successors, (181), 2 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 181 [2024-10-10 22:39:55,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:39:55,637 INFO L225 Difference]: With dead ends: 2574 [2024-10-10 22:39:55,637 INFO L226 Difference]: Without dead ends: 1702 [2024-10-10 22:39:55,638 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-10 22:39:55,639 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 249 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 585 mSolverCounterSat, 195 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 780 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 195 IncrementalHoareTripleChecker+Valid, 585 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-10 22:39:55,639 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 88 Invalid, 780 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [195 Valid, 585 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-10 22:39:55,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1702 states. [2024-10-10 22:39:55,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1702 to 1686. [2024-10-10 22:39:55,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1686 states, 1685 states have (on average 1.4997032640949555) internal successors, (2527), 1685 states have internal predecessors, (2527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:39:55,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1686 states to 1686 states and 2527 transitions. [2024-10-10 22:39:55,675 INFO L78 Accepts]: Start accepts. Automaton has 1686 states and 2527 transitions. Word has length 181 [2024-10-10 22:39:55,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:39:55,676 INFO L471 AbstractCegarLoop]: Abstraction has 1686 states and 2527 transitions. [2024-10-10 22:39:55,676 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 60.333333333333336) internal successors, (181), 2 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:39:55,676 INFO L276 IsEmpty]: Start isEmpty. Operand 1686 states and 2527 transitions. [2024-10-10 22:39:55,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2024-10-10 22:39:55,680 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:39:55,680 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 22:39:55,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-10 22:39:55,680 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:39:55,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:39:55,681 INFO L85 PathProgramCache]: Analyzing trace with hash -493549167, now seen corresponding path program 1 times [2024-10-10 22:39:55,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:39:55,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023072102] [2024-10-10 22:39:55,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:39:55,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:39:55,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:39:55,928 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:39:55,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:39:55,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023072102] [2024-10-10 22:39:55,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023072102] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:39:55,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:39:55,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 22:39:55,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490134504] [2024-10-10 22:39:55,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:39:55,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:39:55,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:39:55,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:39:55,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:39:55,931 INFO L87 Difference]: Start difference. First operand 1686 states and 2527 transitions. Second operand has 3 states, 3 states have (on average 61.0) internal successors, (183), 2 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:39:56,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:39:56,575 INFO L93 Difference]: Finished difference Result 4193 states and 6265 transitions. [2024-10-10 22:39:56,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:39:56,576 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 61.0) internal successors, (183), 2 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 183 [2024-10-10 22:39:56,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:39:56,584 INFO L225 Difference]: With dead ends: 4193 [2024-10-10 22:39:56,585 INFO L226 Difference]: Without dead ends: 2508 [2024-10-10 22:39:56,587 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-10 22:39:56,589 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 236 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 585 mSolverCounterSat, 161 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 746 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 161 IncrementalHoareTripleChecker+Valid, 585 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-10 22:39:56,590 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [236 Valid, 111 Invalid, 746 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [161 Valid, 585 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-10 22:39:56,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2508 states. [2024-10-10 22:39:56,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2508 to 2507. [2024-10-10 22:39:56,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2507 states, 2506 states have (on average 1.4672785315243415) internal successors, (3677), 2506 states have internal predecessors, (3677), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:39:56,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2507 states to 2507 states and 3677 transitions. [2024-10-10 22:39:56,628 INFO L78 Accepts]: Start accepts. Automaton has 2507 states and 3677 transitions. Word has length 183 [2024-10-10 22:39:56,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:39:56,628 INFO L471 AbstractCegarLoop]: Abstraction has 2507 states and 3677 transitions. [2024-10-10 22:39:56,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 61.0) internal successors, (183), 2 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:39:56,629 INFO L276 IsEmpty]: Start isEmpty. Operand 2507 states and 3677 transitions. [2024-10-10 22:39:56,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2024-10-10 22:39:56,632 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:39:56,632 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 22:39:56,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-10 22:39:56,633 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:39:56,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:39:56,633 INFO L85 PathProgramCache]: Analyzing trace with hash -1077995673, now seen corresponding path program 1 times [2024-10-10 22:39:56,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:39:56,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476647580] [2024-10-10 22:39:56,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:39:56,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:39:56,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:39:56,869 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 8 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:39:56,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:39:56,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476647580] [2024-10-10 22:39:56,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476647580] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 22:39:56,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [264957155] [2024-10-10 22:39:56,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:39:56,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:39:56,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:39:56,873 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 22:39:56,874 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-10 22:39:57,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:39:57,009 INFO L255 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-10 22:39:57,017 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:39:57,203 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-10 22:39:57,204 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 22:39:57,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [264957155] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:39:57,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 22:39:57,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2024-10-10 22:39:57,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085386795] [2024-10-10 22:39:57,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:39:57,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:39:57,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:39:57,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:39:57,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-10 22:39:57,206 INFO L87 Difference]: Start difference. First operand 2507 states and 3677 transitions. Second operand has 3 states, 3 states have (on average 61.0) internal successors, (183), 3 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:39:57,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:39:57,871 INFO L93 Difference]: Finished difference Result 7452 states and 10940 transitions. [2024-10-10 22:39:57,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:39:57,872 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 61.0) internal successors, (183), 3 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 188 [2024-10-10 22:39:57,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:39:57,887 INFO L225 Difference]: With dead ends: 7452 [2024-10-10 22:39:57,887 INFO L226 Difference]: Without dead ends: 4946 [2024-10-10 22:39:57,890 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-10 22:39:57,893 INFO L432 NwaCegarLoop]: 398 mSDtfsCounter, 58 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 535 mSolverCounterSat, 170 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 705 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 170 IncrementalHoareTripleChecker+Valid, 535 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-10 22:39:57,894 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 426 Invalid, 705 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [170 Valid, 535 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-10 22:39:57,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4946 states. [2024-10-10 22:39:57,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4946 to 4132. [2024-10-10 22:39:57,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4132 states, 4131 states have (on average 1.3343016218833212) internal successors, (5512), 4131 states have internal predecessors, (5512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:39:57,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4132 states to 4132 states and 5512 transitions. [2024-10-10 22:39:57,955 INFO L78 Accepts]: Start accepts. Automaton has 4132 states and 5512 transitions. Word has length 188 [2024-10-10 22:39:57,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:39:57,956 INFO L471 AbstractCegarLoop]: Abstraction has 4132 states and 5512 transitions. [2024-10-10 22:39:57,956 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 61.0) internal successors, (183), 3 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:39:57,957 INFO L276 IsEmpty]: Start isEmpty. Operand 4132 states and 5512 transitions. [2024-10-10 22:39:57,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-10-10 22:39:57,961 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:39:57,962 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 22:39:57,975 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-10 22:39:58,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:39:58,163 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:39:58,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:39:58,163 INFO L85 PathProgramCache]: Analyzing trace with hash -1300934582, now seen corresponding path program 1 times [2024-10-10 22:39:58,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:39:58,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509157894] [2024-10-10 22:39:58,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:39:58,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:39:58,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:39:58,537 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:39:58,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:39:58,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509157894] [2024-10-10 22:39:58,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509157894] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:39:58,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:39:58,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 22:39:58,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790665204] [2024-10-10 22:39:58,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:39:58,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:39:58,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:39:58,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:39:58,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:39:58,540 INFO L87 Difference]: Start difference. First operand 4132 states and 5512 transitions. Second operand has 3 states, 3 states have (on average 64.0) internal successors, (192), 2 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:39:59,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:39:59,177 INFO L93 Difference]: Finished difference Result 10304 states and 13689 transitions. [2024-10-10 22:39:59,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:39:59,177 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 64.0) internal successors, (192), 2 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 192 [2024-10-10 22:39:59,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:39:59,193 INFO L225 Difference]: With dead ends: 10304 [2024-10-10 22:39:59,194 INFO L226 Difference]: Without dead ends: 6173 [2024-10-10 22:39:59,199 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-10 22:39:59,200 INFO L432 NwaCegarLoop]: 167 mSDtfsCounter, 204 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 626 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 741 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 626 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-10 22:39:59,200 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 188 Invalid, 741 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 626 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-10 22:39:59,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6173 states. [2024-10-10 22:39:59,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6173 to 6162. [2024-10-10 22:39:59,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6162 states, 6161 states have (on average 1.2952442785262133) internal successors, (7980), 6161 states have internal predecessors, (7980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:39:59,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6162 states to 6162 states and 7980 transitions. [2024-10-10 22:39:59,284 INFO L78 Accepts]: Start accepts. Automaton has 6162 states and 7980 transitions. Word has length 192 [2024-10-10 22:39:59,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:39:59,284 INFO L471 AbstractCegarLoop]: Abstraction has 6162 states and 7980 transitions. [2024-10-10 22:39:59,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 64.0) internal successors, (192), 2 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:39:59,285 INFO L276 IsEmpty]: Start isEmpty. Operand 6162 states and 7980 transitions. [2024-10-10 22:39:59,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-10-10 22:39:59,293 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:39:59,293 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 22:39:59,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-10 22:39:59,294 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:39:59,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:39:59,294 INFO L85 PathProgramCache]: Analyzing trace with hash 1018689561, now seen corresponding path program 1 times [2024-10-10 22:39:59,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:39:59,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717570161] [2024-10-10 22:39:59,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:39:59,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:39:59,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:39:59,658 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 25 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:39:59,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:39:59,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717570161] [2024-10-10 22:39:59,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [717570161] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 22:39:59,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1778671634] [2024-10-10 22:39:59,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:39:59,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:39:59,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:39:59,661 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 22:39:59,662 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-10 22:39:59,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:39:59,769 INFO L255 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-10 22:39:59,773 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:39:59,811 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-10 22:39:59,811 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 22:39:59,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1778671634] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:39:59,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 22:39:59,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2024-10-10 22:39:59,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708564477] [2024-10-10 22:39:59,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:39:59,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:39:59,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:39:59,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:39:59,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-10 22:39:59,813 INFO L87 Difference]: Start difference. First operand 6162 states and 7980 transitions. Second operand has 3 states, 3 states have (on average 64.66666666666667) internal successors, (194), 2 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:40:00,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:40:00,484 INFO L93 Difference]: Finished difference Result 15573 states and 20583 transitions. [2024-10-10 22:40:00,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:40:00,485 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 64.66666666666667) internal successors, (194), 2 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 199 [2024-10-10 22:40:00,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:40:00,506 INFO L225 Difference]: With dead ends: 15573 [2024-10-10 22:40:00,506 INFO L226 Difference]: Without dead ends: 9412 [2024-10-10 22:40:00,513 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 198 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-10 22:40:00,514 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 225 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 520 mSolverCounterSat, 202 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 722 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 202 IncrementalHoareTripleChecker+Valid, 520 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-10 22:40:00,514 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 166 Invalid, 722 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [202 Valid, 520 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-10 22:40:00,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9412 states. [2024-10-10 22:40:00,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9412 to 9410. [2024-10-10 22:40:00,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9410 states, 9409 states have (on average 1.2464661494313956) internal successors, (11728), 9409 states have internal predecessors, (11728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:40:00,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9410 states to 9410 states and 11728 transitions. [2024-10-10 22:40:00,637 INFO L78 Accepts]: Start accepts. Automaton has 9410 states and 11728 transitions. Word has length 199 [2024-10-10 22:40:00,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:40:00,637 INFO L471 AbstractCegarLoop]: Abstraction has 9410 states and 11728 transitions. [2024-10-10 22:40:00,637 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 64.66666666666667) internal successors, (194), 2 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:40:00,637 INFO L276 IsEmpty]: Start isEmpty. Operand 9410 states and 11728 transitions. [2024-10-10 22:40:00,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2024-10-10 22:40:00,648 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:40:00,648 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 22:40:00,663 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-10 22:40:00,849 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:40:00,850 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:40:00,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:40:00,850 INFO L85 PathProgramCache]: Analyzing trace with hash 1564470954, now seen corresponding path program 1 times [2024-10-10 22:40:00,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:40:00,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287695107] [2024-10-10 22:40:00,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:40:00,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:40:00,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:40:01,183 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 24 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:40:01,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:40:01,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287695107] [2024-10-10 22:40:01,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287695107] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 22:40:01,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1120738583] [2024-10-10 22:40:01,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:40:01,184 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:40:01,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:40:01,186 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 22:40:01,186 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-10 22:40:01,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:40:01,290 INFO L255 TraceCheckSpWp]: Trace formula consists of 395 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-10 22:40:01,294 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:40:01,335 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-10 22:40:01,337 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 22:40:01,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1120738583] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:40:01,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 22:40:01,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2024-10-10 22:40:01,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727390067] [2024-10-10 22:40:01,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:40:01,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:40:01,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:40:01,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:40:01,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-10 22:40:01,340 INFO L87 Difference]: Start difference. First operand 9410 states and 11728 transitions. Second operand has 3 states, 3 states have (on average 65.0) internal successors, (195), 2 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:40:01,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:40:01,999 INFO L93 Difference]: Finished difference Result 25742 states and 32194 transitions. [2024-10-10 22:40:01,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:40:01,999 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 65.0) internal successors, (195), 2 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 200 [2024-10-10 22:40:02,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:40:02,028 INFO L225 Difference]: With dead ends: 25742 [2024-10-10 22:40:02,029 INFO L226 Difference]: Without dead ends: 16536 [2024-10-10 22:40:02,041 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 199 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-10 22:40:02,042 INFO L432 NwaCegarLoop]: 170 mSDtfsCounter, 244 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 664 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 740 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 664 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-10 22:40:02,043 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [244 Valid, 203 Invalid, 740 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 664 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-10 22:40:02,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16536 states. [2024-10-10 22:40:02,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16536 to 16330. [2024-10-10 22:40:02,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16330 states, 16329 states have (on average 1.2200992099944883) internal successors, (19923), 16329 states have internal predecessors, (19923), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:40:02,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16330 states to 16330 states and 19923 transitions. [2024-10-10 22:40:02,315 INFO L78 Accepts]: Start accepts. Automaton has 16330 states and 19923 transitions. Word has length 200 [2024-10-10 22:40:02,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:40:02,315 INFO L471 AbstractCegarLoop]: Abstraction has 16330 states and 19923 transitions. [2024-10-10 22:40:02,316 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 65.0) internal successors, (195), 2 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:40:02,316 INFO L276 IsEmpty]: Start isEmpty. Operand 16330 states and 19923 transitions. [2024-10-10 22:40:02,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2024-10-10 22:40:02,336 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:40:02,336 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 22:40:02,351 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-10 22:40:02,536 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:40:02,537 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:40:02,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:40:02,537 INFO L85 PathProgramCache]: Analyzing trace with hash -1956494179, now seen corresponding path program 1 times [2024-10-10 22:40:02,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:40:02,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492777636] [2024-10-10 22:40:02,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:40:02,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:40:02,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:40:02,783 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 61 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-10 22:40:02,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:40:02,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492777636] [2024-10-10 22:40:02,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492777636] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 22:40:02,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [920377583] [2024-10-10 22:40:02,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:40:02,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:40:02,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:40:02,786 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 22:40:02,787 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-10 22:40:02,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:40:02,942 INFO L255 TraceCheckSpWp]: Trace formula consists of 468 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-10 22:40:02,946 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:40:03,116 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-10 22:40:03,116 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 22:40:03,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [920377583] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:40:03,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 22:40:03,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2024-10-10 22:40:03,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248091872] [2024-10-10 22:40:03,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:40:03,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:40:03,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:40:03,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:40:03,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-10 22:40:03,118 INFO L87 Difference]: Start difference. First operand 16330 states and 19923 transitions. Second operand has 3 states, 3 states have (on average 69.66666666666667) internal successors, (209), 3 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:40:03,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:40:03,673 INFO L93 Difference]: Finished difference Result 32459 states and 39631 transitions. [2024-10-10 22:40:03,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:40:03,674 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 69.66666666666667) internal successors, (209), 3 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 231 [2024-10-10 22:40:03,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:40:03,699 INFO L225 Difference]: With dead ends: 32459 [2024-10-10 22:40:03,699 INFO L226 Difference]: Without dead ends: 16333 [2024-10-10 22:40:03,713 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 230 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-10 22:40:03,714 INFO L432 NwaCegarLoop]: 319 mSDtfsCounter, 97 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 627 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 675 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 627 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-10 22:40:03,714 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 339 Invalid, 675 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 627 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-10 22:40:03,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16333 states. [2024-10-10 22:40:03,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16333 to 15924. [2024-10-10 22:40:03,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15924 states, 15923 states have (on average 1.196759404634805) internal successors, (19056), 15923 states have internal predecessors, (19056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:40:03,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15924 states to 15924 states and 19056 transitions. [2024-10-10 22:40:03,871 INFO L78 Accepts]: Start accepts. Automaton has 15924 states and 19056 transitions. Word has length 231 [2024-10-10 22:40:03,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:40:03,871 INFO L471 AbstractCegarLoop]: Abstraction has 15924 states and 19056 transitions. [2024-10-10 22:40:03,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 69.66666666666667) internal successors, (209), 3 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:40:03,871 INFO L276 IsEmpty]: Start isEmpty. Operand 15924 states and 19056 transitions. [2024-10-10 22:40:03,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2024-10-10 22:40:03,885 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:40:03,886 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 22:40:03,900 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-10 22:40:04,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-10-10 22:40:04,087 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:40:04,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:40:04,087 INFO L85 PathProgramCache]: Analyzing trace with hash 1270414992, now seen corresponding path program 1 times [2024-10-10 22:40:04,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:40:04,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79300058] [2024-10-10 22:40:04,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:40:04,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:40:04,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:40:04,344 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-10 22:40:04,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:40:04,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79300058] [2024-10-10 22:40:04,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79300058] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:40:04,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:40:04,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:40:04,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147671581] [2024-10-10 22:40:04,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:40:04,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 22:40:04,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:40:04,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 22:40:04,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 22:40:04,346 INFO L87 Difference]: Start difference. First operand 15924 states and 19056 transitions. Second operand has 4 states, 4 states have (on average 57.0) internal successors, (228), 3 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:40:05,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:40:05,239 INFO L93 Difference]: Finished difference Result 61187 states and 73308 transitions. [2024-10-10 22:40:05,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 22:40:05,240 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 57.0) internal successors, (228), 3 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 233 [2024-10-10 22:40:05,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:40:05,294 INFO L225 Difference]: With dead ends: 61187 [2024-10-10 22:40:05,295 INFO L226 Difference]: Without dead ends: 45467 [2024-10-10 22:40:05,319 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 22:40:05,320 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 880 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 751 mSolverCounterSat, 213 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 880 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 964 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 213 IncrementalHoareTripleChecker+Valid, 751 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-10 22:40:05,320 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [880 Valid, 325 Invalid, 964 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [213 Valid, 751 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-10 22:40:05,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45467 states. [2024-10-10 22:40:05,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45467 to 45457. [2024-10-10 22:40:05,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45457 states, 45456 states have (on average 1.1918118620204154) internal successors, (54175), 45456 states have internal predecessors, (54175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:40:05,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45457 states to 45457 states and 54175 transitions. [2024-10-10 22:40:05,813 INFO L78 Accepts]: Start accepts. Automaton has 45457 states and 54175 transitions. Word has length 233 [2024-10-10 22:40:05,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:40:05,813 INFO L471 AbstractCegarLoop]: Abstraction has 45457 states and 54175 transitions. [2024-10-10 22:40:05,814 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 57.0) internal successors, (228), 3 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:40:05,814 INFO L276 IsEmpty]: Start isEmpty. Operand 45457 states and 54175 transitions. [2024-10-10 22:40:05,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2024-10-10 22:40:05,824 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:40:05,825 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 22:40:05,825 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-10 22:40:05,825 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:40:05,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:40:05,825 INFO L85 PathProgramCache]: Analyzing trace with hash -964109443, now seen corresponding path program 1 times [2024-10-10 22:40:05,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:40:05,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725038012] [2024-10-10 22:40:05,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:40:05,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:40:05,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:40:06,350 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:40:06,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:40:06,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725038012] [2024-10-10 22:40:06,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [725038012] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:40:06,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:40:06,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:40:06,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170195339] [2024-10-10 22:40:06,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:40:06,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 22:40:06,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:40:06,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 22:40:06,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 22:40:06,353 INFO L87 Difference]: Start difference. First operand 45457 states and 54175 transitions. Second operand has 4 states, 4 states have (on average 60.75) internal successors, (243), 3 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:40:07,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:40:07,402 INFO L93 Difference]: Finished difference Result 108214 states and 128647 transitions. [2024-10-10 22:40:07,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 22:40:07,403 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 60.75) internal successors, (243), 3 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 243 [2024-10-10 22:40:07,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:40:07,480 INFO L225 Difference]: With dead ends: 108214 [2024-10-10 22:40:07,480 INFO L226 Difference]: Without dead ends: 62961 [2024-10-10 22:40:07,519 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 22:40:07,519 INFO L432 NwaCegarLoop]: 170 mSDtfsCounter, 357 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 1066 mSolverCounterSat, 179 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 357 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 1245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 179 IncrementalHoareTripleChecker+Valid, 1066 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-10 22:40:07,520 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [357 Valid, 216 Invalid, 1245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [179 Valid, 1066 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-10 22:40:07,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62961 states. [2024-10-10 22:40:08,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62961 to 59471. [2024-10-10 22:40:08,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59471 states, 59470 states have (on average 1.171750462418026) internal successors, (69684), 59470 states have internal predecessors, (69684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:40:08,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59471 states to 59471 states and 69684 transitions. [2024-10-10 22:40:08,369 INFO L78 Accepts]: Start accepts. Automaton has 59471 states and 69684 transitions. Word has length 243 [2024-10-10 22:40:08,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:40:08,369 INFO L471 AbstractCegarLoop]: Abstraction has 59471 states and 69684 transitions. [2024-10-10 22:40:08,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 60.75) internal successors, (243), 3 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:40:08,370 INFO L276 IsEmpty]: Start isEmpty. Operand 59471 states and 69684 transitions. [2024-10-10 22:40:08,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2024-10-10 22:40:08,385 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:40:08,385 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 22:40:08,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-10 22:40:08,386 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:40:08,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:40:08,386 INFO L85 PathProgramCache]: Analyzing trace with hash -575328253, now seen corresponding path program 1 times [2024-10-10 22:40:08,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:40:08,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959952582] [2024-10-10 22:40:08,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:40:08,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:40:08,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:40:08,917 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:40:08,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:40:08,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959952582] [2024-10-10 22:40:08,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959952582] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:40:08,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:40:08,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 22:40:08,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366516480] [2024-10-10 22:40:08,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:40:08,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:40:08,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:40:08,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:40:08,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:40:08,920 INFO L87 Difference]: Start difference. First operand 59471 states and 69684 transitions. Second operand has 3 states, 3 states have (on average 82.33333333333333) internal successors, (247), 2 states have internal predecessors, (247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:40:09,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:40:09,681 INFO L93 Difference]: Finished difference Result 122396 states and 143076 transitions. [2024-10-10 22:40:09,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:40:09,682 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 82.33333333333333) internal successors, (247), 2 states have internal predecessors, (247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 247 [2024-10-10 22:40:09,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:40:09,758 INFO L225 Difference]: With dead ends: 122396 [2024-10-10 22:40:09,758 INFO L226 Difference]: Without dead ends: 63535 [2024-10-10 22:40:09,796 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-10 22:40:09,797 INFO L432 NwaCegarLoop]: 166 mSDtfsCounter, 136 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 606 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 617 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 606 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-10 22:40:09,797 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 193 Invalid, 617 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 606 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-10 22:40:09,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63535 states. [2024-10-10 22:40:10,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63535 to 63125. [2024-10-10 22:40:10,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63125 states, 63124 states have (on average 1.1657689626766365) internal successors, (73588), 63124 states have internal predecessors, (73588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:40:10,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63125 states to 63125 states and 73588 transitions. [2024-10-10 22:40:10,701 INFO L78 Accepts]: Start accepts. Automaton has 63125 states and 73588 transitions. Word has length 247 [2024-10-10 22:40:10,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:40:10,702 INFO L471 AbstractCegarLoop]: Abstraction has 63125 states and 73588 transitions. [2024-10-10 22:40:10,702 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 82.33333333333333) internal successors, (247), 2 states have internal predecessors, (247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:40:10,702 INFO L276 IsEmpty]: Start isEmpty. Operand 63125 states and 73588 transitions. [2024-10-10 22:40:10,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2024-10-10 22:40:10,715 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:40:10,715 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 22:40:10,716 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-10 22:40:10,716 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:40:10,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:40:10,716 INFO L85 PathProgramCache]: Analyzing trace with hash 380055575, now seen corresponding path program 1 times [2024-10-10 22:40:10,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:40:10,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275394905] [2024-10-10 22:40:10,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:40:10,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:40:10,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:40:11,197 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2024-10-10 22:40:11,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:40:11,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275394905] [2024-10-10 22:40:11,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [275394905] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:40:11,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:40:11,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 22:40:11,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929410723] [2024-10-10 22:40:11,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:40:11,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:40:11,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:40:11,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:40:11,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:40:11,199 INFO L87 Difference]: Start difference. First operand 63125 states and 73588 transitions. Second operand has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 2 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:40:11,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:40:11,863 INFO L93 Difference]: Finished difference Result 125852 states and 146827 transitions. [2024-10-10 22:40:11,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:40:11,864 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 2 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 270 [2024-10-10 22:40:11,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:40:12,039 INFO L225 Difference]: With dead ends: 125852 [2024-10-10 22:40:12,040 INFO L226 Difference]: Without dead ends: 66991 [2024-10-10 22:40:12,055 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-10 22:40:12,056 INFO L432 NwaCegarLoop]: 167 mSDtfsCounter, 186 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 610 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 615 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 610 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-10 22:40:12,058 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 194 Invalid, 615 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 610 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-10 22:40:12,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66991 states. [2024-10-10 22:40:12,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66991 to 66783. [2024-10-10 22:40:12,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66783 states, 66782 states have (on average 1.161480638495403) internal successors, (77566), 66782 states have internal predecessors, (77566), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:40:12,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66783 states to 66783 states and 77566 transitions. [2024-10-10 22:40:12,852 INFO L78 Accepts]: Start accepts. Automaton has 66783 states and 77566 transitions. Word has length 270 [2024-10-10 22:40:12,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:40:12,853 INFO L471 AbstractCegarLoop]: Abstraction has 66783 states and 77566 transitions. [2024-10-10 22:40:12,853 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 2 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:40:12,853 INFO L276 IsEmpty]: Start isEmpty. Operand 66783 states and 77566 transitions. [2024-10-10 22:40:12,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2024-10-10 22:40:12,871 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:40:12,871 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 22:40:12,871 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-10 22:40:12,871 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:40:12,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:40:12,872 INFO L85 PathProgramCache]: Analyzing trace with hash 630222717, now seen corresponding path program 1 times [2024-10-10 22:40:12,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:40:12,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280767926] [2024-10-10 22:40:12,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:40:12,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:40:12,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:40:13,217 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 101 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:40:13,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:40:13,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280767926] [2024-10-10 22:40:13,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280767926] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 22:40:13,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [165376235] [2024-10-10 22:40:13,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:40:13,218 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:40:13,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:40:13,219 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 22:40:13,220 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-10 22:40:13,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:40:13,418 INFO L255 TraceCheckSpWp]: Trace formula consists of 431 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-10 22:40:13,422 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:40:13,560 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:40:13,560 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 22:40:13,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [165376235] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:40:13,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 22:40:13,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2024-10-10 22:40:13,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090951226] [2024-10-10 22:40:13,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:40:13,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:40:13,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:40:13,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:40:13,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-10 22:40:13,562 INFO L87 Difference]: Start difference. First operand 66783 states and 77566 transitions. Second operand has 3 states, 3 states have (on average 91.66666666666667) internal successors, (275), 3 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:40:14,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:40:14,290 INFO L93 Difference]: Finished difference Result 128736 states and 149197 transitions. [2024-10-10 22:40:14,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:40:14,291 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 91.66666666666667) internal successors, (275), 3 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 275 [2024-10-10 22:40:14,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:40:14,481 INFO L225 Difference]: With dead ends: 128736 [2024-10-10 22:40:14,481 INFO L226 Difference]: Without dead ends: 62360 [2024-10-10 22:40:14,499 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 277 GetRequests, 274 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-10 22:40:14,499 INFO L432 NwaCegarLoop]: 362 mSDtfsCounter, 64 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 695 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 773 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 695 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-10 22:40:14,500 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 383 Invalid, 773 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 695 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-10 22:40:14,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62360 states. [2024-10-10 22:40:14,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62360 to 62317. [2024-10-10 22:40:15,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62317 states, 62316 states have (on average 1.1469927466461263) internal successors, (71476), 62316 states have internal predecessors, (71476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:40:15,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62317 states to 62317 states and 71476 transitions. [2024-10-10 22:40:15,094 INFO L78 Accepts]: Start accepts. Automaton has 62317 states and 71476 transitions. Word has length 275 [2024-10-10 22:40:15,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:40:15,095 INFO L471 AbstractCegarLoop]: Abstraction has 62317 states and 71476 transitions. [2024-10-10 22:40:15,095 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 91.66666666666667) internal successors, (275), 3 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:40:15,095 INFO L276 IsEmpty]: Start isEmpty. Operand 62317 states and 71476 transitions. [2024-10-10 22:40:15,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2024-10-10 22:40:15,114 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:40:15,114 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 22:40:15,126 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-10 22:40:15,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-10-10 22:40:15,315 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:40:15,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:40:15,315 INFO L85 PathProgramCache]: Analyzing trace with hash -529784433, now seen corresponding path program 1 times [2024-10-10 22:40:15,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:40:15,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200740432] [2024-10-10 22:40:15,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:40:15,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:40:15,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:40:16,075 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 137 proven. 41 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:40:16,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:40:16,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200740432] [2024-10-10 22:40:16,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200740432] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 22:40:16,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1133386676] [2024-10-10 22:40:16,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:40:16,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:40:16,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:40:16,077 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 22:40:16,078 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-10 22:40:16,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:40:16,232 INFO L255 TraceCheckSpWp]: Trace formula consists of 506 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-10 22:40:16,237 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:40:16,354 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 178 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:40:16,354 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 22:40:16,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1133386676] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:40:16,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 22:40:16,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2024-10-10 22:40:16,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543675698] [2024-10-10 22:40:16,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:40:16,355 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:40:16,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:40:16,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:40:16,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-10 22:40:16,357 INFO L87 Difference]: Start difference. First operand 62317 states and 71476 transitions. Second operand has 3 states, 3 states have (on average 103.66666666666667) internal successors, (311), 3 states have internal predecessors, (311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:40:17,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:40:17,104 INFO L93 Difference]: Finished difference Result 140300 states and 162129 transitions. [2024-10-10 22:40:17,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:40:17,105 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 103.66666666666667) internal successors, (311), 3 states have internal predecessors, (311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 311 [2024-10-10 22:40:17,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:40:17,196 INFO L225 Difference]: With dead ends: 140300 [2024-10-10 22:40:17,196 INFO L226 Difference]: Without dead ends: 82247 [2024-10-10 22:40:17,238 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 310 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-10 22:40:17,238 INFO L432 NwaCegarLoop]: 341 mSDtfsCounter, 217 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 582 mSolverCounterSat, 135 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 717 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 582 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-10 22:40:17,238 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 370 Invalid, 717 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [135 Valid, 582 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-10 22:40:17,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82247 states. [2024-10-10 22:40:17,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82247 to 82021. [2024-10-10 22:40:17,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82021 states, 82020 states have (on average 1.1410997317727383) internal successors, (93593), 82020 states have internal predecessors, (93593), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:40:18,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82021 states to 82021 states and 93593 transitions. [2024-10-10 22:40:18,301 INFO L78 Accepts]: Start accepts. Automaton has 82021 states and 93593 transitions. Word has length 311 [2024-10-10 22:40:18,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:40:18,302 INFO L471 AbstractCegarLoop]: Abstraction has 82021 states and 93593 transitions. [2024-10-10 22:40:18,302 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 103.66666666666667) internal successors, (311), 3 states have internal predecessors, (311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:40:18,302 INFO L276 IsEmpty]: Start isEmpty. Operand 82021 states and 93593 transitions. [2024-10-10 22:40:18,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 318 [2024-10-10 22:40:18,327 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:40:18,328 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 22:40:18,343 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-10 22:40:18,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-10-10 22:40:18,528 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:40:18,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:40:18,529 INFO L85 PathProgramCache]: Analyzing trace with hash -1608615525, now seen corresponding path program 1 times [2024-10-10 22:40:18,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:40:18,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236159836] [2024-10-10 22:40:18,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:40:18,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:40:18,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:40:18,757 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 147 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2024-10-10 22:40:18,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:40:18,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236159836] [2024-10-10 22:40:18,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236159836] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:40:18,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:40:18,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:40:18,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488956887] [2024-10-10 22:40:18,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:40:18,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 22:40:18,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:40:18,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 22:40:18,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 22:40:18,760 INFO L87 Difference]: Start difference. First operand 82021 states and 93593 transitions. Second operand has 4 states, 4 states have (on average 69.0) internal successors, (276), 3 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:40:20,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:40:20,068 INFO L93 Difference]: Finished difference Result 166344 states and 190371 transitions. [2024-10-10 22:40:20,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 22:40:20,069 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 69.0) internal successors, (276), 3 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 317 [2024-10-10 22:40:20,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:40:20,173 INFO L225 Difference]: With dead ends: 166344 [2024-10-10 22:40:20,174 INFO L226 Difference]: Without dead ends: 89602 [2024-10-10 22:40:20,234 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 22:40:20,235 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 358 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 1179 mSolverCounterSat, 199 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 358 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 1378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 199 IncrementalHoareTripleChecker+Valid, 1179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-10 22:40:20,235 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [358 Valid, 166 Invalid, 1378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [199 Valid, 1179 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-10 22:40:20,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89602 states. [2024-10-10 22:40:21,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89602 to 89562. [2024-10-10 22:40:21,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89562 states, 89561 states have (on average 1.1379060081955314) internal successors, (101912), 89561 states have internal predecessors, (101912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:40:21,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89562 states to 89562 states and 101912 transitions. [2024-10-10 22:40:21,391 INFO L78 Accepts]: Start accepts. Automaton has 89562 states and 101912 transitions. Word has length 317 [2024-10-10 22:40:21,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:40:21,392 INFO L471 AbstractCegarLoop]: Abstraction has 89562 states and 101912 transitions. [2024-10-10 22:40:21,392 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 69.0) internal successors, (276), 3 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:40:21,392 INFO L276 IsEmpty]: Start isEmpty. Operand 89562 states and 101912 transitions. [2024-10-10 22:40:21,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2024-10-10 22:40:21,418 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:40:21,418 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 22:40:21,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-10 22:40:21,418 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:40:21,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:40:21,419 INFO L85 PathProgramCache]: Analyzing trace with hash -504622736, now seen corresponding path program 1 times [2024-10-10 22:40:21,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:40:21,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477076859] [2024-10-10 22:40:21,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:40:21,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:40:21,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:40:22,020 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 111 proven. 6 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2024-10-10 22:40:22,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:40:22,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477076859] [2024-10-10 22:40:22,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477076859] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 22:40:22,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [469702188] [2024-10-10 22:40:22,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:40:22,021 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:40:22,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:40:22,023 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 22:40:22,024 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-10 22:40:22,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:40:22,158 INFO L255 TraceCheckSpWp]: Trace formula consists of 601 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-10 22:40:22,161 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:40:22,212 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 224 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-10-10 22:40:22,212 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 22:40:22,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [469702188] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:40:22,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 22:40:22,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2024-10-10 22:40:22,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319128765] [2024-10-10 22:40:22,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:40:22,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:40:22,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:40:22,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:40:22,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-10 22:40:22,213 INFO L87 Difference]: Start difference. First operand 89562 states and 101912 transitions. Second operand has 3 states, 3 states have (on average 93.33333333333333) internal successors, (280), 3 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:40:23,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:40:23,058 INFO L93 Difference]: Finished difference Result 169746 states and 192790 transitions. [2024-10-10 22:40:23,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:40:23,058 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 93.33333333333333) internal successors, (280), 3 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 326 [2024-10-10 22:40:23,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:40:23,150 INFO L225 Difference]: With dead ends: 169746 [2024-10-10 22:40:23,150 INFO L226 Difference]: Without dead ends: 81809 [2024-10-10 22:40:23,203 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 328 GetRequests, 325 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-10 22:40:23,203 INFO L432 NwaCegarLoop]: 342 mSDtfsCounter, 212 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 549 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 672 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 549 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-10 22:40:23,203 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 366 Invalid, 672 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 549 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-10 22:40:23,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81809 states. [2024-10-10 22:40:24,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81809 to 81805. [2024-10-10 22:40:24,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81805 states, 81804 states have (on average 1.1097501344677523) internal successors, (90782), 81804 states have internal predecessors, (90782), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:40:24,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81805 states to 81805 states and 90782 transitions. [2024-10-10 22:40:24,247 INFO L78 Accepts]: Start accepts. Automaton has 81805 states and 90782 transitions. Word has length 326 [2024-10-10 22:40:24,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:40:24,247 INFO L471 AbstractCegarLoop]: Abstraction has 81805 states and 90782 transitions. [2024-10-10 22:40:24,247 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 93.33333333333333) internal successors, (280), 3 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:40:24,247 INFO L276 IsEmpty]: Start isEmpty. Operand 81805 states and 90782 transitions. [2024-10-10 22:40:24,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 332 [2024-10-10 22:40:24,275 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:40:24,275 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 22:40:24,289 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-10-10 22:40:24,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-10-10 22:40:24,477 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:40:24,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:40:24,477 INFO L85 PathProgramCache]: Analyzing trace with hash 351640335, now seen corresponding path program 1 times [2024-10-10 22:40:24,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:40:24,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983355662] [2024-10-10 22:40:24,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:40:24,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:40:24,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:40:24,759 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2024-10-10 22:40:24,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:40:24,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983355662] [2024-10-10 22:40:24,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1983355662] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:40:24,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:40:24,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 22:40:24,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752763511] [2024-10-10 22:40:24,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:40:24,761 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:40:24,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:40:24,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:40:24,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:40:24,761 INFO L87 Difference]: Start difference. First operand 81805 states and 90782 transitions. Second operand has 3 states, 3 states have (on average 67.33333333333333) internal successors, (202), 2 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:40:25,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:40:25,979 INFO L93 Difference]: Finished difference Result 196573 states and 218081 transitions. [2024-10-10 22:40:25,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:40:25,980 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 67.33333333333333) internal successors, (202), 2 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 331 [2024-10-10 22:40:25,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:40:26,124 INFO L225 Difference]: With dead ends: 196573 [2024-10-10 22:40:26,125 INFO L226 Difference]: Without dead ends: 117611 [2024-10-10 22:40:26,190 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-10 22:40:26,190 INFO L432 NwaCegarLoop]: 173 mSDtfsCounter, 221 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 681 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 788 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 681 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-10 22:40:26,190 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 194 Invalid, 788 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 681 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-10 22:40:26,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117611 states. [2024-10-10 22:40:27,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117611 to 117603. [2024-10-10 22:40:27,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117603 states, 117602 states have (on average 1.1057805139368377) internal successors, (130042), 117602 states have internal predecessors, (130042), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:40:27,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117603 states to 117603 states and 130042 transitions. [2024-10-10 22:40:27,770 INFO L78 Accepts]: Start accepts. Automaton has 117603 states and 130042 transitions. Word has length 331 [2024-10-10 22:40:27,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:40:27,771 INFO L471 AbstractCegarLoop]: Abstraction has 117603 states and 130042 transitions. [2024-10-10 22:40:27,771 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 67.33333333333333) internal successors, (202), 2 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:40:27,771 INFO L276 IsEmpty]: Start isEmpty. Operand 117603 states and 130042 transitions. [2024-10-10 22:40:27,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 339 [2024-10-10 22:40:27,797 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:40:27,798 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 22:40:27,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-10 22:40:27,798 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:40:27,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:40:27,798 INFO L85 PathProgramCache]: Analyzing trace with hash 215694304, now seen corresponding path program 1 times [2024-10-10 22:40:27,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:40:27,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781611212] [2024-10-10 22:40:27,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:40:27,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:40:27,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:40:28,313 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 68 proven. 6 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2024-10-10 22:40:28,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:40:28,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781611212] [2024-10-10 22:40:28,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [781611212] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 22:40:28,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1390370041] [2024-10-10 22:40:28,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:40:28,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:40:28,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:40:28,319 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 22:40:28,319 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-10 22:40:28,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:40:28,491 INFO L255 TraceCheckSpWp]: Trace formula consists of 560 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-10 22:40:28,495 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:40:28,596 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 198 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-10 22:40:28,597 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 22:40:28,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1390370041] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:40:28,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 22:40:28,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2024-10-10 22:40:28,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983948883] [2024-10-10 22:40:28,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:40:28,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:40:28,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:40:28,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:40:28,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-10 22:40:28,598 INFO L87 Difference]: Start difference. First operand 117603 states and 130042 transitions. Second operand has 3 states, 3 states have (on average 111.0) internal successors, (333), 3 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:40:29,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:40:29,625 INFO L93 Difference]: Finished difference Result 226260 states and 250245 transitions. [2024-10-10 22:40:29,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:40:29,625 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 111.0) internal successors, (333), 3 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 338 [2024-10-10 22:40:29,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:40:29,765 INFO L225 Difference]: With dead ends: 226260 [2024-10-10 22:40:29,765 INFO L226 Difference]: Without dead ends: 110282 [2024-10-10 22:40:29,847 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 340 GetRequests, 337 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-10 22:40:29,848 INFO L432 NwaCegarLoop]: 329 mSDtfsCounter, 146 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 565 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 676 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 565 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-10 22:40:29,848 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 354 Invalid, 676 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 565 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-10 22:40:29,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110282 states. [2024-10-10 22:40:31,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110282 to 95246. [2024-10-10 22:40:31,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95246 states, 95245 states have (on average 1.0898314872171768) internal successors, (103801), 95245 states have internal predecessors, (103801), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:40:31,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95246 states to 95246 states and 103801 transitions. [2024-10-10 22:40:31,359 INFO L78 Accepts]: Start accepts. Automaton has 95246 states and 103801 transitions. Word has length 338 [2024-10-10 22:40:31,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:40:31,359 INFO L471 AbstractCegarLoop]: Abstraction has 95246 states and 103801 transitions. [2024-10-10 22:40:31,359 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.0) internal successors, (333), 3 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:40:31,359 INFO L276 IsEmpty]: Start isEmpty. Operand 95246 states and 103801 transitions. [2024-10-10 22:40:31,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 382 [2024-10-10 22:40:31,384 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:40:31,384 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 22:40:31,397 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-10-10 22:40:31,585 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,9 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:40:31,585 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:40:31,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:40:31,586 INFO L85 PathProgramCache]: Analyzing trace with hash 1053241871, now seen corresponding path program 1 times [2024-10-10 22:40:31,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:40:31,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942394499] [2024-10-10 22:40:31,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:40:31,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:40:31,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:40:31,908 INFO L134 CoverageAnalysis]: Checked inductivity of 434 backedges. 148 proven. 6 refuted. 0 times theorem prover too weak. 280 trivial. 0 not checked. [2024-10-10 22:40:31,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:40:31,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942394499] [2024-10-10 22:40:31,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942394499] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 22:40:31,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [512276616] [2024-10-10 22:40:31,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:40:31,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:40:31,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:40:31,910 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 22:40:31,911 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-10-10 22:40:32,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:40:32,272 INFO L255 TraceCheckSpWp]: Trace formula consists of 682 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-10 22:40:32,276 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:40:32,439 INFO L134 CoverageAnalysis]: Checked inductivity of 434 backedges. 207 proven. 113 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2024-10-10 22:40:32,440 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-10 22:40:32,622 INFO L134 CoverageAnalysis]: Checked inductivity of 434 backedges. 207 proven. 113 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2024-10-10 22:40:32,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [512276616] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-10 22:40:32,623 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-10 22:40:32,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2024-10-10 22:40:32,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634715124] [2024-10-10 22:40:32,623 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-10 22:40:32,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-10 22:40:32,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:40:32,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-10 22:40:32,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-10 22:40:32,625 INFO L87 Difference]: Start difference. First operand 95246 states and 103801 transitions. Second operand has 6 states, 6 states have (on average 59.0) internal successors, (354), 5 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:40:35,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:40:35,733 INFO L93 Difference]: Finished difference Result 321351 states and 351769 transitions. [2024-10-10 22:40:35,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-10 22:40:35,734 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 59.0) internal successors, (354), 5 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 381 [2024-10-10 22:40:35,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:40:36,053 INFO L225 Difference]: With dead ends: 321351 [2024-10-10 22:40:36,053 INFO L226 Difference]: Without dead ends: 229959 [2024-10-10 22:40:36,149 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 770 GetRequests, 759 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2024-10-10 22:40:36,149 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 2890 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 3716 mSolverCounterSat, 569 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2890 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 4285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 569 IncrementalHoareTripleChecker+Valid, 3716 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-10-10 22:40:36,150 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2890 Valid, 318 Invalid, 4285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [569 Valid, 3716 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-10-10 22:40:36,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229959 states. [2024-10-10 22:40:39,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229959 to 225019. [2024-10-10 22:40:39,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225019 states, 225018 states have (on average 1.0903838804006791) internal successors, (245356), 225018 states have internal predecessors, (245356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:40:39,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225019 states to 225019 states and 245356 transitions. [2024-10-10 22:40:39,449 INFO L78 Accepts]: Start accepts. Automaton has 225019 states and 245356 transitions. Word has length 381 [2024-10-10 22:40:39,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:40:39,450 INFO L471 AbstractCegarLoop]: Abstraction has 225019 states and 245356 transitions. [2024-10-10 22:40:39,450 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 59.0) internal successors, (354), 5 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:40:39,450 INFO L276 IsEmpty]: Start isEmpty. Operand 225019 states and 245356 transitions. [2024-10-10 22:40:39,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 453 [2024-10-10 22:40:39,519 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:40:39,519 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 22:40:39,533 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-10-10 22:40:39,719 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,10 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:40:39,720 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:40:39,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:40:39,720 INFO L85 PathProgramCache]: Analyzing trace with hash 1041950040, now seen corresponding path program 1 times [2024-10-10 22:40:39,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:40:39,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690920522] [2024-10-10 22:40:39,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:40:39,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:40:39,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:40:39,912 INFO L134 CoverageAnalysis]: Checked inductivity of 640 backedges. 300 proven. 0 refuted. 0 times theorem prover too weak. 340 trivial. 0 not checked. [2024-10-10 22:40:39,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:40:39,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690920522] [2024-10-10 22:40:39,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [690920522] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:40:39,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:40:39,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 22:40:39,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74648733] [2024-10-10 22:40:39,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:40:39,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:40:39,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:40:39,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:40:39,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:40:39,913 INFO L87 Difference]: Start difference. First operand 225019 states and 245356 transitions. Second operand has 3 states, 3 states have (on average 101.66666666666667) internal successors, (305), 2 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:40:42,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:40:42,204 INFO L93 Difference]: Finished difference Result 644509 states and 703370 transitions. [2024-10-10 22:40:42,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:40:42,204 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 101.66666666666667) internal successors, (305), 2 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 452 [2024-10-10 22:40:42,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:40:42,809 INFO L225 Difference]: With dead ends: 644509 [2024-10-10 22:40:42,809 INFO L226 Difference]: Without dead ends: 428835 [2024-10-10 22:40:42,956 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-10 22:40:42,957 INFO L432 NwaCegarLoop]: 410 mSDtfsCounter, 254 mSDsluCounter, 379 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 789 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 22:40:42,957 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [254 Valid, 789 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 22:40:43,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428835 states.