./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pals_lcr.3.ufo.BOUNDED-6.pals+Problem12_label00.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/pals_lcr.3.ufo.BOUNDED-6.pals+Problem12_label00.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 6d20f8abdac11d3a14265079d0abbd72a3c88bf6607f5bf46f98ccd96bfda721 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 00:46:45,285 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 00:46:45,371 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 00:46:45,377 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 00:46:45,378 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 00:46:45,405 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 00:46:45,406 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 00:46:45,406 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 00:46:45,407 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 00:46:45,408 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 00:46:45,409 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 00:46:45,410 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 00:46:45,410 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 00:46:45,411 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 00:46:45,411 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 00:46:45,413 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 00:46:45,413 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 00:46:45,413 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 00:46:45,414 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 00:46:45,414 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 00:46:45,414 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 00:46:45,415 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 00:46:45,415 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 00:46:45,415 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 00:46:45,416 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 00:46:45,416 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 00:46:45,416 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 00:46:45,416 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 00:46:45,417 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 00:46:45,417 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 00:46:45,418 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 00:46:45,418 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 00:46:45,418 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 00:46:45,420 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 00:46:45,420 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 00:46:45,420 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 00:46:45,420 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 00:46:45,421 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 00:46:45,421 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 00:46:45,421 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 00:46:45,421 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 00:46:45,422 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 00:46:45,422 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 -> 6d20f8abdac11d3a14265079d0abbd72a3c88bf6607f5bf46f98ccd96bfda721 [2024-11-10 00:46:45,659 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 00:46:45,681 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 00:46:45,684 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 00:46:45,685 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 00:46:45,686 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 00:46:45,687 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pals_lcr.3.ufo.BOUNDED-6.pals+Problem12_label00.c [2024-11-10 00:46:47,130 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 00:46:47,550 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 00:46:47,552 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.3.ufo.BOUNDED-6.pals+Problem12_label00.c [2024-11-10 00:46:47,589 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f56a0b73a/916993484ce34db99cbe036a0ad124f2/FLAGc079a4fb9 [2024-11-10 00:46:47,698 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f56a0b73a/916993484ce34db99cbe036a0ad124f2 [2024-11-10 00:46:47,700 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 00:46:47,702 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 00:46:47,703 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 00:46:47,704 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 00:46:47,709 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 00:46:47,709 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:46:47" (1/1) ... [2024-11-10 00:46:47,710 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58607939 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:46:47, skipping insertion in model container [2024-11-10 00:46:47,711 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:46:47" (1/1) ... [2024-11-10 00:46:47,824 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 00:46:48,169 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.3.ufo.BOUNDED-6.pals+Problem12_label00.c[6354,6367] [2024-11-10 00:46:48,211 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.3.ufo.BOUNDED-6.pals+Problem12_label00.c[8229,8242] [2024-11-10 00:46:48,841 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 00:46:48,851 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 00:46:48,885 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.3.ufo.BOUNDED-6.pals+Problem12_label00.c[6354,6367] [2024-11-10 00:46:48,892 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.3.ufo.BOUNDED-6.pals+Problem12_label00.c[8229,8242] [2024-11-10 00:46:49,337 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 00:46:49,368 INFO L204 MainTranslator]: Completed translation [2024-11-10 00:46:49,368 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:46:49 WrapperNode [2024-11-10 00:46:49,368 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 00:46:49,369 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 00:46:49,369 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 00:46:49,370 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 00:46:49,376 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:46:49" (1/1) ... [2024-11-10 00:46:49,435 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:46:49" (1/1) ... [2024-11-10 00:46:49,695 INFO L138 Inliner]: procedures = 33, calls = 19, calls flagged for inlining = 14, calls inlined = 14, statements flattened = 4981 [2024-11-10 00:46:49,696 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 00:46:49,696 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 00:46:49,697 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 00:46:49,697 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 00:46:49,706 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:46:49" (1/1) ... [2024-11-10 00:46:49,707 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:46:49" (1/1) ... [2024-11-10 00:46:49,753 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:46:49" (1/1) ... [2024-11-10 00:46:49,974 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-10 00:46:49,978 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:46:49" (1/1) ... [2024-11-10 00:46:49,978 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:46:49" (1/1) ... [2024-11-10 00:46:50,187 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:46:49" (1/1) ... [2024-11-10 00:46:50,228 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:46:49" (1/1) ... [2024-11-10 00:46:50,260 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:46:49" (1/1) ... [2024-11-10 00:46:50,275 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:46:49" (1/1) ... [2024-11-10 00:46:50,323 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 00:46:50,325 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 00:46:50,326 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 00:46:50,326 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 00:46:50,327 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:46:49" (1/1) ... [2024-11-10 00:46:50,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 00:46:50,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 00:46:50,356 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 00:46:50,358 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 00:46:50,392 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 00:46:50,392 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 00:46:50,392 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 00:46:50,392 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 00:46:50,476 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 00:46:50,478 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 00:46:55,670 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1982: havoc calculate_output_#t~ret30#1; [2024-11-10 00:46:55,671 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L3461: havoc calculate_output2_#t~ret31#1; [2024-11-10 00:46:55,671 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L4951: havoc calculate_output3_#t~ret32#1; [2024-11-10 00:46:55,998 INFO L? ?]: Removed 2069 outVars from TransFormulas that were not future-live. [2024-11-10 00:46:55,999 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 00:46:56,036 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 00:46:56,037 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 00:46:56,037 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 12:46:56 BoogieIcfgContainer [2024-11-10 00:46:56,037 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 00:46:56,040 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 00:46:56,040 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 00:46:56,043 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 00:46:56,043 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 12:46:47" (1/3) ... [2024-11-10 00:46:56,044 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4dc390fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 12:46:56, skipping insertion in model container [2024-11-10 00:46:56,044 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:46:49" (2/3) ... [2024-11-10 00:46:56,044 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4dc390fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 12:46:56, skipping insertion in model container [2024-11-10 00:46:56,044 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 12:46:56" (3/3) ... [2024-11-10 00:46:56,046 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.3.ufo.BOUNDED-6.pals+Problem12_label00.c [2024-11-10 00:46:56,062 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 00:46:56,062 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-10 00:46:56,155 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 00:46:56,167 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;@240d4b41, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 00:46:56,167 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-10 00:46:56,179 INFO L276 IsEmpty]: Start isEmpty. Operand has 879 states, 876 states have (on average 2.675799086757991) internal successors, (2344), 878 states have internal predecessors, (2344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:46:56,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-10 00:46:56,187 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:46:56,188 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:46:56,188 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:46:56,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:46:56,193 INFO L85 PathProgramCache]: Analyzing trace with hash -2039591159, now seen corresponding path program 1 times [2024-11-10 00:46:56,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:46:56,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215315788] [2024-11-10 00:46:56,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:46:56,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:46:56,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:46:56,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:46:56,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:46:56,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215315788] [2024-11-10 00:46:56,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [215315788] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:46:56,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:46:56,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 00:46:56,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999437029] [2024-11-10 00:46:56,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:46:56,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:46:56,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:46:56,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:46:56,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:46:56,523 INFO L87 Difference]: Start difference. First operand has 879 states, 876 states have (on average 2.675799086757991) internal successors, (2344), 878 states have internal predecessors, (2344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 2 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:47:01,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:47:01,309 INFO L93 Difference]: Finished difference Result 2490 states and 6829 transitions. [2024-11-10 00:47:01,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:47:01,311 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 2 states have internal predecessors, (18), 0 states have call successors, (0), 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 18 [2024-11-10 00:47:01,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:47:01,338 INFO L225 Difference]: With dead ends: 2490 [2024-11-10 00:47:01,338 INFO L226 Difference]: Without dead ends: 1563 [2024-11-10 00:47:01,346 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:47:01,349 INFO L432 NwaCegarLoop]: 240 mSDtfsCounter, 1653 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 3797 mSolverCounterSat, 771 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1653 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 4568 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 771 IncrementalHoareTripleChecker+Valid, 3797 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2024-11-10 00:47:01,350 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1653 Valid, 253 Invalid, 4568 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [771 Valid, 3797 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2024-11-10 00:47:01,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1563 states. [2024-11-10 00:47:01,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1563 to 1563. [2024-11-10 00:47:01,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1563 states, 1561 states have (on average 2.709160794362588) internal successors, (4229), 1562 states have internal predecessors, (4229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:47:01,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1563 states to 1563 states and 4229 transitions. [2024-11-10 00:47:01,482 INFO L78 Accepts]: Start accepts. Automaton has 1563 states and 4229 transitions. Word has length 18 [2024-11-10 00:47:01,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:47:01,483 INFO L471 AbstractCegarLoop]: Abstraction has 1563 states and 4229 transitions. [2024-11-10 00:47:01,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 2 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:47:01,483 INFO L276 IsEmpty]: Start isEmpty. Operand 1563 states and 4229 transitions. [2024-11-10 00:47:01,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-10 00:47:01,485 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:47:01,485 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:47:01,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 00:47:01,486 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:47:01,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:47:01,487 INFO L85 PathProgramCache]: Analyzing trace with hash -1264971827, now seen corresponding path program 1 times [2024-11-10 00:47:01,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:47:01,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749758556] [2024-11-10 00:47:01,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:47:01,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:47:01,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:47:01,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:47:01,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:47:01,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749758556] [2024-11-10 00:47:01,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749758556] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:47:01,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:47:01,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 00:47:01,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470702056] [2024-11-10 00:47:01,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:47:01,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 00:47:01,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:47:01,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 00:47:01,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 00:47:01,650 INFO L87 Difference]: Start difference. First operand 1563 states and 4229 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:47:01,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:47:01,742 INFO L93 Difference]: Finished difference Result 1633 states and 4333 transitions. [2024-11-10 00:47:01,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 00:47:01,743 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2024-11-10 00:47:01,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:47:01,752 INFO L225 Difference]: With dead ends: 1633 [2024-11-10 00:47:01,752 INFO L226 Difference]: Without dead ends: 1596 [2024-11-10 00:47:01,754 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 00:47:01,755 INFO L432 NwaCegarLoop]: 2205 mSDtfsCounter, 49 mSDsluCounter, 6593 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 8798 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:47:01,756 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 8798 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:47:01,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1596 states. [2024-11-10 00:47:01,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1596 to 1563. [2024-11-10 00:47:01,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1563 states, 1561 states have (on average 2.698910954516336) internal successors, (4213), 1562 states have internal predecessors, (4213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:47:01,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1563 states to 1563 states and 4213 transitions. [2024-11-10 00:47:01,800 INFO L78 Accepts]: Start accepts. Automaton has 1563 states and 4213 transitions. Word has length 22 [2024-11-10 00:47:01,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:47:01,801 INFO L471 AbstractCegarLoop]: Abstraction has 1563 states and 4213 transitions. [2024-11-10 00:47:01,801 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:47:01,801 INFO L276 IsEmpty]: Start isEmpty. Operand 1563 states and 4213 transitions. [2024-11-10 00:47:01,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-10 00:47:01,803 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:47:01,804 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:47:01,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 00:47:01,804 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:47:01,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:47:01,805 INFO L85 PathProgramCache]: Analyzing trace with hash 606557701, now seen corresponding path program 1 times [2024-11-10 00:47:01,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:47:01,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617828111] [2024-11-10 00:47:01,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:47:01,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:47:01,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:47:01,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:47:01,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:47:01,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617828111] [2024-11-10 00:47:01,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [617828111] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:47:01,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:47:01,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 00:47:01,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999148306] [2024-11-10 00:47:01,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:47:01,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 00:47:01,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:47:01,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 00:47:01,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 00:47:01,965 INFO L87 Difference]: Start difference. First operand 1563 states and 4213 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:47:02,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:47:02,099 INFO L93 Difference]: Finished difference Result 1761 states and 4513 transitions. [2024-11-10 00:47:02,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 00:47:02,100 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2024-11-10 00:47:02,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:47:02,109 INFO L225 Difference]: With dead ends: 1761 [2024-11-10 00:47:02,110 INFO L226 Difference]: Without dead ends: 1728 [2024-11-10 00:47:02,110 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-10 00:47:02,111 INFO L432 NwaCegarLoop]: 2189 mSDtfsCounter, 6651 mSDsluCounter, 388 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6651 SdHoareTripleChecker+Valid, 2577 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 00:47:02,112 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6651 Valid, 2577 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 00:47:02,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1728 states. [2024-11-10 00:47:02,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1728 to 1593. [2024-11-10 00:47:02,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1593 states, 1591 states have (on average 2.6769327467001887) internal successors, (4259), 1592 states have internal predecessors, (4259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:47:02,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1593 states to 1593 states and 4259 transitions. [2024-11-10 00:47:02,191 INFO L78 Accepts]: Start accepts. Automaton has 1593 states and 4259 transitions. Word has length 37 [2024-11-10 00:47:02,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:47:02,192 INFO L471 AbstractCegarLoop]: Abstraction has 1593 states and 4259 transitions. [2024-11-10 00:47:02,192 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:47:02,192 INFO L276 IsEmpty]: Start isEmpty. Operand 1593 states and 4259 transitions. [2024-11-10 00:47:02,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-10 00:47:02,194 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:47:02,194 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:47:02,195 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 00:47:02,195 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:47:02,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:47:02,197 INFO L85 PathProgramCache]: Analyzing trace with hash 1075758951, now seen corresponding path program 1 times [2024-11-10 00:47:02,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:47:02,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503608053] [2024-11-10 00:47:02,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:47:02,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:47:02,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:47:02,481 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:47:02,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:47:02,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503608053] [2024-11-10 00:47:02,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1503608053] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:47:02,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:47:02,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 00:47:02,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535893612] [2024-11-10 00:47:02,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:47:02,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 00:47:02,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:47:02,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 00:47:02,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 00:47:02,483 INFO L87 Difference]: Start difference. First operand 1593 states and 4259 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:47:02,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:47:02,572 INFO L93 Difference]: Finished difference Result 1659 states and 4357 transitions. [2024-11-10 00:47:02,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 00:47:02,573 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2024-11-10 00:47:02,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:47:02,580 INFO L225 Difference]: With dead ends: 1659 [2024-11-10 00:47:02,580 INFO L226 Difference]: Without dead ends: 1596 [2024-11-10 00:47:02,581 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-10 00:47:02,582 INFO L432 NwaCegarLoop]: 2188 mSDtfsCounter, 4314 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4314 SdHoareTripleChecker+Valid, 2283 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:47:02,582 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4314 Valid, 2283 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:47:02,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1596 states. [2024-11-10 00:47:02,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1596 to 1593. [2024-11-10 00:47:02,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1593 states, 1591 states have (on average 2.676304211187932) internal successors, (4258), 1592 states have internal predecessors, (4258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:47:02,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1593 states to 1593 states and 4258 transitions. [2024-11-10 00:47:02,618 INFO L78 Accepts]: Start accepts. Automaton has 1593 states and 4258 transitions. Word has length 39 [2024-11-10 00:47:02,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:47:02,619 INFO L471 AbstractCegarLoop]: Abstraction has 1593 states and 4258 transitions. [2024-11-10 00:47:02,619 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:47:02,619 INFO L276 IsEmpty]: Start isEmpty. Operand 1593 states and 4258 transitions. [2024-11-10 00:47:02,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-10 00:47:02,621 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:47:02,621 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:47:02,621 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 00:47:02,621 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:47:02,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:47:02,622 INFO L85 PathProgramCache]: Analyzing trace with hash 712608318, now seen corresponding path program 1 times [2024-11-10 00:47:02,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:47:02,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756571663] [2024-11-10 00:47:02,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:47:02,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:47:02,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:47:02,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:47:02,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:47:02,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756571663] [2024-11-10 00:47:02,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756571663] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:47:02,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:47:02,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:47:02,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409798139] [2024-11-10 00:47:02,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:47:02,713 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:47:02,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:47:02,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:47:02,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:47:02,714 INFO L87 Difference]: Start difference. First operand 1593 states and 4258 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:47:02,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:47:02,752 INFO L93 Difference]: Finished difference Result 1707 states and 4428 transitions. [2024-11-10 00:47:02,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:47:02,753 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2024-11-10 00:47:02,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:47:02,761 INFO L225 Difference]: With dead ends: 1707 [2024-11-10 00:47:02,762 INFO L226 Difference]: Without dead ends: 1644 [2024-11-10 00:47:02,763 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:47:02,765 INFO L432 NwaCegarLoop]: 2199 mSDtfsCounter, 2150 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2150 SdHoareTripleChecker+Valid, 2244 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:47:02,765 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2150 Valid, 2244 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:47:02,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1644 states. [2024-11-10 00:47:02,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1644 to 1641. [2024-11-10 00:47:02,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1641 states, 1639 states have (on average 2.640634533251983) internal successors, (4328), 1640 states have internal predecessors, (4328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:47:02,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1641 states to 1641 states and 4328 transitions. [2024-11-10 00:47:02,802 INFO L78 Accepts]: Start accepts. Automaton has 1641 states and 4328 transitions. Word has length 40 [2024-11-10 00:47:02,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:47:02,803 INFO L471 AbstractCegarLoop]: Abstraction has 1641 states and 4328 transitions. [2024-11-10 00:47:02,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:47:02,804 INFO L276 IsEmpty]: Start isEmpty. Operand 1641 states and 4328 transitions. [2024-11-10 00:47:02,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-10 00:47:02,805 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:47:02,805 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:47:02,805 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 00:47:02,807 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:47:02,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:47:02,808 INFO L85 PathProgramCache]: Analyzing trace with hash 55525097, now seen corresponding path program 1 times [2024-11-10 00:47:02,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:47:02,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321640331] [2024-11-10 00:47:02,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:47:02,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:47:02,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:47:02,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:47:02,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:47:02,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321640331] [2024-11-10 00:47:02,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321640331] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:47:02,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:47:02,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:47:02,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56851243] [2024-11-10 00:47:02,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:47:02,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:47:02,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:47:02,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:47:02,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:47:02,866 INFO L87 Difference]: Start difference. First operand 1641 states and 4328 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:47:02,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:47:02,910 INFO L93 Difference]: Finished difference Result 1762 states and 4508 transitions. [2024-11-10 00:47:02,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:47:02,911 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2024-11-10 00:47:02,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:47:02,919 INFO L225 Difference]: With dead ends: 1762 [2024-11-10 00:47:02,920 INFO L226 Difference]: Without dead ends: 1699 [2024-11-10 00:47:02,921 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:47:02,922 INFO L432 NwaCegarLoop]: 2227 mSDtfsCounter, 2160 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2160 SdHoareTripleChecker+Valid, 2278 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:47:02,923 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2160 Valid, 2278 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:47:02,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1699 states. [2024-11-10 00:47:02,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1699 to 1696. [2024-11-10 00:47:02,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1696 states, 1694 states have (on average 2.602125147579693) internal successors, (4408), 1695 states have internal predecessors, (4408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:47:02,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1696 states to 1696 states and 4408 transitions. [2024-11-10 00:47:02,969 INFO L78 Accepts]: Start accepts. Automaton has 1696 states and 4408 transitions. Word has length 41 [2024-11-10 00:47:02,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:47:02,970 INFO L471 AbstractCegarLoop]: Abstraction has 1696 states and 4408 transitions. [2024-11-10 00:47:02,971 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:47:02,971 INFO L276 IsEmpty]: Start isEmpty. Operand 1696 states and 4408 transitions. [2024-11-10 00:47:02,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-10 00:47:02,972 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:47:02,972 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:47:02,973 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 00:47:02,973 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:47:02,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:47:02,974 INFO L85 PathProgramCache]: Analyzing trace with hash 41075241, now seen corresponding path program 1 times [2024-11-10 00:47:02,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:47:02,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118266813] [2024-11-10 00:47:02,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:47:02,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:47:02,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:47:03,026 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:47:03,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:47:03,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118266813] [2024-11-10 00:47:03,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118266813] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:47:03,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:47:03,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:47:03,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848214627] [2024-11-10 00:47:03,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:47:03,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:47:03,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:47:03,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:47:03,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:47:03,029 INFO L87 Difference]: Start difference. First operand 1696 states and 4408 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:47:03,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:47:03,064 INFO L93 Difference]: Finished difference Result 1998 states and 4850 transitions. [2024-11-10 00:47:03,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:47:03,065 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2024-11-10 00:47:03,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:47:03,073 INFO L225 Difference]: With dead ends: 1998 [2024-11-10 00:47:03,074 INFO L226 Difference]: Without dead ends: 1835 [2024-11-10 00:47:03,075 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:47:03,077 INFO L432 NwaCegarLoop]: 2229 mSDtfsCounter, 2158 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2158 SdHoareTripleChecker+Valid, 2284 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:47:03,078 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2158 Valid, 2284 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:47:03,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1835 states. [2024-11-10 00:47:03,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1835 to 1832. [2024-11-10 00:47:03,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1832 states, 1830 states have (on average 2.5136612021857925) internal successors, (4600), 1831 states have internal predecessors, (4600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:47:03,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1832 states to 1832 states and 4600 transitions. [2024-11-10 00:47:03,119 INFO L78 Accepts]: Start accepts. Automaton has 1832 states and 4600 transitions. Word has length 41 [2024-11-10 00:47:03,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:47:03,120 INFO L471 AbstractCegarLoop]: Abstraction has 1832 states and 4600 transitions. [2024-11-10 00:47:03,120 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:47:03,120 INFO L276 IsEmpty]: Start isEmpty. Operand 1832 states and 4600 transitions. [2024-11-10 00:47:03,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-10 00:47:03,121 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:47:03,122 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:47:03,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 00:47:03,122 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:47:03,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:47:03,123 INFO L85 PathProgramCache]: Analyzing trace with hash 2132677993, now seen corresponding path program 1 times [2024-11-10 00:47:03,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:47:03,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711474697] [2024-11-10 00:47:03,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:47:03,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:47:03,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:47:03,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:47:03,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:47:03,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711474697] [2024-11-10 00:47:03,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711474697] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:47:03,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:47:03,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:47:03,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365956063] [2024-11-10 00:47:03,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:47:03,179 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:47:03,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:47:03,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:47:03,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:47:03,180 INFO L87 Difference]: Start difference. First operand 1832 states and 4600 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:47:03,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:47:03,220 INFO L93 Difference]: Finished difference Result 2382 states and 5384 transitions. [2024-11-10 00:47:03,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:47:03,220 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2024-11-10 00:47:03,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:47:03,231 INFO L225 Difference]: With dead ends: 2382 [2024-11-10 00:47:03,231 INFO L226 Difference]: Without dead ends: 2083 [2024-11-10 00:47:03,232 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:47:03,233 INFO L432 NwaCegarLoop]: 2227 mSDtfsCounter, 2156 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2156 SdHoareTripleChecker+Valid, 2286 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:47:03,235 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2156 Valid, 2286 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:47:03,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2083 states. [2024-11-10 00:47:03,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2083 to 2080. [2024-11-10 00:47:03,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2080 states, 2078 states have (on average 2.3753609239653515) internal successors, (4936), 2079 states have internal predecessors, (4936), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:47:03,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2080 states to 2080 states and 4936 transitions. [2024-11-10 00:47:03,282 INFO L78 Accepts]: Start accepts. Automaton has 2080 states and 4936 transitions. Word has length 41 [2024-11-10 00:47:03,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:47:03,282 INFO L471 AbstractCegarLoop]: Abstraction has 2080 states and 4936 transitions. [2024-11-10 00:47:03,283 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:47:03,283 INFO L276 IsEmpty]: Start isEmpty. Operand 2080 states and 4936 transitions. [2024-11-10 00:47:03,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-10 00:47:03,283 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:47:03,283 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:47:03,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 00:47:03,284 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:47:03,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:47:03,284 INFO L85 PathProgramCache]: Analyzing trace with hash 1608400938, now seen corresponding path program 1 times [2024-11-10 00:47:03,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:47:03,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249696934] [2024-11-10 00:47:03,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:47:03,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:47:03,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:47:03,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:47:03,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:47:03,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249696934] [2024-11-10 00:47:03,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [249696934] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:47:03,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:47:03,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 00:47:03,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205865439] [2024-11-10 00:47:03,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:47:03,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 00:47:03,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:47:03,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 00:47:03,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-10 00:47:03,503 INFO L87 Difference]: Start difference. First operand 2080 states and 4936 transitions. Second operand has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:47:03,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:47:03,614 INFO L93 Difference]: Finished difference Result 2131 states and 5002 transitions. [2024-11-10 00:47:03,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 00:47:03,615 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2024-11-10 00:47:03,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:47:03,630 INFO L225 Difference]: With dead ends: 2131 [2024-11-10 00:47:03,630 INFO L226 Difference]: Without dead ends: 2128 [2024-11-10 00:47:03,631 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-10 00:47:03,632 INFO L432 NwaCegarLoop]: 2187 mSDtfsCounter, 0 mSDsluCounter, 13106 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 15293 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:47:03,632 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 15293 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:47:03,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2128 states. [2024-11-10 00:47:03,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2128 to 2128. [2024-11-10 00:47:03,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2128 states, 2126 states have (on average 2.3424270931326436) internal successors, (4980), 2127 states have internal predecessors, (4980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:47:03,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2128 states to 2128 states and 4980 transitions. [2024-11-10 00:47:03,685 INFO L78 Accepts]: Start accepts. Automaton has 2128 states and 4980 transitions. Word has length 41 [2024-11-10 00:47:03,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:47:03,685 INFO L471 AbstractCegarLoop]: Abstraction has 2128 states and 4980 transitions. [2024-11-10 00:47:03,685 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:47:03,685 INFO L276 IsEmpty]: Start isEmpty. Operand 2128 states and 4980 transitions. [2024-11-10 00:47:03,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-10 00:47:03,686 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:47:03,686 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:47:03,687 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-10 00:47:03,687 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:47:03,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:47:03,688 INFO L85 PathProgramCache]: Analyzing trace with hash 18026415, now seen corresponding path program 1 times [2024-11-10 00:47:03,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:47:03,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830107766] [2024-11-10 00:47:03,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:47:03,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:47:03,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:47:03,820 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-10 00:47:03,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:47:03,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830107766] [2024-11-10 00:47:03,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1830107766] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:47:03,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:47:03,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 00:47:03,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905969727] [2024-11-10 00:47:03,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:47:03,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 00:47:03,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:47:03,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 00:47:03,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 00:47:03,822 INFO L87 Difference]: Start difference. First operand 2128 states and 4980 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:47:03,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:47:03,979 INFO L93 Difference]: Finished difference Result 3896 states and 7392 transitions. [2024-11-10 00:47:03,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 00:47:03,980 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2024-11-10 00:47:03,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:47:03,993 INFO L225 Difference]: With dead ends: 3896 [2024-11-10 00:47:03,994 INFO L226 Difference]: Without dead ends: 3461 [2024-11-10 00:47:03,995 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-10 00:47:03,996 INFO L432 NwaCegarLoop]: 2235 mSDtfsCounter, 4410 mSDsluCounter, 2320 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4410 SdHoareTripleChecker+Valid, 4555 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:47:03,996 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4410 Valid, 4555 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:47:03,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3461 states. [2024-11-10 00:47:04,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3461 to 2644. [2024-11-10 00:47:04,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2644 states, 2642 states have (on average 2.148372445117335) internal successors, (5676), 2643 states have internal predecessors, (5676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:47:04,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2644 states to 2644 states and 5676 transitions. [2024-11-10 00:47:04,064 INFO L78 Accepts]: Start accepts. Automaton has 2644 states and 5676 transitions. Word has length 58 [2024-11-10 00:47:04,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:47:04,064 INFO L471 AbstractCegarLoop]: Abstraction has 2644 states and 5676 transitions. [2024-11-10 00:47:04,065 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:47:04,065 INFO L276 IsEmpty]: Start isEmpty. Operand 2644 states and 5676 transitions. [2024-11-10 00:47:04,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-10 00:47:04,066 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:47:04,066 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:47:04,066 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-10 00:47:04,066 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:47:04,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:47:04,067 INFO L85 PathProgramCache]: Analyzing trace with hash 3576559, now seen corresponding path program 1 times [2024-11-10 00:47:04,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:47:04,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057334259] [2024-11-10 00:47:04,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:47:04,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:47:04,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:47:04,173 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-10 00:47:04,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:47:04,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057334259] [2024-11-10 00:47:04,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2057334259] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:47:04,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:47:04,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 00:47:04,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586309548] [2024-11-10 00:47:04,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:47:04,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 00:47:04,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:47:04,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 00:47:04,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 00:47:04,176 INFO L87 Difference]: Start difference. First operand 2644 states and 5676 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:47:04,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:47:04,301 INFO L93 Difference]: Finished difference Result 4488 states and 8196 transitions. [2024-11-10 00:47:04,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 00:47:04,302 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2024-11-10 00:47:04,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:47:04,311 INFO L225 Difference]: With dead ends: 4488 [2024-11-10 00:47:04,311 INFO L226 Difference]: Without dead ends: 3893 [2024-11-10 00:47:04,313 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-10 00:47:04,314 INFO L432 NwaCegarLoop]: 2236 mSDtfsCounter, 4412 mSDsluCounter, 2303 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4412 SdHoareTripleChecker+Valid, 4539 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:47:04,314 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4412 Valid, 4539 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:47:04,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3893 states. [2024-11-10 00:47:04,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3893 to 3452. [2024-11-10 00:47:04,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3452 states, 3450 states have (on average 1.9605797101449276) internal successors, (6764), 3451 states have internal predecessors, (6764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:47:04,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3452 states to 3452 states and 6764 transitions. [2024-11-10 00:47:04,409 INFO L78 Accepts]: Start accepts. Automaton has 3452 states and 6764 transitions. Word has length 58 [2024-11-10 00:47:04,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:47:04,409 INFO L471 AbstractCegarLoop]: Abstraction has 3452 states and 6764 transitions. [2024-11-10 00:47:04,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:47:04,410 INFO L276 IsEmpty]: Start isEmpty. Operand 3452 states and 6764 transitions. [2024-11-10 00:47:04,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-10 00:47:04,411 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:47:04,411 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:47:04,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-10 00:47:04,411 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:47:04,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:47:04,412 INFO L85 PathProgramCache]: Analyzing trace with hash 2095179311, now seen corresponding path program 1 times [2024-11-10 00:47:04,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:47:04,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240986577] [2024-11-10 00:47:04,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:47:04,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:47:04,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:47:04,506 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-10 00:47:04,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:47:04,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240986577] [2024-11-10 00:47:04,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240986577] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:47:04,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:47:04,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 00:47:04,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335452098] [2024-11-10 00:47:04,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:47:04,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 00:47:04,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:47:04,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 00:47:04,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 00:47:04,508 INFO L87 Difference]: Start difference. First operand 3452 states and 6764 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:47:04,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:47:04,638 INFO L93 Difference]: Finished difference Result 5080 states and 8996 transitions. [2024-11-10 00:47:04,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 00:47:04,639 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2024-11-10 00:47:04,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:47:04,650 INFO L225 Difference]: With dead ends: 5080 [2024-11-10 00:47:04,650 INFO L226 Difference]: Without dead ends: 4485 [2024-11-10 00:47:04,653 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-10 00:47:04,653 INFO L432 NwaCegarLoop]: 2237 mSDtfsCounter, 4419 mSDsluCounter, 2309 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4419 SdHoareTripleChecker+Valid, 4546 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:47:04,654 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4419 Valid, 4546 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:47:04,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4485 states. [2024-11-10 00:47:04,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4485 to 4044. [2024-11-10 00:47:04,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4044 states, 4042 states have (on average 1.8713508164275112) internal successors, (7564), 4043 states have internal predecessors, (7564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:47:04,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4044 states to 4044 states and 7564 transitions. [2024-11-10 00:47:04,767 INFO L78 Accepts]: Start accepts. Automaton has 4044 states and 7564 transitions. Word has length 58 [2024-11-10 00:47:04,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:47:04,768 INFO L471 AbstractCegarLoop]: Abstraction has 4044 states and 7564 transitions. [2024-11-10 00:47:04,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:47:04,769 INFO L276 IsEmpty]: Start isEmpty. Operand 4044 states and 7564 transitions. [2024-11-10 00:47:04,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-10 00:47:04,770 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:47:04,770 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:47:04,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-10 00:47:04,770 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:47:04,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:47:04,771 INFO L85 PathProgramCache]: Analyzing trace with hash -1862091119, now seen corresponding path program 1 times [2024-11-10 00:47:04,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:47:04,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329588129] [2024-11-10 00:47:04,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:47:04,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:47:04,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:47:04,861 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:47:04,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:47:04,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329588129] [2024-11-10 00:47:04,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1329588129] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:47:04,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:47:04,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:47:04,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51662177] [2024-11-10 00:47:04,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:47:04,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:47:04,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:47:04,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:47:04,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:47:04,864 INFO L87 Difference]: Start difference. First operand 4044 states and 7564 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:47:04,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:47:04,945 INFO L93 Difference]: Finished difference Result 6558 states and 10964 transitions. [2024-11-10 00:47:04,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:47:04,946 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2024-11-10 00:47:04,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:47:04,955 INFO L225 Difference]: With dead ends: 6558 [2024-11-10 00:47:04,955 INFO L226 Difference]: Without dead ends: 4047 [2024-11-10 00:47:04,959 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:47:04,959 INFO L432 NwaCegarLoop]: 2213 mSDtfsCounter, 28 mSDsluCounter, 2181 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 4394 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:47:04,960 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 4394 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:47:04,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4047 states. [2024-11-10 00:47:05,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4047 to 4044. [2024-11-10 00:47:05,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4044 states, 4042 states have (on average 1.858980702622464) internal successors, (7514), 4043 states have internal predecessors, (7514), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:47:05,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4044 states to 4044 states and 7514 transitions. [2024-11-10 00:47:05,051 INFO L78 Accepts]: Start accepts. Automaton has 4044 states and 7514 transitions. Word has length 60 [2024-11-10 00:47:05,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:47:05,051 INFO L471 AbstractCegarLoop]: Abstraction has 4044 states and 7514 transitions. [2024-11-10 00:47:05,052 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:47:05,052 INFO L276 IsEmpty]: Start isEmpty. Operand 4044 states and 7514 transitions. [2024-11-10 00:47:05,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-10 00:47:05,053 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:47:05,053 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:47:05,053 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-10 00:47:05,053 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:47:05,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:47:05,053 INFO L85 PathProgramCache]: Analyzing trace with hash 1431466449, now seen corresponding path program 1 times [2024-11-10 00:47:05,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:47:05,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609703103] [2024-11-10 00:47:05,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:47:05,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:47:05,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:47:05,127 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:47:05,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:47:05,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609703103] [2024-11-10 00:47:05,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [609703103] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:47:05,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:47:05,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:47:05,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197128185] [2024-11-10 00:47:05,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:47:05,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:47:05,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:47:05,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:47:05,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:47:05,131 INFO L87 Difference]: Start difference. First operand 4044 states and 7514 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:47:05,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:47:05,178 INFO L93 Difference]: Finished difference Result 5039 states and 8850 transitions. [2024-11-10 00:47:05,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:47:05,178 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2024-11-10 00:47:05,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:47:05,184 INFO L225 Difference]: With dead ends: 5039 [2024-11-10 00:47:05,185 INFO L226 Difference]: Without dead ends: 2528 [2024-11-10 00:47:05,188 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:47:05,189 INFO L432 NwaCegarLoop]: 2211 mSDtfsCounter, 24 mSDsluCounter, 2180 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 4391 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:47:05,189 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 4391 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:47:05,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2528 states. [2024-11-10 00:47:05,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2528 to 2518. [2024-11-10 00:47:05,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2518 states, 2516 states have (on average 2.175675675675676) internal successors, (5474), 2517 states have internal predecessors, (5474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:47:05,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2518 states to 2518 states and 5474 transitions. [2024-11-10 00:47:05,305 INFO L78 Accepts]: Start accepts. Automaton has 2518 states and 5474 transitions. Word has length 60 [2024-11-10 00:47:05,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:47:05,306 INFO L471 AbstractCegarLoop]: Abstraction has 2518 states and 5474 transitions. [2024-11-10 00:47:05,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:47:05,306 INFO L276 IsEmpty]: Start isEmpty. Operand 2518 states and 5474 transitions. [2024-11-10 00:47:05,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-10 00:47:05,307 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:47:05,307 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:47:05,307 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-10 00:47:05,308 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:47:05,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:47:05,308 INFO L85 PathProgramCache]: Analyzing trace with hash -1439328557, now seen corresponding path program 1 times [2024-11-10 00:47:05,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:47:05,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894069561] [2024-11-10 00:47:05,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:47:05,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:47:05,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:47:05,389 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:47:05,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:47:05,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894069561] [2024-11-10 00:47:05,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1894069561] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:47:05,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:47:05,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:47:05,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610565103] [2024-11-10 00:47:05,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:47:05,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:47:05,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:47:05,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:47:05,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:47:05,391 INFO L87 Difference]: Start difference. First operand 2518 states and 5474 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:47:05,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:47:05,429 INFO L93 Difference]: Finished difference Result 3010 states and 6126 transitions. [2024-11-10 00:47:05,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:47:05,430 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2024-11-10 00:47:05,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:47:05,435 INFO L225 Difference]: With dead ends: 3010 [2024-11-10 00:47:05,436 INFO L226 Difference]: Without dead ends: 2035 [2024-11-10 00:47:05,439 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:47:05,439 INFO L432 NwaCegarLoop]: 2205 mSDtfsCounter, 22 mSDsluCounter, 2165 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 4370 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:47:05,440 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 4370 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:47:05,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2035 states. [2024-11-10 00:47:05,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2035 to 2032. [2024-11-10 00:47:05,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2032 states, 2030 states have (on average 2.372906403940887) internal successors, (4817), 2031 states have internal predecessors, (4817), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:47:05,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2032 states to 2032 states and 4817 transitions. [2024-11-10 00:47:05,483 INFO L78 Accepts]: Start accepts. Automaton has 2032 states and 4817 transitions. Word has length 62 [2024-11-10 00:47:05,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:47:05,483 INFO L471 AbstractCegarLoop]: Abstraction has 2032 states and 4817 transitions. [2024-11-10 00:47:05,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:47:05,484 INFO L276 IsEmpty]: Start isEmpty. Operand 2032 states and 4817 transitions. [2024-11-10 00:47:05,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-10 00:47:05,487 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:47:05,487 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:47:05,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-10 00:47:05,487 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:47:05,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:47:05,488 INFO L85 PathProgramCache]: Analyzing trace with hash 111390330, now seen corresponding path program 1 times [2024-11-10 00:47:05,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:47:05,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358880492] [2024-11-10 00:47:05,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:47:05,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:47:05,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:47:05,906 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:47:05,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:47:05,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358880492] [2024-11-10 00:47:05,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1358880492] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 00:47:05,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2022703106] [2024-11-10 00:47:05,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:47:05,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 00:47:05,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 00:47:05,911 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 00:47:05,912 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-10 00:47:06,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:47:06,079 INFO L255 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-10 00:47:06,086 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 00:47:09,257 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:47:09,257 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 00:47:11,749 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:47:11,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2022703106] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 00:47:11,750 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 00:47:11,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 18, 17] total 41 [2024-11-10 00:47:11,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3985397] [2024-11-10 00:47:11,750 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 00:47:11,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2024-11-10 00:47:11,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:47:11,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2024-11-10 00:47:11,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=1456, Unknown=0, NotChecked=0, Total=1640 [2024-11-10 00:47:11,752 INFO L87 Difference]: Start difference. First operand 2032 states and 4817 transitions. Second operand has 41 states, 41 states have (on average 4.146341463414634) internal successors, (170), 41 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:47:24,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:47:24,028 INFO L93 Difference]: Finished difference Result 7575 states and 12081 transitions. [2024-11-10 00:47:24,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2024-11-10 00:47:24,028 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 4.146341463414634) internal successors, (170), 41 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2024-11-10 00:47:24,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:47:24,042 INFO L225 Difference]: With dead ends: 7575 [2024-11-10 00:47:24,042 INFO L226 Difference]: Without dead ends: 7086 [2024-11-10 00:47:24,050 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8093 ImplicationChecksByTransitivity, 12.5s TimeCoverageRelationStatistics Valid=4042, Invalid=19520, Unknown=0, NotChecked=0, Total=23562 [2024-11-10 00:47:24,051 INFO L432 NwaCegarLoop]: 2182 mSDtfsCounter, 30653 mSDsluCounter, 28847 mSDsCounter, 0 mSdLazyCounter, 1214 mSolverCounterSat, 158 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30653 SdHoareTripleChecker+Valid, 31029 SdHoareTripleChecker+Invalid, 1372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 158 IncrementalHoareTripleChecker+Valid, 1214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-10 00:47:24,051 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30653 Valid, 31029 Invalid, 1372 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [158 Valid, 1214 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-10 00:47:24,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7086 states. [2024-11-10 00:47:24,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7086 to 4860. [2024-11-10 00:47:24,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4860 states, 4858 states have (on average 1.7414573898723755) internal successors, (8460), 4859 states have internal predecessors, (8460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:47:24,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4860 states to 4860 states and 8460 transitions. [2024-11-10 00:47:24,209 INFO L78 Accepts]: Start accepts. Automaton has 4860 states and 8460 transitions. Word has length 64 [2024-11-10 00:47:24,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:47:24,209 INFO L471 AbstractCegarLoop]: Abstraction has 4860 states and 8460 transitions. [2024-11-10 00:47:24,209 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 4.146341463414634) internal successors, (170), 41 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:47:24,210 INFO L276 IsEmpty]: Start isEmpty. Operand 4860 states and 8460 transitions. [2024-11-10 00:47:24,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-10 00:47:24,211 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:47:24,211 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:47:24,229 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-10 00:47:24,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-10 00:47:24,412 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:47:24,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:47:24,413 INFO L85 PathProgramCache]: Analyzing trace with hash 1426733626, now seen corresponding path program 1 times [2024-11-10 00:47:24,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:47:24,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456717033] [2024-11-10 00:47:24,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:47:24,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:47:24,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:47:24,810 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:47:24,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:47:24,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456717033] [2024-11-10 00:47:24,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456717033] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 00:47:24,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [41639174] [2024-11-10 00:47:24,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:47:24,811 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 00:47:24,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 00:47:24,813 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 00:47:24,814 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-10 00:47:24,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:47:24,947 INFO L255 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-10 00:47:24,949 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 00:47:25,210 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:47:25,210 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 00:47:25,803 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:47:25,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [41639174] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 00:47:25,804 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 00:47:25,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 20 [2024-11-10 00:47:25,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875393657] [2024-11-10 00:47:25,804 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 00:47:25,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-10 00:47:25,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:47:25,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-10 00:47:25,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=337, Unknown=0, NotChecked=0, Total=420 [2024-11-10 00:47:25,806 INFO L87 Difference]: Start difference. First operand 4860 states and 8460 transitions. Second operand has 21 states, 21 states have (on average 6.142857142857143) internal successors, (129), 20 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:47:26,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:47:26,302 INFO L93 Difference]: Finished difference Result 9209 states and 14071 transitions. [2024-11-10 00:47:26,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-10 00:47:26,303 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 6.142857142857143) internal successors, (129), 20 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2024-11-10 00:47:26,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:47:26,315 INFO L225 Difference]: With dead ends: 9209 [2024-11-10 00:47:26,316 INFO L226 Difference]: Without dead ends: 5892 [2024-11-10 00:47:26,322 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=220, Invalid=650, Unknown=0, NotChecked=0, Total=870 [2024-11-10 00:47:26,323 INFO L432 NwaCegarLoop]: 2178 mSDtfsCounter, 15322 mSDsluCounter, 6759 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15322 SdHoareTripleChecker+Valid, 8937 SdHoareTripleChecker+Invalid, 319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 00:47:26,323 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15322 Valid, 8937 Invalid, 319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 00:47:26,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5892 states. [2024-11-10 00:47:26,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5892 to 5886. [2024-11-10 00:47:26,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5886 states, 5884 states have (on average 1.656526172671652) internal successors, (9747), 5885 states have internal predecessors, (9747), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:47:26,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5886 states to 5886 states and 9747 transitions. [2024-11-10 00:47:26,503 INFO L78 Accepts]: Start accepts. Automaton has 5886 states and 9747 transitions. Word has length 64 [2024-11-10 00:47:26,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:47:26,503 INFO L471 AbstractCegarLoop]: Abstraction has 5886 states and 9747 transitions. [2024-11-10 00:47:26,504 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 6.142857142857143) internal successors, (129), 20 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:47:26,504 INFO L276 IsEmpty]: Start isEmpty. Operand 5886 states and 9747 transitions. [2024-11-10 00:47:26,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-10 00:47:26,505 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:47:26,505 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:47:26,522 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-10 00:47:26,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-10 00:47:26,710 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:47:26,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:47:26,710 INFO L85 PathProgramCache]: Analyzing trace with hash 1924712451, now seen corresponding path program 1 times [2024-11-10 00:47:26,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:47:26,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436627688] [2024-11-10 00:47:26,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:47:26,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:47:26,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:47:27,288 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:47:27,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:47:27,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436627688] [2024-11-10 00:47:27,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436627688] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 00:47:27,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [955634069] [2024-11-10 00:47:27,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:47:27,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 00:47:27,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 00:47:27,290 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 00:47:27,291 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-10 00:47:27,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:47:27,413 INFO L255 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-10 00:47:27,415 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 00:47:27,945 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:47:27,946 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 00:47:28,562 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:47:28,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [955634069] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 00:47:28,563 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 00:47:28,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 13] total 35 [2024-11-10 00:47:28,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903323361] [2024-11-10 00:47:28,563 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 00:47:28,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-11-10 00:47:28,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:47:28,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-11-10 00:47:28,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=1075, Unknown=0, NotChecked=0, Total=1190 [2024-11-10 00:47:28,565 INFO L87 Difference]: Start difference. First operand 5886 states and 9747 transitions. Second operand has 35 states, 35 states have (on average 5.057142857142857) internal successors, (177), 35 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:47:32,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:47:32,531 INFO L93 Difference]: Finished difference Result 14290 states and 20617 transitions. [2024-11-10 00:47:32,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2024-11-10 00:47:32,532 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 5.057142857142857) internal successors, (177), 35 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2024-11-10 00:47:32,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:47:32,553 INFO L225 Difference]: With dead ends: 14290 [2024-11-10 00:47:32,553 INFO L226 Difference]: Without dead ends: 11375 [2024-11-10 00:47:32,561 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1738 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=1633, Invalid=5507, Unknown=0, NotChecked=0, Total=7140 [2024-11-10 00:47:32,562 INFO L432 NwaCegarLoop]: 2200 mSDtfsCounter, 22406 mSDsluCounter, 33097 mSDsCounter, 0 mSdLazyCounter, 1229 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22406 SdHoareTripleChecker+Valid, 35297 SdHoareTripleChecker+Invalid, 1298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 1229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-10 00:47:32,562 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22406 Valid, 35297 Invalid, 1298 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [69 Valid, 1229 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-10 00:47:32,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11375 states. [2024-11-10 00:47:32,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11375 to 5628. [2024-11-10 00:47:32,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5628 states, 5626 states have (on average 1.667614646285105) internal successors, (9382), 5627 states have internal predecessors, (9382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:47:32,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5628 states to 5628 states and 9382 transitions. [2024-11-10 00:47:32,911 INFO L78 Accepts]: Start accepts. Automaton has 5628 states and 9382 transitions. Word has length 65 [2024-11-10 00:47:32,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:47:32,912 INFO L471 AbstractCegarLoop]: Abstraction has 5628 states and 9382 transitions. [2024-11-10 00:47:32,912 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 5.057142857142857) internal successors, (177), 35 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:47:32,912 INFO L276 IsEmpty]: Start isEmpty. Operand 5628 states and 9382 transitions. [2024-11-10 00:47:32,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-10 00:47:32,913 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:47:32,914 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:47:32,932 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-10 00:47:33,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-10 00:47:33,115 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:47:33,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:47:33,116 INFO L85 PathProgramCache]: Analyzing trace with hash 1274102374, now seen corresponding path program 1 times [2024-11-10 00:47:33,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:47:33,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790974413] [2024-11-10 00:47:33,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:47:33,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:47:33,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:47:33,246 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-10 00:47:33,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:47:33,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790974413] [2024-11-10 00:47:33,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1790974413] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 00:47:33,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1273369853] [2024-11-10 00:47:33,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:47:33,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 00:47:33,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 00:47:33,249 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 00:47:33,250 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-10 00:47:33,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:47:33,380 INFO L255 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-10 00:47:33,383 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 00:47:33,538 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:47:33,538 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 00:47:33,833 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:47:33,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1273369853] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 00:47:33,834 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 00:47:33,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7, 6] total 13 [2024-11-10 00:47:33,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266028679] [2024-11-10 00:47:33,834 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 00:47:33,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-10 00:47:33,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:47:33,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-10 00:47:33,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2024-11-10 00:47:33,836 INFO L87 Difference]: Start difference. First operand 5628 states and 9382 transitions. Second operand has 13 states, 13 states have (on average 13.846153846153847) internal successors, (180), 13 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:47:34,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:47:34,338 INFO L93 Difference]: Finished difference Result 15768 states and 22090 transitions. [2024-11-10 00:47:34,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-10 00:47:34,338 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 13.846153846153847) internal successors, (180), 13 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2024-11-10 00:47:34,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:47:34,357 INFO L225 Difference]: With dead ends: 15768 [2024-11-10 00:47:34,358 INFO L226 Difference]: Without dead ends: 11527 [2024-11-10 00:47:34,366 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=110, Unknown=0, NotChecked=0, Total=182 [2024-11-10 00:47:34,367 INFO L432 NwaCegarLoop]: 2244 mSDtfsCounter, 2270 mSDsluCounter, 9064 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2270 SdHoareTripleChecker+Valid, 11308 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 00:47:34,367 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2270 Valid, 11308 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 00:47:34,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11527 states. [2024-11-10 00:47:34,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11527 to 11159. [2024-11-10 00:47:34,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11159 states, 11157 states have (on average 1.4274446535807117) internal successors, (15926), 11158 states have internal predecessors, (15926), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:47:34,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11159 states to 11159 states and 15926 transitions. [2024-11-10 00:47:34,878 INFO L78 Accepts]: Start accepts. Automaton has 11159 states and 15926 transitions. Word has length 67 [2024-11-10 00:47:34,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:47:34,879 INFO L471 AbstractCegarLoop]: Abstraction has 11159 states and 15926 transitions. [2024-11-10 00:47:34,879 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 13.846153846153847) internal successors, (180), 13 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:47:34,879 INFO L276 IsEmpty]: Start isEmpty. Operand 11159 states and 15926 transitions. [2024-11-10 00:47:34,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-10 00:47:34,880 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:47:34,880 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:47:34,898 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-10 00:47:35,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 00:47:35,085 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:47:35,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:47:35,085 INFO L85 PathProgramCache]: Analyzing trace with hash 856172965, now seen corresponding path program 1 times [2024-11-10 00:47:35,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:47:35,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156354503] [2024-11-10 00:47:35,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:47:35,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:47:35,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:47:35,769 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:47:35,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:47:35,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156354503] [2024-11-10 00:47:35,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156354503] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 00:47:35,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [87316991] [2024-11-10 00:47:35,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:47:35,770 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 00:47:35,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 00:47:35,771 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 00:47:35,773 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-10 00:47:35,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:47:35,926 INFO L255 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-11-10 00:47:35,928 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 00:47:37,412 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:47:37,413 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 00:47:40,706 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:47:40,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [87316991] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 00:47:40,706 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 00:47:40,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 20, 21] total 51 [2024-11-10 00:47:40,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035150456] [2024-11-10 00:47:40,706 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 00:47:40,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2024-11-10 00:47:40,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:47:40,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2024-11-10 00:47:40,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=349, Invalid=2201, Unknown=0, NotChecked=0, Total=2550 [2024-11-10 00:47:40,709 INFO L87 Difference]: Start difference. First operand 11159 states and 15926 transitions. Second operand has 51 states, 51 states have (on average 3.3137254901960786) internal successors, (169), 51 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:47:49,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:47:49,232 INFO L93 Difference]: Finished difference Result 31985 states and 41431 transitions. [2024-11-10 00:47:49,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2024-11-10 00:47:49,233 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 51 states have (on average 3.3137254901960786) internal successors, (169), 51 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2024-11-10 00:47:49,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:47:49,265 INFO L225 Difference]: With dead ends: 31985 [2024-11-10 00:47:49,265 INFO L226 Difference]: Without dead ends: 22713 [2024-11-10 00:47:49,284 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4846 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=2955, Invalid=12051, Unknown=0, NotChecked=0, Total=15006 [2024-11-10 00:47:49,285 INFO L432 NwaCegarLoop]: 2205 mSDtfsCounter, 36939 mSDsluCounter, 22906 mSDsCounter, 0 mSdLazyCounter, 1691 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36939 SdHoareTripleChecker+Valid, 25111 SdHoareTripleChecker+Invalid, 1779 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 1691 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-10 00:47:49,285 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36939 Valid, 25111 Invalid, 1779 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [88 Valid, 1691 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-10 00:47:49,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22713 states. [2024-11-10 00:47:49,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22713 to 9113. [2024-11-10 00:47:49,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9113 states, 9111 states have (on average 1.4680057073866755) internal successors, (13375), 9112 states have internal predecessors, (13375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:47:49,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9113 states to 9113 states and 13375 transitions. [2024-11-10 00:47:49,897 INFO L78 Accepts]: Start accepts. Automaton has 9113 states and 13375 transitions. Word has length 67 [2024-11-10 00:47:49,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:47:49,897 INFO L471 AbstractCegarLoop]: Abstraction has 9113 states and 13375 transitions. [2024-11-10 00:47:49,897 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 51 states have (on average 3.3137254901960786) internal successors, (169), 51 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:47:49,897 INFO L276 IsEmpty]: Start isEmpty. Operand 9113 states and 13375 transitions. [2024-11-10 00:47:49,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-11-10 00:47:49,899 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:47:49,899 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-10 00:47:49,917 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-10 00:47:50,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 00:47:50,100 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:47:50,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:47:50,100 INFO L85 PathProgramCache]: Analyzing trace with hash -1060528056, now seen corresponding path program 1 times [2024-11-10 00:47:50,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:47:50,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55496250] [2024-11-10 00:47:50,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:47:50,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:47:50,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:47:50,234 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:47:50,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:47:50,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55496250] [2024-11-10 00:47:50,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55496250] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:47:50,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:47:50,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:47:50,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693571352] [2024-11-10 00:47:50,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:47:50,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 00:47:50,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:47:50,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 00:47:50,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 00:47:50,236 INFO L87 Difference]: Start difference. First operand 9113 states and 13375 transitions. Second operand has 4 states, 4 states have (on average 22.0) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:47:57,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:47:57,350 INFO L93 Difference]: Finished difference Result 12876 states and 23671 transitions. [2024-11-10 00:47:57,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 00:47:57,350 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 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 88 [2024-11-10 00:47:57,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:47:57,360 INFO L225 Difference]: With dead ends: 12876 [2024-11-10 00:47:57,361 INFO L226 Difference]: Without dead ends: 11369 [2024-11-10 00:47:57,363 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 00:47:57,364 INFO L432 NwaCegarLoop]: 767 mSDtfsCounter, 4361 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 7874 mSolverCounterSat, 1148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4361 SdHoareTripleChecker+Valid, 790 SdHoareTripleChecker+Invalid, 9022 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1148 IncrementalHoareTripleChecker+Valid, 7874 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.5s IncrementalHoareTripleChecker+Time [2024-11-10 00:47:57,364 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4361 Valid, 790 Invalid, 9022 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1148 Valid, 7874 Invalid, 0 Unknown, 0 Unchecked, 6.5s Time] [2024-11-10 00:47:57,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11369 states. [2024-11-10 00:47:57,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11369 to 11369. [2024-11-10 00:47:57,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11369 states, 11367 states have (on average 1.631653030702912) internal successors, (18547), 11368 states have internal predecessors, (18547), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:47:57,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11369 states to 11369 states and 18547 transitions. [2024-11-10 00:47:57,794 INFO L78 Accepts]: Start accepts. Automaton has 11369 states and 18547 transitions. Word has length 88 [2024-11-10 00:47:57,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:47:57,794 INFO L471 AbstractCegarLoop]: Abstraction has 11369 states and 18547 transitions. [2024-11-10 00:47:57,794 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:47:57,795 INFO L276 IsEmpty]: Start isEmpty. Operand 11369 states and 18547 transitions. [2024-11-10 00:47:57,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-10 00:47:57,795 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:47:57,796 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:47:57,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-10 00:47:57,796 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:47:57,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:47:57,796 INFO L85 PathProgramCache]: Analyzing trace with hash -1134425650, now seen corresponding path program 1 times [2024-11-10 00:47:57,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:47:57,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661650919] [2024-11-10 00:47:57,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:47:57,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:47:57,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:47:57,863 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:47:57,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:47:57,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661650919] [2024-11-10 00:47:57,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [661650919] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:47:57,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:47:57,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:47:57,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622511813] [2024-11-10 00:47:57,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:47:57,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:47:57,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:47:57,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:47:57,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:47:57,866 INFO L87 Difference]: Start difference. First operand 11369 states and 18547 transitions. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)