./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.ufo.BOUNDED-6.pals.c.v+nlh-reducer.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 561889d92df45f99e756a59f568aff549bcbf1af3442520c3f6faf4dbc996ed6 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 01:46:41,418 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 01:46:41,479 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 01:46:41,483 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 01:46:41,484 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 01:46:41,517 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 01:46:41,517 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 01:46:41,518 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 01:46:41,518 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 01:46:41,521 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 01:46:41,521 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 01:46:41,522 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 01:46:41,522 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 01:46:41,522 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 01:46:41,523 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 01:46:41,523 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 01:46:41,523 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 01:46:41,523 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 01:46:41,524 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 01:46:41,524 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 01:46:41,524 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 01:46:41,525 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 01:46:41,525 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 01:46:41,525 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 01:46:41,525 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 01:46:41,526 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 01:46:41,526 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 01:46:41,526 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 01:46:41,527 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 01:46:41,527 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 01:46:41,528 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 01:46:41,528 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 01:46:41,528 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 01:46:41,528 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 01:46:41,528 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 01:46:41,528 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 01:46:41,528 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 01:46:41,529 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 01:46:41,529 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 01:46:41,529 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 01:46:41,529 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 01:46:41,529 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 01:46:41,529 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 -> 561889d92df45f99e756a59f568aff549bcbf1af3442520c3f6faf4dbc996ed6 [2024-10-24 01:46:41,747 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 01:46:41,769 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 01:46:41,771 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 01:46:41,772 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 01:46:41,773 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 01:46:41,774 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2024-10-24 01:46:43,043 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 01:46:43,256 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 01:46:43,257 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2024-10-24 01:46:43,273 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c641d235b/baec9ff43712437dbc942a5fb753ab7f/FLAGc8c1fd477 [2024-10-24 01:46:43,285 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c641d235b/baec9ff43712437dbc942a5fb753ab7f [2024-10-24 01:46:43,287 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 01:46:43,289 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 01:46:43,292 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 01:46:43,292 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 01:46:43,297 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 01:46:43,298 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 01:46:43" (1/1) ... [2024-10-24 01:46:43,300 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f81c058 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:46:43, skipping insertion in model container [2024-10-24 01:46:43,300 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 01:46:43" (1/1) ... [2024-10-24 01:46:43,349 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 01:46:43,553 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c[7180,7193] [2024-10-24 01:46:43,573 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c[9491,9504] [2024-10-24 01:46:43,585 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 01:46:43,598 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 01:46:43,637 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c[7180,7193] [2024-10-24 01:46:43,647 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c[9491,9504] [2024-10-24 01:46:43,652 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 01:46:43,669 INFO L204 MainTranslator]: Completed translation [2024-10-24 01:46:43,671 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:46:43 WrapperNode [2024-10-24 01:46:43,671 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 01:46:43,672 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 01:46:43,672 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 01:46:43,672 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 01:46:43,679 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:46:43" (1/1) ... [2024-10-24 01:46:43,689 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:46:43" (1/1) ... [2024-10-24 01:46:43,717 INFO L138 Inliner]: procedures = 22, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 505 [2024-10-24 01:46:43,718 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 01:46:43,718 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 01:46:43,718 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 01:46:43,719 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 01:46:43,733 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:46:43" (1/1) ... [2024-10-24 01:46:43,733 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:46:43" (1/1) ... [2024-10-24 01:46:43,736 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:46:43" (1/1) ... [2024-10-24 01:46:43,758 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-24 01:46:43,758 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:46:43" (1/1) ... [2024-10-24 01:46:43,758 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:46:43" (1/1) ... [2024-10-24 01:46:43,767 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:46:43" (1/1) ... [2024-10-24 01:46:43,770 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:46:43" (1/1) ... [2024-10-24 01:46:43,776 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:46:43" (1/1) ... [2024-10-24 01:46:43,777 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:46:43" (1/1) ... [2024-10-24 01:46:43,781 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 01:46:43,786 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 01:46:43,787 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 01:46:43,787 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 01:46:43,788 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:46:43" (1/1) ... [2024-10-24 01:46:43,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 01:46:43,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 01:46:43,819 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-10-24 01:46:43,822 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-10-24 01:46:43,863 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 01:46:43,863 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 01:46:43,863 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 01:46:43,863 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 01:46:43,969 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 01:46:43,971 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 01:46:44,370 INFO L? ?]: Removed 73 outVars from TransFormulas that were not future-live. [2024-10-24 01:46:44,370 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 01:46:44,404 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 01:46:44,404 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-24 01:46:44,405 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 01:46:44 BoogieIcfgContainer [2024-10-24 01:46:44,405 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 01:46:44,406 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 01:46:44,407 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 01:46:44,410 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 01:46:44,410 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 01:46:43" (1/3) ... [2024-10-24 01:46:44,411 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47e370f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 01:46:44, skipping insertion in model container [2024-10-24 01:46:44,411 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:46:43" (2/3) ... [2024-10-24 01:46:44,411 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47e370f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 01:46:44, skipping insertion in model container [2024-10-24 01:46:44,411 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 01:46:44" (3/3) ... [2024-10-24 01:46:44,413 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.3.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2024-10-24 01:46:44,427 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 01:46:44,428 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-24 01:46:44,544 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 01:46:44,550 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;@322c7113, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 01:46:44,551 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-24 01:46:44,555 INFO L276 IsEmpty]: Start isEmpty. Operand has 104 states, 101 states have (on average 1.7722772277227723) internal successors, (179), 103 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:46:44,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-10-24 01:46:44,568 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:46:44,569 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:46:44,570 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:46:44,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:46:44,575 INFO L85 PathProgramCache]: Analyzing trace with hash -1236458848, now seen corresponding path program 1 times [2024-10-24 01:46:44,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:46:44,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668634410] [2024-10-24 01:46:44,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:46:44,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:46:44,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:46:44,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:46:44,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:46:44,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668634410] [2024-10-24 01:46:44,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668634410] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:46:44,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:46:44,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 01:46:44,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912626456] [2024-10-24 01:46:44,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:46:44,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 01:46:44,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:46:45,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 01:46:45,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 01:46:45,020 INFO L87 Difference]: Start difference. First operand has 104 states, 101 states have (on average 1.7722772277227723) internal successors, (179), 103 states have internal predecessors, (179), 0 states have call successors, (0), 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 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:46:45,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:46:45,247 INFO L93 Difference]: Finished difference Result 408 states and 655 transitions. [2024-10-24 01:46:45,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 01:46:45,252 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 0 states have call successors, (0), 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 47 [2024-10-24 01:46:45,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:46:45,262 INFO L225 Difference]: With dead ends: 408 [2024-10-24 01:46:45,262 INFO L226 Difference]: Without dead ends: 352 [2024-10-24 01:46:45,264 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-24 01:46:45,267 INFO L432 NwaCegarLoop]: 281 mSDtfsCounter, 591 mSDsluCounter, 461 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 591 SdHoareTripleChecker+Valid, 742 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 01:46:45,267 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [591 Valid, 742 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 01:46:45,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2024-10-24 01:46:45,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 154. [2024-10-24 01:46:45,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 152 states have (on average 1.4342105263157894) internal successors, (218), 153 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:46:45,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 218 transitions. [2024-10-24 01:46:45,310 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 218 transitions. Word has length 47 [2024-10-24 01:46:45,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:46:45,311 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 218 transitions. [2024-10-24 01:46:45,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:46:45,311 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 218 transitions. [2024-10-24 01:46:45,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-10-24 01:46:45,312 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:46:45,312 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:46:45,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 01:46:45,313 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:46:45,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:46:45,313 INFO L85 PathProgramCache]: Analyzing trace with hash 149827959, now seen corresponding path program 1 times [2024-10-24 01:46:45,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:46:45,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034431995] [2024-10-24 01:46:45,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:46:45,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:46:45,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:46:45,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:46:45,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:46:45,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034431995] [2024-10-24 01:46:45,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1034431995] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:46:45,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:46:45,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 01:46:45,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70410592] [2024-10-24 01:46:45,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:46:45,395 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 01:46:45,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:46:45,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 01:46:45,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 01:46:45,396 INFO L87 Difference]: Start difference. First operand 154 states and 218 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:46:45,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:46:45,431 INFO L93 Difference]: Finished difference Result 243 states and 351 transitions. [2024-10-24 01:46:45,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 01:46:45,431 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 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 48 [2024-10-24 01:46:45,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:46:45,432 INFO L225 Difference]: With dead ends: 243 [2024-10-24 01:46:45,433 INFO L226 Difference]: Without dead ends: 158 [2024-10-24 01:46:45,434 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-10-24 01:46:45,436 INFO L432 NwaCegarLoop]: 194 mSDtfsCounter, 73 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:46:45,436 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 299 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:46:45,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2024-10-24 01:46:45,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 156. [2024-10-24 01:46:45,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 154 states have (on average 1.422077922077922) internal successors, (219), 155 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:46:45,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 219 transitions. [2024-10-24 01:46:45,450 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 219 transitions. Word has length 48 [2024-10-24 01:46:45,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:46:45,450 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 219 transitions. [2024-10-24 01:46:45,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:46:45,451 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 219 transitions. [2024-10-24 01:46:45,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-10-24 01:46:45,453 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:46:45,456 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:46:45,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 01:46:45,457 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:46:45,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:46:45,457 INFO L85 PathProgramCache]: Analyzing trace with hash 967473249, now seen corresponding path program 1 times [2024-10-24 01:46:45,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:46:45,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339203188] [2024-10-24 01:46:45,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:46:45,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:46:45,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:46:45,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:46:45,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:46:45,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339203188] [2024-10-24 01:46:45,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1339203188] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:46:45,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:46:45,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 01:46:45,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791511062] [2024-10-24 01:46:45,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:46:45,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 01:46:45,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:46:45,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 01:46:45,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-24 01:46:45,654 INFO L87 Difference]: Start difference. First operand 156 states and 219 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:46:45,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:46:45,752 INFO L93 Difference]: Finished difference Result 469 states and 689 transitions. [2024-10-24 01:46:45,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 01:46:45,753 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 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 49 [2024-10-24 01:46:45,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:46:45,755 INFO L225 Difference]: With dead ends: 469 [2024-10-24 01:46:45,756 INFO L226 Difference]: Without dead ends: 387 [2024-10-24 01:46:45,757 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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-10-24 01:46:45,758 INFO L432 NwaCegarLoop]: 255 mSDtfsCounter, 292 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 292 SdHoareTripleChecker+Valid, 596 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 01:46:45,759 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [292 Valid, 596 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 01:46:45,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2024-10-24 01:46:45,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 247. [2024-10-24 01:46:45,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 245 states have (on average 1.4612244897959183) internal successors, (358), 246 states have internal predecessors, (358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:46:45,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 358 transitions. [2024-10-24 01:46:45,769 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 358 transitions. Word has length 49 [2024-10-24 01:46:45,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:46:45,769 INFO L471 AbstractCegarLoop]: Abstraction has 247 states and 358 transitions. [2024-10-24 01:46:45,769 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:46:45,770 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 358 transitions. [2024-10-24 01:46:45,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-10-24 01:46:45,770 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:46:45,771 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:46:45,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 01:46:45,771 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:46:45,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:46:45,772 INFO L85 PathProgramCache]: Analyzing trace with hash 1095295369, now seen corresponding path program 1 times [2024-10-24 01:46:45,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:46:45,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256983157] [2024-10-24 01:46:45,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:46:45,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:46:45,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:46:45,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:46:45,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:46:45,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256983157] [2024-10-24 01:46:45,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256983157] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:46:45,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:46:45,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 01:46:45,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150329680] [2024-10-24 01:46:45,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:46:45,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 01:46:45,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:46:45,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 01:46:45,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-24 01:46:45,910 INFO L87 Difference]: Start difference. First operand 247 states and 358 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:46:45,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:46:45,984 INFO L93 Difference]: Finished difference Result 555 states and 820 transitions. [2024-10-24 01:46:45,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 01:46:45,985 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 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 49 [2024-10-24 01:46:45,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:46:45,986 INFO L225 Difference]: With dead ends: 555 [2024-10-24 01:46:45,986 INFO L226 Difference]: Without dead ends: 473 [2024-10-24 01:46:45,989 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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-10-24 01:46:45,992 INFO L432 NwaCegarLoop]: 204 mSDtfsCounter, 356 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 356 SdHoareTripleChecker+Valid, 535 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 01:46:45,992 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [356 Valid, 535 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 01:46:45,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2024-10-24 01:46:46,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 375. [2024-10-24 01:46:46,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 375 states, 373 states have (on average 1.479892761394102) internal successors, (552), 374 states have internal predecessors, (552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:46:46,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 552 transitions. [2024-10-24 01:46:46,008 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 552 transitions. Word has length 49 [2024-10-24 01:46:46,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:46:46,008 INFO L471 AbstractCegarLoop]: Abstraction has 375 states and 552 transitions. [2024-10-24 01:46:46,008 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:46:46,008 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 552 transitions. [2024-10-24 01:46:46,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-10-24 01:46:46,009 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:46:46,009 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:46:46,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 01:46:46,010 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:46:46,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:46:46,010 INFO L85 PathProgramCache]: Analyzing trace with hash 1600326517, now seen corresponding path program 1 times [2024-10-24 01:46:46,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:46:46,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535501900] [2024-10-24 01:46:46,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:46:46,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:46:46,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:46:46,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:46:46,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:46:46,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535501900] [2024-10-24 01:46:46,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [535501900] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:46:46,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:46:46,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 01:46:46,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77189366] [2024-10-24 01:46:46,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:46:46,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 01:46:46,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:46:46,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 01:46:46,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-24 01:46:46,126 INFO L87 Difference]: Start difference. First operand 375 states and 552 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:46:46,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:46:46,214 INFO L93 Difference]: Finished difference Result 646 states and 959 transitions. [2024-10-24 01:46:46,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 01:46:46,215 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 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 49 [2024-10-24 01:46:46,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:46:46,217 INFO L225 Difference]: With dead ends: 646 [2024-10-24 01:46:46,219 INFO L226 Difference]: Without dead ends: 564 [2024-10-24 01:46:46,220 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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-10-24 01:46:46,221 INFO L432 NwaCegarLoop]: 222 mSDtfsCounter, 355 mSDsluCounter, 347 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 355 SdHoareTripleChecker+Valid, 569 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 01:46:46,222 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [355 Valid, 569 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 01:46:46,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2024-10-24 01:46:46,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 466. [2024-10-24 01:46:46,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 466 states, 464 states have (on average 1.4892241379310345) internal successors, (691), 465 states have internal predecessors, (691), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:46:46,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 691 transitions. [2024-10-24 01:46:46,235 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 691 transitions. Word has length 49 [2024-10-24 01:46:46,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:46:46,236 INFO L471 AbstractCegarLoop]: Abstraction has 466 states and 691 transitions. [2024-10-24 01:46:46,236 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:46:46,236 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 691 transitions. [2024-10-24 01:46:46,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-10-24 01:46:46,238 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:46:46,238 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:46:46,238 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-24 01:46:46,239 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:46:46,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:46:46,242 INFO L85 PathProgramCache]: Analyzing trace with hash -247753770, now seen corresponding path program 1 times [2024-10-24 01:46:46,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:46:46,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840786527] [2024-10-24 01:46:46,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:46:46,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:46:46,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:46:46,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:46:46,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:46:46,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840786527] [2024-10-24 01:46:46,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1840786527] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:46:46,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:46:46,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 01:46:46,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405080993] [2024-10-24 01:46:46,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:46:46,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 01:46:46,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:46:46,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 01:46:46,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 01:46:46,345 INFO L87 Difference]: Start difference. First operand 466 states and 691 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:46:46,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:46:46,435 INFO L93 Difference]: Finished difference Result 910 states and 1359 transitions. [2024-10-24 01:46:46,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 01:46:46,436 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 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 50 [2024-10-24 01:46:46,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:46:46,437 INFO L225 Difference]: With dead ends: 910 [2024-10-24 01:46:46,437 INFO L226 Difference]: Without dead ends: 466 [2024-10-24 01:46:46,438 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-24 01:46:46,438 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 380 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 380 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 01:46:46,439 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [380 Valid, 78 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 01:46:46,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2024-10-24 01:46:46,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 466. [2024-10-24 01:46:46,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 466 states, 464 states have (on average 1.4676724137931034) internal successors, (681), 465 states have internal predecessors, (681), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:46:46,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 681 transitions. [2024-10-24 01:46:46,454 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 681 transitions. Word has length 50 [2024-10-24 01:46:46,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:46:46,454 INFO L471 AbstractCegarLoop]: Abstraction has 466 states and 681 transitions. [2024-10-24 01:46:46,455 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:46:46,455 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 681 transitions. [2024-10-24 01:46:46,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-10-24 01:46:46,457 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:46:46,458 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:46:46,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-24 01:46:46,458 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:46:46,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:46:46,458 INFO L85 PathProgramCache]: Analyzing trace with hash -1364763558, now seen corresponding path program 1 times [2024-10-24 01:46:46,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:46:46,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010043433] [2024-10-24 01:46:46,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:46:46,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:46:46,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:46:46,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:46:46,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:46:46,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010043433] [2024-10-24 01:46:46,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2010043433] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:46:46,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:46:46,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 01:46:46,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276767256] [2024-10-24 01:46:46,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:46:46,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 01:46:46,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:46:46,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 01:46:46,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 01:46:46,561 INFO L87 Difference]: Start difference. First operand 466 states and 681 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:46:46,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:46:46,646 INFO L93 Difference]: Finished difference Result 902 states and 1330 transitions. [2024-10-24 01:46:46,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 01:46:46,647 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 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 51 [2024-10-24 01:46:46,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:46:46,649 INFO L225 Difference]: With dead ends: 902 [2024-10-24 01:46:46,649 INFO L226 Difference]: Without dead ends: 466 [2024-10-24 01:46:46,650 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-24 01:46:46,651 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 351 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 351 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 01:46:46,653 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [351 Valid, 94 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 01:46:46,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2024-10-24 01:46:46,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 466. [2024-10-24 01:46:46,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 466 states, 464 states have (on average 1.4461206896551724) internal successors, (671), 465 states have internal predecessors, (671), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:46:46,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 671 transitions. [2024-10-24 01:46:46,661 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 671 transitions. Word has length 51 [2024-10-24 01:46:46,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:46:46,662 INFO L471 AbstractCegarLoop]: Abstraction has 466 states and 671 transitions. [2024-10-24 01:46:46,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:46:46,662 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 671 transitions. [2024-10-24 01:46:46,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-10-24 01:46:46,663 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:46:46,663 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:46:46,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-24 01:46:46,663 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:46:46,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:46:46,663 INFO L85 PathProgramCache]: Analyzing trace with hash 114055254, now seen corresponding path program 1 times [2024-10-24 01:46:46,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:46:46,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780466445] [2024-10-24 01:46:46,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:46:46,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:46:46,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:46:46,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:46:46,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:46:46,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780466445] [2024-10-24 01:46:46,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780466445] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:46:46,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:46:46,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 01:46:46,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737101600] [2024-10-24 01:46:46,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:46:46,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 01:46:46,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:46:46,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 01:46:46,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 01:46:46,752 INFO L87 Difference]: Start difference. First operand 466 states and 671 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 4 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-10-24 01:46:46,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:46:46,832 INFO L93 Difference]: Finished difference Result 906 states and 1315 transitions. [2024-10-24 01:46:46,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 01:46:46,833 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 4 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 52 [2024-10-24 01:46:46,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:46:46,834 INFO L225 Difference]: With dead ends: 906 [2024-10-24 01:46:46,834 INFO L226 Difference]: Without dead ends: 466 [2024-10-24 01:46:46,835 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-24 01:46:46,835 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 356 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 356 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 01:46:46,836 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [356 Valid, 86 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 01:46:46,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2024-10-24 01:46:46,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 466. [2024-10-24 01:46:46,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 466 states, 464 states have (on average 1.4245689655172413) internal successors, (661), 465 states have internal predecessors, (661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:46:46,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 661 transitions. [2024-10-24 01:46:46,843 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 661 transitions. Word has length 52 [2024-10-24 01:46:46,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:46:46,843 INFO L471 AbstractCegarLoop]: Abstraction has 466 states and 661 transitions. [2024-10-24 01:46:46,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 4 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-10-24 01:46:46,843 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 661 transitions. [2024-10-24 01:46:46,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-10-24 01:46:46,844 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:46:46,844 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:46:46,844 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-24 01:46:46,844 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:46:46,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:46:46,844 INFO L85 PathProgramCache]: Analyzing trace with hash 456972262, now seen corresponding path program 1 times [2024-10-24 01:46:46,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:46:46,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624837930] [2024-10-24 01:46:46,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:46:46,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:46:46,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:46:47,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:46:47,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:46:47,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624837930] [2024-10-24 01:46:47,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624837930] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:46:47,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:46:47,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 01:46:47,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901873046] [2024-10-24 01:46:47,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:46:47,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 01:46:47,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:46:47,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 01:46:47,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-24 01:46:47,100 INFO L87 Difference]: Start difference. First operand 466 states and 661 transitions. Second operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 7 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:46:47,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:46:47,361 INFO L93 Difference]: Finished difference Result 1259 states and 1809 transitions. [2024-10-24 01:46:47,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 01:46:47,363 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 7 states have internal predecessors, (53), 0 states have call successors, (0), 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 53 [2024-10-24 01:46:47,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:46:47,365 INFO L225 Difference]: With dead ends: 1259 [2024-10-24 01:46:47,365 INFO L226 Difference]: Without dead ends: 855 [2024-10-24 01:46:47,366 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2024-10-24 01:46:47,369 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 502 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 269 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 502 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 01:46:47,369 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [502 Valid, 322 Invalid, 270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 269 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 01:46:47,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 855 states. [2024-10-24 01:46:47,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 855 to 466. [2024-10-24 01:46:47,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 466 states, 464 states have (on average 1.4224137931034482) internal successors, (660), 465 states have internal predecessors, (660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:46:47,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 660 transitions. [2024-10-24 01:46:47,380 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 660 transitions. Word has length 53 [2024-10-24 01:46:47,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:46:47,380 INFO L471 AbstractCegarLoop]: Abstraction has 466 states and 660 transitions. [2024-10-24 01:46:47,380 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 7 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:46:47,380 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 660 transitions. [2024-10-24 01:46:47,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-10-24 01:46:47,380 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:46:47,380 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:46:47,380 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-24 01:46:47,381 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:46:47,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:46:47,384 INFO L85 PathProgramCache]: Analyzing trace with hash -1399412910, now seen corresponding path program 1 times [2024-10-24 01:46:47,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:46:47,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035222399] [2024-10-24 01:46:47,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:46:47,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:46:47,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:46:47,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:46:47,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:46:47,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035222399] [2024-10-24 01:46:47,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2035222399] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:46:47,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:46:47,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-24 01:46:47,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577469756] [2024-10-24 01:46:47,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:46:47,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-24 01:46:47,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:46:47,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-24 01:46:47,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-24 01:46:47,603 INFO L87 Difference]: Start difference. First operand 466 states and 660 transitions. Second operand has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 8 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:46:47,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:46:47,908 INFO L93 Difference]: Finished difference Result 1287 states and 1842 transitions. [2024-10-24 01:46:47,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-24 01:46:47,908 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 8 states have internal predecessors, (53), 0 states have call successors, (0), 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 53 [2024-10-24 01:46:47,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:46:47,911 INFO L225 Difference]: With dead ends: 1287 [2024-10-24 01:46:47,911 INFO L226 Difference]: Without dead ends: 888 [2024-10-24 01:46:47,912 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=285, Unknown=0, NotChecked=0, Total=380 [2024-10-24 01:46:47,912 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 529 mSDsluCounter, 330 mSDsCounter, 0 mSdLazyCounter, 381 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 529 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 385 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 01:46:47,913 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [529 Valid, 408 Invalid, 385 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 381 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 01:46:47,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 888 states. [2024-10-24 01:46:47,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 888 to 466. [2024-10-24 01:46:47,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 466 states, 464 states have (on average 1.418103448275862) internal successors, (658), 465 states have internal predecessors, (658), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:46:47,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 658 transitions. [2024-10-24 01:46:47,923 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 658 transitions. Word has length 53 [2024-10-24 01:46:47,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:46:47,923 INFO L471 AbstractCegarLoop]: Abstraction has 466 states and 658 transitions. [2024-10-24 01:46:47,923 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 8 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:46:47,923 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 658 transitions. [2024-10-24 01:46:47,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-10-24 01:46:47,924 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:46:47,924 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:46:47,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-24 01:46:47,924 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:46:47,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:46:47,924 INFO L85 PathProgramCache]: Analyzing trace with hash 185646566, now seen corresponding path program 1 times [2024-10-24 01:46:47,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:46:47,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893991721] [2024-10-24 01:46:47,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:46:47,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:46:47,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:46:48,172 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:46:48,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:46:48,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893991721] [2024-10-24 01:46:48,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [893991721] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:46:48,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:46:48,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-24 01:46:48,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452279990] [2024-10-24 01:46:48,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:46:48,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-24 01:46:48,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:46:48,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-24 01:46:48,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-24 01:46:48,173 INFO L87 Difference]: Start difference. First operand 466 states and 658 transitions. Second operand has 9 states, 9 states have (on average 6.0) internal successors, (54), 8 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-10-24 01:46:48,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:46:48,490 INFO L93 Difference]: Finished difference Result 1272 states and 1816 transitions. [2024-10-24 01:46:48,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-24 01:46:48,494 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.0) internal successors, (54), 8 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 54 [2024-10-24 01:46:48,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:46:48,497 INFO L225 Difference]: With dead ends: 1272 [2024-10-24 01:46:48,497 INFO L226 Difference]: Without dead ends: 883 [2024-10-24 01:46:48,498 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=108, Invalid=312, Unknown=0, NotChecked=0, Total=420 [2024-10-24 01:46:48,499 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 512 mSDsluCounter, 327 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 512 SdHoareTripleChecker+Valid, 404 SdHoareTripleChecker+Invalid, 356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 01:46:48,499 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [512 Valid, 404 Invalid, 356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 352 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 01:46:48,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 883 states. [2024-10-24 01:46:48,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 883 to 466. [2024-10-24 01:46:48,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 466 states, 464 states have (on average 1.4094827586206897) internal successors, (654), 465 states have internal predecessors, (654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:46:48,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 654 transitions. [2024-10-24 01:46:48,509 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 654 transitions. Word has length 54 [2024-10-24 01:46:48,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:46:48,509 INFO L471 AbstractCegarLoop]: Abstraction has 466 states and 654 transitions. [2024-10-24 01:46:48,510 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.0) internal successors, (54), 8 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-10-24 01:46:48,510 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 654 transitions. [2024-10-24 01:46:48,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-10-24 01:46:48,510 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:46:48,510 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:46:48,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-24 01:46:48,510 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:46:48,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:46:48,511 INFO L85 PathProgramCache]: Analyzing trace with hash 568588166, now seen corresponding path program 1 times [2024-10-24 01:46:48,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:46:48,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640499122] [2024-10-24 01:46:48,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:46:48,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:46:48,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:46:49,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:46:49,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:46:49,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640499122] [2024-10-24 01:46:49,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [640499122] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:46:49,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:46:49,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-24 01:46:49,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106443007] [2024-10-24 01:46:49,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:46:49,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-24 01:46:49,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:46:49,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-24 01:46:49,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2024-10-24 01:46:49,062 INFO L87 Difference]: Start difference. First operand 466 states and 654 transitions. Second operand has 13 states, 13 states have (on average 4.230769230769231) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:46:49,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:46:49,645 INFO L93 Difference]: Finished difference Result 1024 states and 1463 transitions. [2024-10-24 01:46:49,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-24 01:46:49,646 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.230769230769231) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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 55 [2024-10-24 01:46:49,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:46:49,648 INFO L225 Difference]: With dead ends: 1024 [2024-10-24 01:46:49,648 INFO L226 Difference]: Without dead ends: 837 [2024-10-24 01:46:49,649 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=142, Invalid=458, Unknown=0, NotChecked=0, Total=600 [2024-10-24 01:46:49,649 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 714 mSDsluCounter, 660 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 714 SdHoareTripleChecker+Valid, 771 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 01:46:49,650 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [714 Valid, 771 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 01:46:49,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 837 states. [2024-10-24 01:46:49,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 837 to 450. [2024-10-24 01:46:49,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 450 states, 448 states have (on average 1.4084821428571428) internal successors, (631), 449 states have internal predecessors, (631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:46:49,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 631 transitions. [2024-10-24 01:46:49,664 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 631 transitions. Word has length 55 [2024-10-24 01:46:49,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:46:49,664 INFO L471 AbstractCegarLoop]: Abstraction has 450 states and 631 transitions. [2024-10-24 01:46:49,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.230769230769231) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:46:49,665 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 631 transitions. [2024-10-24 01:46:49,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-10-24 01:46:49,665 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:46:49,665 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:46:49,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-24 01:46:49,666 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:46:49,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:46:49,666 INFO L85 PathProgramCache]: Analyzing trace with hash 85104233, now seen corresponding path program 1 times [2024-10-24 01:46:49,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:46:49,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453560511] [2024-10-24 01:46:49,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:46:49,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:46:49,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:46:50,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:46:50,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:46:50,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453560511] [2024-10-24 01:46:50,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453560511] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:46:50,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:46:50,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2024-10-24 01:46:50,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597511252] [2024-10-24 01:46:50,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:46:50,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-10-24 01:46:50,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:46:50,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-10-24 01:46:50,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=369, Unknown=0, NotChecked=0, Total=420 [2024-10-24 01:46:50,467 INFO L87 Difference]: Start difference. First operand 450 states and 631 transitions. Second operand has 21 states, 21 states have (on average 2.619047619047619) internal successors, (55), 20 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:46:51,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:46:51,864 INFO L93 Difference]: Finished difference Result 1784 states and 2561 transitions. [2024-10-24 01:46:51,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-10-24 01:46:51,864 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.619047619047619) internal successors, (55), 20 states have internal predecessors, (55), 0 states have call successors, (0), 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 55 [2024-10-24 01:46:51,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:46:51,868 INFO L225 Difference]: With dead ends: 1784 [2024-10-24 01:46:51,869 INFO L226 Difference]: Without dead ends: 1607 [2024-10-24 01:46:51,870 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=237, Invalid=1023, Unknown=0, NotChecked=0, Total=1260 [2024-10-24 01:46:51,870 INFO L432 NwaCegarLoop]: 228 mSDtfsCounter, 833 mSDsluCounter, 2386 mSDsCounter, 0 mSdLazyCounter, 1377 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 833 SdHoareTripleChecker+Valid, 2614 SdHoareTripleChecker+Invalid, 1378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1377 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-24 01:46:51,870 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [833 Valid, 2614 Invalid, 1378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1377 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-24 01:46:51,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1607 states. [2024-10-24 01:46:51,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1607 to 455. [2024-10-24 01:46:51,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 455 states, 453 states have (on average 1.403973509933775) internal successors, (636), 454 states have internal predecessors, (636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:46:51,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 636 transitions. [2024-10-24 01:46:51,884 INFO L78 Accepts]: Start accepts. Automaton has 455 states and 636 transitions. Word has length 55 [2024-10-24 01:46:51,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:46:51,884 INFO L471 AbstractCegarLoop]: Abstraction has 455 states and 636 transitions. [2024-10-24 01:46:51,884 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.619047619047619) internal successors, (55), 20 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:46:51,885 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 636 transitions. [2024-10-24 01:46:51,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-10-24 01:46:51,885 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:46:51,885 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:46:51,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-24 01:46:51,885 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:46:51,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:46:51,885 INFO L85 PathProgramCache]: Analyzing trace with hash 1555801447, now seen corresponding path program 1 times [2024-10-24 01:46:51,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:46:51,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203888858] [2024-10-24 01:46:51,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:46:51,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:46:51,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:46:52,636 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:46:52,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:46:52,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203888858] [2024-10-24 01:46:52,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1203888858] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:46:52,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:46:52,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2024-10-24 01:46:52,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019448732] [2024-10-24 01:46:52,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:46:52,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-10-24 01:46:52,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:46:52,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-10-24 01:46:52,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=376, Unknown=0, NotChecked=0, Total=420 [2024-10-24 01:46:52,638 INFO L87 Difference]: Start difference. First operand 455 states and 636 transitions. Second operand has 21 states, 21 states have (on average 2.619047619047619) internal successors, (55), 20 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:46:53,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:46:53,980 INFO L93 Difference]: Finished difference Result 1783 states and 2558 transitions. [2024-10-24 01:46:53,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-10-24 01:46:53,981 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.619047619047619) internal successors, (55), 20 states have internal predecessors, (55), 0 states have call successors, (0), 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 55 [2024-10-24 01:46:53,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:46:53,986 INFO L225 Difference]: With dead ends: 1783 [2024-10-24 01:46:53,986 INFO L226 Difference]: Without dead ends: 1612 [2024-10-24 01:46:53,987 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=213, Invalid=1119, Unknown=0, NotChecked=0, Total=1332 [2024-10-24 01:46:53,988 INFO L432 NwaCegarLoop]: 195 mSDtfsCounter, 798 mSDsluCounter, 2478 mSDsCounter, 0 mSdLazyCounter, 1520 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 798 SdHoareTripleChecker+Valid, 2673 SdHoareTripleChecker+Invalid, 1520 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1520 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-24 01:46:53,988 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [798 Valid, 2673 Invalid, 1520 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1520 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-24 01:46:53,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1612 states. [2024-10-24 01:46:54,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1612 to 464. [2024-10-24 01:46:54,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 464 states, 462 states have (on average 1.4004329004329004) internal successors, (647), 463 states have internal predecessors, (647), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:46:54,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 647 transitions. [2024-10-24 01:46:54,004 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 647 transitions. Word has length 55 [2024-10-24 01:46:54,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:46:54,004 INFO L471 AbstractCegarLoop]: Abstraction has 464 states and 647 transitions. [2024-10-24 01:46:54,004 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.619047619047619) internal successors, (55), 20 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:46:54,004 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 647 transitions. [2024-10-24 01:46:54,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-10-24 01:46:54,006 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:46:54,006 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:46:54,007 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-24 01:46:54,007 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:46:54,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:46:54,007 INFO L85 PathProgramCache]: Analyzing trace with hash 1588815950, now seen corresponding path program 1 times [2024-10-24 01:46:54,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:46:54,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374041696] [2024-10-24 01:46:54,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:46:54,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:46:54,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:46:54,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:46:54,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:46:54,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374041696] [2024-10-24 01:46:54,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374041696] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:46:54,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:46:54,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-24 01:46:54,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643512061] [2024-10-24 01:46:54,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:46:54,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-24 01:46:54,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:46:54,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-24 01:46:54,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2024-10-24 01:46:54,436 INFO L87 Difference]: Start difference. First operand 464 states and 647 transitions. Second operand has 13 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 12 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-10-24 01:46:54,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:46:54,931 INFO L93 Difference]: Finished difference Result 1011 states and 1441 transitions. [2024-10-24 01:46:54,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-24 01:46:54,932 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 12 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 56 [2024-10-24 01:46:54,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:46:54,934 INFO L225 Difference]: With dead ends: 1011 [2024-10-24 01:46:54,934 INFO L226 Difference]: Without dead ends: 834 [2024-10-24 01:46:54,935 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=142, Invalid=458, Unknown=0, NotChecked=0, Total=600 [2024-10-24 01:46:54,935 INFO L432 NwaCegarLoop]: 156 mSDtfsCounter, 568 mSDsluCounter, 884 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 568 SdHoareTripleChecker+Valid, 1040 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 01:46:54,935 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [568 Valid, 1040 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 01:46:54,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 834 states. [2024-10-24 01:46:54,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 834 to 442. [2024-10-24 01:46:54,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 442 states, 440 states have (on average 1.4045454545454545) internal successors, (618), 441 states have internal predecessors, (618), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:46:54,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 618 transitions. [2024-10-24 01:46:54,944 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 618 transitions. Word has length 56 [2024-10-24 01:46:54,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:46:54,944 INFO L471 AbstractCegarLoop]: Abstraction has 442 states and 618 transitions. [2024-10-24 01:46:54,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 12 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-10-24 01:46:54,944 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 618 transitions. [2024-10-24 01:46:54,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-10-24 01:46:54,945 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:46:54,945 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:46:54,945 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-24 01:46:54,945 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:46:54,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:46:54,945 INFO L85 PathProgramCache]: Analyzing trace with hash 972775123, now seen corresponding path program 1 times [2024-10-24 01:46:54,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:46:54,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5146331] [2024-10-24 01:46:54,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:46:54,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:46:54,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:46:55,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:46:55,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:46:55,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5146331] [2024-10-24 01:46:55,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5146331] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:46:55,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:46:55,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2024-10-24 01:46:55,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373569573] [2024-10-24 01:46:55,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:46:55,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-10-24 01:46:55,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:46:55,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-10-24 01:46:55,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=298, Unknown=0, NotChecked=0, Total=342 [2024-10-24 01:46:55,758 INFO L87 Difference]: Start difference. First operand 442 states and 618 transitions. Second operand has 19 states, 19 states have (on average 2.9473684210526314) internal successors, (56), 18 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-10-24 01:46:57,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:46:57,130 INFO L93 Difference]: Finished difference Result 1360 states and 1954 transitions. [2024-10-24 01:46:57,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-24 01:46:57,130 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.9473684210526314) internal successors, (56), 18 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 56 [2024-10-24 01:46:57,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:46:57,133 INFO L225 Difference]: With dead ends: 1360 [2024-10-24 01:46:57,133 INFO L226 Difference]: Without dead ends: 1189 [2024-10-24 01:46:57,134 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=243, Invalid=879, Unknown=0, NotChecked=0, Total=1122 [2024-10-24 01:46:57,135 INFO L432 NwaCegarLoop]: 216 mSDtfsCounter, 453 mSDsluCounter, 2033 mSDsCounter, 0 mSdLazyCounter, 1122 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 453 SdHoareTripleChecker+Valid, 2249 SdHoareTripleChecker+Invalid, 1125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-24 01:46:57,135 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [453 Valid, 2249 Invalid, 1125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1122 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-24 01:46:57,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1189 states. [2024-10-24 01:46:57,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1189 to 438. [2024-10-24 01:46:57,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 438 states, 436 states have (on average 1.4059633027522935) internal successors, (613), 437 states have internal predecessors, (613), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:46:57,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 613 transitions. [2024-10-24 01:46:57,146 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 613 transitions. Word has length 56 [2024-10-24 01:46:57,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:46:57,146 INFO L471 AbstractCegarLoop]: Abstraction has 438 states and 613 transitions. [2024-10-24 01:46:57,146 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.9473684210526314) internal successors, (56), 18 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-10-24 01:46:57,146 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 613 transitions. [2024-10-24 01:46:57,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-10-24 01:46:57,146 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:46:57,147 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:46:57,147 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-24 01:46:57,147 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:46:57,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:46:57,147 INFO L85 PathProgramCache]: Analyzing trace with hash 89924370, now seen corresponding path program 1 times [2024-10-24 01:46:57,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:46:57,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138157004] [2024-10-24 01:46:57,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:46:57,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:46:57,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:46:57,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:46:57,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:46:57,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138157004] [2024-10-24 01:46:57,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138157004] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:46:57,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:46:57,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-24 01:46:57,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119571894] [2024-10-24 01:46:57,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:46:57,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-24 01:46:57,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:46:57,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-24 01:46:57,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-10-24 01:46:57,484 INFO L87 Difference]: Start difference. First operand 438 states and 613 transitions. Second operand has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 10 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-10-24 01:46:57,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:46:57,722 INFO L93 Difference]: Finished difference Result 968 states and 1389 transitions. [2024-10-24 01:46:57,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-24 01:46:57,723 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 10 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 56 [2024-10-24 01:46:57,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:46:57,725 INFO L225 Difference]: With dead ends: 968 [2024-10-24 01:46:57,725 INFO L226 Difference]: Without dead ends: 787 [2024-10-24 01:46:57,726 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2024-10-24 01:46:57,726 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 301 mSDsluCounter, 584 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 301 SdHoareTripleChecker+Valid, 737 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 01:46:57,727 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [301 Valid, 737 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 01:46:57,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 787 states. [2024-10-24 01:46:57,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 787 to 419. [2024-10-24 01:46:57,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 419 states, 418 states have (on average 1.4162679425837321) internal successors, (592), 418 states have internal predecessors, (592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:46:57,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 592 transitions. [2024-10-24 01:46:57,734 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 592 transitions. Word has length 56 [2024-10-24 01:46:57,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:46:57,734 INFO L471 AbstractCegarLoop]: Abstraction has 419 states and 592 transitions. [2024-10-24 01:46:57,734 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 10 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-10-24 01:46:57,734 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 592 transitions. [2024-10-24 01:46:57,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-10-24 01:46:57,735 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:46:57,735 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:46:57,735 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-24 01:46:57,735 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:46:57,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:46:57,735 INFO L85 PathProgramCache]: Analyzing trace with hash 1226454128, now seen corresponding path program 1 times [2024-10-24 01:46:57,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:46:57,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056249374] [2024-10-24 01:46:57,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:46:57,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:46:57,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:46:57,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:46:57,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:46:57,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056249374] [2024-10-24 01:46:57,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1056249374] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:46:57,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:46:57,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 01:46:57,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004500020] [2024-10-24 01:46:57,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:46:57,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 01:46:57,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:46:57,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 01:46:57,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 01:46:57,769 INFO L87 Difference]: Start difference. First operand 419 states and 592 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:46:57,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:46:57,788 INFO L93 Difference]: Finished difference Result 1085 states and 1559 transitions. [2024-10-24 01:46:57,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 01:46:57,789 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 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 75 [2024-10-24 01:46:57,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:46:57,790 INFO L225 Difference]: With dead ends: 1085 [2024-10-24 01:46:57,791 INFO L226 Difference]: Without dead ends: 723 [2024-10-24 01:46:57,791 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-10-24 01:46:57,792 INFO L432 NwaCegarLoop]: 166 mSDtfsCounter, 49 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:46:57,792 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 274 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:46:57,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 723 states. [2024-10-24 01:46:57,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 723 to 721. [2024-10-24 01:46:57,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 721 states, 720 states have (on average 1.4) internal successors, (1008), 720 states have internal predecessors, (1008), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:46:57,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 721 states to 721 states and 1008 transitions. [2024-10-24 01:46:57,801 INFO L78 Accepts]: Start accepts. Automaton has 721 states and 1008 transitions. Word has length 75 [2024-10-24 01:46:57,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:46:57,801 INFO L471 AbstractCegarLoop]: Abstraction has 721 states and 1008 transitions. [2024-10-24 01:46:57,801 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:46:57,801 INFO L276 IsEmpty]: Start isEmpty. Operand 721 states and 1008 transitions. [2024-10-24 01:46:57,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-10-24 01:46:57,802 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:46:57,802 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:46:57,802 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-24 01:46:57,802 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:46:57,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:46:57,802 INFO L85 PathProgramCache]: Analyzing trace with hash -152814666, now seen corresponding path program 1 times [2024-10-24 01:46:57,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:46:57,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121829554] [2024-10-24 01:46:57,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:46:57,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:46:57,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:46:57,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:46:57,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:46:57,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121829554] [2024-10-24 01:46:57,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121829554] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:46:57,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:46:57,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 01:46:57,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793467506] [2024-10-24 01:46:57,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:46:57,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 01:46:57,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:46:57,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 01:46:57,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 01:46:57,867 INFO L87 Difference]: Start difference. First operand 721 states and 1008 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:46:57,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:46:57,882 INFO L93 Difference]: Finished difference Result 1806 states and 2543 transitions. [2024-10-24 01:46:57,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 01:46:57,883 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 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 76 [2024-10-24 01:46:57,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:46:57,886 INFO L225 Difference]: With dead ends: 1806 [2024-10-24 01:46:57,886 INFO L226 Difference]: Without dead ends: 1142 [2024-10-24 01:46:57,887 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-10-24 01:46:57,887 INFO L432 NwaCegarLoop]: 166 mSDtfsCounter, 55 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:46:57,887 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 261 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:46:57,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1142 states. [2024-10-24 01:46:57,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1142 to 1068. [2024-10-24 01:46:57,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1068 states, 1067 states have (on average 1.3926897844423618) internal successors, (1486), 1067 states have internal predecessors, (1486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:46:57,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1068 states to 1068 states and 1486 transitions. [2024-10-24 01:46:57,901 INFO L78 Accepts]: Start accepts. Automaton has 1068 states and 1486 transitions. Word has length 76 [2024-10-24 01:46:57,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:46:57,901 INFO L471 AbstractCegarLoop]: Abstraction has 1068 states and 1486 transitions. [2024-10-24 01:46:57,901 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:46:57,901 INFO L276 IsEmpty]: Start isEmpty. Operand 1068 states and 1486 transitions. [2024-10-24 01:46:57,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-10-24 01:46:57,902 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:46:57,902 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:46:57,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-24 01:46:57,903 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:46:57,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:46:57,903 INFO L85 PathProgramCache]: Analyzing trace with hash 1881732104, now seen corresponding path program 1 times [2024-10-24 01:46:57,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:46:57,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42791978] [2024-10-24 01:46:57,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:46:57,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:46:57,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:46:57,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:46:57,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:46:57,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42791978] [2024-10-24 01:46:57,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42791978] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:46:57,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:46:57,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 01:46:57,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841105654] [2024-10-24 01:46:57,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:46:57,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 01:46:57,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:46:57,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 01:46:57,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 01:46:57,991 INFO L87 Difference]: Start difference. First operand 1068 states and 1486 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:46:58,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:46:58,009 INFO L93 Difference]: Finished difference Result 2982 states and 4149 transitions. [2024-10-24 01:46:58,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 01:46:58,010 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 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 77 [2024-10-24 01:46:58,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:46:58,014 INFO L225 Difference]: With dead ends: 2982 [2024-10-24 01:46:58,014 INFO L226 Difference]: Without dead ends: 1971 [2024-10-24 01:46:58,016 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-10-24 01:46:58,016 INFO L432 NwaCegarLoop]: 158 mSDtfsCounter, 48 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:46:58,017 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 259 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:46:58,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1971 states. [2024-10-24 01:46:58,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1971 to 1861. [2024-10-24 01:46:58,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1861 states, 1860 states have (on average 1.3763440860215055) internal successors, (2560), 1860 states have internal predecessors, (2560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:46:58,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1861 states to 1861 states and 2560 transitions. [2024-10-24 01:46:58,044 INFO L78 Accepts]: Start accepts. Automaton has 1861 states and 2560 transitions. Word has length 77 [2024-10-24 01:46:58,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:46:58,044 INFO L471 AbstractCegarLoop]: Abstraction has 1861 states and 2560 transitions. [2024-10-24 01:46:58,044 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:46:58,045 INFO L276 IsEmpty]: Start isEmpty. Operand 1861 states and 2560 transitions. [2024-10-24 01:46:58,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-10-24 01:46:58,045 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:46:58,045 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:46:58,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-24 01:46:58,045 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:46:58,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:46:58,045 INFO L85 PathProgramCache]: Analyzing trace with hash -1991300515, now seen corresponding path program 1 times [2024-10-24 01:46:58,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:46:58,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796544846] [2024-10-24 01:46:58,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:46:58,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:46:58,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:46:58,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:46:58,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:46:58,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796544846] [2024-10-24 01:46:58,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796544846] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:46:58,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:46:58,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 01:46:58,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913072952] [2024-10-24 01:46:58,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:46:58,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 01:46:58,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:46:58,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 01:46:58,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 01:46:58,116 INFO L87 Difference]: Start difference. First operand 1861 states and 2560 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:46:58,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:46:58,133 INFO L93 Difference]: Finished difference Result 5253 states and 7182 transitions. [2024-10-24 01:46:58,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 01:46:58,133 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 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 78 [2024-10-24 01:46:58,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:46:58,141 INFO L225 Difference]: With dead ends: 5253 [2024-10-24 01:46:58,141 INFO L226 Difference]: Without dead ends: 3449 [2024-10-24 01:46:58,144 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-10-24 01:46:58,145 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 41 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:46:58,145 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 256 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:46:58,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3449 states. [2024-10-24 01:46:58,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3449 to 3231. [2024-10-24 01:46:58,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3231 states, 3230 states have (on average 1.3489164086687306) internal successors, (4357), 3230 states have internal predecessors, (4357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:46:58,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3231 states to 3231 states and 4357 transitions. [2024-10-24 01:46:58,194 INFO L78 Accepts]: Start accepts. Automaton has 3231 states and 4357 transitions. Word has length 78 [2024-10-24 01:46:58,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:46:58,194 INFO L471 AbstractCegarLoop]: Abstraction has 3231 states and 4357 transitions. [2024-10-24 01:46:58,194 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:46:58,194 INFO L276 IsEmpty]: Start isEmpty. Operand 3231 states and 4357 transitions. [2024-10-24 01:46:58,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-10-24 01:46:58,195 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:46:58,195 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:46:58,195 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-24 01:46:58,195 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:46:58,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:46:58,196 INFO L85 PathProgramCache]: Analyzing trace with hash -1447540709, now seen corresponding path program 1 times [2024-10-24 01:46:58,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:46:58,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135003458] [2024-10-24 01:46:58,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:46:58,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:46:58,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:46:58,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:46:58,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:46:58,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135003458] [2024-10-24 01:46:58,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2135003458] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:46:58,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:46:58,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 01:46:58,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033182229] [2024-10-24 01:46:58,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:46:58,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 01:46:58,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:46:58,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 01:46:58,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 01:46:58,383 INFO L87 Difference]: Start difference. First operand 3231 states and 4357 transitions. Second operand has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:46:58,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:46:58,413 INFO L93 Difference]: Finished difference Result 3329 states and 4486 transitions. [2024-10-24 01:46:58,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 01:46:58,415 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 0 states have call successors, (0), 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 79 [2024-10-24 01:46:58,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:46:58,422 INFO L225 Difference]: With dead ends: 3329 [2024-10-24 01:46:58,423 INFO L226 Difference]: Without dead ends: 3327 [2024-10-24 01:46:58,424 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 01:46:58,424 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 0 mSDsluCounter, 455 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 572 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:46:58,424 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 572 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:46:58,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3327 states. [2024-10-24 01:46:58,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3327 to 3327. [2024-10-24 01:46:58,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3327 states, 3326 states have (on average 1.3268190018039687) internal successors, (4413), 3326 states have internal predecessors, (4413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:46:58,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3327 states to 3327 states and 4413 transitions. [2024-10-24 01:46:58,492 INFO L78 Accepts]: Start accepts. Automaton has 3327 states and 4413 transitions. Word has length 79 [2024-10-24 01:46:58,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:46:58,493 INFO L471 AbstractCegarLoop]: Abstraction has 3327 states and 4413 transitions. [2024-10-24 01:46:58,493 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:46:58,493 INFO L276 IsEmpty]: Start isEmpty. Operand 3327 states and 4413 transitions. [2024-10-24 01:46:58,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-10-24 01:46:58,493 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:46:58,493 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:46:58,493 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-24 01:46:58,493 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:46:58,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:46:58,494 INFO L85 PathProgramCache]: Analyzing trace with hash -1542460705, now seen corresponding path program 1 times [2024-10-24 01:46:58,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:46:58,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541135572] [2024-10-24 01:46:58,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:46:58,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:46:58,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:46:58,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:46:58,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:46:58,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541135572] [2024-10-24 01:46:58,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541135572] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:46:58,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:46:58,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 01:46:58,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576423260] [2024-10-24 01:46:58,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:46:58,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 01:46:58,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:46:58,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 01:46:58,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 01:46:58,528 INFO L87 Difference]: Start difference. First operand 3327 states and 4413 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:46:58,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:46:58,559 INFO L93 Difference]: Finished difference Result 6723 states and 8935 transitions. [2024-10-24 01:46:58,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 01:46:58,560 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 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 79 [2024-10-24 01:46:58,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:46:58,570 INFO L225 Difference]: With dead ends: 6723 [2024-10-24 01:46:58,570 INFO L226 Difference]: Without dead ends: 3453 [2024-10-24 01:46:58,573 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-10-24 01:46:58,574 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 67 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:46:58,574 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 206 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:46:58,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3453 states. [2024-10-24 01:46:58,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3453 to 3451. [2024-10-24 01:46:58,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3451 states, 3450 states have (on average 1.3057971014492753) internal successors, (4505), 3450 states have internal predecessors, (4505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:46:58,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3451 states to 3451 states and 4505 transitions. [2024-10-24 01:46:58,612 INFO L78 Accepts]: Start accepts. Automaton has 3451 states and 4505 transitions. Word has length 79 [2024-10-24 01:46:58,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:46:58,612 INFO L471 AbstractCegarLoop]: Abstraction has 3451 states and 4505 transitions. [2024-10-24 01:46:58,612 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:46:58,613 INFO L276 IsEmpty]: Start isEmpty. Operand 3451 states and 4505 transitions. [2024-10-24 01:46:58,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-24 01:46:58,613 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:46:58,614 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:46:58,614 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-24 01:46:58,614 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:46:58,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:46:58,614 INFO L85 PathProgramCache]: Analyzing trace with hash -1846087042, now seen corresponding path program 1 times [2024-10-24 01:46:58,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:46:58,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143986154] [2024-10-24 01:46:58,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:46:58,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:46:58,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:46:58,959 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:46:58,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:46:58,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143986154] [2024-10-24 01:46:58,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143986154] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 01:46:58,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [808510389] [2024-10-24 01:46:58,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:46:58,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 01:46:58,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 01:46:58,963 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-10-24 01:46:58,964 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-10-24 01:46:59,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:46:59,095 INFO L255 TraceCheckSpWp]: Trace formula consists of 448 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-10-24 01:46:59,105 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 01:46:59,749 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:46:59,749 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 01:47:01,016 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:47:01,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [808510389] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 01:47:01,017 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 01:47:01,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 30 [2024-10-24 01:47:01,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526241647] [2024-10-24 01:47:01,018 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 01:47:01,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-10-24 01:47:01,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:47:01,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-10-24 01:47:01,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=831, Unknown=0, NotChecked=0, Total=930 [2024-10-24 01:47:01,019 INFO L87 Difference]: Start difference. First operand 3451 states and 4505 transitions. Second operand has 31 states, 31 states have (on average 8.580645161290322) internal successors, (266), 30 states have internal predecessors, (266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:47:05,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:47:05,853 INFO L93 Difference]: Finished difference Result 29721 states and 38582 transitions. [2024-10-24 01:47:05,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2024-10-24 01:47:05,854 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 8.580645161290322) internal successors, (266), 30 states have internal predecessors, (266), 0 states have call successors, (0), 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 100 [2024-10-24 01:47:05,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:47:05,890 INFO L225 Difference]: With dead ends: 29721 [2024-10-24 01:47:05,890 INFO L226 Difference]: Without dead ends: 26327 [2024-10-24 01:47:05,901 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 305 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4346 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=2713, Invalid=13289, Unknown=0, NotChecked=0, Total=16002 [2024-10-24 01:47:05,902 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 2979 mSDsluCounter, 1515 mSDsCounter, 0 mSdLazyCounter, 2424 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2979 SdHoareTripleChecker+Valid, 1615 SdHoareTripleChecker+Invalid, 2523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 2424 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-24 01:47:05,903 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2979 Valid, 1615 Invalid, 2523 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 2424 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-24 01:47:05,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26327 states. [2024-10-24 01:47:06,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26327 to 17737. [2024-10-24 01:47:06,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17737 states, 17736 states have (on average 1.2987708615245828) internal successors, (23035), 17736 states have internal predecessors, (23035), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:47:06,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17737 states to 17737 states and 23035 transitions. [2024-10-24 01:47:06,148 INFO L78 Accepts]: Start accepts. Automaton has 17737 states and 23035 transitions. Word has length 100 [2024-10-24 01:47:06,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:47:06,148 INFO L471 AbstractCegarLoop]: Abstraction has 17737 states and 23035 transitions. [2024-10-24 01:47:06,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 8.580645161290322) internal successors, (266), 30 states have internal predecessors, (266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 01:47:06,148 INFO L276 IsEmpty]: Start isEmpty. Operand 17737 states and 23035 transitions. [2024-10-24 01:47:06,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-24 01:47:06,151 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:47:06,152 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:47:06,166 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-24 01:47:06,355 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,SelfDestructingSolverStorable23 [2024-10-24 01:47:06,356 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:47:06,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:47:06,356 INFO L85 PathProgramCache]: Analyzing trace with hash 696879962, now seen corresponding path program 1 times [2024-10-24 01:47:06,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:47:06,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760431831] [2024-10-24 01:47:06,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:47:06,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:47:06,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:47:06,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-10-24 01:47:06,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:47:06,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760431831] [2024-10-24 01:47:06,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760431831] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 01:47:06,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [749516934] [2024-10-24 01:47:06,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:47:06,750 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 01:47:06,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 01:47:06,752 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-10-24 01:47:06,753 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-10-24 01:47:06,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:47:06,869 INFO L255 TraceCheckSpWp]: Trace formula consists of 453 conjuncts, 53 conjuncts are in the unsatisfiable core [2024-10-24 01:47:06,874 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 01:47:08,480 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:47:08,480 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 01:47:10,997 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 01:47:10,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [749516934] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 01:47:10,998 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 01:47:10,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 26, 24] total 58 [2024-10-24 01:47:10,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434779106] [2024-10-24 01:47:10,998 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 01:47:10,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2024-10-24 01:47:10,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:47:10,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2024-10-24 01:47:11,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=293, Invalid=3013, Unknown=0, NotChecked=0, Total=3306 [2024-10-24 01:47:11,000 INFO L87 Difference]: Start difference. First operand 17737 states and 23035 transitions. Second operand has 58 states, 58 states have (on average 4.844827586206897) internal successors, (281), 58 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)