./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pals_lcr.8.ufo.BOUNDED-16.pals+Problem12_label09.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.8.ufo.BOUNDED-16.pals+Problem12_label09.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 3f39a4ed88358f3843a49d42ec542cedd625f85ccc775ac00c8c7c6ba1bcaef3 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 01:04:03,050 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 01:04:03,110 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 01:04:03,114 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 01:04:03,114 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 01:04:03,139 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 01:04:03,139 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 01:04:03,140 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 01:04:03,140 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 01:04:03,143 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 01:04:03,143 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 01:04:03,144 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 01:04:03,144 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 01:04:03,144 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 01:04:03,145 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 01:04:03,145 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 01:04:03,145 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 01:04:03,145 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 01:04:03,147 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 01:04:03,147 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 01:04:03,148 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 01:04:03,148 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 01:04:03,148 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 01:04:03,149 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 01:04:03,149 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 01:04:03,149 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 01:04:03,149 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 01:04:03,149 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 01:04:03,150 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 01:04:03,150 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 01:04:03,150 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 01:04:03,150 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 01:04:03,151 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 01:04:03,151 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 01:04:03,151 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 01:04:03,151 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 01:04:03,151 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 01:04:03,151 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 01:04:03,152 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 01:04:03,152 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 01:04:03,153 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 01:04:03,153 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 01:04:03,154 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 -> 3f39a4ed88358f3843a49d42ec542cedd625f85ccc775ac00c8c7c6ba1bcaef3 [2024-11-10 01:04:03,360 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 01:04:03,378 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 01:04:03,382 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 01:04:03,383 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 01:04:03,383 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 01:04:03,384 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pals_lcr.8.ufo.BOUNDED-16.pals+Problem12_label09.c [2024-11-10 01:04:04,740 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 01:04:05,147 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 01:04:05,147 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.8.ufo.BOUNDED-16.pals+Problem12_label09.c [2024-11-10 01:04:05,177 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a001d74e/8e19d60258f848db861fac3d3896afe3/FLAG02d538f05 [2024-11-10 01:04:05,316 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a001d74e/8e19d60258f848db861fac3d3896afe3 [2024-11-10 01:04:05,318 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 01:04:05,320 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 01:04:05,322 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 01:04:05,323 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 01:04:05,327 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 01:04:05,328 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 01:04:05" (1/1) ... [2024-11-10 01:04:05,329 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78f431a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:04:05, skipping insertion in model container [2024-11-10 01:04:05,329 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 01:04:05" (1/1) ... [2024-11-10 01:04:05,421 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 01:04:05,936 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.8.ufo.BOUNDED-16.pals+Problem12_label09.c[26860,26873] [2024-11-10 01:04:06,006 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.8.ufo.BOUNDED-16.pals+Problem12_label09.c[34608,34621] [2024-11-10 01:04:06,441 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 01:04:06,452 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 01:04:06,495 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.8.ufo.BOUNDED-16.pals+Problem12_label09.c[26860,26873] [2024-11-10 01:04:06,510 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.8.ufo.BOUNDED-16.pals+Problem12_label09.c[34608,34621] [2024-11-10 01:04:06,927 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 01:04:06,953 INFO L204 MainTranslator]: Completed translation [2024-11-10 01:04:06,954 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:04:06 WrapperNode [2024-11-10 01:04:06,954 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 01:04:06,955 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 01:04:06,955 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 01:04:06,955 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 01:04:06,961 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:04:06" (1/1) ... [2024-11-10 01:04:07,017 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:04:06" (1/1) ... [2024-11-10 01:04:07,309 INFO L138 Inliner]: procedures = 39, calls = 25, calls flagged for inlining = 20, calls inlined = 20, statements flattened = 5291 [2024-11-10 01:04:07,309 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 01:04:07,310 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 01:04:07,310 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 01:04:07,310 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 01:04:07,322 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:04:06" (1/1) ... [2024-11-10 01:04:07,322 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:04:06" (1/1) ... [2024-11-10 01:04:07,371 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:04:06" (1/1) ... [2024-11-10 01:04:07,548 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 01:04:07,549 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:04:06" (1/1) ... [2024-11-10 01:04:07,549 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:04:06" (1/1) ... [2024-11-10 01:04:07,667 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:04:06" (1/1) ... [2024-11-10 01:04:07,686 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:04:06" (1/1) ... [2024-11-10 01:04:07,707 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:04:06" (1/1) ... [2024-11-10 01:04:07,721 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:04:06" (1/1) ... [2024-11-10 01:04:07,784 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 01:04:07,786 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 01:04:07,786 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 01:04:07,786 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 01:04:07,788 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:04:06" (1/1) ... [2024-11-10 01:04:07,793 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 01:04:07,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 01:04:07,829 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 01:04:07,908 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 01:04:07,954 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 01:04:07,954 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 01:04:07,955 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 01:04:07,955 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 01:04:08,098 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 01:04:08,100 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 01:04:12,379 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2373: havoc calculate_output_#t~ret50#1; [2024-11-10 01:04:12,380 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L3852: havoc calculate_output2_#t~ret51#1; [2024-11-10 01:04:12,380 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L5342: havoc calculate_output3_#t~ret52#1; [2024-11-10 01:04:12,673 INFO L? ?]: Removed 2096 outVars from TransFormulas that were not future-live. [2024-11-10 01:04:12,673 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 01:04:12,707 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 01:04:12,707 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 01:04:12,708 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 01:04:12 BoogieIcfgContainer [2024-11-10 01:04:12,708 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 01:04:12,710 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 01:04:12,710 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 01:04:12,712 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 01:04:12,712 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 01:04:05" (1/3) ... [2024-11-10 01:04:12,713 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@113043b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 01:04:12, skipping insertion in model container [2024-11-10 01:04:12,713 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:04:06" (2/3) ... [2024-11-10 01:04:12,713 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@113043b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 01:04:12, skipping insertion in model container [2024-11-10 01:04:12,713 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 01:04:12" (3/3) ... [2024-11-10 01:04:12,714 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.8.ufo.BOUNDED-16.pals+Problem12_label09.c [2024-11-10 01:04:12,727 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 01:04:12,728 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-10 01:04:12,807 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 01:04:12,816 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;@284c2917, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 01:04:12,820 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-10 01:04:12,835 INFO L276 IsEmpty]: Start isEmpty. Operand has 954 states, 951 states have (on average 2.6119873817034702) internal successors, (2484), 953 states have internal predecessors, (2484), 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 01:04:12,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-10 01:04:12,849 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:04:12,850 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] [2024-11-10 01:04:12,850 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:04:12,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:04:12,854 INFO L85 PathProgramCache]: Analyzing trace with hash -1923967236, now seen corresponding path program 1 times [2024-11-10 01:04:12,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:04:12,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841470233] [2024-11-10 01:04:12,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:04:12,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:04:13,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:04:13,130 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 01:04:13,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:04:13,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841470233] [2024-11-10 01:04:13,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [841470233] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:04:13,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:04:13,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 01:04:13,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806461474] [2024-11-10 01:04:13,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:04:13,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 01:04:13,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:04:13,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 01:04:13,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 01:04:13,155 INFO L87 Difference]: Start difference. First operand has 954 states, 951 states have (on average 2.6119873817034702) internal successors, (2484), 953 states have internal predecessors, (2484), 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 16.0) internal successors, (32), 2 states have internal predecessors, (32), 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 01:04:13,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:04:13,221 INFO L93 Difference]: Finished difference Result 1839 states and 4836 transitions. [2024-11-10 01:04:13,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 01:04:13,224 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 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 32 [2024-11-10 01:04:13,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:04:13,238 INFO L225 Difference]: With dead ends: 1839 [2024-11-10 01:04:13,239 INFO L226 Difference]: Without dead ends: 886 [2024-11-10 01:04:13,243 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 01:04:13,246 INFO L432 NwaCegarLoop]: 2416 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, 2416 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 01:04:13,246 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2416 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 01:04:13,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 886 states. [2024-11-10 01:04:13,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 886 to 886. [2024-11-10 01:04:13,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 886 states, 884 states have (on average 2.6572398190045248) internal successors, (2349), 885 states have internal predecessors, (2349), 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 01:04:13,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 886 states to 886 states and 2349 transitions. [2024-11-10 01:04:13,314 INFO L78 Accepts]: Start accepts. Automaton has 886 states and 2349 transitions. Word has length 32 [2024-11-10 01:04:13,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:04:13,314 INFO L471 AbstractCegarLoop]: Abstraction has 886 states and 2349 transitions. [2024-11-10 01:04:13,314 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 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 01:04:13,314 INFO L276 IsEmpty]: Start isEmpty. Operand 886 states and 2349 transitions. [2024-11-10 01:04:13,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-10 01:04:13,316 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:04:13,316 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] [2024-11-10 01:04:13,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 01:04:13,316 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:04:13,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:04:13,317 INFO L85 PathProgramCache]: Analyzing trace with hash -1892947429, now seen corresponding path program 1 times [2024-11-10 01:04:13,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:04:13,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71452296] [2024-11-10 01:04:13,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:04:13,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:04:13,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:04:13,505 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 01:04:13,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:04:13,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71452296] [2024-11-10 01:04:13,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71452296] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:04:13,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:04:13,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 01:04:13,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087038282] [2024-11-10 01:04:13,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:04:13,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 01:04:13,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:04:13,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 01:04:13,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 01:04:13,508 INFO L87 Difference]: Start difference. First operand 886 states and 2349 transitions. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 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 01:04:13,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:04:13,629 INFO L93 Difference]: Finished difference Result 953 states and 2453 transitions. [2024-11-10 01:04:13,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 01:04:13,630 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 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 32 [2024-11-10 01:04:13,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:04:13,634 INFO L225 Difference]: With dead ends: 953 [2024-11-10 01:04:13,634 INFO L226 Difference]: Without dead ends: 886 [2024-11-10 01:04:13,635 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 01:04:13,636 INFO L432 NwaCegarLoop]: 2347 mSDtfsCounter, 0 mSDsluCounter, 6975 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 9322 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 01:04:13,636 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 9322 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 01:04:13,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 886 states. [2024-11-10 01:04:13,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 886 to 886. [2024-11-10 01:04:13,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 886 states, 884 states have (on average 2.588235294117647) internal successors, (2288), 885 states have internal predecessors, (2288), 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 01:04:13,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 886 states to 886 states and 2288 transitions. [2024-11-10 01:04:13,655 INFO L78 Accepts]: Start accepts. Automaton has 886 states and 2288 transitions. Word has length 32 [2024-11-10 01:04:13,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:04:13,655 INFO L471 AbstractCegarLoop]: Abstraction has 886 states and 2288 transitions. [2024-11-10 01:04:13,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 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 01:04:13,655 INFO L276 IsEmpty]: Start isEmpty. Operand 886 states and 2288 transitions. [2024-11-10 01:04:13,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-10 01:04:13,657 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:04:13,657 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:04:13,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 01:04:13,657 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:04:13,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:04:13,658 INFO L85 PathProgramCache]: Analyzing trace with hash 215218300, now seen corresponding path program 1 times [2024-11-10 01:04:13,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:04:13,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702884322] [2024-11-10 01:04:13,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:04:13,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:04:13,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:04:13,840 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 01:04:13,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:04:13,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702884322] [2024-11-10 01:04:13,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702884322] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:04:13,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:04:13,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 01:04:13,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052471695] [2024-11-10 01:04:13,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:04:13,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 01:04:13,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:04:13,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 01:04:13,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 01:04:13,844 INFO L87 Difference]: Start difference. First operand 886 states and 2288 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 3 states have internal predecessors, (69), 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 01:04:21,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:04:21,730 INFO L93 Difference]: Finished difference Result 3145 states and 8641 transitions. [2024-11-10 01:04:21,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 01:04:21,734 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 3 states have internal predecessors, (69), 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 69 [2024-11-10 01:04:21,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:04:21,761 INFO L225 Difference]: With dead ends: 3145 [2024-11-10 01:04:21,766 INFO L226 Difference]: Without dead ends: 2390 [2024-11-10 01:04:21,772 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 01:04:21,777 INFO L432 NwaCegarLoop]: 862 mSDtfsCounter, 4561 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 7874 mSolverCounterSat, 1245 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4561 SdHoareTripleChecker+Valid, 885 SdHoareTripleChecker+Invalid, 9119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1245 IncrementalHoareTripleChecker+Valid, 7874 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.7s IncrementalHoareTripleChecker+Time [2024-11-10 01:04:21,778 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4561 Valid, 885 Invalid, 9119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1245 Valid, 7874 Invalid, 0 Unknown, 0 Unchecked, 7.7s Time] [2024-11-10 01:04:21,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2390 states. [2024-11-10 01:04:21,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2390 to 2390. [2024-11-10 01:04:21,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2390 states, 2388 states have (on average 2.3559463986599667) internal successors, (5626), 2389 states have internal predecessors, (5626), 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 01:04:21,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2390 states to 2390 states and 5626 transitions. [2024-11-10 01:04:21,939 INFO L78 Accepts]: Start accepts. Automaton has 2390 states and 5626 transitions. Word has length 69 [2024-11-10 01:04:21,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:04:21,939 INFO L471 AbstractCegarLoop]: Abstraction has 2390 states and 5626 transitions. [2024-11-10 01:04:21,939 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 3 states have internal predecessors, (69), 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 01:04:21,940 INFO L276 IsEmpty]: Start isEmpty. Operand 2390 states and 5626 transitions. [2024-11-10 01:04:21,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-10 01:04:21,948 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:04:21,949 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:04:21,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 01:04:21,949 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:04:21,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:04:21,950 INFO L85 PathProgramCache]: Analyzing trace with hash -713735649, now seen corresponding path program 1 times [2024-11-10 01:04:21,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:04:21,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253864037] [2024-11-10 01:04:21,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:04:21,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:04:22,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:04:22,374 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 01:04:22,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:04:22,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253864037] [2024-11-10 01:04:22,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253864037] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:04:22,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:04:22,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-10 01:04:22,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288461877] [2024-11-10 01:04:22,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:04:22,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 01:04:22,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:04:22,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 01:04:22,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-10 01:04:22,378 INFO L87 Difference]: Start difference. First operand 2390 states and 5626 transitions. Second operand has 10 states, 10 states have (on average 9.2) internal successors, (92), 10 states have internal predecessors, (92), 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 01:04:22,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:04:22,877 INFO L93 Difference]: Finished difference Result 3398 states and 7226 transitions. [2024-11-10 01:04:22,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-10 01:04:22,877 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.2) internal successors, (92), 10 states have internal predecessors, (92), 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 92 [2024-11-10 01:04:22,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:04:22,889 INFO L225 Difference]: With dead ends: 3398 [2024-11-10 01:04:22,890 INFO L226 Difference]: Without dead ends: 3335 [2024-11-10 01:04:22,893 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=162, Invalid=344, Unknown=0, NotChecked=0, Total=506 [2024-11-10 01:04:22,895 INFO L432 NwaCegarLoop]: 2284 mSDtfsCounter, 18877 mSDsluCounter, 5120 mSDsCounter, 0 mSdLazyCounter, 373 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18877 SdHoareTripleChecker+Valid, 7404 SdHoareTripleChecker+Invalid, 384 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 373 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 01:04:22,896 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18877 Valid, 7404 Invalid, 384 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 373 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 01:04:22,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3335 states. [2024-11-10 01:04:22,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3335 to 2450. [2024-11-10 01:04:22,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2450 states, 2448 states have (on average 2.337418300653595) internal successors, (5722), 2449 states have internal predecessors, (5722), 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 01:04:22,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2450 states to 2450 states and 5722 transitions. [2024-11-10 01:04:22,948 INFO L78 Accepts]: Start accepts. Automaton has 2450 states and 5722 transitions. Word has length 92 [2024-11-10 01:04:22,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:04:22,949 INFO L471 AbstractCegarLoop]: Abstraction has 2450 states and 5722 transitions. [2024-11-10 01:04:22,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.2) internal successors, (92), 10 states have internal predecessors, (92), 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 01:04:22,949 INFO L276 IsEmpty]: Start isEmpty. Operand 2450 states and 5722 transitions. [2024-11-10 01:04:22,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-10 01:04:22,951 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:04:22,951 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:04:22,951 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 01:04:22,951 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:04:22,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:04:22,952 INFO L85 PathProgramCache]: Analyzing trace with hash -710798079, now seen corresponding path program 1 times [2024-11-10 01:04:22,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:04:22,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485085432] [2024-11-10 01:04:22,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:04:22,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:04:23,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:04:23,640 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 01:04:23,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:04:23,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485085432] [2024-11-10 01:04:23,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485085432] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:04:23,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:04:23,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-10 01:04:23,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066904588] [2024-11-10 01:04:23,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:04:23,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 01:04:23,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:04:23,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 01:04:23,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-11-10 01:04:23,647 INFO L87 Difference]: Start difference. First operand 2450 states and 5722 transitions. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 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 01:04:24,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:04:24,071 INFO L93 Difference]: Finished difference Result 2576 states and 5920 transitions. [2024-11-10 01:04:24,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-10 01:04:24,075 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 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 94 [2024-11-10 01:04:24,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:04:24,083 INFO L225 Difference]: With dead ends: 2576 [2024-11-10 01:04:24,083 INFO L226 Difference]: Without dead ends: 2453 [2024-11-10 01:04:24,084 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=84, Invalid=156, Unknown=0, NotChecked=0, Total=240 [2024-11-10 01:04:24,085 INFO L432 NwaCegarLoop]: 2278 mSDtfsCounter, 13224 mSDsluCounter, 682 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13224 SdHoareTripleChecker+Valid, 2960 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 01:04:24,085 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13224 Valid, 2960 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 01:04:24,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2453 states. [2024-11-10 01:04:24,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2453 to 2450. [2024-11-10 01:04:24,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2450 states, 2448 states have (on average 2.3370098039215685) internal successors, (5721), 2449 states have internal predecessors, (5721), 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 01:04:24,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2450 states to 2450 states and 5721 transitions. [2024-11-10 01:04:24,125 INFO L78 Accepts]: Start accepts. Automaton has 2450 states and 5721 transitions. Word has length 94 [2024-11-10 01:04:24,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:04:24,126 INFO L471 AbstractCegarLoop]: Abstraction has 2450 states and 5721 transitions. [2024-11-10 01:04:24,126 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 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 01:04:24,126 INFO L276 IsEmpty]: Start isEmpty. Operand 2450 states and 5721 transitions. [2024-11-10 01:04:24,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-10 01:04:24,127 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:04:24,127 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:04:24,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 01:04:24,127 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:04:24,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:04:24,128 INFO L85 PathProgramCache]: Analyzing trace with hash 1163915236, now seen corresponding path program 1 times [2024-11-10 01:04:24,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:04:24,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805966140] [2024-11-10 01:04:24,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:04:24,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:04:24,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:04:24,205 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 01:04:24,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:04:24,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805966140] [2024-11-10 01:04:24,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805966140] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:04:24,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:04:24,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 01:04:24,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519286276] [2024-11-10 01:04:24,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:04:24,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 01:04:24,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:04:24,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 01:04:24,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 01:04:24,207 INFO L87 Difference]: Start difference. First operand 2450 states and 5721 transitions. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 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 01:04:24,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:04:24,239 INFO L93 Difference]: Finished difference Result 2684 states and 6091 transitions. [2024-11-10 01:04:24,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 01:04:24,240 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 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 95 [2024-11-10 01:04:24,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:04:24,247 INFO L225 Difference]: With dead ends: 2684 [2024-11-10 01:04:24,248 INFO L226 Difference]: Without dead ends: 2561 [2024-11-10 01:04:24,248 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 01:04:24,249 INFO L432 NwaCegarLoop]: 2294 mSDtfsCounter, 2190 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2190 SdHoareTripleChecker+Valid, 2389 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 01:04:24,249 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2190 Valid, 2389 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 01:04:24,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2561 states. [2024-11-10 01:04:24,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2561 to 2558. [2024-11-10 01:04:24,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2558 states, 2556 states have (on average 2.304773082942097) internal successors, (5891), 2557 states have internal predecessors, (5891), 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 01:04:24,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2558 states to 2558 states and 5891 transitions. [2024-11-10 01:04:24,285 INFO L78 Accepts]: Start accepts. Automaton has 2558 states and 5891 transitions. Word has length 95 [2024-11-10 01:04:24,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:04:24,285 INFO L471 AbstractCegarLoop]: Abstraction has 2558 states and 5891 transitions. [2024-11-10 01:04:24,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 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 01:04:24,286 INFO L276 IsEmpty]: Start isEmpty. Operand 2558 states and 5891 transitions. [2024-11-10 01:04:24,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-10 01:04:24,286 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:04:24,287 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:04:24,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 01:04:24,287 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:04:24,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:04:24,287 INFO L85 PathProgramCache]: Analyzing trace with hash 2094869955, now seen corresponding path program 1 times [2024-11-10 01:04:24,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:04:24,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867687389] [2024-11-10 01:04:24,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:04:24,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:04:24,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:04:24,358 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 01:04:24,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:04:24,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867687389] [2024-11-10 01:04:24,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1867687389] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:04:24,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:04:24,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 01:04:24,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437954860] [2024-11-10 01:04:24,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:04:24,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 01:04:24,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:04:24,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 01:04:24,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 01:04:24,361 INFO L87 Difference]: Start difference. First operand 2558 states and 5891 transitions. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 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 01:04:24,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:04:24,399 INFO L93 Difference]: Finished difference Result 2799 states and 6271 transitions. [2024-11-10 01:04:24,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 01:04:24,400 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 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 96 [2024-11-10 01:04:24,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:04:24,408 INFO L225 Difference]: With dead ends: 2799 [2024-11-10 01:04:24,409 INFO L226 Difference]: Without dead ends: 2676 [2024-11-10 01:04:24,411 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 01:04:24,412 INFO L432 NwaCegarLoop]: 2372 mSDtfsCounter, 2210 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2210 SdHoareTripleChecker+Valid, 2473 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 01:04:24,412 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2210 Valid, 2473 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 01:04:24,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2676 states. [2024-11-10 01:04:24,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2676 to 2673. [2024-11-10 01:04:24,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2673 states, 2671 states have (on average 2.272931486334706) internal successors, (6071), 2672 states have internal predecessors, (6071), 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 01:04:24,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2673 states to 2673 states and 6071 transitions. [2024-11-10 01:04:24,456 INFO L78 Accepts]: Start accepts. Automaton has 2673 states and 6071 transitions. Word has length 96 [2024-11-10 01:04:24,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:04:24,456 INFO L471 AbstractCegarLoop]: Abstraction has 2673 states and 6071 transitions. [2024-11-10 01:04:24,456 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 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 01:04:24,456 INFO L276 IsEmpty]: Start isEmpty. Operand 2673 states and 6071 transitions. [2024-11-10 01:04:24,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-10 01:04:24,457 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:04:24,457 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:04:24,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 01:04:24,457 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:04:24,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:04:24,458 INFO L85 PathProgramCache]: Analyzing trace with hash 1826988291, now seen corresponding path program 1 times [2024-11-10 01:04:24,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:04:24,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644287343] [2024-11-10 01:04:24,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:04:24,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:04:24,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:04:24,550 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 01:04:24,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:04:24,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644287343] [2024-11-10 01:04:24,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1644287343] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:04:24,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:04:24,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 01:04:24,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001030439] [2024-11-10 01:04:24,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:04:24,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 01:04:24,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:04:24,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 01:04:24,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 01:04:24,552 INFO L87 Difference]: Start difference. First operand 2673 states and 6071 transitions. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 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 01:04:24,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:04:24,603 INFO L93 Difference]: Finished difference Result 3335 states and 7113 transitions. [2024-11-10 01:04:24,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 01:04:24,603 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 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 96 [2024-11-10 01:04:24,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:04:24,615 INFO L225 Difference]: With dead ends: 3335 [2024-11-10 01:04:24,615 INFO L226 Difference]: Without dead ends: 2992 [2024-11-10 01:04:24,617 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 01:04:24,617 INFO L432 NwaCegarLoop]: 2374 mSDtfsCounter, 2208 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2208 SdHoareTripleChecker+Valid, 2479 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 01:04:24,618 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2208 Valid, 2479 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 01:04:24,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2992 states. [2024-11-10 01:04:24,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2992 to 2989. [2024-11-10 01:04:24,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2989 states, 2987 states have (on average 2.1971878138600602) internal successors, (6563), 2988 states have internal predecessors, (6563), 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 01:04:24,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2989 states to 2989 states and 6563 transitions. [2024-11-10 01:04:24,666 INFO L78 Accepts]: Start accepts. Automaton has 2989 states and 6563 transitions. Word has length 96 [2024-11-10 01:04:24,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:04:24,667 INFO L471 AbstractCegarLoop]: Abstraction has 2989 states and 6563 transitions. [2024-11-10 01:04:24,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 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 01:04:24,667 INFO L276 IsEmpty]: Start isEmpty. Operand 2989 states and 6563 transitions. [2024-11-10 01:04:24,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-10 01:04:24,668 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:04:24,668 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:04:24,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 01:04:24,668 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:04:24,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:04:24,669 INFO L85 PathProgramCache]: Analyzing trace with hash -1359879101, now seen corresponding path program 1 times [2024-11-10 01:04:24,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:04:24,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765209665] [2024-11-10 01:04:24,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:04:24,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:04:24,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:04:24,775 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 01:04:24,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:04:24,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765209665] [2024-11-10 01:04:24,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1765209665] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:04:24,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:04:24,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 01:04:24,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506018239] [2024-11-10 01:04:24,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:04:24,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 01:04:24,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:04:24,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 01:04:24,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 01:04:24,776 INFO L87 Difference]: Start difference. First operand 2989 states and 6563 transitions. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 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 01:04:24,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:04:24,857 INFO L93 Difference]: Finished difference Result 4259 states and 8547 transitions. [2024-11-10 01:04:24,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 01:04:24,858 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 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 96 [2024-11-10 01:04:24,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:04:24,873 INFO L225 Difference]: With dead ends: 4259 [2024-11-10 01:04:24,873 INFO L226 Difference]: Without dead ends: 3600 [2024-11-10 01:04:24,875 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 01:04:24,875 INFO L432 NwaCegarLoop]: 2372 mSDtfsCounter, 2206 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2206 SdHoareTripleChecker+Valid, 2481 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 01:04:24,876 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2206 Valid, 2481 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 01:04:24,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3600 states. [2024-11-10 01:04:24,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3600 to 3597. [2024-11-10 01:04:24,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3597 states, 3595 states have (on average 2.085952712100139) internal successors, (7499), 3596 states have internal predecessors, (7499), 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 01:04:24,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3597 states to 3597 states and 7499 transitions. [2024-11-10 01:04:24,999 INFO L78 Accepts]: Start accepts. Automaton has 3597 states and 7499 transitions. Word has length 96 [2024-11-10 01:04:24,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:04:24,999 INFO L471 AbstractCegarLoop]: Abstraction has 3597 states and 7499 transitions. [2024-11-10 01:04:25,000 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 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 01:04:25,000 INFO L276 IsEmpty]: Start isEmpty. Operand 3597 states and 7499 transitions. [2024-11-10 01:04:25,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-10 01:04:25,001 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:04:25,001 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:04:25,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-10 01:04:25,001 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:04:25,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:04:25,002 INFO L85 PathProgramCache]: Analyzing trace with hash -2132419901, now seen corresponding path program 1 times [2024-11-10 01:04:25,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:04:25,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247300100] [2024-11-10 01:04:25,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:04:25,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:04:25,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:04:25,062 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 01:04:25,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:04:25,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247300100] [2024-11-10 01:04:25,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247300100] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:04:25,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:04:25,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 01:04:25,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393305049] [2024-11-10 01:04:25,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:04:25,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 01:04:25,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:04:25,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 01:04:25,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 01:04:25,064 INFO L87 Difference]: Start difference. First operand 3597 states and 7499 transitions. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 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 01:04:25,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:04:25,110 INFO L93 Difference]: Finished difference Result 6035 states and 11271 transitions. [2024-11-10 01:04:25,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 01:04:25,110 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 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 96 [2024-11-10 01:04:25,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:04:25,118 INFO L225 Difference]: With dead ends: 6035 [2024-11-10 01:04:25,119 INFO L226 Difference]: Without dead ends: 4768 [2024-11-10 01:04:25,122 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 01:04:25,122 INFO L432 NwaCegarLoop]: 2360 mSDtfsCounter, 2202 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2202 SdHoareTripleChecker+Valid, 2477 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 01:04:25,122 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2202 Valid, 2477 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 01:04:25,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4768 states. [2024-11-10 01:04:25,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4768 to 4765. [2024-11-10 01:04:25,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4765 states, 4763 states have (on average 1.9473021205122822) internal successors, (9275), 4764 states have internal predecessors, (9275), 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 01:04:25,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4765 states to 4765 states and 9275 transitions. [2024-11-10 01:04:25,201 INFO L78 Accepts]: Start accepts. Automaton has 4765 states and 9275 transitions. Word has length 96 [2024-11-10 01:04:25,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:04:25,201 INFO L471 AbstractCegarLoop]: Abstraction has 4765 states and 9275 transitions. [2024-11-10 01:04:25,202 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 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 01:04:25,202 INFO L276 IsEmpty]: Start isEmpty. Operand 4765 states and 9275 transitions. [2024-11-10 01:04:25,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-10 01:04:25,202 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:04:25,203 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:04:25,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-10 01:04:25,203 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:04:25,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:04:25,203 INFO L85 PathProgramCache]: Analyzing trace with hash 1161137667, now seen corresponding path program 1 times [2024-11-10 01:04:25,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:04:25,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724758729] [2024-11-10 01:04:25,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:04:25,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:04:25,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:04:25,260 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 01:04:25,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:04:25,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724758729] [2024-11-10 01:04:25,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724758729] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:04:25,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:04:25,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 01:04:25,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805181228] [2024-11-10 01:04:25,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:04:25,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 01:04:25,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:04:25,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 01:04:25,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 01:04:25,261 INFO L87 Difference]: Start difference. First operand 4765 states and 9275 transitions. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 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 01:04:25,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:04:25,329 INFO L93 Difference]: Finished difference Result 9443 states and 16431 transitions. [2024-11-10 01:04:25,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 01:04:25,330 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 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 96 [2024-11-10 01:04:25,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:04:25,341 INFO L225 Difference]: With dead ends: 9443 [2024-11-10 01:04:25,341 INFO L226 Difference]: Without dead ends: 7008 [2024-11-10 01:04:25,346 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 01:04:25,346 INFO L432 NwaCegarLoop]: 2358 mSDtfsCounter, 2200 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2200 SdHoareTripleChecker+Valid, 2479 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 01:04:25,347 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2200 Valid, 2479 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 01:04:25,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7008 states. [2024-11-10 01:04:25,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7008 to 7005. [2024-11-10 01:04:25,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7005 states, 7003 states have (on average 1.8042267599600172) internal successors, (12635), 7004 states have internal predecessors, (12635), 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 01:04:25,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7005 states to 7005 states and 12635 transitions. [2024-11-10 01:04:25,535 INFO L78 Accepts]: Start accepts. Automaton has 7005 states and 12635 transitions. Word has length 96 [2024-11-10 01:04:25,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:04:25,535 INFO L471 AbstractCegarLoop]: Abstraction has 7005 states and 12635 transitions. [2024-11-10 01:04:25,535 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 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 01:04:25,535 INFO L276 IsEmpty]: Start isEmpty. Operand 7005 states and 12635 transitions. [2024-11-10 01:04:25,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-10 01:04:25,536 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:04:25,536 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:04:25,536 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-10 01:04:25,536 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:04:25,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:04:25,537 INFO L85 PathProgramCache]: Analyzing trace with hash 1146687811, now seen corresponding path program 1 times [2024-11-10 01:04:25,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:04:25,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139953512] [2024-11-10 01:04:25,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:04:25,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:04:25,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:04:25,605 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 01:04:25,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:04:25,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139953512] [2024-11-10 01:04:25,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139953512] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:04:25,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:04:25,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 01:04:25,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975033264] [2024-11-10 01:04:25,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:04:25,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 01:04:25,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:04:25,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 01:04:25,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 01:04:25,607 INFO L87 Difference]: Start difference. First operand 7005 states and 12635 transitions. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 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 01:04:25,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:04:25,720 INFO L93 Difference]: Finished difference Result 15971 states and 26175 transitions. [2024-11-10 01:04:25,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 01:04:25,720 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 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 96 [2024-11-10 01:04:25,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:04:25,738 INFO L225 Difference]: With dead ends: 15971 [2024-11-10 01:04:25,738 INFO L226 Difference]: Without dead ends: 11296 [2024-11-10 01:04:25,747 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 01:04:25,747 INFO L432 NwaCegarLoop]: 2356 mSDtfsCounter, 2198 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2198 SdHoareTripleChecker+Valid, 2481 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 01:04:25,748 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2198 Valid, 2481 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 01:04:25,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11296 states. [2024-11-10 01:04:25,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11296 to 11293. [2024-11-10 01:04:25,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11293 states, 11291 states have (on average 1.6801877601629616) internal successors, (18971), 11292 states have internal predecessors, (18971), 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 01:04:25,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11293 states to 11293 states and 18971 transitions. [2024-11-10 01:04:25,976 INFO L78 Accepts]: Start accepts. Automaton has 11293 states and 18971 transitions. Word has length 96 [2024-11-10 01:04:25,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:04:25,977 INFO L471 AbstractCegarLoop]: Abstraction has 11293 states and 18971 transitions. [2024-11-10 01:04:25,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 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 01:04:25,977 INFO L276 IsEmpty]: Start isEmpty. Operand 11293 states and 18971 transitions. [2024-11-10 01:04:25,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-10 01:04:25,978 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:04:25,978 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:04:25,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-10 01:04:25,978 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:04:25,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:04:25,978 INFO L85 PathProgramCache]: Analyzing trace with hash -1056676733, now seen corresponding path program 1 times [2024-11-10 01:04:25,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:04:25,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807023182] [2024-11-10 01:04:25,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:04:25,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:04:25,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:04:26,034 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 01:04:26,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:04:26,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807023182] [2024-11-10 01:04:26,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807023182] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:04:26,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:04:26,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 01:04:26,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313560438] [2024-11-10 01:04:26,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:04:26,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 01:04:26,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:04:26,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 01:04:26,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 01:04:26,036 INFO L87 Difference]: Start difference. First operand 11293 states and 18971 transitions. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 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 01:04:26,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:04:26,243 INFO L93 Difference]: Finished difference Result 28451 states and 44511 transitions. [2024-11-10 01:04:26,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 01:04:26,243 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 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 96 [2024-11-10 01:04:26,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:04:26,273 INFO L225 Difference]: With dead ends: 28451 [2024-11-10 01:04:26,273 INFO L226 Difference]: Without dead ends: 19488 [2024-11-10 01:04:26,288 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 01:04:26,289 INFO L432 NwaCegarLoop]: 2354 mSDtfsCounter, 2196 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2196 SdHoareTripleChecker+Valid, 2483 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 01:04:26,289 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2196 Valid, 2483 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 01:04:26,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19488 states. [2024-11-10 01:04:26,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19488 to 19485. [2024-11-10 01:04:26,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19485 states, 19483 states have (on average 1.5847148796386594) internal successors, (30875), 19484 states have internal predecessors, (30875), 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 01:04:26,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19485 states to 19485 states and 30875 transitions. [2024-11-10 01:04:26,939 INFO L78 Accepts]: Start accepts. Automaton has 19485 states and 30875 transitions. Word has length 96 [2024-11-10 01:04:26,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:04:26,939 INFO L471 AbstractCegarLoop]: Abstraction has 19485 states and 30875 transitions. [2024-11-10 01:04:26,939 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 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 01:04:26,939 INFO L276 IsEmpty]: Start isEmpty. Operand 19485 states and 30875 transitions. [2024-11-10 01:04:26,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-10 01:04:26,940 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:04:26,940 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:04:26,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-10 01:04:26,941 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:04:26,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:04:26,941 INFO L85 PathProgramCache]: Analyzing trace with hash -1580953788, now seen corresponding path program 1 times [2024-11-10 01:04:26,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:04:26,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488568571] [2024-11-10 01:04:26,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:04:26,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:04:26,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:04:27,254 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 01:04:27,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:04:27,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488568571] [2024-11-10 01:04:27,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488568571] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:04:27,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:04:27,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 01:04:27,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205971112] [2024-11-10 01:04:27,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:04:27,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 01:04:27,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:04:27,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 01:04:27,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-10 01:04:27,257 INFO L87 Difference]: Start difference. First operand 19485 states and 30875 transitions. Second operand has 8 states, 8 states have (on average 12.0) internal successors, (96), 8 states have internal predecessors, (96), 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 01:04:27,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:04:27,600 INFO L93 Difference]: Finished difference Result 20256 states and 31901 transitions. [2024-11-10 01:04:27,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 01:04:27,601 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.0) internal successors, (96), 8 states have internal predecessors, (96), 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 96 [2024-11-10 01:04:27,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:04:27,636 INFO L225 Difference]: With dead ends: 20256 [2024-11-10 01:04:27,636 INFO L226 Difference]: Without dead ends: 20253 [2024-11-10 01:04:27,647 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 01:04:27,648 INFO L432 NwaCegarLoop]: 2282 mSDtfsCounter, 0 mSDsluCounter, 13679 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 15961 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 01:04:27,648 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 15961 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 01:04:27,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20253 states. [2024-11-10 01:04:28,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20253 to 20253. [2024-11-10 01:04:28,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20253 states, 20251 states have (on average 1.5593797837143846) internal successors, (31579), 20252 states have internal predecessors, (31579), 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 01:04:28,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20253 states to 20253 states and 31579 transitions. [2024-11-10 01:04:28,097 INFO L78 Accepts]: Start accepts. Automaton has 20253 states and 31579 transitions. Word has length 96 [2024-11-10 01:04:28,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:04:28,097 INFO L471 AbstractCegarLoop]: Abstraction has 20253 states and 31579 transitions. [2024-11-10 01:04:28,097 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.0) internal successors, (96), 8 states have internal predecessors, (96), 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 01:04:28,098 INFO L276 IsEmpty]: Start isEmpty. Operand 20253 states and 31579 transitions. [2024-11-10 01:04:28,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-10 01:04:28,098 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:04:28,098 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:04:28,098 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-10 01:04:28,098 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:04:28,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:04:28,099 INFO L85 PathProgramCache]: Analyzing trace with hash -1850345597, now seen corresponding path program 1 times [2024-11-10 01:04:28,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:04:28,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178784554] [2024-11-10 01:04:28,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:04:28,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:04:28,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:04:28,164 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 01:04:28,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:04:28,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178784554] [2024-11-10 01:04:28,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178784554] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:04:28,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:04:28,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 01:04:28,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63535761] [2024-11-10 01:04:28,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:04:28,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 01:04:28,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:04:28,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 01:04:28,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 01:04:28,165 INFO L87 Difference]: Start difference. First operand 20253 states and 31579 transitions. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 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 01:04:28,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:04:28,641 INFO L93 Difference]: Finished difference Result 54563 states and 80991 transitions. [2024-11-10 01:04:28,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 01:04:28,642 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 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 96 [2024-11-10 01:04:28,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:04:28,689 INFO L225 Difference]: With dead ends: 54563 [2024-11-10 01:04:28,690 INFO L226 Difference]: Without dead ends: 36640 [2024-11-10 01:04:28,710 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 01:04:28,710 INFO L432 NwaCegarLoop]: 2370 mSDtfsCounter, 2204 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2204 SdHoareTripleChecker+Valid, 2483 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 01:04:28,711 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2204 Valid, 2483 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 01:04:28,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36640 states. [2024-11-10 01:04:29,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36640 to 36637. [2024-11-10 01:04:29,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36637 states, 36635 states have (on average 1.4891497202129111) internal successors, (54555), 36636 states have internal predecessors, (54555), 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 01:04:29,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36637 states to 36637 states and 54555 transitions. [2024-11-10 01:04:29,349 INFO L78 Accepts]: Start accepts. Automaton has 36637 states and 54555 transitions. Word has length 96 [2024-11-10 01:04:29,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:04:29,349 INFO L471 AbstractCegarLoop]: Abstraction has 36637 states and 54555 transitions. [2024-11-10 01:04:29,349 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 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 01:04:29,350 INFO L276 IsEmpty]: Start isEmpty. Operand 36637 states and 54555 transitions. [2024-11-10 01:04:29,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-10 01:04:29,360 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:04:29,361 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:04:29,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-10 01:04:29,361 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:04:29,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:04:29,361 INFO L85 PathProgramCache]: Analyzing trace with hash -684209181, now seen corresponding path program 1 times [2024-11-10 01:04:29,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:04:29,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451289403] [2024-11-10 01:04:29,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:04:29,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:04:29,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:04:29,629 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-10 01:04:29,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:04:29,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451289403] [2024-11-10 01:04:29,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451289403] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:04:29,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:04:29,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-10 01:04:29,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218529144] [2024-11-10 01:04:29,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:04:29,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 01:04:29,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:04:29,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 01:04:29,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-10 01:04:29,635 INFO L87 Difference]: Start difference. First operand 36637 states and 54555 transitions. Second operand has 10 states, 10 states have (on average 12.1) internal successors, (121), 10 states have internal predecessors, (121), 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 01:04:35,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:04:35,082 INFO L93 Difference]: Finished difference Result 307896 states and 441901 transitions. [2024-11-10 01:04:35,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-10 01:04:35,083 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 12.1) internal successors, (121), 10 states have internal predecessors, (121), 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 123 [2024-11-10 01:04:35,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:04:35,663 INFO L225 Difference]: With dead ends: 307896 [2024-11-10 01:04:35,664 INFO L226 Difference]: Without dead ends: 283829 [2024-11-10 01:04:35,740 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2024-11-10 01:04:35,741 INFO L432 NwaCegarLoop]: 2392 mSDtfsCounter, 16522 mSDsluCounter, 4413 mSDsCounter, 0 mSdLazyCounter, 292 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16522 SdHoareTripleChecker+Valid, 6805 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 01:04:35,741 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16522 Valid, 6805 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 292 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 01:04:35,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283829 states. [2024-11-10 01:04:39,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283829 to 65949. [2024-11-10 01:04:39,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65949 states, 65947 states have (on average 1.4561238570367112) internal successors, (96027), 65948 states have internal predecessors, (96027), 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 01:04:39,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65949 states to 65949 states and 96027 transitions. [2024-11-10 01:04:39,467 INFO L78 Accepts]: Start accepts. Automaton has 65949 states and 96027 transitions. Word has length 123 [2024-11-10 01:04:39,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:04:39,471 INFO L471 AbstractCegarLoop]: Abstraction has 65949 states and 96027 transitions. [2024-11-10 01:04:39,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.1) internal successors, (121), 10 states have internal predecessors, (121), 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 01:04:39,471 INFO L276 IsEmpty]: Start isEmpty. Operand 65949 states and 96027 transitions. [2024-11-10 01:04:39,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-10 01:04:39,495 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:04:39,495 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:04:39,495 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-10 01:04:39,496 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:04:39,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:04:39,496 INFO L85 PathProgramCache]: Analyzing trace with hash -952090845, now seen corresponding path program 1 times [2024-11-10 01:04:39,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:04:39,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288751828] [2024-11-10 01:04:39,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:04:39,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:04:39,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:04:40,144 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-10 01:04:40,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:04:40,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288751828] [2024-11-10 01:04:40,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288751828] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:04:40,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:04:40,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-10 01:04:40,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827510550] [2024-11-10 01:04:40,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:04:40,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 01:04:40,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:04:40,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 01:04:40,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-10 01:04:40,145 INFO L87 Difference]: Start difference. First operand 65949 states and 96027 transitions. Second operand has 10 states, 10 states have (on average 11.9) internal successors, (119), 10 states have internal predecessors, (119), 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 01:04:46,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:04:46,077 INFO L93 Difference]: Finished difference Result 342200 states and 490669 transitions. [2024-11-10 01:04:46,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-10 01:04:46,078 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 11.9) internal successors, (119), 10 states have internal predecessors, (119), 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 123 [2024-11-10 01:04:46,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:04:46,618 INFO L225 Difference]: With dead ends: 342200 [2024-11-10 01:04:46,618 INFO L226 Difference]: Without dead ends: 307893 [2024-11-10 01:04:46,691 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2024-11-10 01:04:46,692 INFO L432 NwaCegarLoop]: 2393 mSDtfsCounter, 16524 mSDsluCounter, 4346 mSDsCounter, 0 mSdLazyCounter, 285 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16524 SdHoareTripleChecker+Valid, 6739 SdHoareTripleChecker+Invalid, 292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 01:04:46,694 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16524 Valid, 6739 Invalid, 292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 285 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 01:04:46,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307893 states. [2024-11-10 01:04:51,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307893 to 112285. [2024-11-10 01:04:51,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112285 states, 112283 states have (on average 1.438891016449507) internal successors, (161563), 112284 states have internal predecessors, (161563), 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 01:04:52,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112285 states to 112285 states and 161563 transitions. [2024-11-10 01:04:52,066 INFO L78 Accepts]: Start accepts. Automaton has 112285 states and 161563 transitions. Word has length 123 [2024-11-10 01:04:52,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:04:52,067 INFO L471 AbstractCegarLoop]: Abstraction has 112285 states and 161563 transitions. [2024-11-10 01:04:52,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.9) internal successors, (119), 10 states have internal predecessors, (119), 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 01:04:52,067 INFO L276 IsEmpty]: Start isEmpty. Operand 112285 states and 161563 transitions. [2024-11-10 01:04:52,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-10 01:04:52,080 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:04:52,081 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:04:52,081 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-10 01:04:52,081 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:04:52,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:04:52,081 INFO L85 PathProgramCache]: Analyzing trace with hash 156009059, now seen corresponding path program 1 times [2024-11-10 01:04:52,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:04:52,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961873121] [2024-11-10 01:04:52,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:04:52,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:04:52,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:04:52,437 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-10 01:04:52,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:04:52,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961873121] [2024-11-10 01:04:52,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961873121] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:04:52,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:04:52,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-10 01:04:52,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149364392] [2024-11-10 01:04:52,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:04:52,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 01:04:52,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:04:52,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 01:04:52,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-10 01:04:52,442 INFO L87 Difference]: Start difference. First operand 112285 states and 161563 transitions. Second operand has 10 states, 10 states have (on average 11.7) internal successors, (117), 10 states have internal predecessors, (117), 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 01:04:59,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:04:59,970 INFO L93 Difference]: Finished difference Result 376504 states and 539309 transitions. [2024-11-10 01:04:59,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-10 01:04:59,970 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 11.7) internal successors, (117), 10 states have internal predecessors, (117), 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 123 [2024-11-10 01:04:59,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:05:00,615 INFO L225 Difference]: With dead ends: 376504 [2024-11-10 01:05:00,616 INFO L226 Difference]: Without dead ends: 342197 [2024-11-10 01:05:00,715 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2024-11-10 01:05:00,715 INFO L432 NwaCegarLoop]: 2390 mSDtfsCounter, 16570 mSDsluCounter, 4219 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16570 SdHoareTripleChecker+Valid, 6609 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 01:05:00,716 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16570 Valid, 6609 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 01:05:00,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342197 states. [2024-11-10 01:05:07,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342197 to 146589. [2024-11-10 01:05:07,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146589 states, 146587 states have (on average 1.433981185234707) internal successors, (210203), 146588 states have internal predecessors, (210203), 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 01:05:07,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146589 states to 146589 states and 210203 transitions. [2024-11-10 01:05:07,583 INFO L78 Accepts]: Start accepts. Automaton has 146589 states and 210203 transitions. Word has length 123 [2024-11-10 01:05:07,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:05:07,584 INFO L471 AbstractCegarLoop]: Abstraction has 146589 states and 210203 transitions. [2024-11-10 01:05:07,584 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.7) internal successors, (117), 10 states have internal predecessors, (117), 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 01:05:07,584 INFO L276 IsEmpty]: Start isEmpty. Operand 146589 states and 210203 transitions. [2024-11-10 01:05:07,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-10 01:05:07,816 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:05:07,817 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:05:07,817 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-10 01:05:07,817 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:05:07,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:05:07,817 INFO L85 PathProgramCache]: Analyzing trace with hash -616531741, now seen corresponding path program 1 times [2024-11-10 01:05:07,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:05:07,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446279542] [2024-11-10 01:05:07,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:05:07,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:05:07,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:05:08,013 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-10 01:05:08,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:05:08,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446279542] [2024-11-10 01:05:08,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446279542] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:05:08,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:05:08,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-10 01:05:08,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472625865] [2024-11-10 01:05:08,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:05:08,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 01:05:08,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:05:08,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 01:05:08,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-10 01:05:08,016 INFO L87 Difference]: Start difference. First operand 146589 states and 210203 transitions. Second operand has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 states have internal predecessors, (113), 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)