./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_opt-floodmax.4.3.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d 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_opt-floodmax.4.3.ufo.UNBOUNDED.pals.c.v+cfa-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 b01ecc2cec2d3b25790e2e1261ee2a51c1fc74f823e2e108c953a6bc27a2446d --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 20:36:31,371 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 20:36:31,435 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-12 20:36:31,441 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 20:36:31,441 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 20:36:31,466 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 20:36:31,466 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 20:36:31,467 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 20:36:31,467 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 20:36:31,470 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 20:36:31,471 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 20:36:31,471 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 20:36:31,471 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 20:36:31,471 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 20:36:31,472 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 20:36:31,472 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 20:36:31,472 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 20:36:31,472 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 20:36:31,472 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 20:36:31,472 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 20:36:31,473 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 20:36:31,474 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 20:36:31,474 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 20:36:31,474 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 20:36:31,474 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 20:36:31,475 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 20:36:31,475 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 20:36:31,475 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 20:36:31,475 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 20:36:31,475 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 20:36:31,476 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 20:36:31,476 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 20:36:31,476 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 20:36:31,476 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 20:36:31,477 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 20:36:31,477 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 20:36:31,477 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 20:36:31,478 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 20:36:31,478 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 20:36:31,478 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 20:36:31,478 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 20:36:31,479 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 20:36:31,479 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 -> b01ecc2cec2d3b25790e2e1261ee2a51c1fc74f823e2e108c953a6bc27a2446d [2024-10-12 20:36:31,688 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 20:36:31,724 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 20:36:31,731 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 20:36:31,732 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 20:36:31,732 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 20:36:31,736 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.4.3.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2024-10-12 20:36:33,112 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 20:36:33,340 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 20:36:33,340 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.4.3.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2024-10-12 20:36:33,360 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3da794764/e001dbc99bc7444dbca74b500716bdb5/FLAG7b70a39ad [2024-10-12 20:36:33,373 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3da794764/e001dbc99bc7444dbca74b500716bdb5 [2024-10-12 20:36:33,375 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 20:36:33,377 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 20:36:33,379 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 20:36:33,379 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 20:36:33,383 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 20:36:33,384 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 08:36:33" (1/1) ... [2024-10-12 20:36:33,385 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58f250fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:36:33, skipping insertion in model container [2024-10-12 20:36:33,385 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 08:36:33" (1/1) ... [2024-10-12 20:36:33,434 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 20:36:33,840 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_opt-floodmax.4.3.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c[13826,13839] [2024-10-12 20:36:33,936 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 20:36:33,961 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 20:36:34,064 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_opt-floodmax.4.3.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c[13826,13839] [2024-10-12 20:36:34,118 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 20:36:34,154 INFO L204 MainTranslator]: Completed translation [2024-10-12 20:36:34,154 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:36:34 WrapperNode [2024-10-12 20:36:34,157 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 20:36:34,158 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 20:36:34,158 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 20:36:34,158 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 20:36:34,164 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:36:34" (1/1) ... [2024-10-12 20:36:34,176 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:36:34" (1/1) ... [2024-10-12 20:36:34,224 INFO L138 Inliner]: procedures = 24, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1451 [2024-10-12 20:36:34,225 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 20:36:34,225 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 20:36:34,225 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 20:36:34,226 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 20:36:34,238 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:36:34" (1/1) ... [2024-10-12 20:36:34,238 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:36:34" (1/1) ... [2024-10-12 20:36:34,243 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:36:34" (1/1) ... [2024-10-12 20:36:34,260 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-12 20:36:34,261 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:36:34" (1/1) ... [2024-10-12 20:36:34,261 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:36:34" (1/1) ... [2024-10-12 20:36:34,274 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:36:34" (1/1) ... [2024-10-12 20:36:34,280 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:36:34" (1/1) ... [2024-10-12 20:36:34,283 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:36:34" (1/1) ... [2024-10-12 20:36:34,287 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:36:34" (1/1) ... [2024-10-12 20:36:34,292 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 20:36:34,293 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 20:36:34,293 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 20:36:34,293 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 20:36:34,294 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:36:34" (1/1) ... [2024-10-12 20:36:34,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 20:36:34,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 20:36:34,345 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-12 20:36:34,347 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-12 20:36:34,378 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 20:36:34,378 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 20:36:34,378 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 20:36:34,379 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 20:36:34,641 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 20:36:34,642 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 20:36:35,767 INFO L? ?]: Removed 123 outVars from TransFormulas that were not future-live. [2024-10-12 20:36:35,768 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 20:36:35,822 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 20:36:35,822 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-12 20:36:35,822 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 08:36:35 BoogieIcfgContainer [2024-10-12 20:36:35,823 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 20:36:35,824 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 20:36:35,824 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 20:36:35,827 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 20:36:35,827 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 08:36:33" (1/3) ... [2024-10-12 20:36:35,828 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a22bd9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 08:36:35, skipping insertion in model container [2024-10-12 20:36:35,828 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:36:34" (2/3) ... [2024-10-12 20:36:35,828 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a22bd9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 08:36:35, skipping insertion in model container [2024-10-12 20:36:35,828 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 08:36:35" (3/3) ... [2024-10-12 20:36:35,829 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.4.3.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2024-10-12 20:36:35,842 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 20:36:35,842 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-12 20:36:35,893 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 20:36:35,898 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;@f12f204, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 20:36:35,898 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-12 20:36:35,904 INFO L276 IsEmpty]: Start isEmpty. Operand has 348 states, 346 states have (on average 1.7919075144508672) internal successors, (620), 347 states have internal predecessors, (620), 0 states have call successors, (0), 0 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-12 20:36:35,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-10-12 20:36:35,917 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:36:35,917 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:36:35,918 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:36:35,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:36:35,923 INFO L85 PathProgramCache]: Analyzing trace with hash 1104503108, now seen corresponding path program 1 times [2024-10-12 20:36:35,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:36:35,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974088133] [2024-10-12 20:36:35,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:36:35,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:36:36,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:36:36,531 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-12 20:36:36,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:36:36,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974088133] [2024-10-12 20:36:36,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974088133] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:36:36,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:36:36,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:36:36,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252386357] [2024-10-12 20:36:36,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:36:36,538 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:36:36,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:36:36,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:36:36,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:36:36,585 INFO L87 Difference]: Start difference. First operand has 348 states, 346 states have (on average 1.7919075144508672) internal successors, (620), 347 states have internal predecessors, (620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:36:36,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:36:36,711 INFO L93 Difference]: Finished difference Result 648 states and 1120 transitions. [2024-10-12 20:36:36,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:36:36,716 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 117 [2024-10-12 20:36:36,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:36:36,729 INFO L225 Difference]: With dead ends: 648 [2024-10-12 20:36:36,730 INFO L226 Difference]: Without dead ends: 488 [2024-10-12 20:36:36,733 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-12 20:36:36,736 INFO L432 NwaCegarLoop]: 610 mSDtfsCounter, 265 mSDsluCounter, 528 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 1138 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:36:36,737 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [265 Valid, 1138 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:36:36,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2024-10-12 20:36:36,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 485. [2024-10-12 20:36:36,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 485 states, 484 states have (on average 1.6528925619834711) internal successors, (800), 484 states have internal predecessors, (800), 0 states have call successors, (0), 0 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-12 20:36:36,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 485 states and 800 transitions. [2024-10-12 20:36:36,791 INFO L78 Accepts]: Start accepts. Automaton has 485 states and 800 transitions. Word has length 117 [2024-10-12 20:36:36,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:36:36,792 INFO L471 AbstractCegarLoop]: Abstraction has 485 states and 800 transitions. [2024-10-12 20:36:36,793 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:36:36,793 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 800 transitions. [2024-10-12 20:36:36,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-10-12 20:36:36,796 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:36:36,796 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:36:36,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 20:36:36,796 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:36:36,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:36:36,797 INFO L85 PathProgramCache]: Analyzing trace with hash -1038605622, now seen corresponding path program 1 times [2024-10-12 20:36:36,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:36:36,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596276775] [2024-10-12 20:36:36,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:36:36,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:36:36,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:36:37,044 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-12 20:36:37,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:36:37,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596276775] [2024-10-12 20:36:37,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596276775] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:36:37,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:36:37,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:36:37,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903722254] [2024-10-12 20:36:37,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:36:37,047 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:36:37,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:36:37,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:36:37,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:36:37,048 INFO L87 Difference]: Start difference. First operand 485 states and 800 transitions. Second operand has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 0 states have call successors, (0), 0 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-12 20:36:37,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:36:37,098 INFO L93 Difference]: Finished difference Result 1051 states and 1740 transitions. [2024-10-12 20:36:37,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:36:37,099 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 0 states have call successors, (0), 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 120 [2024-10-12 20:36:37,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:36:37,101 INFO L225 Difference]: With dead ends: 1051 [2024-10-12 20:36:37,101 INFO L226 Difference]: Without dead ends: 758 [2024-10-12 20:36:37,102 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-12 20:36:37,107 INFO L432 NwaCegarLoop]: 567 mSDtfsCounter, 229 mSDsluCounter, 527 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 1094 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:36:37,107 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [229 Valid, 1094 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:36:37,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 758 states. [2024-10-12 20:36:37,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 758 to 754. [2024-10-12 20:36:37,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 754 states, 753 states have (on average 1.653386454183267) internal successors, (1245), 753 states have internal predecessors, (1245), 0 states have call successors, (0), 0 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-12 20:36:37,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 1245 transitions. [2024-10-12 20:36:37,147 INFO L78 Accepts]: Start accepts. Automaton has 754 states and 1245 transitions. Word has length 120 [2024-10-12 20:36:37,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:36:37,148 INFO L471 AbstractCegarLoop]: Abstraction has 754 states and 1245 transitions. [2024-10-12 20:36:37,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 0 states have call successors, (0), 0 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-12 20:36:37,148 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 1245 transitions. [2024-10-12 20:36:37,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-10-12 20:36:37,150 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:36:37,150 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:36:37,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 20:36:37,150 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:36:37,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:36:37,151 INFO L85 PathProgramCache]: Analyzing trace with hash -1045683377, now seen corresponding path program 1 times [2024-10-12 20:36:37,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:36:37,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393043269] [2024-10-12 20:36:37,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:36:37,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:36:37,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:36:37,312 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-12 20:36:37,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:36:37,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393043269] [2024-10-12 20:36:37,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1393043269] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:36:37,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:36:37,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:36:37,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630886683] [2024-10-12 20:36:37,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:36:37,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:36:37,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:36:37,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:36:37,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:36:37,316 INFO L87 Difference]: Start difference. First operand 754 states and 1245 transitions. Second operand has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 0 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-12 20:36:37,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:36:37,353 INFO L93 Difference]: Finished difference Result 1838 states and 3039 transitions. [2024-10-12 20:36:37,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:36:37,354 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 123 [2024-10-12 20:36:37,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:36:37,359 INFO L225 Difference]: With dead ends: 1838 [2024-10-12 20:36:37,361 INFO L226 Difference]: Without dead ends: 1276 [2024-10-12 20:36:37,362 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-12 20:36:37,364 INFO L432 NwaCegarLoop]: 567 mSDtfsCounter, 222 mSDsluCounter, 528 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 1095 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:36:37,367 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 1095 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:36:37,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1276 states. [2024-10-12 20:36:37,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1276 to 1270. [2024-10-12 20:36:37,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1270 states, 1269 states have (on average 1.649330181245075) internal successors, (2093), 1269 states have internal predecessors, (2093), 0 states have call successors, (0), 0 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-12 20:36:37,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1270 states to 1270 states and 2093 transitions. [2024-10-12 20:36:37,423 INFO L78 Accepts]: Start accepts. Automaton has 1270 states and 2093 transitions. Word has length 123 [2024-10-12 20:36:37,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:36:37,424 INFO L471 AbstractCegarLoop]: Abstraction has 1270 states and 2093 transitions. [2024-10-12 20:36:37,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 0 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-12 20:36:37,424 INFO L276 IsEmpty]: Start isEmpty. Operand 1270 states and 2093 transitions. [2024-10-12 20:36:37,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-10-12 20:36:37,426 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:36:37,426 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:36:37,426 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-12 20:36:37,427 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:36:37,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:36:37,427 INFO L85 PathProgramCache]: Analyzing trace with hash 1670401211, now seen corresponding path program 1 times [2024-10-12 20:36:37,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:36:37,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026647432] [2024-10-12 20:36:37,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:36:37,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:36:37,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:36:37,556 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-12 20:36:37,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:36:37,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026647432] [2024-10-12 20:36:37,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026647432] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:36:37,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:36:37,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:36:37,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648605700] [2024-10-12 20:36:37,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:36:37,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:36:37,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:36:37,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:36:37,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:36:37,560 INFO L87 Difference]: Start difference. First operand 1270 states and 2093 transitions. Second operand has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 0 states have call successors, (0), 0 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-12 20:36:37,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:36:37,604 INFO L93 Difference]: Finished difference Result 3346 states and 5511 transitions. [2024-10-12 20:36:37,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:36:37,605 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 0 states have call successors, (0), 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 126 [2024-10-12 20:36:37,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:36:37,612 INFO L225 Difference]: With dead ends: 3346 [2024-10-12 20:36:37,612 INFO L226 Difference]: Without dead ends: 2268 [2024-10-12 20:36:37,614 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-12 20:36:37,615 INFO L432 NwaCegarLoop]: 567 mSDtfsCounter, 215 mSDsluCounter, 529 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 1096 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:36:37,616 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 1096 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:36:37,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2268 states. [2024-10-12 20:36:37,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2268 to 2258. [2024-10-12 20:36:37,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2258 states, 2257 states have (on average 1.6415595923792645) internal successors, (3705), 2257 states have internal predecessors, (3705), 0 states have call successors, (0), 0 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-12 20:36:37,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2258 states to 2258 states and 3705 transitions. [2024-10-12 20:36:37,649 INFO L78 Accepts]: Start accepts. Automaton has 2258 states and 3705 transitions. Word has length 126 [2024-10-12 20:36:37,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:36:37,650 INFO L471 AbstractCegarLoop]: Abstraction has 2258 states and 3705 transitions. [2024-10-12 20:36:37,650 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 0 states have call successors, (0), 0 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-12 20:36:37,651 INFO L276 IsEmpty]: Start isEmpty. Operand 2258 states and 3705 transitions. [2024-10-12 20:36:37,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-10-12 20:36:37,652 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:36:37,653 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:36:37,653 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-12 20:36:37,654 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:36:37,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:36:37,654 INFO L85 PathProgramCache]: Analyzing trace with hash -1229327834, now seen corresponding path program 1 times [2024-10-12 20:36:37,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:36:37,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808412287] [2024-10-12 20:36:37,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:36:37,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:36:37,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:36:37,832 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-12 20:36:37,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:36:37,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808412287] [2024-10-12 20:36:37,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [808412287] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:36:37,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:36:37,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 20:36:37,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475638046] [2024-10-12 20:36:37,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:36:37,834 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 20:36:37,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:36:37,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 20:36:37,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-12 20:36:37,835 INFO L87 Difference]: Start difference. First operand 2258 states and 3705 transitions. Second operand has 6 states, 6 states have (on average 21.5) internal successors, (129), 6 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:36:38,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:36:38,100 INFO L93 Difference]: Finished difference Result 11838 states and 19569 transitions. [2024-10-12 20:36:38,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-12 20:36:38,101 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 21.5) internal successors, (129), 6 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 129 [2024-10-12 20:36:38,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:36:38,127 INFO L225 Difference]: With dead ends: 11838 [2024-10-12 20:36:38,128 INFO L226 Difference]: Without dead ends: 9772 [2024-10-12 20:36:38,133 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-10-12 20:36:38,133 INFO L432 NwaCegarLoop]: 569 mSDtfsCounter, 2145 mSDsluCounter, 4278 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2145 SdHoareTripleChecker+Valid, 4847 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:36:38,134 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2145 Valid, 4847 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:36:38,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9772 states. [2024-10-12 20:36:38,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9772 to 4188. [2024-10-12 20:36:38,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4188 states, 4187 states have (on average 1.6412705994745642) internal successors, (6872), 4187 states have internal predecessors, (6872), 0 states have call successors, (0), 0 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-12 20:36:38,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4188 states to 4188 states and 6872 transitions. [2024-10-12 20:36:38,259 INFO L78 Accepts]: Start accepts. Automaton has 4188 states and 6872 transitions. Word has length 129 [2024-10-12 20:36:38,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:36:38,260 INFO L471 AbstractCegarLoop]: Abstraction has 4188 states and 6872 transitions. [2024-10-12 20:36:38,260 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.5) internal successors, (129), 6 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:36:38,260 INFO L276 IsEmpty]: Start isEmpty. Operand 4188 states and 6872 transitions. [2024-10-12 20:36:38,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-10-12 20:36:38,263 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:36:38,263 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:36:38,263 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-12 20:36:38,263 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:36:38,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:36:38,264 INFO L85 PathProgramCache]: Analyzing trace with hash 478480816, now seen corresponding path program 1 times [2024-10-12 20:36:38,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:36:38,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431695953] [2024-10-12 20:36:38,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:36:38,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:36:38,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:36:38,442 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-12 20:36:38,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:36:38,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431695953] [2024-10-12 20:36:38,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431695953] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:36:38,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:36:38,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 20:36:38,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788851462] [2024-10-12 20:36:38,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:36:38,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 20:36:38,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:36:38,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 20:36:38,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 20:36:38,444 INFO L87 Difference]: Start difference. First operand 4188 states and 6872 transitions. Second operand has 4 states, 4 states have (on average 32.5) internal successors, (130), 4 states have internal predecessors, (130), 0 states have call successors, (0), 0 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-12 20:36:38,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:36:38,540 INFO L93 Difference]: Finished difference Result 12286 states and 20260 transitions. [2024-10-12 20:36:38,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 20:36:38,541 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.5) internal successors, (130), 4 states have internal predecessors, (130), 0 states have call successors, (0), 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 130 [2024-10-12 20:36:38,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:36:38,564 INFO L225 Difference]: With dead ends: 12286 [2024-10-12 20:36:38,565 INFO L226 Difference]: Without dead ends: 8290 [2024-10-12 20:36:38,572 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-12 20:36:38,573 INFO L432 NwaCegarLoop]: 562 mSDtfsCounter, 754 mSDsluCounter, 1331 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 754 SdHoareTripleChecker+Valid, 1893 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:36:38,573 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [754 Valid, 1893 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:36:38,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8290 states. [2024-10-12 20:36:38,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8290 to 6222. [2024-10-12 20:36:38,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6222 states, 6221 states have (on average 1.6436264266195146) internal successors, (10225), 6221 states have internal predecessors, (10225), 0 states have call successors, (0), 0 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-12 20:36:38,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6222 states to 6222 states and 10225 transitions. [2024-10-12 20:36:38,731 INFO L78 Accepts]: Start accepts. Automaton has 6222 states and 10225 transitions. Word has length 130 [2024-10-12 20:36:38,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:36:38,731 INFO L471 AbstractCegarLoop]: Abstraction has 6222 states and 10225 transitions. [2024-10-12 20:36:38,732 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.5) internal successors, (130), 4 states have internal predecessors, (130), 0 states have call successors, (0), 0 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-12 20:36:38,732 INFO L276 IsEmpty]: Start isEmpty. Operand 6222 states and 10225 transitions. [2024-10-12 20:36:38,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-12 20:36:38,735 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:36:38,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 20:36:38,735 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-12 20:36:38,735 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:36:38,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:36:38,736 INFO L85 PathProgramCache]: Analyzing trace with hash 1885499437, now seen corresponding path program 1 times [2024-10-12 20:36:38,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:36:38,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408819892] [2024-10-12 20:36:38,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:36:38,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:36:38,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:36:38,951 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-12 20:36:38,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:36:38,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408819892] [2024-10-12 20:36:38,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408819892] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:36:38,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:36:38,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 20:36:38,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368152703] [2024-10-12 20:36:38,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:36:38,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 20:36:38,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:36:38,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 20:36:38,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 20:36:38,954 INFO L87 Difference]: Start difference. First operand 6222 states and 10225 transitions. Second operand has 4 states, 4 states have (on average 32.75) internal successors, (131), 4 states have internal predecessors, (131), 0 states have call successors, (0), 0 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-12 20:36:39,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:36:39,108 INFO L93 Difference]: Finished difference Result 18284 states and 30120 transitions. [2024-10-12 20:36:39,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 20:36:39,108 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.75) internal successors, (131), 4 states have internal predecessors, (131), 0 states have call successors, (0), 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 131 [2024-10-12 20:36:39,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:36:39,139 INFO L225 Difference]: With dead ends: 18284 [2024-10-12 20:36:39,140 INFO L226 Difference]: Without dead ends: 12254 [2024-10-12 20:36:39,151 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-12 20:36:39,154 INFO L432 NwaCegarLoop]: 565 mSDtfsCounter, 752 mSDsluCounter, 1207 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 752 SdHoareTripleChecker+Valid, 1772 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:36:39,154 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [752 Valid, 1772 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:36:39,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12254 states. [2024-10-12 20:36:39,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12254 to 9214. [2024-10-12 20:36:39,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9214 states, 9213 states have (on average 1.6419190274611961) internal successors, (15127), 9213 states have internal predecessors, (15127), 0 states have call successors, (0), 0 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-12 20:36:39,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9214 states to 9214 states and 15127 transitions. [2024-10-12 20:36:39,490 INFO L78 Accepts]: Start accepts. Automaton has 9214 states and 15127 transitions. Word has length 131 [2024-10-12 20:36:39,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:36:39,490 INFO L471 AbstractCegarLoop]: Abstraction has 9214 states and 15127 transitions. [2024-10-12 20:36:39,491 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.75) internal successors, (131), 4 states have internal predecessors, (131), 0 states have call successors, (0), 0 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-12 20:36:39,491 INFO L276 IsEmpty]: Start isEmpty. Operand 9214 states and 15127 transitions. [2024-10-12 20:36:39,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-10-12 20:36:39,494 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:36:39,494 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:36:39,495 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-12 20:36:39,495 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:36:39,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:36:39,495 INFO L85 PathProgramCache]: Analyzing trace with hash -1737005545, now seen corresponding path program 1 times [2024-10-12 20:36:39,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:36:39,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948828784] [2024-10-12 20:36:39,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:36:39,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:36:39,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:36:39,617 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-12 20:36:39,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:36:39,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948828784] [2024-10-12 20:36:39,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [948828784] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:36:39,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:36:39,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 20:36:39,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103032524] [2024-10-12 20:36:39,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:36:39,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 20:36:39,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:36:39,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 20:36:39,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 20:36:39,619 INFO L87 Difference]: Start difference. First operand 9214 states and 15127 transitions. Second operand has 4 states, 4 states have (on average 33.0) internal successors, (132), 4 states have internal predecessors, (132), 0 states have call successors, (0), 0 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-12 20:36:39,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:36:39,810 INFO L93 Difference]: Finished difference Result 27108 states and 44608 transitions. [2024-10-12 20:36:39,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 20:36:39,813 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.0) internal successors, (132), 4 states have internal predecessors, (132), 0 states have call successors, (0), 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 132 [2024-10-12 20:36:39,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:36:39,841 INFO L225 Difference]: With dead ends: 27108 [2024-10-12 20:36:39,841 INFO L226 Difference]: Without dead ends: 18086 [2024-10-12 20:36:39,850 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-12 20:36:39,850 INFO L432 NwaCegarLoop]: 559 mSDtfsCounter, 750 mSDsluCounter, 1335 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 750 SdHoareTripleChecker+Valid, 1894 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:36:39,851 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [750 Valid, 1894 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:36:39,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18086 states. [2024-10-12 20:36:40,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18086 to 13616. [2024-10-12 20:36:40,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13616 states, 13615 states have (on average 1.6401762761659935) internal successors, (22331), 13615 states have internal predecessors, (22331), 0 states have call successors, (0), 0 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-12 20:36:40,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13616 states to 13616 states and 22331 transitions. [2024-10-12 20:36:40,162 INFO L78 Accepts]: Start accepts. Automaton has 13616 states and 22331 transitions. Word has length 132 [2024-10-12 20:36:40,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:36:40,163 INFO L471 AbstractCegarLoop]: Abstraction has 13616 states and 22331 transitions. [2024-10-12 20:36:40,163 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.0) internal successors, (132), 4 states have internal predecessors, (132), 0 states have call successors, (0), 0 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-12 20:36:40,163 INFO L276 IsEmpty]: Start isEmpty. Operand 13616 states and 22331 transitions. [2024-10-12 20:36:40,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-10-12 20:36:40,167 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:36:40,167 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:36:40,168 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-12 20:36:40,168 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:36:40,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:36:40,169 INFO L85 PathProgramCache]: Analyzing trace with hash -463645793, now seen corresponding path program 1 times [2024-10-12 20:36:40,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:36:40,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845407109] [2024-10-12 20:36:40,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:36:40,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:36:40,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:36:40,252 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-12 20:36:40,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:36:40,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845407109] [2024-10-12 20:36:40,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845407109] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:36:40,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:36:40,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:36:40,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397480053] [2024-10-12 20:36:40,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:36:40,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:36:40,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:36:40,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:36:40,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:36:40,255 INFO L87 Difference]: Start difference. First operand 13616 states and 22331 transitions. Second operand has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 0 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-12 20:36:40,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:36:40,420 INFO L93 Difference]: Finished difference Result 30204 states and 49578 transitions. [2024-10-12 20:36:40,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:36:40,421 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 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 133 [2024-10-12 20:36:40,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:36:40,451 INFO L225 Difference]: With dead ends: 30204 [2024-10-12 20:36:40,451 INFO L226 Difference]: Without dead ends: 20858 [2024-10-12 20:36:40,460 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-12 20:36:40,461 INFO L432 NwaCegarLoop]: 715 mSDtfsCounter, 228 mSDsluCounter, 526 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 1241 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:36:40,461 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [228 Valid, 1241 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:36:40,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20858 states. [2024-10-12 20:36:40,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20858 to 20856. [2024-10-12 20:36:40,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20856 states, 20855 states have (on average 1.6355789978422441) internal successors, (34110), 20855 states have internal predecessors, (34110), 0 states have call successors, (0), 0 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-12 20:36:40,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20856 states to 20856 states and 34110 transitions. [2024-10-12 20:36:40,755 INFO L78 Accepts]: Start accepts. Automaton has 20856 states and 34110 transitions. Word has length 133 [2024-10-12 20:36:40,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:36:40,756 INFO L471 AbstractCegarLoop]: Abstraction has 20856 states and 34110 transitions. [2024-10-12 20:36:40,756 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 0 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-12 20:36:40,756 INFO L276 IsEmpty]: Start isEmpty. Operand 20856 states and 34110 transitions. [2024-10-12 20:36:40,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-10-12 20:36:40,759 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:36:40,759 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:36:40,759 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-12 20:36:40,759 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:36:40,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:36:40,760 INFO L85 PathProgramCache]: Analyzing trace with hash -1410705485, now seen corresponding path program 1 times [2024-10-12 20:36:40,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:36:40,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671212231] [2024-10-12 20:36:40,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:36:40,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:36:40,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:36:40,982 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-12 20:36:40,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:36:40,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671212231] [2024-10-12 20:36:40,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671212231] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:36:40,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:36:40,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:36:40,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922519317] [2024-10-12 20:36:40,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:36:40,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:36:40,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:36:40,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:36:40,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:36:40,984 INFO L87 Difference]: Start difference. First operand 20856 states and 34110 transitions. Second operand has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 0 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-12 20:36:41,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:36:41,161 INFO L93 Difference]: Finished difference Result 46074 states and 75424 transitions. [2024-10-12 20:36:41,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:36:41,161 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 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 133 [2024-10-12 20:36:41,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:36:41,213 INFO L225 Difference]: With dead ends: 46074 [2024-10-12 20:36:41,213 INFO L226 Difference]: Without dead ends: 31710 [2024-10-12 20:36:41,232 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:36:41,233 INFO L432 NwaCegarLoop]: 681 mSDtfsCounter, 221 mSDsluCounter, 527 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 1208 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:36:41,233 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 1208 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:36:41,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31710 states. [2024-10-12 20:36:41,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31710 to 31708. [2024-10-12 20:36:41,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31708 states, 31707 states have (on average 1.6303024568707225) internal successors, (51692), 31707 states have internal predecessors, (51692), 0 states have call successors, (0), 0 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-12 20:36:41,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31708 states to 31708 states and 51692 transitions. [2024-10-12 20:36:41,757 INFO L78 Accepts]: Start accepts. Automaton has 31708 states and 51692 transitions. Word has length 133 [2024-10-12 20:36:41,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:36:41,757 INFO L471 AbstractCegarLoop]: Abstraction has 31708 states and 51692 transitions. [2024-10-12 20:36:41,757 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 0 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-12 20:36:41,758 INFO L276 IsEmpty]: Start isEmpty. Operand 31708 states and 51692 transitions. [2024-10-12 20:36:41,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-10-12 20:36:41,759 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:36:41,759 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:36:41,759 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-12 20:36:41,760 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:36:41,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:36:41,760 INFO L85 PathProgramCache]: Analyzing trace with hash -641806061, now seen corresponding path program 1 times [2024-10-12 20:36:41,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:36:41,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434197765] [2024-10-12 20:36:41,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:36:41,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:36:41,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:36:41,980 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-12 20:36:41,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:36:41,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434197765] [2024-10-12 20:36:41,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1434197765] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:36:41,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:36:41,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:36:41,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634335888] [2024-10-12 20:36:41,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:36:41,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:36:41,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:36:41,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:36:41,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:36:41,982 INFO L87 Difference]: Start difference. First operand 31708 states and 51692 transitions. Second operand has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 0 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-12 20:36:42,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:36:42,165 INFO L93 Difference]: Finished difference Result 61884 states and 101018 transitions. [2024-10-12 20:36:42,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:36:42,166 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 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 133 [2024-10-12 20:36:42,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:36:42,227 INFO L225 Difference]: With dead ends: 61884 [2024-10-12 20:36:42,227 INFO L226 Difference]: Without dead ends: 44438 [2024-10-12 20:36:42,256 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-12 20:36:42,256 INFO L432 NwaCegarLoop]: 648 mSDtfsCounter, 214 mSDsluCounter, 528 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 1176 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:36:42,257 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 1176 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:36:42,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44438 states. [2024-10-12 20:36:42,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44438 to 44436. [2024-10-12 20:36:42,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44436 states, 44435 states have (on average 1.6252503657027118) internal successors, (72218), 44435 states have internal predecessors, (72218), 0 states have call successors, (0), 0 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-12 20:36:42,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44436 states to 44436 states and 72218 transitions. [2024-10-12 20:36:42,896 INFO L78 Accepts]: Start accepts. Automaton has 44436 states and 72218 transitions. Word has length 133 [2024-10-12 20:36:42,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:36:42,896 INFO L471 AbstractCegarLoop]: Abstraction has 44436 states and 72218 transitions. [2024-10-12 20:36:42,897 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 0 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-12 20:36:42,897 INFO L276 IsEmpty]: Start isEmpty. Operand 44436 states and 72218 transitions. [2024-10-12 20:36:42,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-10-12 20:36:42,898 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:36:42,899 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:36:42,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-12 20:36:42,899 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:36:42,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:36:42,900 INFO L85 PathProgramCache]: Analyzing trace with hash 1934015028, now seen corresponding path program 1 times [2024-10-12 20:36:42,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:36:42,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853832695] [2024-10-12 20:36:42,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:36:42,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:36:42,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:36:43,229 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-12 20:36:43,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:36:43,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853832695] [2024-10-12 20:36:43,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [853832695] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:36:43,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:36:43,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 20:36:43,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696192991] [2024-10-12 20:36:43,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:36:43,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 20:36:43,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:36:43,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 20:36:43,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 20:36:43,236 INFO L87 Difference]: Start difference. First operand 44436 states and 72218 transitions. Second operand has 4 states, 4 states have (on average 33.25) internal successors, (133), 4 states have internal predecessors, (133), 0 states have call successors, (0), 0 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-12 20:36:43,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:36:43,835 INFO L93 Difference]: Finished difference Result 141592 states and 230509 transitions. [2024-10-12 20:36:43,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 20:36:43,836 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.25) internal successors, (133), 4 states have internal predecessors, (133), 0 states have call successors, (0), 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 133 [2024-10-12 20:36:43,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:36:43,987 INFO L225 Difference]: With dead ends: 141592 [2024-10-12 20:36:43,988 INFO L226 Difference]: Without dead ends: 97568 [2024-10-12 20:36:44,028 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-12 20:36:44,029 INFO L432 NwaCegarLoop]: 559 mSDtfsCounter, 748 mSDsluCounter, 1337 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 748 SdHoareTripleChecker+Valid, 1896 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:36:44,029 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [748 Valid, 1896 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:36:44,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97568 states. [2024-10-12 20:36:44,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97568 to 70868. [2024-10-12 20:36:45,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70868 states, 70867 states have (on average 1.6216010272764474) internal successors, (114918), 70867 states have internal predecessors, (114918), 0 states have call successors, (0), 0 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-12 20:36:45,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70868 states to 70868 states and 114918 transitions. [2024-10-12 20:36:45,166 INFO L78 Accepts]: Start accepts. Automaton has 70868 states and 114918 transitions. Word has length 133 [2024-10-12 20:36:45,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:36:45,166 INFO L471 AbstractCegarLoop]: Abstraction has 70868 states and 114918 transitions. [2024-10-12 20:36:45,166 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.25) internal successors, (133), 4 states have internal predecessors, (133), 0 states have call successors, (0), 0 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-12 20:36:45,166 INFO L276 IsEmpty]: Start isEmpty. Operand 70868 states and 114918 transitions. [2024-10-12 20:36:45,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-10-12 20:36:45,168 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:36:45,168 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:36:45,168 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-12 20:36:45,169 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:36:45,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:36:45,169 INFO L85 PathProgramCache]: Analyzing trace with hash 1335786477, now seen corresponding path program 1 times [2024-10-12 20:36:45,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:36:45,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027046409] [2024-10-12 20:36:45,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:36:45,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:36:45,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:36:45,264 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-12 20:36:45,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:36:45,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027046409] [2024-10-12 20:36:45,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1027046409] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:36:45,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:36:45,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:36:45,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955551227] [2024-10-12 20:36:45,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:36:45,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:36:45,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:36:45,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:36:45,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:36:45,266 INFO L87 Difference]: Start difference. First operand 70868 states and 114918 transitions. Second operand has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 0 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-12 20:36:46,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:36:46,157 INFO L93 Difference]: Finished difference Result 156081 states and 254328 transitions. [2024-10-12 20:36:46,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:36:46,158 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 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 133 [2024-10-12 20:36:46,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:36:46,312 INFO L225 Difference]: With dead ends: 156081 [2024-10-12 20:36:46,312 INFO L226 Difference]: Without dead ends: 105866 [2024-10-12 20:36:46,368 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-12 20:36:46,369 INFO L432 NwaCegarLoop]: 762 mSDtfsCounter, 235 mSDsluCounter, 525 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 1287 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:36:46,369 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [235 Valid, 1287 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:36:46,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105866 states. [2024-10-12 20:36:47,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105866 to 105864. [2024-10-12 20:36:47,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105864 states, 105863 states have (on average 1.618771431000444) internal successors, (171368), 105863 states have internal predecessors, (171368), 0 states have call successors, (0), 0 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-12 20:36:48,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105864 states to 105864 states and 171368 transitions. [2024-10-12 20:36:48,057 INFO L78 Accepts]: Start accepts. Automaton has 105864 states and 171368 transitions. Word has length 133 [2024-10-12 20:36:48,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:36:48,057 INFO L471 AbstractCegarLoop]: Abstraction has 105864 states and 171368 transitions. [2024-10-12 20:36:48,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 0 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-12 20:36:48,057 INFO L276 IsEmpty]: Start isEmpty. Operand 105864 states and 171368 transitions. [2024-10-12 20:36:48,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-10-12 20:36:48,059 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:36:48,059 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:36:48,059 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-12 20:36:48,059 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:36:48,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:36:48,060 INFO L85 PathProgramCache]: Analyzing trace with hash 1645265701, now seen corresponding path program 1 times [2024-10-12 20:36:48,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:36:48,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094847408] [2024-10-12 20:36:48,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:36:48,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:36:48,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:36:48,333 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-12 20:36:48,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:36:48,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094847408] [2024-10-12 20:36:48,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2094847408] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:36:48,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:36:48,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 20:36:48,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405709545] [2024-10-12 20:36:48,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:36:48,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 20:36:48,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:36:48,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 20:36:48,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-12 20:36:48,335 INFO L87 Difference]: Start difference. First operand 105864 states and 171368 transitions. Second operand has 6 states, 6 states have (on average 22.5) internal successors, (135), 6 states have internal predecessors, (135), 0 states have call successors, (0), 0 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-12 20:36:49,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:36:49,607 INFO L93 Difference]: Finished difference Result 211470 states and 342321 transitions. [2024-10-12 20:36:49,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 20:36:49,608 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.5) internal successors, (135), 6 states have internal predecessors, (135), 0 states have call successors, (0), 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 135 [2024-10-12 20:36:49,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:36:49,790 INFO L225 Difference]: With dead ends: 211470 [2024-10-12 20:36:49,790 INFO L226 Difference]: Without dead ends: 105866 [2024-10-12 20:36:49,897 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-10-12 20:36:49,898 INFO L432 NwaCegarLoop]: 567 mSDtfsCounter, 654 mSDsluCounter, 1605 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 654 SdHoareTripleChecker+Valid, 2172 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:36:49,898 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [654 Valid, 2172 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:36:49,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105866 states. [2024-10-12 20:36:51,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105866 to 105864. [2024-10-12 20:36:51,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105864 states, 105863 states have (on average 1.612867574128827) internal successors, (170743), 105863 states have internal predecessors, (170743), 0 states have call successors, (0), 0 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-12 20:36:51,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105864 states to 105864 states and 170743 transitions. [2024-10-12 20:36:51,483 INFO L78 Accepts]: Start accepts. Automaton has 105864 states and 170743 transitions. Word has length 135 [2024-10-12 20:36:51,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:36:51,483 INFO L471 AbstractCegarLoop]: Abstraction has 105864 states and 170743 transitions. [2024-10-12 20:36:51,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.5) internal successors, (135), 6 states have internal predecessors, (135), 0 states have call successors, (0), 0 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-12 20:36:51,483 INFO L276 IsEmpty]: Start isEmpty. Operand 105864 states and 170743 transitions. [2024-10-12 20:36:51,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-10-12 20:36:51,484 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:36:51,485 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 20:36:51,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-12 20:36:51,485 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:36:51,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:36:51,485 INFO L85 PathProgramCache]: Analyzing trace with hash -2104616215, now seen corresponding path program 1 times [2024-10-12 20:36:51,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:36:51,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850863594] [2024-10-12 20:36:51,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:36:51,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:36:51,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:36:52,315 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-12 20:36:52,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:36:52,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850863594] [2024-10-12 20:36:52,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850863594] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:36:52,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:36:52,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 20:36:52,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138590416] [2024-10-12 20:36:52,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:36:52,317 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 20:36:52,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:36:52,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 20:36:52,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-12 20:36:52,317 INFO L87 Difference]: Start difference. First operand 105864 states and 170743 transitions. Second operand has 6 states, 6 states have (on average 23.0) internal successors, (138), 6 states have internal predecessors, (138), 0 states have call successors, (0), 0 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-12 20:36:53,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:36:53,015 INFO L93 Difference]: Finished difference Result 309468 states and 499581 transitions. [2024-10-12 20:36:53,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 20:36:53,016 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 23.0) internal successors, (138), 6 states have internal predecessors, (138), 0 states have call successors, (0), 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 138 [2024-10-12 20:36:53,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:36:53,857 INFO L225 Difference]: With dead ends: 309468 [2024-10-12 20:36:53,858 INFO L226 Difference]: Without dead ends: 203864 [2024-10-12 20:36:53,936 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-10-12 20:36:53,936 INFO L432 NwaCegarLoop]: 558 mSDtfsCounter, 863 mSDsluCounter, 1623 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 863 SdHoareTripleChecker+Valid, 2181 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:36:53,937 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [863 Valid, 2181 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:36:54,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203864 states. [2024-10-12 20:36:56,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203864 to 203862. [2024-10-12 20:36:56,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203862 states, 203861 states have (on average 1.6051917728256018) internal successors, (327236), 203861 states have internal predecessors, (327236), 0 states have call successors, (0), 0 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-12 20:36:57,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203862 states to 203862 states and 327236 transitions. [2024-10-12 20:36:57,476 INFO L78 Accepts]: Start accepts. Automaton has 203862 states and 327236 transitions. Word has length 138 [2024-10-12 20:36:57,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:36:57,477 INFO L471 AbstractCegarLoop]: Abstraction has 203862 states and 327236 transitions. [2024-10-12 20:36:57,477 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.0) internal successors, (138), 6 states have internal predecessors, (138), 0 states have call successors, (0), 0 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-12 20:36:57,477 INFO L276 IsEmpty]: Start isEmpty. Operand 203862 states and 327236 transitions. [2024-10-12 20:36:57,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-10-12 20:36:57,478 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:36:57,478 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:36:57,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-12 20:36:57,478 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:36:57,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:36:57,479 INFO L85 PathProgramCache]: Analyzing trace with hash -820502302, now seen corresponding path program 1 times [2024-10-12 20:36:57,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:36:57,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051777974] [2024-10-12 20:36:57,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:36:57,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:36:57,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:36:58,752 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-12 20:36:58,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:36:58,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051777974] [2024-10-12 20:36:58,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051777974] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:36:58,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:36:58,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 20:36:58,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976179327] [2024-10-12 20:36:58,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:36:58,753 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 20:36:58,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:36:58,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 20:36:58,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 20:36:58,753 INFO L87 Difference]: Start difference. First operand 203862 states and 327236 transitions. Second operand has 5 states, 5 states have (on average 27.8) internal successors, (139), 5 states have internal predecessors, (139), 0 states have call successors, (0), 0 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-12 20:36:59,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:36:59,535 INFO L93 Difference]: Finished difference Result 207736 states and 333045 transitions. [2024-10-12 20:36:59,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 20:36:59,536 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 27.8) internal successors, (139), 5 states have internal predecessors, (139), 0 states have call successors, (0), 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 139 [2024-10-12 20:36:59,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:36:59,922 INFO L225 Difference]: With dead ends: 207736 [2024-10-12 20:36:59,922 INFO L226 Difference]: Without dead ends: 207734 [2024-10-12 20:36:59,993 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 20:36:59,994 INFO L432 NwaCegarLoop]: 567 mSDtfsCounter, 0 mSDsluCounter, 1687 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2254 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:36:59,994 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2254 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:37:00,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207734 states. [2024-10-12 20:37:03,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207734 to 207734. [2024-10-12 20:37:03,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207734 states, 207733 states have (on average 1.5937814405992308) internal successors, (331081), 207733 states have internal predecessors, (331081), 0 states have call successors, (0), 0 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-12 20:37:04,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207734 states to 207734 states and 331081 transitions. [2024-10-12 20:37:04,037 INFO L78 Accepts]: Start accepts. Automaton has 207734 states and 331081 transitions. Word has length 139 [2024-10-12 20:37:04,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:37:04,038 INFO L471 AbstractCegarLoop]: Abstraction has 207734 states and 331081 transitions. [2024-10-12 20:37:04,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.8) internal successors, (139), 5 states have internal predecessors, (139), 0 states have call successors, (0), 0 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-12 20:37:04,038 INFO L276 IsEmpty]: Start isEmpty. Operand 207734 states and 331081 transitions. [2024-10-12 20:37:04,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-10-12 20:37:04,050 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:37:04,051 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 20:37:04,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-12 20:37:04,051 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:37:04,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:37:04,052 INFO L85 PathProgramCache]: Analyzing trace with hash -1542140681, now seen corresponding path program 1 times [2024-10-12 20:37:04,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:37:04,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301952591] [2024-10-12 20:37:04,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:37:04,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:37:04,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:37:05,309 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-12 20:37:05,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:37:05,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301952591] [2024-10-12 20:37:05,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [301952591] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:37:05,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:37:05,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 20:37:05,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558914522] [2024-10-12 20:37:05,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:37:05,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 20:37:05,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:37:05,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 20:37:05,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-12 20:37:05,311 INFO L87 Difference]: Start difference. First operand 207734 states and 331081 transitions. Second operand has 6 states, 6 states have (on average 27.833333333333332) internal successors, (167), 6 states have internal predecessors, (167), 0 states have call successors, (0), 0 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-12 20:37:08,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:37:08,022 INFO L93 Difference]: Finished difference Result 565656 states and 903742 transitions. [2024-10-12 20:37:08,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 20:37:08,022 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 27.833333333333332) internal successors, (167), 6 states have internal predecessors, (167), 0 states have call successors, (0), 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 175 [2024-10-12 20:37:08,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:37:08,905 INFO L225 Difference]: With dead ends: 565656 [2024-10-12 20:37:08,905 INFO L226 Difference]: Without dead ends: 474404 [2024-10-12 20:37:08,996 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-10-12 20:37:08,996 INFO L432 NwaCegarLoop]: 824 mSDtfsCounter, 1501 mSDsluCounter, 2660 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1501 SdHoareTripleChecker+Valid, 3484 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:37:08,996 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1501 Valid, 3484 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:37:09,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474404 states. [2024-10-12 20:37:14,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474404 to 333614. [2024-10-12 20:37:14,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 333614 states, 333613 states have (on average 1.592249103002581) internal successors, (531195), 333613 states have internal predecessors, (531195), 0 states have call successors, (0), 0 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-12 20:37:15,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333614 states to 333614 states and 531195 transitions. [2024-10-12 20:37:15,544 INFO L78 Accepts]: Start accepts. Automaton has 333614 states and 531195 transitions. Word has length 175 [2024-10-12 20:37:15,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:37:15,544 INFO L471 AbstractCegarLoop]: Abstraction has 333614 states and 531195 transitions. [2024-10-12 20:37:15,545 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.833333333333332) internal successors, (167), 6 states have internal predecessors, (167), 0 states have call successors, (0), 0 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-12 20:37:15,545 INFO L276 IsEmpty]: Start isEmpty. Operand 333614 states and 531195 transitions. [2024-10-12 20:37:15,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-10-12 20:37:15,555 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:37:15,555 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 20:37:15,556 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-12 20:37:15,556 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:37:15,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:37:15,557 INFO L85 PathProgramCache]: Analyzing trace with hash 1805766923, now seen corresponding path program 1 times [2024-10-12 20:37:15,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:37:15,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062336813] [2024-10-12 20:37:15,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:37:15,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:37:15,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:37:15,751 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-12 20:37:15,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:37:15,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062336813] [2024-10-12 20:37:15,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062336813] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:37:15,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:37:15,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 20:37:15,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868907012] [2024-10-12 20:37:15,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:37:15,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 20:37:15,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:37:15,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 20:37:15,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-12 20:37:15,753 INFO L87 Difference]: Start difference. First operand 333614 states and 531195 transitions. Second operand has 6 states, 6 states have (on average 26.666666666666668) internal successors, (160), 6 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:37:19,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:37:19,342 INFO L93 Difference]: Finished difference Result 623672 states and 996666 transitions. [2024-10-12 20:37:19,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 20:37:19,346 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.666666666666668) internal successors, (160), 6 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 175 [2024-10-12 20:37:19,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:37:20,553 INFO L225 Difference]: With dead ends: 623672 [2024-10-12 20:37:20,553 INFO L226 Difference]: Without dead ends: 532420 [2024-10-12 20:37:20,702 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-10-12 20:37:20,702 INFO L432 NwaCegarLoop]: 816 mSDtfsCounter, 1611 mSDsluCounter, 2185 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1611 SdHoareTripleChecker+Valid, 3001 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-12 20:37:20,703 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1611 Valid, 3001 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-12 20:37:21,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532420 states.