./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pals_lcr.3.ufo.BOUNDED-6.pals+Problem12_label03.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/pals_lcr.3.ufo.BOUNDED-6.pals+Problem12_label03.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 00976d0f33ca0b9714575e3679f5d33e30ad2cb228857f610050b5b28bb1919c --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 00:47:16,015 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 00:47:16,074 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 00:47:16,079 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 00:47:16,080 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 00:47:16,106 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 00:47:16,107 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 00:47:16,107 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 00:47:16,107 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 00:47:16,108 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 00:47:16,108 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 00:47:16,109 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 00:47:16,109 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 00:47:16,109 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 00:47:16,111 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 00:47:16,111 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 00:47:16,111 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 00:47:16,111 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 00:47:16,112 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 00:47:16,112 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 00:47:16,112 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 00:47:16,116 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 00:47:16,116 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 00:47:16,116 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 00:47:16,116 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 00:47:16,117 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 00:47:16,117 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 00:47:16,117 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 00:47:16,117 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 00:47:16,117 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 00:47:16,117 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 00:47:16,117 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 00:47:16,117 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 00:47:16,118 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 00:47:16,118 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 00:47:16,118 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 00:47:16,118 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 00:47:16,118 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 00:47:16,118 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 00:47:16,118 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 00:47:16,119 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 00:47:16,120 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 00:47:16,120 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 00976d0f33ca0b9714575e3679f5d33e30ad2cb228857f610050b5b28bb1919c [2024-11-10 00:47:16,304 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 00:47:16,324 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 00:47:16,327 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 00:47:16,328 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 00:47:16,328 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 00:47:16,329 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pals_lcr.3.ufo.BOUNDED-6.pals+Problem12_label03.c [2024-11-10 00:47:17,535 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 00:47:17,848 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 00:47:17,849 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.3.ufo.BOUNDED-6.pals+Problem12_label03.c [2024-11-10 00:47:17,874 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dd2098ba7/7f0e95cc4691420c80a21e3c58f4ca04/FLAGf99a0ab89 [2024-11-10 00:47:17,886 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dd2098ba7/7f0e95cc4691420c80a21e3c58f4ca04 [2024-11-10 00:47:17,888 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 00:47:17,889 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 00:47:17,891 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 00:47:17,891 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 00:47:17,895 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 00:47:17,895 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:47:17" (1/1) ... [2024-11-10 00:47:17,896 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@446a3f64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:47:17, skipping insertion in model container [2024-11-10 00:47:17,896 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:47:17" (1/1) ... [2024-11-10 00:47:17,972 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 00:47:18,235 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.3.ufo.BOUNDED-6.pals+Problem12_label03.c[6354,6367] [2024-11-10 00:47:18,273 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.3.ufo.BOUNDED-6.pals+Problem12_label03.c[8691,8704] [2024-11-10 00:47:18,804 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 00:47:18,813 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 00:47:18,836 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.3.ufo.BOUNDED-6.pals+Problem12_label03.c[6354,6367] [2024-11-10 00:47:18,844 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.3.ufo.BOUNDED-6.pals+Problem12_label03.c[8691,8704] [2024-11-10 00:47:19,134 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 00:47:19,156 INFO L204 MainTranslator]: Completed translation [2024-11-10 00:47:19,156 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:47:19 WrapperNode [2024-11-10 00:47:19,156 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 00:47:19,157 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 00:47:19,157 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 00:47:19,157 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 00:47:19,162 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:47:19" (1/1) ... [2024-11-10 00:47:19,196 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:47:19" (1/1) ... [2024-11-10 00:47:19,404 INFO L138 Inliner]: procedures = 33, calls = 19, calls flagged for inlining = 14, calls inlined = 14, statements flattened = 4981 [2024-11-10 00:47:19,405 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 00:47:19,405 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 00:47:19,406 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 00:47:19,406 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 00:47:19,413 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:47:19" (1/1) ... [2024-11-10 00:47:19,413 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:47:19" (1/1) ... [2024-11-10 00:47:19,447 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:47:19" (1/1) ... [2024-11-10 00:47:19,609 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-11-10 00:47:19,609 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:47:19" (1/1) ... [2024-11-10 00:47:19,609 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:47:19" (1/1) ... [2024-11-10 00:47:19,690 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:47:19" (1/1) ... [2024-11-10 00:47:19,704 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:47:19" (1/1) ... [2024-11-10 00:47:19,719 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:47:19" (1/1) ... [2024-11-10 00:47:19,734 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:47:19" (1/1) ... [2024-11-10 00:47:19,784 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 00:47:19,786 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 00:47:19,786 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 00:47:19,787 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 00:47:19,787 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:47:19" (1/1) ... [2024-11-10 00:47:19,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 00:47:19,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 00:47:19,813 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 00:47:19,814 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 00:47:19,848 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 00:47:19,848 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 00:47:19,848 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 00:47:19,849 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 00:47:19,949 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 00:47:19,951 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 00:47:23,760 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1982: havoc calculate_output_#t~ret30#1; [2024-11-10 00:47:23,761 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L3461: havoc calculate_output2_#t~ret31#1; [2024-11-10 00:47:23,761 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L4951: havoc calculate_output3_#t~ret32#1; [2024-11-10 00:47:23,975 INFO L? ?]: Removed 2069 outVars from TransFormulas that were not future-live. [2024-11-10 00:47:23,976 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 00:47:24,009 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 00:47:24,010 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 00:47:24,010 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 12:47:24 BoogieIcfgContainer [2024-11-10 00:47:24,010 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 00:47:24,011 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 00:47:24,011 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 00:47:24,014 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 00:47:24,015 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 12:47:17" (1/3) ... [2024-11-10 00:47:24,015 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28d0bd3f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 12:47:24, skipping insertion in model container [2024-11-10 00:47:24,015 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:47:19" (2/3) ... [2024-11-10 00:47:24,017 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28d0bd3f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 12:47:24, skipping insertion in model container [2024-11-10 00:47:24,017 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 12:47:24" (3/3) ... [2024-11-10 00:47:24,018 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.3.ufo.BOUNDED-6.pals+Problem12_label03.c [2024-11-10 00:47:24,029 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 00:47:24,030 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-10 00:47:24,100 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 00:47:24,108 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;@1c40d6cb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 00:47:24,108 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-10 00:47:24,117 INFO L276 IsEmpty]: Start isEmpty. Operand has 879 states, 876 states have (on average 2.675799086757991) internal successors, (2344), 878 states have internal predecessors, (2344), 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-11-10 00:47:24,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-10 00:47:24,124 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:47:24,124 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] [2024-11-10 00:47:24,125 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:47:24,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:47:24,129 INFO L85 PathProgramCache]: Analyzing trace with hash -754437650, now seen corresponding path program 1 times [2024-11-10 00:47:24,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:47:24,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117886670] [2024-11-10 00:47:24,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:47:24,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:47:24,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:47:24,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:47:24,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:47:24,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117886670] [2024-11-10 00:47:24,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [117886670] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:47:24,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:47:24,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 00:47:24,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353964141] [2024-11-10 00:47:24,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:47:24,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 00:47:24,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:47:24,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 00:47:24,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 00:47:24,429 INFO L87 Difference]: Start difference. First operand has 879 states, 876 states have (on average 2.675799086757991) internal successors, (2344), 878 states have internal predecessors, (2344), 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 11.0) internal successors, (22), 2 states have internal predecessors, (22), 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-11-10 00:47:24,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:47:24,563 INFO L93 Difference]: Finished difference Result 1734 states and 4646 transitions. [2024-11-10 00:47:24,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 00:47:24,569 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 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 22 [2024-11-10 00:47:24,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:47:24,592 INFO L225 Difference]: With dead ends: 1734 [2024-11-10 00:47:24,592 INFO L226 Difference]: Without dead ends: 811 [2024-11-10 00:47:24,599 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-11-10 00:47:24,604 INFO L432 NwaCegarLoop]: 2276 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2276 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:47:24,604 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2276 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:47:24,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 811 states. [2024-11-10 00:47:24,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 811 to 811. [2024-11-10 00:47:24,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 811 states, 809 states have (on average 2.7305315203955502) internal successors, (2209), 810 states have internal predecessors, (2209), 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-11-10 00:47:24,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 811 states to 811 states and 2209 transitions. [2024-11-10 00:47:24,687 INFO L78 Accepts]: Start accepts. Automaton has 811 states and 2209 transitions. Word has length 22 [2024-11-10 00:47:24,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:47:24,687 INFO L471 AbstractCegarLoop]: Abstraction has 811 states and 2209 transitions. [2024-11-10 00:47:24,688 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 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-11-10 00:47:24,688 INFO L276 IsEmpty]: Start isEmpty. Operand 811 states and 2209 transitions. [2024-11-10 00:47:24,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-10 00:47:24,689 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:47:24,689 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] [2024-11-10 00:47:24,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 00:47:24,690 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:47:24,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:47:24,691 INFO L85 PathProgramCache]: Analyzing trace with hash -1264971827, now seen corresponding path program 1 times [2024-11-10 00:47:24,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:47:24,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350725976] [2024-11-10 00:47:24,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:47:24,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:47:24,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:47:24,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:47:24,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:47:24,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350725976] [2024-11-10 00:47:24,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [350725976] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:47:24,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:47:24,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 00:47:24,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639396770] [2024-11-10 00:47:24,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:47:24,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 00:47:24,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:47:24,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 00:47:24,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 00:47:24,842 INFO L87 Difference]: Start difference. First operand 811 states and 2209 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 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-11-10 00:47:24,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:47:24,954 INFO L93 Difference]: Finished difference Result 881 states and 2313 transitions. [2024-11-10 00:47:24,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 00:47:24,955 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 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 22 [2024-11-10 00:47:24,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:47:24,959 INFO L225 Difference]: With dead ends: 881 [2024-11-10 00:47:24,959 INFO L226 Difference]: Without dead ends: 844 [2024-11-10 00:47:24,959 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-11-10 00:47:24,960 INFO L432 NwaCegarLoop]: 2205 mSDtfsCounter, 49 mSDsluCounter, 6593 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 8798 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 00:47:24,961 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 8798 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 00:47:24,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 844 states. [2024-11-10 00:47:24,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 844 to 811. [2024-11-10 00:47:24,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 811 states, 809 states have (on average 2.710754017305315) internal successors, (2193), 810 states have internal predecessors, (2193), 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-11-10 00:47:24,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 811 states to 811 states and 2193 transitions. [2024-11-10 00:47:24,983 INFO L78 Accepts]: Start accepts. Automaton has 811 states and 2193 transitions. Word has length 22 [2024-11-10 00:47:24,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:47:24,983 INFO L471 AbstractCegarLoop]: Abstraction has 811 states and 2193 transitions. [2024-11-10 00:47:24,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 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-11-10 00:47:24,984 INFO L276 IsEmpty]: Start isEmpty. Operand 811 states and 2193 transitions. [2024-11-10 00:47:24,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-10 00:47:24,985 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:47:24,985 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] [2024-11-10 00:47:24,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 00:47:24,986 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:47:24,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:47:24,987 INFO L85 PathProgramCache]: Analyzing trace with hash 834156099, now seen corresponding path program 1 times [2024-11-10 00:47:24,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:47:24,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929170861] [2024-11-10 00:47:24,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:47:24,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:47:25,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:47:25,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:47:25,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:47:25,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929170861] [2024-11-10 00:47:25,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929170861] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:47:25,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:47:25,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 00:47:25,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28852327] [2024-11-10 00:47:25,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:47:25,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:47:25,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:47:25,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:47:25,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:47:25,044 INFO L87 Difference]: Start difference. First operand 811 states and 2193 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 2 states have internal predecessors, (22), 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-11-10 00:47:28,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:47:28,805 INFO L93 Difference]: Finished difference Result 2318 states and 6429 transitions. [2024-11-10 00:47:28,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:47:28,806 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 2 states have internal predecessors, (22), 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 22 [2024-11-10 00:47:28,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:47:28,813 INFO L225 Difference]: With dead ends: 2318 [2024-11-10 00:47:28,813 INFO L226 Difference]: Without dead ends: 1563 [2024-11-10 00:47:28,814 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-11-10 00:47:28,818 INFO L432 NwaCegarLoop]: 542 mSDtfsCounter, 1533 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 3621 mSolverCounterSat, 652 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1533 SdHoareTripleChecker+Valid, 551 SdHoareTripleChecker+Invalid, 4273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 652 IncrementalHoareTripleChecker+Valid, 3621 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2024-11-10 00:47:28,818 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1533 Valid, 551 Invalid, 4273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [652 Valid, 3621 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2024-11-10 00:47:28,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1563 states. [2024-11-10 00:47:28,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1563 to 1563. [2024-11-10 00:47:28,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1563 states, 1561 states have (on average 2.4682895579756567) internal successors, (3853), 1562 states have internal predecessors, (3853), 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-11-10 00:47:28,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1563 states to 1563 states and 3853 transitions. [2024-11-10 00:47:28,850 INFO L78 Accepts]: Start accepts. Automaton has 1563 states and 3853 transitions. Word has length 22 [2024-11-10 00:47:28,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:47:28,850 INFO L471 AbstractCegarLoop]: Abstraction has 1563 states and 3853 transitions. [2024-11-10 00:47:28,851 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 2 states have internal predecessors, (22), 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-11-10 00:47:28,851 INFO L276 IsEmpty]: Start isEmpty. Operand 1563 states and 3853 transitions. [2024-11-10 00:47:28,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-10 00:47:28,852 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:47:28,852 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] [2024-11-10 00:47:28,852 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 00:47:28,852 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:47:28,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:47:28,855 INFO L85 PathProgramCache]: Analyzing trace with hash 606557701, now seen corresponding path program 1 times [2024-11-10 00:47:28,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:47:28,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744265842] [2024-11-10 00:47:28,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:47:28,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:47:28,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:47:28,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:47:28,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:47:28,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744265842] [2024-11-10 00:47:28,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744265842] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:47:28,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:47:28,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 00:47:28,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648830590] [2024-11-10 00:47:28,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:47:28,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 00:47:28,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:47:28,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 00:47:28,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 00:47:28,986 INFO L87 Difference]: Start difference. First operand 1563 states and 3853 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 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-11-10 00:47:29,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:47:29,084 INFO L93 Difference]: Finished difference Result 1761 states and 4153 transitions. [2024-11-10 00:47:29,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 00:47:29,085 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 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 37 [2024-11-10 00:47:29,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:47:29,091 INFO L225 Difference]: With dead ends: 1761 [2024-11-10 00:47:29,091 INFO L226 Difference]: Without dead ends: 1728 [2024-11-10 00:47:29,091 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-10 00:47:29,092 INFO L432 NwaCegarLoop]: 2189 mSDtfsCounter, 6651 mSDsluCounter, 388 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6651 SdHoareTripleChecker+Valid, 2577 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 00:47:29,092 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6651 Valid, 2577 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 00:47:29,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1728 states. [2024-11-10 00:47:29,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1728 to 1593. [2024-11-10 00:47:29,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1593 states, 1591 states have (on average 2.4506599622878693) internal successors, (3899), 1592 states have internal predecessors, (3899), 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-11-10 00:47:29,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1593 states to 1593 states and 3899 transitions. [2024-11-10 00:47:29,115 INFO L78 Accepts]: Start accepts. Automaton has 1593 states and 3899 transitions. Word has length 37 [2024-11-10 00:47:29,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:47:29,115 INFO L471 AbstractCegarLoop]: Abstraction has 1593 states and 3899 transitions. [2024-11-10 00:47:29,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 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-11-10 00:47:29,116 INFO L276 IsEmpty]: Start isEmpty. Operand 1593 states and 3899 transitions. [2024-11-10 00:47:29,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-10 00:47:29,116 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:47:29,117 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] [2024-11-10 00:47:29,117 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 00:47:29,117 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:47:29,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:47:29,117 INFO L85 PathProgramCache]: Analyzing trace with hash 1075758951, now seen corresponding path program 1 times [2024-11-10 00:47:29,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:47:29,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015625830] [2024-11-10 00:47:29,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:47:29,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:47:29,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:47:29,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:47:29,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:47:29,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015625830] [2024-11-10 00:47:29,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1015625830] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:47:29,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:47:29,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 00:47:29,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415941550] [2024-11-10 00:47:29,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:47:29,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 00:47:29,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:47:29,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 00:47:29,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 00:47:29,271 INFO L87 Difference]: Start difference. First operand 1593 states and 3899 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 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-11-10 00:47:29,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:47:29,334 INFO L93 Difference]: Finished difference Result 1659 states and 3997 transitions. [2024-11-10 00:47:29,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 00:47:29,334 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 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 39 [2024-11-10 00:47:29,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:47:29,341 INFO L225 Difference]: With dead ends: 1659 [2024-11-10 00:47:29,341 INFO L226 Difference]: Without dead ends: 1596 [2024-11-10 00:47:29,342 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-10 00:47:29,343 INFO L432 NwaCegarLoop]: 2188 mSDtfsCounter, 6469 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6469 SdHoareTripleChecker+Valid, 2280 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:47:29,343 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6469 Valid, 2280 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:47:29,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1596 states. [2024-11-10 00:47:29,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1596 to 1593. [2024-11-10 00:47:29,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1593 states, 1591 states have (on average 2.4500314267756127) internal successors, (3898), 1592 states have internal predecessors, (3898), 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-11-10 00:47:29,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1593 states to 1593 states and 3898 transitions. [2024-11-10 00:47:29,367 INFO L78 Accepts]: Start accepts. Automaton has 1593 states and 3898 transitions. Word has length 39 [2024-11-10 00:47:29,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:47:29,367 INFO L471 AbstractCegarLoop]: Abstraction has 1593 states and 3898 transitions. [2024-11-10 00:47:29,367 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 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-11-10 00:47:29,368 INFO L276 IsEmpty]: Start isEmpty. Operand 1593 states and 3898 transitions. [2024-11-10 00:47:29,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-10 00:47:29,370 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:47:29,370 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] [2024-11-10 00:47:29,370 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 00:47:29,372 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:47:29,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:47:29,372 INFO L85 PathProgramCache]: Analyzing trace with hash 712608318, now seen corresponding path program 1 times [2024-11-10 00:47:29,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:47:29,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928500187] [2024-11-10 00:47:29,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:47:29,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:47:29,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:47:29,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:47:29,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:47:29,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928500187] [2024-11-10 00:47:29,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928500187] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:47:29,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:47:29,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:47:29,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786911687] [2024-11-10 00:47:29,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:47:29,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:47:29,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:47:29,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:47:29,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:47:29,410 INFO L87 Difference]: Start difference. First operand 1593 states and 3898 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 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-11-10 00:47:29,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:47:29,436 INFO L93 Difference]: Finished difference Result 1707 states and 4068 transitions. [2024-11-10 00:47:29,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:47:29,437 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 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 40 [2024-11-10 00:47:29,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:47:29,441 INFO L225 Difference]: With dead ends: 1707 [2024-11-10 00:47:29,441 INFO L226 Difference]: Without dead ends: 1644 [2024-11-10 00:47:29,442 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-11-10 00:47:29,442 INFO L432 NwaCegarLoop]: 2199 mSDtfsCounter, 2150 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2150 SdHoareTripleChecker+Valid, 2244 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:47:29,443 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2150 Valid, 2244 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:47:29,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1644 states. [2024-11-10 00:47:29,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1644 to 1641. [2024-11-10 00:47:29,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1641 states, 1639 states have (on average 2.4209884075655888) internal successors, (3968), 1640 states have internal predecessors, (3968), 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-11-10 00:47:29,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1641 states to 1641 states and 3968 transitions. [2024-11-10 00:47:29,465 INFO L78 Accepts]: Start accepts. Automaton has 1641 states and 3968 transitions. Word has length 40 [2024-11-10 00:47:29,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:47:29,466 INFO L471 AbstractCegarLoop]: Abstraction has 1641 states and 3968 transitions. [2024-11-10 00:47:29,466 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 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-11-10 00:47:29,466 INFO L276 IsEmpty]: Start isEmpty. Operand 1641 states and 3968 transitions. [2024-11-10 00:47:29,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-10 00:47:29,466 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:47:29,467 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] [2024-11-10 00:47:29,467 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 00:47:29,467 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:47:29,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:47:29,467 INFO L85 PathProgramCache]: Analyzing trace with hash 55525097, now seen corresponding path program 1 times [2024-11-10 00:47:29,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:47:29,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820284559] [2024-11-10 00:47:29,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:47:29,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:47:29,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:47:29,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:47:29,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:47:29,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820284559] [2024-11-10 00:47:29,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820284559] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:47:29,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:47:29,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:47:29,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829821907] [2024-11-10 00:47:29,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:47:29,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:47:29,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:47:29,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:47:29,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:47:29,499 INFO L87 Difference]: Start difference. First operand 1641 states and 3968 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 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-11-10 00:47:29,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:47:29,521 INFO L93 Difference]: Finished difference Result 1762 states and 4148 transitions. [2024-11-10 00:47:29,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:47:29,522 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 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 41 [2024-11-10 00:47:29,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:47:29,527 INFO L225 Difference]: With dead ends: 1762 [2024-11-10 00:47:29,527 INFO L226 Difference]: Without dead ends: 1699 [2024-11-10 00:47:29,527 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-11-10 00:47:29,528 INFO L432 NwaCegarLoop]: 2227 mSDtfsCounter, 2160 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2160 SdHoareTripleChecker+Valid, 2278 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:47:29,528 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2160 Valid, 2278 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:47:29,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1699 states. [2024-11-10 00:47:29,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1699 to 1696. [2024-11-10 00:47:29,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1696 states, 1694 states have (on average 2.3896103896103895) internal successors, (4048), 1695 states have internal predecessors, (4048), 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-11-10 00:47:29,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1696 states to 1696 states and 4048 transitions. [2024-11-10 00:47:29,554 INFO L78 Accepts]: Start accepts. Automaton has 1696 states and 4048 transitions. Word has length 41 [2024-11-10 00:47:29,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:47:29,555 INFO L471 AbstractCegarLoop]: Abstraction has 1696 states and 4048 transitions. [2024-11-10 00:47:29,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 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-11-10 00:47:29,555 INFO L276 IsEmpty]: Start isEmpty. Operand 1696 states and 4048 transitions. [2024-11-10 00:47:29,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-10 00:47:29,556 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:47:29,556 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] [2024-11-10 00:47:29,556 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 00:47:29,556 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:47:29,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:47:29,556 INFO L85 PathProgramCache]: Analyzing trace with hash 41075241, now seen corresponding path program 1 times [2024-11-10 00:47:29,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:47:29,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220286975] [2024-11-10 00:47:29,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:47:29,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:47:29,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:47:29,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:47:29,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:47:29,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220286975] [2024-11-10 00:47:29,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220286975] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:47:29,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:47:29,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:47:29,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145622447] [2024-11-10 00:47:29,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:47:29,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:47:29,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:47:29,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:47:29,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:47:29,601 INFO L87 Difference]: Start difference. First operand 1696 states and 4048 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 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-11-10 00:47:29,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:47:29,627 INFO L93 Difference]: Finished difference Result 1998 states and 4490 transitions. [2024-11-10 00:47:29,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:47:29,627 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 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 41 [2024-11-10 00:47:29,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:47:29,633 INFO L225 Difference]: With dead ends: 1998 [2024-11-10 00:47:29,634 INFO L226 Difference]: Without dead ends: 1835 [2024-11-10 00:47:29,634 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-11-10 00:47:29,635 INFO L432 NwaCegarLoop]: 2229 mSDtfsCounter, 2158 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2158 SdHoareTripleChecker+Valid, 2284 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:47:29,636 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2158 Valid, 2284 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:47:29,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1835 states. [2024-11-10 00:47:29,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1835 to 1832. [2024-11-10 00:47:29,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1832 states, 1830 states have (on average 2.3169398907103824) internal successors, (4240), 1831 states have internal predecessors, (4240), 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-11-10 00:47:29,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1832 states to 1832 states and 4240 transitions. [2024-11-10 00:47:29,715 INFO L78 Accepts]: Start accepts. Automaton has 1832 states and 4240 transitions. Word has length 41 [2024-11-10 00:47:29,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:47:29,716 INFO L471 AbstractCegarLoop]: Abstraction has 1832 states and 4240 transitions. [2024-11-10 00:47:29,716 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 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-11-10 00:47:29,716 INFO L276 IsEmpty]: Start isEmpty. Operand 1832 states and 4240 transitions. [2024-11-10 00:47:29,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-10 00:47:29,717 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:47:29,717 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] [2024-11-10 00:47:29,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 00:47:29,717 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:47:29,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:47:29,717 INFO L85 PathProgramCache]: Analyzing trace with hash 2132677993, now seen corresponding path program 1 times [2024-11-10 00:47:29,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:47:29,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239410021] [2024-11-10 00:47:29,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:47:29,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:47:29,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:47:29,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:47:29,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:47:29,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239410021] [2024-11-10 00:47:29,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239410021] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:47:29,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:47:29,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:47:29,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676990800] [2024-11-10 00:47:29,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:47:29,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:47:29,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:47:29,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:47:29,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:47:29,757 INFO L87 Difference]: Start difference. First operand 1832 states and 4240 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 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-11-10 00:47:29,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:47:29,787 INFO L93 Difference]: Finished difference Result 2382 states and 5024 transitions. [2024-11-10 00:47:29,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:47:29,787 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 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 41 [2024-11-10 00:47:29,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:47:29,795 INFO L225 Difference]: With dead ends: 2382 [2024-11-10 00:47:29,795 INFO L226 Difference]: Without dead ends: 2083 [2024-11-10 00:47:29,796 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-11-10 00:47:29,797 INFO L432 NwaCegarLoop]: 2227 mSDtfsCounter, 2156 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2156 SdHoareTripleChecker+Valid, 2286 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:47:29,797 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2156 Valid, 2286 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:47:29,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2083 states. [2024-11-10 00:47:29,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2083 to 2080. [2024-11-10 00:47:29,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2080 states, 2078 states have (on average 2.2021174205967275) internal successors, (4576), 2079 states have internal predecessors, (4576), 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-11-10 00:47:29,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2080 states to 2080 states and 4576 transitions. [2024-11-10 00:47:29,830 INFO L78 Accepts]: Start accepts. Automaton has 2080 states and 4576 transitions. Word has length 41 [2024-11-10 00:47:29,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:47:29,831 INFO L471 AbstractCegarLoop]: Abstraction has 2080 states and 4576 transitions. [2024-11-10 00:47:29,831 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 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-11-10 00:47:29,831 INFO L276 IsEmpty]: Start isEmpty. Operand 2080 states and 4576 transitions. [2024-11-10 00:47:29,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-10 00:47:29,831 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:47:29,831 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] [2024-11-10 00:47:29,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-10 00:47:29,832 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:47:29,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:47:29,832 INFO L85 PathProgramCache]: Analyzing trace with hash 1608400938, now seen corresponding path program 1 times [2024-11-10 00:47:29,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:47:29,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886700529] [2024-11-10 00:47:29,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:47:29,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:47:29,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:47:29,965 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:47:29,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:47:29,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886700529] [2024-11-10 00:47:29,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1886700529] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:47:29,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:47:29,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 00:47:29,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974307985] [2024-11-10 00:47:29,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:47:29,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 00:47:29,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:47:29,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 00:47:29,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-10 00:47:29,966 INFO L87 Difference]: Start difference. First operand 2080 states and 4576 transitions. Second operand has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 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-11-10 00:47:30,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:47:30,035 INFO L93 Difference]: Finished difference Result 2131 states and 4642 transitions. [2024-11-10 00:47:30,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 00:47:30,035 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 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 41 [2024-11-10 00:47:30,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:47:30,043 INFO L225 Difference]: With dead ends: 2131 [2024-11-10 00:47:30,043 INFO L226 Difference]: Without dead ends: 2128 [2024-11-10 00:47:30,044 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-10 00:47:30,044 INFO L432 NwaCegarLoop]: 2187 mSDtfsCounter, 0 mSDsluCounter, 13106 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 15293 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:47:30,045 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 15293 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:47:30,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2128 states. [2024-11-10 00:47:30,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2128 to 2128. [2024-11-10 00:47:30,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2128 states, 2126 states have (on average 2.1730950141110066) internal successors, (4620), 2127 states have internal predecessors, (4620), 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-11-10 00:47:30,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2128 states to 2128 states and 4620 transitions. [2024-11-10 00:47:30,079 INFO L78 Accepts]: Start accepts. Automaton has 2128 states and 4620 transitions. Word has length 41 [2024-11-10 00:47:30,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:47:30,079 INFO L471 AbstractCegarLoop]: Abstraction has 2128 states and 4620 transitions. [2024-11-10 00:47:30,079 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 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-11-10 00:47:30,079 INFO L276 IsEmpty]: Start isEmpty. Operand 2128 states and 4620 transitions. [2024-11-10 00:47:30,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-10 00:47:30,080 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:47:30,080 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-10 00:47:30,081 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-10 00:47:30,081 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:47:30,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:47:30,081 INFO L85 PathProgramCache]: Analyzing trace with hash 18026415, now seen corresponding path program 1 times [2024-11-10 00:47:30,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:47:30,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050409912] [2024-11-10 00:47:30,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:47:30,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:47:30,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:47:30,157 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-10 00:47:30,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:47:30,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050409912] [2024-11-10 00:47:30,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1050409912] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:47:30,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:47:30,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 00:47:30,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362701157] [2024-11-10 00:47:30,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:47:30,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 00:47:30,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:47:30,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 00:47:30,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 00:47:30,159 INFO L87 Difference]: Start difference. First operand 2128 states and 4620 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 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-11-10 00:47:30,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:47:30,240 INFO L93 Difference]: Finished difference Result 3896 states and 7032 transitions. [2024-11-10 00:47:30,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 00:47:30,241 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 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 58 [2024-11-10 00:47:30,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:47:30,250 INFO L225 Difference]: With dead ends: 3896 [2024-11-10 00:47:30,250 INFO L226 Difference]: Without dead ends: 3461 [2024-11-10 00:47:30,251 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-10 00:47:30,252 INFO L432 NwaCegarLoop]: 2235 mSDtfsCounter, 4410 mSDsluCounter, 2320 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4410 SdHoareTripleChecker+Valid, 4555 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:47:30,252 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4410 Valid, 4555 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:47:30,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3461 states. [2024-11-10 00:47:30,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3461 to 2644. [2024-11-10 00:47:30,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2644 states, 2642 states have (on average 2.012112036336109) internal successors, (5316), 2643 states have internal predecessors, (5316), 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-11-10 00:47:30,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2644 states to 2644 states and 5316 transitions. [2024-11-10 00:47:30,299 INFO L78 Accepts]: Start accepts. Automaton has 2644 states and 5316 transitions. Word has length 58 [2024-11-10 00:47:30,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:47:30,303 INFO L471 AbstractCegarLoop]: Abstraction has 2644 states and 5316 transitions. [2024-11-10 00:47:30,303 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 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-11-10 00:47:30,303 INFO L276 IsEmpty]: Start isEmpty. Operand 2644 states and 5316 transitions. [2024-11-10 00:47:30,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-10 00:47:30,304 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:47:30,304 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-10 00:47:30,304 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-10 00:47:30,304 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:47:30,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:47:30,305 INFO L85 PathProgramCache]: Analyzing trace with hash 3576559, now seen corresponding path program 1 times [2024-11-10 00:47:30,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:47:30,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031081025] [2024-11-10 00:47:30,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:47:30,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:47:30,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:47:30,370 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-10 00:47:30,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:47:30,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031081025] [2024-11-10 00:47:30,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031081025] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:47:30,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:47:30,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 00:47:30,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057266668] [2024-11-10 00:47:30,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:47:30,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 00:47:30,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:47:30,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 00:47:30,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 00:47:30,372 INFO L87 Difference]: Start difference. First operand 2644 states and 5316 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 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-11-10 00:47:30,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:47:30,459 INFO L93 Difference]: Finished difference Result 4488 states and 7836 transitions. [2024-11-10 00:47:30,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 00:47:30,459 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 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 58 [2024-11-10 00:47:30,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:47:30,465 INFO L225 Difference]: With dead ends: 4488 [2024-11-10 00:47:30,465 INFO L226 Difference]: Without dead ends: 3893 [2024-11-10 00:47:30,467 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-10 00:47:30,467 INFO L432 NwaCegarLoop]: 2236 mSDtfsCounter, 4412 mSDsluCounter, 2303 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4412 SdHoareTripleChecker+Valid, 4539 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:47:30,467 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4412 Valid, 4539 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:47:30,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3893 states. [2024-11-10 00:47:30,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3893 to 3452. [2024-11-10 00:47:30,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3452 states, 3450 states have (on average 1.856231884057971) internal successors, (6404), 3451 states have internal predecessors, (6404), 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-11-10 00:47:30,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3452 states to 3452 states and 6404 transitions. [2024-11-10 00:47:30,525 INFO L78 Accepts]: Start accepts. Automaton has 3452 states and 6404 transitions. Word has length 58 [2024-11-10 00:47:30,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:47:30,525 INFO L471 AbstractCegarLoop]: Abstraction has 3452 states and 6404 transitions. [2024-11-10 00:47:30,526 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 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-11-10 00:47:30,526 INFO L276 IsEmpty]: Start isEmpty. Operand 3452 states and 6404 transitions. [2024-11-10 00:47:30,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-10 00:47:30,526 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:47:30,526 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-10 00:47:30,526 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-10 00:47:30,527 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:47:30,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:47:30,527 INFO L85 PathProgramCache]: Analyzing trace with hash 2095179311, now seen corresponding path program 1 times [2024-11-10 00:47:30,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:47:30,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295034438] [2024-11-10 00:47:30,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:47:30,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:47:30,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:47:30,588 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-10 00:47:30,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:47:30,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295034438] [2024-11-10 00:47:30,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [295034438] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:47:30,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:47:30,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 00:47:30,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312394632] [2024-11-10 00:47:30,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:47:30,590 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 00:47:30,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:47:30,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 00:47:30,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 00:47:30,591 INFO L87 Difference]: Start difference. First operand 3452 states and 6404 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 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-11-10 00:47:30,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:47:30,724 INFO L93 Difference]: Finished difference Result 5080 states and 8636 transitions. [2024-11-10 00:47:30,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 00:47:30,724 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 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 58 [2024-11-10 00:47:30,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:47:30,730 INFO L225 Difference]: With dead ends: 5080 [2024-11-10 00:47:30,730 INFO L226 Difference]: Without dead ends: 4485 [2024-11-10 00:47:30,732 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-10 00:47:30,732 INFO L432 NwaCegarLoop]: 2237 mSDtfsCounter, 4421 mSDsluCounter, 2301 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4421 SdHoareTripleChecker+Valid, 4538 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:47:30,732 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4421 Valid, 4538 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:47:30,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4485 states. [2024-11-10 00:47:30,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4485 to 4044. [2024-11-10 00:47:30,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4044 states, 4042 states have (on average 1.7822859970311726) internal successors, (7204), 4043 states have internal predecessors, (7204), 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-11-10 00:47:30,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4044 states to 4044 states and 7204 transitions. [2024-11-10 00:47:30,798 INFO L78 Accepts]: Start accepts. Automaton has 4044 states and 7204 transitions. Word has length 58 [2024-11-10 00:47:30,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:47:30,799 INFO L471 AbstractCegarLoop]: Abstraction has 4044 states and 7204 transitions. [2024-11-10 00:47:30,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 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-11-10 00:47:30,799 INFO L276 IsEmpty]: Start isEmpty. Operand 4044 states and 7204 transitions. [2024-11-10 00:47:30,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-10 00:47:30,800 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:47:30,800 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-10 00:47:30,800 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-10 00:47:30,800 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:47:30,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:47:30,800 INFO L85 PathProgramCache]: Analyzing trace with hash -1862091119, now seen corresponding path program 1 times [2024-11-10 00:47:30,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:47:30,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308024647] [2024-11-10 00:47:30,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:47:30,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:47:30,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:47:30,852 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:47:30,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:47:30,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308024647] [2024-11-10 00:47:30,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308024647] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:47:30,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:47:30,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:47:30,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146403828] [2024-11-10 00:47:30,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:47:30,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:47:30,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:47:30,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:47:30,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:47:30,854 INFO L87 Difference]: Start difference. First operand 4044 states and 7204 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 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-11-10 00:47:30,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:47:30,903 INFO L93 Difference]: Finished difference Result 6558 states and 10604 transitions. [2024-11-10 00:47:30,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:47:30,903 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 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 60 [2024-11-10 00:47:30,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:47:30,909 INFO L225 Difference]: With dead ends: 6558 [2024-11-10 00:47:30,909 INFO L226 Difference]: Without dead ends: 4047 [2024-11-10 00:47:30,912 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-11-10 00:47:30,913 INFO L432 NwaCegarLoop]: 2213 mSDtfsCounter, 28 mSDsluCounter, 2181 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 4394 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:47:30,913 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 4394 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:47:30,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4047 states. [2024-11-10 00:47:30,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4047 to 4044. [2024-11-10 00:47:30,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4044 states, 4042 states have (on average 1.7699158832261257) internal successors, (7154), 4043 states have internal predecessors, (7154), 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-11-10 00:47:30,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4044 states to 4044 states and 7154 transitions. [2024-11-10 00:47:30,976 INFO L78 Accepts]: Start accepts. Automaton has 4044 states and 7154 transitions. Word has length 60 [2024-11-10 00:47:30,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:47:30,977 INFO L471 AbstractCegarLoop]: Abstraction has 4044 states and 7154 transitions. [2024-11-10 00:47:30,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 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-11-10 00:47:30,977 INFO L276 IsEmpty]: Start isEmpty. Operand 4044 states and 7154 transitions. [2024-11-10 00:47:30,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-10 00:47:30,978 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:47:30,978 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-10 00:47:30,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-10 00:47:30,978 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:47:30,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:47:30,978 INFO L85 PathProgramCache]: Analyzing trace with hash 1431466449, now seen corresponding path program 1 times [2024-11-10 00:47:30,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:47:30,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119189859] [2024-11-10 00:47:30,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:47:30,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:47:30,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:47:31,027 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:47:31,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:47:31,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119189859] [2024-11-10 00:47:31,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119189859] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:47:31,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:47:31,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:47:31,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122793603] [2024-11-10 00:47:31,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:47:31,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:47:31,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:47:31,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:47:31,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:47:31,029 INFO L87 Difference]: Start difference. First operand 4044 states and 7154 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 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-11-10 00:47:31,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:47:31,066 INFO L93 Difference]: Finished difference Result 5039 states and 8490 transitions. [2024-11-10 00:47:31,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:47:31,067 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 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 60 [2024-11-10 00:47:31,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:47:31,071 INFO L225 Difference]: With dead ends: 5039 [2024-11-10 00:47:31,071 INFO L226 Difference]: Without dead ends: 2528 [2024-11-10 00:47:31,074 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-11-10 00:47:31,074 INFO L432 NwaCegarLoop]: 2211 mSDtfsCounter, 24 mSDsluCounter, 2180 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 4391 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:47:31,074 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 4391 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:47:31,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2528 states. [2024-11-10 00:47:31,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2528 to 2518. [2024-11-10 00:47:31,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2518 states, 2516 states have (on average 2.0325914149443562) internal successors, (5114), 2517 states have internal predecessors, (5114), 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-11-10 00:47:31,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2518 states to 2518 states and 5114 transitions. [2024-11-10 00:47:31,111 INFO L78 Accepts]: Start accepts. Automaton has 2518 states and 5114 transitions. Word has length 60 [2024-11-10 00:47:31,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:47:31,111 INFO L471 AbstractCegarLoop]: Abstraction has 2518 states and 5114 transitions. [2024-11-10 00:47:31,111 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 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-11-10 00:47:31,111 INFO L276 IsEmpty]: Start isEmpty. Operand 2518 states and 5114 transitions. [2024-11-10 00:47:31,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-10 00:47:31,112 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:47:31,112 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] [2024-11-10 00:47:31,112 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-10 00:47:31,112 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:47:31,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:47:31,112 INFO L85 PathProgramCache]: Analyzing trace with hash -1439328557, now seen corresponding path program 1 times [2024-11-10 00:47:31,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:47:31,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041687522] [2024-11-10 00:47:31,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:47:31,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:47:31,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:47:31,167 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:47:31,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:47:31,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041687522] [2024-11-10 00:47:31,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2041687522] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:47:31,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:47:31,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:47:31,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635818321] [2024-11-10 00:47:31,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:47:31,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:47:31,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:47:31,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:47:31,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:47:31,169 INFO L87 Difference]: Start difference. First operand 2518 states and 5114 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 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-11-10 00:47:31,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:47:31,193 INFO L93 Difference]: Finished difference Result 3010 states and 5766 transitions. [2024-11-10 00:47:31,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:47:31,194 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 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 62 [2024-11-10 00:47:31,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:47:31,197 INFO L225 Difference]: With dead ends: 3010 [2024-11-10 00:47:31,197 INFO L226 Difference]: Without dead ends: 2035 [2024-11-10 00:47:31,198 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-11-10 00:47:31,199 INFO L432 NwaCegarLoop]: 2205 mSDtfsCounter, 22 mSDsluCounter, 2165 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 4370 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:47:31,199 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 4370 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:47:31,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2035 states. [2024-11-10 00:47:31,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2035 to 2032. [2024-11-10 00:47:31,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2032 states, 2030 states have (on average 2.195566502463054) internal successors, (4457), 2031 states have internal predecessors, (4457), 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-11-10 00:47:31,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2032 states to 2032 states and 4457 transitions. [2024-11-10 00:47:31,226 INFO L78 Accepts]: Start accepts. Automaton has 2032 states and 4457 transitions. Word has length 62 [2024-11-10 00:47:31,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:47:31,227 INFO L471 AbstractCegarLoop]: Abstraction has 2032 states and 4457 transitions. [2024-11-10 00:47:31,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 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-11-10 00:47:31,227 INFO L276 IsEmpty]: Start isEmpty. Operand 2032 states and 4457 transitions. [2024-11-10 00:47:31,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-10 00:47:31,227 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:47:31,228 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-10 00:47:31,228 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-10 00:47:31,228 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:47:31,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:47:31,228 INFO L85 PathProgramCache]: Analyzing trace with hash 111390330, now seen corresponding path program 1 times [2024-11-10 00:47:31,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:47:31,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754310541] [2024-11-10 00:47:31,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:47:31,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:47:31,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:47:31,577 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:47:31,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:47:31,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754310541] [2024-11-10 00:47:31,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754310541] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 00:47:31,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1632808147] [2024-11-10 00:47:31,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:47:31,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 00:47:31,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 00:47:31,580 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 00:47:31,582 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-10 00:47:31,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:47:31,720 INFO L255 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-10 00:47:31,724 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 00:47:32,354 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:47:32,354 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 00:47:33,283 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:47:33,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1632808147] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 00:47:33,283 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 00:47:33,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 12] total 30 [2024-11-10 00:47:33,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320121674] [2024-11-10 00:47:33,284 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 00:47:33,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-11-10 00:47:33,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:47:33,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-11-10 00:47:33,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=767, Unknown=0, NotChecked=0, Total=870 [2024-11-10 00:47:33,286 INFO L87 Difference]: Start difference. First operand 2032 states and 4457 transitions. Second operand has 30 states, 30 states have (on average 5.666666666666667) internal successors, (170), 30 states have internal predecessors, (170), 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-11-10 00:47:34,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:47:34,913 INFO L93 Difference]: Finished difference Result 3478 states and 6352 transitions. [2024-11-10 00:47:34,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-11-10 00:47:34,914 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 5.666666666666667) internal successors, (170), 30 states have internal predecessors, (170), 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 64 [2024-11-10 00:47:34,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:47:34,918 INFO L225 Difference]: With dead ends: 3478 [2024-11-10 00:47:34,918 INFO L226 Difference]: Without dead ends: 2989 [2024-11-10 00:47:34,919 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 659 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=650, Invalid=2656, Unknown=0, NotChecked=0, Total=3306 [2024-11-10 00:47:34,919 INFO L432 NwaCegarLoop]: 2167 mSDtfsCounter, 22988 mSDsluCounter, 24033 mSDsCounter, 0 mSdLazyCounter, 673 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22988 SdHoareTripleChecker+Valid, 26200 SdHoareTripleChecker+Invalid, 715 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 673 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 00:47:34,920 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22988 Valid, 26200 Invalid, 715 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [42 Valid, 673 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 00:47:34,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2989 states. [2024-11-10 00:47:34,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2989 to 2974. [2024-11-10 00:47:34,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2974 states, 2972 states have (on average 1.9004037685060566) internal successors, (5648), 2973 states have internal predecessors, (5648), 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-11-10 00:47:34,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2974 states to 2974 states and 5648 transitions. [2024-11-10 00:47:34,960 INFO L78 Accepts]: Start accepts. Automaton has 2974 states and 5648 transitions. Word has length 64 [2024-11-10 00:47:34,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:47:34,961 INFO L471 AbstractCegarLoop]: Abstraction has 2974 states and 5648 transitions. [2024-11-10 00:47:34,961 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 5.666666666666667) internal successors, (170), 30 states have internal predecessors, (170), 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-11-10 00:47:34,961 INFO L276 IsEmpty]: Start isEmpty. Operand 2974 states and 5648 transitions. [2024-11-10 00:47:34,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-10 00:47:34,962 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:47:34,962 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-10 00:47:34,979 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-10 00:47:35,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-10 00:47:35,163 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:47:35,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:47:35,163 INFO L85 PathProgramCache]: Analyzing trace with hash 1924712451, now seen corresponding path program 1 times [2024-11-10 00:47:35,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:47:35,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330438908] [2024-11-10 00:47:35,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:47:35,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:47:35,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:47:35,747 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:47:35,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:47:35,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330438908] [2024-11-10 00:47:35,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330438908] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 00:47:35,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [127886025] [2024-11-10 00:47:35,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:47:35,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 00:47:35,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 00:47:35,750 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 00:47:35,751 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-10 00:47:35,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:47:35,860 INFO L255 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-10 00:47:35,862 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 00:47:36,873 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:47:36,873 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 00:47:38,953 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:47:38,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [127886025] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 00:47:38,954 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 00:47:38,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 16, 18] total 42 [2024-11-10 00:47:38,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615136370] [2024-11-10 00:47:38,954 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 00:47:38,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2024-11-10 00:47:38,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:47:38,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2024-11-10 00:47:38,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=265, Invalid=1457, Unknown=0, NotChecked=0, Total=1722 [2024-11-10 00:47:38,956 INFO L87 Difference]: Start difference. First operand 2974 states and 5648 transitions. Second operand has 42 states, 42 states have (on average 3.8095238095238093) internal successors, (160), 42 states have internal predecessors, (160), 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-11-10 00:47:41,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:47:41,614 INFO L93 Difference]: Finished difference Result 7651 states and 11605 transitions. [2024-11-10 00:47:41,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2024-11-10 00:47:41,615 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 3.8095238095238093) internal successors, (160), 42 states have internal predecessors, (160), 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 65 [2024-11-10 00:47:41,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:47:41,624 INFO L225 Difference]: With dead ends: 7651 [2024-11-10 00:47:41,624 INFO L226 Difference]: Without dead ends: 6220 [2024-11-10 00:47:41,628 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1485 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=1390, Invalid=4616, Unknown=0, NotChecked=0, Total=6006 [2024-11-10 00:47:41,628 INFO L432 NwaCegarLoop]: 2191 mSDtfsCounter, 16611 mSDsluCounter, 20109 mSDsCounter, 0 mSdLazyCounter, 1115 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16611 SdHoareTripleChecker+Valid, 22300 SdHoareTripleChecker+Invalid, 1183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 1115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-10 00:47:41,628 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16611 Valid, 22300 Invalid, 1183 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [68 Valid, 1115 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-10 00:47:41,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6220 states. [2024-11-10 00:47:41,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6220 to 3938. [2024-11-10 00:47:41,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3938 states, 3936 states have (on average 1.744410569105691) internal successors, (6866), 3937 states have internal predecessors, (6866), 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-11-10 00:47:41,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3938 states to 3938 states and 6866 transitions. [2024-11-10 00:47:41,711 INFO L78 Accepts]: Start accepts. Automaton has 3938 states and 6866 transitions. Word has length 65 [2024-11-10 00:47:41,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:47:41,711 INFO L471 AbstractCegarLoop]: Abstraction has 3938 states and 6866 transitions. [2024-11-10 00:47:41,711 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 3.8095238095238093) internal successors, (160), 42 states have internal predecessors, (160), 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-11-10 00:47:41,712 INFO L276 IsEmpty]: Start isEmpty. Operand 3938 states and 6866 transitions. [2024-11-10 00:47:41,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-10 00:47:41,712 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:47:41,712 INFO L215 NwaCegarLoop]: trace histogram [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-11-10 00:47:41,726 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-10 00:47:41,912 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-10 00:47:41,913 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:47:41,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:47:41,914 INFO L85 PathProgramCache]: Analyzing trace with hash -136318182, now seen corresponding path program 1 times [2024-11-10 00:47:41,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:47:41,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501089870] [2024-11-10 00:47:41,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:47:41,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:47:41,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:47:42,487 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:47:42,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:47:42,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501089870] [2024-11-10 00:47:42,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [501089870] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 00:47:42,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1892591463] [2024-11-10 00:47:42,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:47:42,488 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 00:47:42,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 00:47:42,489 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 00:47:42,490 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-10 00:47:42,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:47:42,634 INFO L255 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-10 00:47:42,637 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 00:47:43,206 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:47:43,206 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 00:47:43,940 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:47:43,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1892591463] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 00:47:43,941 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 00:47:43,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 17, 17] total 40 [2024-11-10 00:47:43,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164730682] [2024-11-10 00:47:43,941 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 00:47:43,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2024-11-10 00:47:43,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:47:43,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2024-11-10 00:47:43,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=1357, Unknown=0, NotChecked=0, Total=1560 [2024-11-10 00:47:43,942 INFO L87 Difference]: Start difference. First operand 3938 states and 6866 transitions. Second operand has 40 states, 40 states have (on average 4.25) internal successors, (170), 40 states have internal predecessors, (170), 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-11-10 00:47:47,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:47:47,047 INFO L93 Difference]: Finished difference Result 15375 states and 21459 transitions. [2024-11-10 00:47:47,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2024-11-10 00:47:47,048 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 4.25) internal successors, (170), 40 states have internal predecessors, (170), 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 66 [2024-11-10 00:47:47,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:47:47,064 INFO L225 Difference]: With dead ends: 15375 [2024-11-10 00:47:47,064 INFO L226 Difference]: Without dead ends: 14116 [2024-11-10 00:47:47,069 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1600 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=1379, Invalid=5101, Unknown=0, NotChecked=0, Total=6480 [2024-11-10 00:47:47,070 INFO L432 NwaCegarLoop]: 2212 mSDtfsCounter, 23826 mSDsluCounter, 20281 mSDsCounter, 0 mSdLazyCounter, 1414 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23826 SdHoareTripleChecker+Valid, 22493 SdHoareTripleChecker+Invalid, 1465 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 1414 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-10 00:47:47,070 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23826 Valid, 22493 Invalid, 1465 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 1414 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-10 00:47:47,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14116 states. [2024-11-10 00:47:47,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14116 to 4826. [2024-11-10 00:47:47,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4826 states, 4824 states have (on average 1.6515339966832505) internal successors, (7967), 4825 states have internal predecessors, (7967), 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-11-10 00:47:47,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4826 states to 4826 states and 7967 transitions. [2024-11-10 00:47:47,228 INFO L78 Accepts]: Start accepts. Automaton has 4826 states and 7967 transitions. Word has length 66 [2024-11-10 00:47:47,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:47:47,228 INFO L471 AbstractCegarLoop]: Abstraction has 4826 states and 7967 transitions. [2024-11-10 00:47:47,229 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 4.25) internal successors, (170), 40 states have internal predecessors, (170), 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-11-10 00:47:47,229 INFO L276 IsEmpty]: Start isEmpty. Operand 4826 states and 7967 transitions. [2024-11-10 00:47:47,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-10 00:47:47,229 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:47:47,229 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-10 00:47:47,243 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-10 00:47:47,434 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 00:47:47,434 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:47:47,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:47:47,435 INFO L85 PathProgramCache]: Analyzing trace with hash 1274102374, now seen corresponding path program 1 times [2024-11-10 00:47:47,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:47:47,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281906058] [2024-11-10 00:47:47,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:47:47,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:47:47,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:47:47,510 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-10 00:47:47,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:47:47,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281906058] [2024-11-10 00:47:47,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281906058] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 00:47:47,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1263521058] [2024-11-10 00:47:47,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:47:47,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 00:47:47,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 00:47:47,513 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 00:47:47,514 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-10 00:47:47,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:47:47,610 INFO L255 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-10 00:47:47,611 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 00:47:47,672 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-10 00:47:47,672 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 00:47:47,829 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-10 00:47:47,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1263521058] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 00:47:47,830 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 00:47:47,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6, 4] total 9 [2024-11-10 00:47:47,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960583772] [2024-11-10 00:47:47,830 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 00:47:47,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 00:47:47,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:47:47,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 00:47:47,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=39, Unknown=0, NotChecked=0, Total=72 [2024-11-10 00:47:47,831 INFO L87 Difference]: Start difference. First operand 4826 states and 7967 transitions. Second operand has 9 states, 9 states have (on average 17.444444444444443) internal successors, (157), 9 states have internal predecessors, (157), 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-11-10 00:47:48,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:47:48,056 INFO L93 Difference]: Finished difference Result 10068 states and 14411 transitions. [2024-11-10 00:47:48,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 00:47:48,056 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 17.444444444444443) internal successors, (157), 9 states have internal predecessors, (157), 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 67 [2024-11-10 00:47:48,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:47:48,065 INFO L225 Difference]: With dead ends: 10068 [2024-11-10 00:47:48,065 INFO L226 Difference]: Without dead ends: 6785 [2024-11-10 00:47:48,068 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=48, Unknown=0, NotChecked=0, Total=90 [2024-11-10 00:47:48,069 INFO L432 NwaCegarLoop]: 2188 mSDtfsCounter, 6447 mSDsluCounter, 4532 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6447 SdHoareTripleChecker+Valid, 6720 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:47:48,069 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6447 Valid, 6720 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:47:48,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6785 states. [2024-11-10 00:47:48,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6785 to 6420. [2024-11-10 00:47:48,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6420 states, 6418 states have (on average 1.5096603303209724) internal successors, (9689), 6419 states have internal predecessors, (9689), 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-11-10 00:47:48,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6420 states to 6420 states and 9689 transitions. [2024-11-10 00:47:48,280 INFO L78 Accepts]: Start accepts. Automaton has 6420 states and 9689 transitions. Word has length 67 [2024-11-10 00:47:48,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:47:48,280 INFO L471 AbstractCegarLoop]: Abstraction has 6420 states and 9689 transitions. [2024-11-10 00:47:48,280 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 17.444444444444443) internal successors, (157), 9 states have internal predecessors, (157), 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-11-10 00:47:48,280 INFO L276 IsEmpty]: Start isEmpty. Operand 6420 states and 9689 transitions. [2024-11-10 00:47:48,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-10 00:47:48,282 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:47:48,282 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-10 00:47:48,295 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-10 00:47:48,482 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 00:47:48,482 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:47:48,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:47:48,483 INFO L85 PathProgramCache]: Analyzing trace with hash -1727769516, now seen corresponding path program 1 times [2024-11-10 00:47:48,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:47:48,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627020361] [2024-11-10 00:47:48,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:47:48,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:47:48,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:47:48,625 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:47:48,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:47:48,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627020361] [2024-11-10 00:47:48,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627020361] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:47:48,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:47:48,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 00:47:48,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108070095] [2024-11-10 00:47:48,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:47:48,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 00:47:48,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:47:48,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 00:47:48,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 00:47:48,627 INFO L87 Difference]: Start difference. First operand 6420 states and 9689 transitions. Second operand has 5 states, 5 states have (on average 19.6) internal successors, (98), 4 states have internal predecessors, (98), 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-11-10 00:47:52,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:47:52,332 INFO L93 Difference]: Finished difference Result 8679 states and 15128 transitions. [2024-11-10 00:47:52,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 00:47:52,332 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.6) internal successors, (98), 4 states have internal predecessors, (98), 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 98 [2024-11-10 00:47:52,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:47:52,340 INFO L225 Difference]: With dead ends: 8679 [2024-11-10 00:47:52,340 INFO L226 Difference]: Without dead ends: 7172 [2024-11-10 00:47:52,342 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-10 00:47:52,342 INFO L432 NwaCegarLoop]: 765 mSDtfsCounter, 3080 mSDsluCounter, 554 mSDsCounter, 0 mSdLazyCounter, 5192 mSolverCounterSat, 221 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3080 SdHoareTripleChecker+Valid, 1319 SdHoareTripleChecker+Invalid, 5413 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 221 IncrementalHoareTripleChecker+Valid, 5192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2024-11-10 00:47:52,342 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3080 Valid, 1319 Invalid, 5413 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [221 Valid, 5192 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2024-11-10 00:47:52,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7172 states. [2024-11-10 00:47:52,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7172 to 7172. [2024-11-10 00:47:52,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7172 states, 7170 states have (on average 1.5518828451882845) internal successors, (11127), 7171 states have internal predecessors, (11127), 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-11-10 00:47:52,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7172 states to 7172 states and 11127 transitions. [2024-11-10 00:47:52,621 INFO L78 Accepts]: Start accepts. Automaton has 7172 states and 11127 transitions. Word has length 98 [2024-11-10 00:47:52,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:47:52,622 INFO L471 AbstractCegarLoop]: Abstraction has 7172 states and 11127 transitions. [2024-11-10 00:47:52,622 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.6) internal successors, (98), 4 states have internal predecessors, (98), 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-11-10 00:47:52,622 INFO L276 IsEmpty]: Start isEmpty. Operand 7172 states and 11127 transitions. [2024-11-10 00:47:52,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-10 00:47:52,624 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:47:52,624 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-10 00:47:52,624 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-10 00:47:52,624 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:47:52,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:47:52,625 INFO L85 PathProgramCache]: Analyzing trace with hash -1418192942, now seen corresponding path program 1 times [2024-11-10 00:47:52,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:47:52,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131736916] [2024-11-10 00:47:52,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:47:52,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:47:52,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:47:53,093 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 25 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:47:53,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:47:53,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131736916] [2024-11-10 00:47:53,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [131736916] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 00:47:53,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [315951558] [2024-11-10 00:47:53,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:47:53,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 00:47:53,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 00:47:53,095 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 00:47:53,096 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-10 00:47:53,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:47:53,209 INFO L255 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 62 conjuncts are in the unsatisfiable core [2024-11-10 00:47:53,212 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 00:47:55,232 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 33 proven. 62 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:47:55,233 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 00:48:02,157 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 16 proven. 79 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:48:02,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [315951558] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 00:48:02,158 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 00:48:02,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 25, 30] total 63 [2024-11-10 00:48:02,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968521123] [2024-11-10 00:48:02,158 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 00:48:02,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2024-11-10 00:48:02,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:48:02,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2024-11-10 00:48:02,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=571, Invalid=3335, Unknown=0, NotChecked=0, Total=3906 [2024-11-10 00:48:02,160 INFO L87 Difference]: Start difference. First operand 7172 states and 11127 transitions. Second operand has 63 states, 63 states have (on average 4.650793650793651) internal successors, (293), 63 states have internal predecessors, (293), 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-11-10 00:48:07,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:48:07,583 INFO L93 Difference]: Finished difference Result 10855 states and 15602 transitions. [2024-11-10 00:48:07,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2024-11-10 00:48:07,584 INFO L78 Accepts]: Start accepts. Automaton has has 63 states, 63 states have (on average 4.650793650793651) internal successors, (293), 63 states have internal predecessors, (293), 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 107 [2024-11-10 00:48:07,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:48:07,590 INFO L225 Difference]: With dead ends: 10855 [2024-11-10 00:48:07,591 INFO L226 Difference]: Without dead ends: 7665 [2024-11-10 00:48:07,596 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 292 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4535 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=2864, Invalid=13648, Unknown=0, NotChecked=0, Total=16512 [2024-11-10 00:48:07,596 INFO L432 NwaCegarLoop]: 2242 mSDtfsCounter, 42643 mSDsluCounter, 38075 mSDsCounter, 0 mSdLazyCounter, 1561 mSolverCounterSat, 173 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42643 SdHoareTripleChecker+Valid, 40317 SdHoareTripleChecker+Invalid, 1734 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 173 IncrementalHoareTripleChecker+Valid, 1561 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-10 00:48:07,596 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42643 Valid, 40317 Invalid, 1734 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [173 Valid, 1561 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-10 00:48:07,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7665 states. [2024-11-10 00:48:07,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7665 to 7333. [2024-11-10 00:48:07,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7333 states, 7331 states have (on average 1.535261219478925) internal successors, (11255), 7332 states have internal predecessors, (11255), 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-11-10 00:48:07,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7333 states to 7333 states and 11255 transitions. [2024-11-10 00:48:07,805 INFO L78 Accepts]: Start accepts. Automaton has 7333 states and 11255 transitions. Word has length 107 [2024-11-10 00:48:07,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:48:07,805 INFO L471 AbstractCegarLoop]: Abstraction has 7333 states and 11255 transitions. [2024-11-10 00:48:07,805 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 63 states, 63 states have (on average 4.650793650793651) internal successors, (293), 63 states have internal predecessors, (293), 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-11-10 00:48:07,805 INFO L276 IsEmpty]: Start isEmpty. Operand 7333 states and 11255 transitions. [2024-11-10 00:48:07,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-10 00:48:07,807 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:48:07,807 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 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] [2024-11-10 00:48:07,820 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-10 00:48:08,007 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2024-11-10 00:48:08,007 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:48:08,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:48:08,008 INFO L85 PathProgramCache]: Analyzing trace with hash 122124328, now seen corresponding path program 1 times [2024-11-10 00:48:08,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:48:08,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077219521] [2024-11-10 00:48:08,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:48:08,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:48:08,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:48:08,357 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 35 proven. 53 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-10 00:48:08,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:48:08,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077219521] [2024-11-10 00:48:08,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077219521] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 00:48:08,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [976058042] [2024-11-10 00:48:08,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:48:08,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 00:48:08,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 00:48:08,359 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 00:48:08,360 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-10 00:48:08,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:48:08,476 INFO L255 TraceCheckSpWp]: Trace formula consists of 439 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-10 00:48:08,478 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 00:48:09,017 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 39 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:48:09,018 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 00:48:10,230 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 36 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:48:10,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [976058042] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 00:48:10,230 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 00:48:10,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 12] total 26 [2024-11-10 00:48:10,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504149571] [2024-11-10 00:48:10,230 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 00:48:10,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-11-10 00:48:10,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:48:10,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-11-10 00:48:10,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=591, Unknown=0, NotChecked=0, Total=702 [2024-11-10 00:48:10,231 INFO L87 Difference]: Start difference. First operand 7333 states and 11255 transitions. Second operand has 27 states, 27 states have (on average 9.185185185185185) internal successors, (248), 26 states have internal predecessors, (248), 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-11-10 00:48:11,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:48:11,723 INFO L93 Difference]: Finished difference Result 17162 states and 23033 transitions. [2024-11-10 00:48:11,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2024-11-10 00:48:11,723 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 9.185185185185185) internal successors, (248), 26 states have internal predecessors, (248), 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 108 [2024-11-10 00:48:11,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:48:11,735 INFO L225 Difference]: With dead ends: 17162 [2024-11-10 00:48:11,735 INFO L226 Difference]: Without dead ends: 13521 [2024-11-10 00:48:11,741 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 198 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 799 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=865, Invalid=2795, Unknown=0, NotChecked=0, Total=3660 [2024-11-10 00:48:11,741 INFO L432 NwaCegarLoop]: 2216 mSDtfsCounter, 26657 mSDsluCounter, 15742 mSDsCounter, 0 mSdLazyCounter, 549 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26657 SdHoareTripleChecker+Valid, 17958 SdHoareTripleChecker+Invalid, 590 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 549 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 00:48:11,742 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26657 Valid, 17958 Invalid, 590 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 549 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 00:48:11,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13521 states. [2024-11-10 00:48:12,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13521 to 9654. [2024-11-10 00:48:12,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9654 states, 9652 states have (on average 1.4525486945710733) internal successors, (14020), 9653 states have internal predecessors, (14020), 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-11-10 00:48:12,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9654 states to 9654 states and 14020 transitions. [2024-11-10 00:48:12,115 INFO L78 Accepts]: Start accepts. Automaton has 9654 states and 14020 transitions. Word has length 108 [2024-11-10 00:48:12,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:48:12,115 INFO L471 AbstractCegarLoop]: Abstraction has 9654 states and 14020 transitions. [2024-11-10 00:48:12,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 9.185185185185185) internal successors, (248), 26 states have internal predecessors, (248), 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-11-10 00:48:12,115 INFO L276 IsEmpty]: Start isEmpty. Operand 9654 states and 14020 transitions. [2024-11-10 00:48:12,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-10 00:48:12,117 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:48:12,117 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 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] [2024-11-10 00:48:12,133 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-10 00:48:12,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 00:48:12,323 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:48:12,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:48:12,323 INFO L85 PathProgramCache]: Analyzing trace with hash -1680227606, now seen corresponding path program 1 times [2024-11-10 00:48:12,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:48:12,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679214607] [2024-11-10 00:48:12,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:48:12,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:48:12,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:48:12,932 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 25 proven. 71 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:48:12,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:48:12,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679214607] [2024-11-10 00:48:12,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [679214607] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 00:48:12,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1600151423] [2024-11-10 00:48:12,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:48:12,932 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 00:48:12,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 00:48:12,935 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 00:48:12,937 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-10 00:48:13,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:48:13,058 INFO L255 TraceCheckSpWp]: Trace formula consists of 442 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-10 00:48:13,060 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 00:48:14,936 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 25 proven. 71 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:48:14,936 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 00:48:17,525 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 25 proven. 71 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:48:17,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1600151423] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 00:48:17,526 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 00:48:17,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18, 18] total 53 [2024-11-10 00:48:17,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228600752] [2024-11-10 00:48:17,526 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 00:48:17,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2024-11-10 00:48:17,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:48:17,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2024-11-10 00:48:17,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=283, Invalid=2473, Unknown=0, NotChecked=0, Total=2756 [2024-11-10 00:48:17,528 INFO L87 Difference]: Start difference. First operand 9654 states and 14020 transitions. Second operand has 53 states, 53 states have (on average 5.566037735849057) internal successors, (295), 53 states have internal predecessors, (295), 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-11-10 00:48:22,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:48:22,248 INFO L93 Difference]: Finished difference Result 15958 states and 21592 transitions. [2024-11-10 00:48:22,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2024-11-10 00:48:22,249 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 5.566037735849057) internal successors, (295), 53 states have internal predecessors, (295), 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 108 [2024-11-10 00:48:22,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:48:22,260 INFO L225 Difference]: With dead ends: 15958 [2024-11-10 00:48:22,260 INFO L226 Difference]: Without dead ends: 12295 [2024-11-10 00:48:22,266 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 183 SyntacticMatches, 1 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2229 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=1620, Invalid=7500, Unknown=0, NotChecked=0, Total=9120 [2024-11-10 00:48:22,266 INFO L432 NwaCegarLoop]: 2275 mSDtfsCounter, 14260 mSDsluCounter, 51655 mSDsCounter, 0 mSdLazyCounter, 2049 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14260 SdHoareTripleChecker+Valid, 53930 SdHoareTripleChecker+Invalid, 2120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 2049 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-10 00:48:22,267 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14260 Valid, 53930 Invalid, 2120 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [71 Valid, 2049 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-10 00:48:22,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12295 states. [2024-11-10 00:48:22,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12295 to 12121. [2024-11-10 00:48:22,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12121 states, 12119 states have (on average 1.3954946777786945) internal successors, (16912), 12120 states have internal predecessors, (16912), 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-11-10 00:48:22,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12121 states to 12121 states and 16912 transitions. [2024-11-10 00:48:22,778 INFO L78 Accepts]: Start accepts. Automaton has 12121 states and 16912 transitions. Word has length 108 [2024-11-10 00:48:22,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:48:22,779 INFO L471 AbstractCegarLoop]: Abstraction has 12121 states and 16912 transitions. [2024-11-10 00:48:22,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 53 states have (on average 5.566037735849057) internal successors, (295), 53 states have internal predecessors, (295), 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-11-10 00:48:22,779 INFO L276 IsEmpty]: Start isEmpty. Operand 12121 states and 16912 transitions. [2024-11-10 00:48:22,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-10 00:48:22,781 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:48:22,781 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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] [2024-11-10 00:48:22,794 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-10 00:48:22,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 00:48:22,981 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:48:22,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:48:22,982 INFO L85 PathProgramCache]: Analyzing trace with hash 41264274, now seen corresponding path program 1 times [2024-11-10 00:48:22,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:48:22,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88738543] [2024-11-10 00:48:22,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:48:22,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:48:23,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:48:23,782 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 63 proven. 7 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-11-10 00:48:23,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:48:23,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88738543] [2024-11-10 00:48:23,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [88738543] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 00:48:23,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [822435355] [2024-11-10 00:48:23,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:48:23,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 00:48:23,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 00:48:23,784 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 00:48:23,784 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-10 00:48:23,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:48:23,898 INFO L255 TraceCheckSpWp]: Trace formula consists of 442 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-11-10 00:48:23,899 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 00:48:25,736 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 40 proven. 62 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:48:25,737 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 00:48:27,921 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 40 proven. 62 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:48:27,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [822435355] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 00:48:27,921 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 00:48:27,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 21, 21] total 59 [2024-11-10 00:48:27,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737300797] [2024-11-10 00:48:27,921 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 00:48:27,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2024-11-10 00:48:27,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:48:27,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2024-11-10 00:48:27,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=303, Invalid=3119, Unknown=0, NotChecked=0, Total=3422 [2024-11-10 00:48:27,923 INFO L87 Difference]: Start difference. First operand 12121 states and 16912 transitions. Second operand has 59 states, 59 states have (on average 4.491525423728813) internal successors, (265), 59 states have internal predecessors, (265), 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)