./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem17_label46.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem17_label46.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 41cafc53a40b6e7779bbda9324b8e7811f318944543219bcda44525ed08008a3 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-09 19:54:25,216 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 19:54:25,286 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 19:54:25,290 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 19:54:25,291 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 19:54:25,310 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 19:54:25,311 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 19:54:25,311 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 19:54:25,312 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 19:54:25,312 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 19:54:25,313 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 19:54:25,313 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 19:54:25,313 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 19:54:25,314 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 19:54:25,314 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 19:54:25,315 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 19:54:25,315 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 19:54:25,315 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 19:54:25,316 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 19:54:25,316 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 19:54:25,316 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 19:54:25,317 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 19:54:25,317 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 19:54:25,317 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 19:54:25,318 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 19:54:25,318 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 19:54:25,318 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 19:54:25,319 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 19:54:25,319 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-09 19:54:25,319 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 19:54:25,319 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 19:54:25,320 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 19:54:25,320 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 19:54:25,330 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 19:54:25,330 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 19:54:25,331 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 19:54:25,331 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 19:54:25,331 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 19:54:25,331 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 19:54:25,332 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 19:54:25,332 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 19:54:25,332 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 19:54:25,333 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 -> 41cafc53a40b6e7779bbda9324b8e7811f318944543219bcda44525ed08008a3 [2024-11-09 19:54:25,568 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 19:54:25,592 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 19:54:25,596 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 19:54:25,597 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 19:54:25,597 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 19:54:25,599 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem17_label46.c [2024-11-09 19:54:26,989 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 19:54:27,361 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 19:54:27,363 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem17_label46.c [2024-11-09 19:54:27,399 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3e5de12eb/5ea0a3014f29421482d87bf9535f9ed9/FLAG41e804272 [2024-11-09 19:54:27,415 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3e5de12eb/5ea0a3014f29421482d87bf9535f9ed9 [2024-11-09 19:54:27,419 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 19:54:27,423 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 19:54:27,426 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 19:54:27,426 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 19:54:27,431 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 19:54:27,432 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:54:27" (1/1) ... [2024-11-09 19:54:27,433 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2630aefe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:54:27, skipping insertion in model container [2024-11-09 19:54:27,433 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:54:27" (1/1) ... [2024-11-09 19:54:27,514 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 19:54:27,739 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem17_label46.c[1649,1662] [2024-11-09 19:54:28,334 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 19:54:28,344 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 19:54:28,391 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem17_label46.c[1649,1662] [2024-11-09 19:54:28,661 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 19:54:28,685 INFO L204 MainTranslator]: Completed translation [2024-11-09 19:54:28,685 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:54:28 WrapperNode [2024-11-09 19:54:28,686 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 19:54:28,687 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 19:54:28,687 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 19:54:28,687 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 19:54:28,693 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:54:28" (1/1) ... [2024-11-09 19:54:28,743 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:54:28" (1/1) ... [2024-11-09 19:54:28,969 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 2612 [2024-11-09 19:54:28,970 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 19:54:28,970 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 19:54:28,971 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 19:54:28,971 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 19:54:28,981 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:54:28" (1/1) ... [2024-11-09 19:54:28,981 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:54:28" (1/1) ... [2024-11-09 19:54:29,024 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:54:28" (1/1) ... [2024-11-09 19:54:29,229 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-09 19:54:29,229 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:54:28" (1/1) ... [2024-11-09 19:54:29,230 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:54:28" (1/1) ... [2024-11-09 19:54:29,369 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:54:28" (1/1) ... [2024-11-09 19:54:29,387 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:54:28" (1/1) ... [2024-11-09 19:54:29,401 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:54:28" (1/1) ... [2024-11-09 19:54:29,416 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:54:28" (1/1) ... [2024-11-09 19:54:29,449 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 19:54:29,450 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-09 19:54:29,450 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-09 19:54:29,450 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-09 19:54:29,451 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:54:28" (1/1) ... [2024-11-09 19:54:29,456 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 19:54:29,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 19:54:29,486 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 19:54:29,491 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 19:54:29,528 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 19:54:29,528 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 19:54:29,529 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 19:54:29,529 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 19:54:29,587 INFO L256 CfgBuilder]: Building ICFG [2024-11-09 19:54:29,588 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 19:54:33,322 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1653: havoc calculate_output_#t~ret7#1; [2024-11-09 19:54:33,528 INFO L? ?]: Removed 949 outVars from TransFormulas that were not future-live. [2024-11-09 19:54:33,528 INFO L307 CfgBuilder]: Performing block encoding [2024-11-09 19:54:33,568 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 19:54:33,568 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 19:54:33,571 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 07:54:33 BoogieIcfgContainer [2024-11-09 19:54:33,571 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-09 19:54:33,573 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 19:54:33,574 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 19:54:33,578 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 19:54:33,578 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 07:54:27" (1/3) ... [2024-11-09 19:54:33,579 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49a7462f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:54:33, skipping insertion in model container [2024-11-09 19:54:33,579 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:54:28" (2/3) ... [2024-11-09 19:54:33,579 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49a7462f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:54:33, skipping insertion in model container [2024-11-09 19:54:33,580 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 07:54:33" (3/3) ... [2024-11-09 19:54:33,581 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem17_label46.c [2024-11-09 19:54:33,600 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 19:54:33,601 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 19:54:33,687 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 19:54:33,696 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;@436b622e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 19:54:33,697 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 19:54:33,704 INFO L276 IsEmpty]: Start isEmpty. Operand has 593 states, 591 states have (on average 2.4077834179357023) internal successors, (1423), 592 states have internal predecessors, (1423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:54:33,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-09 19:54:33,713 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:54:33,714 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:54:33,715 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:54:33,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:54:33,722 INFO L85 PathProgramCache]: Analyzing trace with hash -1384221134, now seen corresponding path program 1 times [2024-11-09 19:54:33,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:54:33,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308490228] [2024-11-09 19:54:33,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:54:33,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:54:33,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:54:33,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 19:54:33,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:54:33,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308490228] [2024-11-09 19:54:33,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308490228] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:54:33,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:54:33,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 19:54:33,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524220144] [2024-11-09 19:54:33,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:54:33,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:54:33,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:54:34,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:54:34,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:54:34,017 INFO L87 Difference]: Start difference. First operand has 593 states, 591 states have (on average 2.4077834179357023) internal successors, (1423), 592 states have internal predecessors, (1423), 0 states have call successors, (0), 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 4.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:54:37,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:54:37,095 INFO L93 Difference]: Finished difference Result 1673 states and 4141 transitions. [2024-11-09 19:54:37,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:54:37,097 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 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 12 [2024-11-09 19:54:37,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:54:37,125 INFO L225 Difference]: With dead ends: 1673 [2024-11-09 19:54:37,125 INFO L226 Difference]: Without dead ends: 1001 [2024-11-09 19:54:37,133 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:54:37,138 INFO L432 NwaCegarLoop]: 215 mSDtfsCounter, 893 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 2282 mSolverCounterSat, 396 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 893 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 2678 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 396 IncrementalHoareTripleChecker+Valid, 2282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-11-09 19:54:37,140 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [893 Valid, 279 Invalid, 2678 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [396 Valid, 2282 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-11-09 19:54:37,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1001 states. [2024-11-09 19:54:37,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1001 to 985. [2024-11-09 19:54:37,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 985 states, 984 states have (on average 2.432926829268293) internal successors, (2394), 984 states have internal predecessors, (2394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:54:37,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 985 states to 985 states and 2394 transitions. [2024-11-09 19:54:37,244 INFO L78 Accepts]: Start accepts. Automaton has 985 states and 2394 transitions. Word has length 12 [2024-11-09 19:54:37,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:54:37,245 INFO L471 AbstractCegarLoop]: Abstraction has 985 states and 2394 transitions. [2024-11-09 19:54:37,245 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:54:37,245 INFO L276 IsEmpty]: Start isEmpty. Operand 985 states and 2394 transitions. [2024-11-09 19:54:37,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-09 19:54:37,247 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:54:37,248 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:54:37,248 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 19:54:37,248 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:54:37,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:54:37,249 INFO L85 PathProgramCache]: Analyzing trace with hash -246973317, now seen corresponding path program 1 times [2024-11-09 19:54:37,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:54:37,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029116064] [2024-11-09 19:54:37,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:54:37,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:54:37,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:54:37,576 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 19:54:37,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:54:37,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029116064] [2024-11-09 19:54:37,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029116064] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:54:37,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:54:37,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 19:54:37,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008618860] [2024-11-09 19:54:37,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:54:37,583 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:54:37,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:54:37,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:54:37,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:54:37,585 INFO L87 Difference]: Start difference. First operand 985 states and 2394 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 2 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:54:40,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:54:40,752 INFO L93 Difference]: Finished difference Result 2851 states and 7040 transitions. [2024-11-09 19:54:40,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:54:40,754 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 2 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2024-11-09 19:54:40,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:54:40,763 INFO L225 Difference]: With dead ends: 2851 [2024-11-09 19:54:40,763 INFO L226 Difference]: Without dead ends: 1868 [2024-11-09 19:54:40,767 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:54:40,768 INFO L432 NwaCegarLoop]: 431 mSDtfsCounter, 766 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 2148 mSolverCounterSat, 284 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 766 SdHoareTripleChecker+Valid, 508 SdHoareTripleChecker+Invalid, 2432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 284 IncrementalHoareTripleChecker+Valid, 2148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-11-09 19:54:40,769 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [766 Valid, 508 Invalid, 2432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [284 Valid, 2148 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-11-09 19:54:40,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1868 states. [2024-11-09 19:54:40,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1868 to 1859. [2024-11-09 19:54:40,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1859 states, 1858 states have (on average 2.258880516684607) internal successors, (4197), 1858 states have internal predecessors, (4197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:54:40,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1859 states to 1859 states and 4197 transitions. [2024-11-09 19:54:40,816 INFO L78 Accepts]: Start accepts. Automaton has 1859 states and 4197 transitions. Word has length 78 [2024-11-09 19:54:40,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:54:40,818 INFO L471 AbstractCegarLoop]: Abstraction has 1859 states and 4197 transitions. [2024-11-09 19:54:40,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 2 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:54:40,818 INFO L276 IsEmpty]: Start isEmpty. Operand 1859 states and 4197 transitions. [2024-11-09 19:54:40,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-11-09 19:54:40,822 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:54:40,823 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:54:40,824 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 19:54:40,824 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:54:40,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:54:40,824 INFO L85 PathProgramCache]: Analyzing trace with hash -106831235, now seen corresponding path program 1 times [2024-11-09 19:54:40,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:54:40,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051406664] [2024-11-09 19:54:40,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:54:40,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:54:40,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:54:41,122 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 19:54:41,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:54:41,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051406664] [2024-11-09 19:54:41,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051406664] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:54:41,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:54:41,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 19:54:41,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095956931] [2024-11-09 19:54:41,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:54:41,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:54:41,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:54:41,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:54:41,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:54:41,127 INFO L87 Difference]: Start difference. First operand 1859 states and 4197 transitions. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 2 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:54:43,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:54:43,298 INFO L93 Difference]: Finished difference Result 4150 states and 9272 transitions. [2024-11-09 19:54:43,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:54:43,299 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 2 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2024-11-09 19:54:43,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:54:43,308 INFO L225 Difference]: With dead ends: 4150 [2024-11-09 19:54:43,308 INFO L226 Difference]: Without dead ends: 2293 [2024-11-09 19:54:43,311 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:54:43,312 INFO L432 NwaCegarLoop]: 443 mSDtfsCounter, 719 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 2086 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 719 SdHoareTripleChecker+Valid, 502 SdHoareTripleChecker+Invalid, 2109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 2086 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-09 19:54:43,312 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [719 Valid, 502 Invalid, 2109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 2086 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-09 19:54:43,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2293 states. [2024-11-09 19:54:43,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2293 to 2289. [2024-11-09 19:54:43,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2289 states, 2288 states have (on average 2.208479020979021) internal successors, (5053), 2288 states have internal predecessors, (5053), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:54:43,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2289 states to 2289 states and 5053 transitions. [2024-11-09 19:54:43,353 INFO L78 Accepts]: Start accepts. Automaton has 2289 states and 5053 transitions. Word has length 88 [2024-11-09 19:54:43,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:54:43,354 INFO L471 AbstractCegarLoop]: Abstraction has 2289 states and 5053 transitions. [2024-11-09 19:54:43,354 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 2 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:54:43,354 INFO L276 IsEmpty]: Start isEmpty. Operand 2289 states and 5053 transitions. [2024-11-09 19:54:43,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-09 19:54:43,356 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:54:43,356 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:54:43,356 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 19:54:43,356 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:54:43,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:54:43,358 INFO L85 PathProgramCache]: Analyzing trace with hash 1120680435, now seen corresponding path program 1 times [2024-11-09 19:54:43,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:54:43,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495494107] [2024-11-09 19:54:43,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:54:43,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:54:43,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:54:43,528 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 19:54:43,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:54:43,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495494107] [2024-11-09 19:54:43,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495494107] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:54:43,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:54:43,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 19:54:43,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101094488] [2024-11-09 19:54:43,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:54:43,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:54:43,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:54:43,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:54:43,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:54:43,531 INFO L87 Difference]: Start difference. First operand 2289 states and 5053 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:54:45,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:54:45,796 INFO L93 Difference]: Finished difference Result 6735 states and 14978 transitions. [2024-11-09 19:54:45,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:54:45,797 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 0 states have call successors, (0), 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 99 [2024-11-09 19:54:45,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:54:45,814 INFO L225 Difference]: With dead ends: 6735 [2024-11-09 19:54:45,814 INFO L226 Difference]: Without dead ends: 4448 [2024-11-09 19:54:45,818 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:54:45,819 INFO L432 NwaCegarLoop]: 521 mSDtfsCounter, 744 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 2109 mSolverCounterSat, 325 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 744 SdHoareTripleChecker+Valid, 596 SdHoareTripleChecker+Invalid, 2434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 325 IncrementalHoareTripleChecker+Valid, 2109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-09 19:54:45,821 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [744 Valid, 596 Invalid, 2434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [325 Valid, 2109 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-09 19:54:45,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4448 states. [2024-11-09 19:54:45,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4448 to 4444. [2024-11-09 19:54:45,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4444 states, 4443 states have (on average 2.072473553905019) internal successors, (9208), 4443 states have internal predecessors, (9208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:54:45,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4444 states to 4444 states and 9208 transitions. [2024-11-09 19:54:45,906 INFO L78 Accepts]: Start accepts. Automaton has 4444 states and 9208 transitions. Word has length 99 [2024-11-09 19:54:45,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:54:45,907 INFO L471 AbstractCegarLoop]: Abstraction has 4444 states and 9208 transitions. [2024-11-09 19:54:45,907 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:54:45,907 INFO L276 IsEmpty]: Start isEmpty. Operand 4444 states and 9208 transitions. [2024-11-09 19:54:45,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-09 19:54:45,908 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:54:45,909 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:54:45,909 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 19:54:45,909 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:54:45,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:54:45,909 INFO L85 PathProgramCache]: Analyzing trace with hash 314816138, now seen corresponding path program 1 times [2024-11-09 19:54:45,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:54:45,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54875207] [2024-11-09 19:54:45,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:54:45,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:54:45,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:54:46,317 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 19:54:46,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:54:46,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54875207] [2024-11-09 19:54:46,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54875207] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:54:46,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:54:46,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:54:46,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096457187] [2024-11-09 19:54:46,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:54:46,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 19:54:46,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:54:46,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 19:54:46,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 19:54:46,323 INFO L87 Difference]: Start difference. First operand 4444 states and 9208 transitions. Second operand has 4 states, 4 states have (on average 31.0) internal successors, (124), 3 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:54:48,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:54:48,971 INFO L93 Difference]: Finished difference Result 9312 states and 19210 transitions. [2024-11-09 19:54:48,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 19:54:48,971 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 31.0) internal successors, (124), 3 states have internal predecessors, (124), 0 states have call successors, (0), 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 124 [2024-11-09 19:54:48,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:54:48,988 INFO L225 Difference]: With dead ends: 9312 [2024-11-09 19:54:48,988 INFO L226 Difference]: Without dead ends: 4870 [2024-11-09 19:54:48,993 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 19:54:48,994 INFO L432 NwaCegarLoop]: 513 mSDtfsCounter, 888 mSDsluCounter, 348 mSDsCounter, 0 mSdLazyCounter, 3029 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 888 SdHoareTripleChecker+Valid, 861 SdHoareTripleChecker+Invalid, 3034 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 3029 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-09 19:54:48,994 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [888 Valid, 861 Invalid, 3034 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 3029 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-11-09 19:54:48,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4870 states. [2024-11-09 19:54:49,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4870 to 4870. [2024-11-09 19:54:49,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4870 states, 4869 states have (on average 2.053399055247484) internal successors, (9998), 4869 states have internal predecessors, (9998), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:54:49,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4870 states to 4870 states and 9998 transitions. [2024-11-09 19:54:49,074 INFO L78 Accepts]: Start accepts. Automaton has 4870 states and 9998 transitions. Word has length 124 [2024-11-09 19:54:49,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:54:49,075 INFO L471 AbstractCegarLoop]: Abstraction has 4870 states and 9998 transitions. [2024-11-09 19:54:49,075 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.0) internal successors, (124), 3 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:54:49,075 INFO L276 IsEmpty]: Start isEmpty. Operand 4870 states and 9998 transitions. [2024-11-09 19:54:49,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-11-09 19:54:49,078 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:54:49,079 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-09 19:54:49,079 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 19:54:49,079 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:54:49,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:54:49,080 INFO L85 PathProgramCache]: Analyzing trace with hash -1753516625, now seen corresponding path program 1 times [2024-11-09 19:54:49,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:54:49,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312960058] [2024-11-09 19:54:49,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:54:49,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:54:49,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:54:49,245 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2024-11-09 19:54:49,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:54:49,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312960058] [2024-11-09 19:54:49,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [312960058] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:54:49,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:54:49,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 19:54:49,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825513230] [2024-11-09 19:54:49,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:54:49,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:54:49,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:54:49,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:54:49,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:54:49,249 INFO L87 Difference]: Start difference. First operand 4870 states and 9998 transitions. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 2 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:54:51,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:54:51,740 INFO L93 Difference]: Finished difference Result 12733 states and 26565 transitions. [2024-11-09 19:54:51,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:54:51,741 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 2 states have internal predecessors, (85), 0 states have call successors, (0), 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 149 [2024-11-09 19:54:51,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:54:51,771 INFO L225 Difference]: With dead ends: 12733 [2024-11-09 19:54:51,772 INFO L226 Difference]: Without dead ends: 8291 [2024-11-09 19:54:51,778 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:54:51,779 INFO L432 NwaCegarLoop]: 516 mSDtfsCounter, 745 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 1797 mSolverCounterSat, 548 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 745 SdHoareTripleChecker+Valid, 592 SdHoareTripleChecker+Invalid, 2345 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 548 IncrementalHoareTripleChecker+Valid, 1797 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-09 19:54:51,780 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [745 Valid, 592 Invalid, 2345 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [548 Valid, 1797 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-11-09 19:54:51,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8291 states. [2024-11-09 19:54:51,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8291 to 5723. [2024-11-09 19:54:51,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5723 states, 5722 states have (on average 2.0228940929744845) internal successors, (11575), 5722 states have internal predecessors, (11575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:54:51,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5723 states to 5723 states and 11575 transitions. [2024-11-09 19:54:51,919 INFO L78 Accepts]: Start accepts. Automaton has 5723 states and 11575 transitions. Word has length 149 [2024-11-09 19:54:51,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:54:51,921 INFO L471 AbstractCegarLoop]: Abstraction has 5723 states and 11575 transitions. [2024-11-09 19:54:51,921 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 2 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:54:51,921 INFO L276 IsEmpty]: Start isEmpty. Operand 5723 states and 11575 transitions. [2024-11-09 19:54:51,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-09 19:54:51,923 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:54:51,923 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-09 19:54:51,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 19:54:51,924 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:54:51,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:54:51,924 INFO L85 PathProgramCache]: Analyzing trace with hash -432287412, now seen corresponding path program 1 times [2024-11-09 19:54:51,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:54:51,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423567975] [2024-11-09 19:54:51,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:54:51,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:54:51,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:54:52,273 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 19:54:52,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:54:52,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423567975] [2024-11-09 19:54:52,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [423567975] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:54:52,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:54:52,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 19:54:52,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519796543] [2024-11-09 19:54:52,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:54:52,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 19:54:52,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:54:52,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 19:54:52,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 19:54:52,276 INFO L87 Difference]: Start difference. First operand 5723 states and 11575 transitions. Second operand has 5 states, 5 states have (on average 32.4) internal successors, (162), 5 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:54:55,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:54:55,140 INFO L93 Difference]: Finished difference Result 14450 states and 29712 transitions. [2024-11-09 19:54:55,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 19:54:55,141 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 32.4) internal successors, (162), 5 states have internal predecessors, (162), 0 states have call successors, (0), 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 162 [2024-11-09 19:54:55,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:54:55,158 INFO L225 Difference]: With dead ends: 14450 [2024-11-09 19:54:55,158 INFO L226 Difference]: Without dead ends: 8729 [2024-11-09 19:54:55,164 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-11-09 19:54:55,167 INFO L432 NwaCegarLoop]: 1126 mSDtfsCounter, 1806 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 3060 mSolverCounterSat, 789 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1806 SdHoareTripleChecker+Valid, 1259 SdHoareTripleChecker+Invalid, 3849 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 789 IncrementalHoareTripleChecker+Valid, 3060 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-11-09 19:54:55,168 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1806 Valid, 1259 Invalid, 3849 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [789 Valid, 3060 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-11-09 19:54:55,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8729 states. [2024-11-09 19:54:55,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8729 to 8715. [2024-11-09 19:54:55,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8715 states, 8714 states have (on average 2.0238696350700023) internal successors, (17636), 8714 states have internal predecessors, (17636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:54:55,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8715 states to 8715 states and 17636 transitions. [2024-11-09 19:54:55,302 INFO L78 Accepts]: Start accepts. Automaton has 8715 states and 17636 transitions. Word has length 162 [2024-11-09 19:54:55,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:54:55,303 INFO L471 AbstractCegarLoop]: Abstraction has 8715 states and 17636 transitions. [2024-11-09 19:54:55,304 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 32.4) internal successors, (162), 5 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:54:55,304 INFO L276 IsEmpty]: Start isEmpty. Operand 8715 states and 17636 transitions. [2024-11-09 19:54:55,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-09 19:54:55,305 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:54:55,305 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-09 19:54:55,305 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 19:54:55,306 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:54:55,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:54:55,306 INFO L85 PathProgramCache]: Analyzing trace with hash 1195177818, now seen corresponding path program 1 times [2024-11-09 19:54:55,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:54:55,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571207964] [2024-11-09 19:54:55,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:54:55,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:54:55,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:54:55,407 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2024-11-09 19:54:55,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:54:55,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571207964] [2024-11-09 19:54:55,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [571207964] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:54:55,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:54:55,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:54:55,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304661186] [2024-11-09 19:54:55,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:54:55,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:54:55,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:54:55,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:54:55,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:54:55,411 INFO L87 Difference]: Start difference. First operand 8715 states and 17636 transitions. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:54:57,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:54:57,754 INFO L93 Difference]: Finished difference Result 21259 states and 43465 transitions. [2024-11-09 19:54:57,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:54:57,755 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 168 [2024-11-09 19:54:57,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:54:57,782 INFO L225 Difference]: With dead ends: 21259 [2024-11-09 19:54:57,783 INFO L226 Difference]: Without dead ends: 12546 [2024-11-09 19:54:57,794 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:54:57,795 INFO L432 NwaCegarLoop]: 485 mSDtfsCounter, 796 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 2055 mSolverCounterSat, 356 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 796 SdHoareTripleChecker+Valid, 551 SdHoareTripleChecker+Invalid, 2411 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 356 IncrementalHoareTripleChecker+Valid, 2055 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-09 19:54:57,797 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [796 Valid, 551 Invalid, 2411 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [356 Valid, 2055 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-09 19:54:57,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12546 states. [2024-11-09 19:54:57,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12546 to 8689. [2024-11-09 19:54:57,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8689 states, 8688 states have (on average 2.025437384898711) internal successors, (17597), 8688 states have internal predecessors, (17597), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:54:58,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8689 states to 8689 states and 17597 transitions. [2024-11-09 19:54:58,009 INFO L78 Accepts]: Start accepts. Automaton has 8689 states and 17597 transitions. Word has length 168 [2024-11-09 19:54:58,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:54:58,010 INFO L471 AbstractCegarLoop]: Abstraction has 8689 states and 17597 transitions. [2024-11-09 19:54:58,010 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:54:58,010 INFO L276 IsEmpty]: Start isEmpty. Operand 8689 states and 17597 transitions. [2024-11-09 19:54:58,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2024-11-09 19:54:58,012 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:54:58,012 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-09 19:54:58,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 19:54:58,012 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:54:58,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:54:58,013 INFO L85 PathProgramCache]: Analyzing trace with hash -384108472, now seen corresponding path program 1 times [2024-11-09 19:54:58,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:54:58,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089678343] [2024-11-09 19:54:58,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:54:58,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:54:58,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:54:58,117 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2024-11-09 19:54:58,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:54:58,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089678343] [2024-11-09 19:54:58,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2089678343] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:54:58,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:54:58,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:54:58,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203873765] [2024-11-09 19:54:58,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:54:58,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:54:58,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:54:58,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:54:58,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:54:58,120 INFO L87 Difference]: Start difference. First operand 8689 states and 17597 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:55:00,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:55:00,676 INFO L93 Difference]: Finished difference Result 21221 states and 43352 transitions. [2024-11-09 19:55:00,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:55:00,677 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 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 181 [2024-11-09 19:55:00,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:55:00,698 INFO L225 Difference]: With dead ends: 21221 [2024-11-09 19:55:00,699 INFO L226 Difference]: Without dead ends: 11224 [2024-11-09 19:55:00,711 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:55:00,712 INFO L432 NwaCegarLoop]: 967 mSDtfsCounter, 941 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 1993 mSolverCounterSat, 544 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 941 SdHoareTripleChecker+Valid, 999 SdHoareTripleChecker+Invalid, 2537 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 544 IncrementalHoareTripleChecker+Valid, 1993 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-09 19:55:00,712 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [941 Valid, 999 Invalid, 2537 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [544 Valid, 1993 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-11-09 19:55:00,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11224 states. [2024-11-09 19:55:00,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11224 to 9938. [2024-11-09 19:55:00,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9938 states, 9937 states have (on average 1.9812820770856396) internal successors, (19688), 9937 states have internal predecessors, (19688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:55:00,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9938 states to 9938 states and 19688 transitions. [2024-11-09 19:55:00,854 INFO L78 Accepts]: Start accepts. Automaton has 9938 states and 19688 transitions. Word has length 181 [2024-11-09 19:55:00,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:55:00,854 INFO L471 AbstractCegarLoop]: Abstraction has 9938 states and 19688 transitions. [2024-11-09 19:55:00,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:55:00,855 INFO L276 IsEmpty]: Start isEmpty. Operand 9938 states and 19688 transitions. [2024-11-09 19:55:00,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2024-11-09 19:55:00,857 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:55:00,857 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-09 19:55:00,858 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 19:55:00,858 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:55:00,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:55:00,858 INFO L85 PathProgramCache]: Analyzing trace with hash -1982928383, now seen corresponding path program 1 times [2024-11-09 19:55:00,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:55:00,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106783699] [2024-11-09 19:55:00,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:55:00,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:55:00,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:55:01,214 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 17 proven. 83 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 19:55:01,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:55:01,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106783699] [2024-11-09 19:55:01,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2106783699] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 19:55:01,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1791063564] [2024-11-09 19:55:01,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:55:01,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 19:55:01,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 19:55:01,218 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 19:55:01,220 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 19:55:01,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:55:01,348 INFO L255 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 19:55:01,356 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 19:55:01,698 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 17 proven. 83 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 19:55:01,699 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 19:55:02,056 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 19:55:02,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1791063564] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-09 19:55:02,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-09 19:55:02,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 7 [2024-11-09 19:55:02,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379039597] [2024-11-09 19:55:02,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:55:02,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 19:55:02,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:55:02,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 19:55:02,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-09 19:55:02,059 INFO L87 Difference]: Start difference. First operand 9938 states and 19688 transitions. Second operand has 4 states, 4 states have (on average 58.5) internal successors, (234), 3 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:55:05,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:55:05,704 INFO L93 Difference]: Finished difference Result 30554 states and 60573 transitions. [2024-11-09 19:55:05,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 19:55:05,705 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 58.5) internal successors, (234), 3 states have internal predecessors, (234), 0 states have call successors, (0), 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 234 [2024-11-09 19:55:05,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:55:05,742 INFO L225 Difference]: With dead ends: 30554 [2024-11-09 19:55:05,743 INFO L226 Difference]: Without dead ends: 20191 [2024-11-09 19:55:05,758 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 469 GetRequests, 463 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-09 19:55:05,759 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 1619 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 3507 mSolverCounterSat, 750 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1619 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 4257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 750 IncrementalHoareTripleChecker+Valid, 3507 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2024-11-09 19:55:05,759 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1619 Valid, 125 Invalid, 4257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [750 Valid, 3507 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2024-11-09 19:55:05,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20191 states. [2024-11-09 19:55:06,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20191 to 20188. [2024-11-09 19:55:06,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20188 states, 20187 states have (on average 1.9709218804180908) internal successors, (39787), 20187 states have internal predecessors, (39787), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:55:06,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20188 states to 20188 states and 39787 transitions. [2024-11-09 19:55:06,091 INFO L78 Accepts]: Start accepts. Automaton has 20188 states and 39787 transitions. Word has length 234 [2024-11-09 19:55:06,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:55:06,092 INFO L471 AbstractCegarLoop]: Abstraction has 20188 states and 39787 transitions. [2024-11-09 19:55:06,092 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 58.5) internal successors, (234), 3 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:55:06,092 INFO L276 IsEmpty]: Start isEmpty. Operand 20188 states and 39787 transitions. [2024-11-09 19:55:06,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2024-11-09 19:55:06,095 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:55:06,096 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-09 19:55:06,113 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-09 19:55:06,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-09 19:55:06,297 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:55:06,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:55:06,297 INFO L85 PathProgramCache]: Analyzing trace with hash -1150050210, now seen corresponding path program 1 times [2024-11-09 19:55:06,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:55:06,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162824032] [2024-11-09 19:55:06,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:55:06,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:55:06,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:55:06,549 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 19:55:06,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:55:06,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162824032] [2024-11-09 19:55:06,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [162824032] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:55:06,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:55:06,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:55:06,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253682521] [2024-11-09 19:55:06,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:55:06,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:55:06,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:55:06,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:55:06,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:55:06,551 INFO L87 Difference]: Start difference. First operand 20188 states and 39787 transitions. Second operand has 3 states, 3 states have (on average 84.0) internal successors, (252), 3 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:55:08,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:55:08,666 INFO L93 Difference]: Finished difference Result 46807 states and 92506 transitions. [2024-11-09 19:55:08,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:55:08,666 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 84.0) internal successors, (252), 3 states have internal predecessors, (252), 0 states have call successors, (0), 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 252 [2024-11-09 19:55:08,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:55:08,697 INFO L225 Difference]: With dead ends: 46807 [2024-11-09 19:55:08,697 INFO L226 Difference]: Without dead ends: 26621 [2024-11-09 19:55:08,709 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:55:08,710 INFO L432 NwaCegarLoop]: 1067 mSDtfsCounter, 673 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 1890 mSolverCounterSat, 137 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 673 SdHoareTripleChecker+Valid, 1130 SdHoareTripleChecker+Invalid, 2027 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 137 IncrementalHoareTripleChecker+Valid, 1890 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-09 19:55:08,710 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [673 Valid, 1130 Invalid, 2027 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [137 Valid, 1890 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-09 19:55:08,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26621 states. [2024-11-09 19:55:08,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26621 to 26614. [2024-11-09 19:55:08,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26614 states, 26613 states have (on average 1.9562619772291736) internal successors, (52062), 26613 states have internal predecessors, (52062), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:55:09,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26614 states to 26614 states and 52062 transitions. [2024-11-09 19:55:09,047 INFO L78 Accepts]: Start accepts. Automaton has 26614 states and 52062 transitions. Word has length 252 [2024-11-09 19:55:09,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:55:09,048 INFO L471 AbstractCegarLoop]: Abstraction has 26614 states and 52062 transitions. [2024-11-09 19:55:09,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 84.0) internal successors, (252), 3 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:55:09,048 INFO L276 IsEmpty]: Start isEmpty. Operand 26614 states and 52062 transitions. [2024-11-09 19:55:09,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2024-11-09 19:55:09,052 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:55:09,052 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:55:09,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 19:55:09,053 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:55:09,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:55:09,053 INFO L85 PathProgramCache]: Analyzing trace with hash -1905918427, now seen corresponding path program 1 times [2024-11-09 19:55:09,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:55:09,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760594728] [2024-11-09 19:55:09,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:55:09,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:55:09,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:55:09,292 INFO L134 CoverageAnalysis]: Checked inductivity of 254 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 228 trivial. 0 not checked. [2024-11-09 19:55:09,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:55:09,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760594728] [2024-11-09 19:55:09,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1760594728] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:55:09,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:55:09,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:55:09,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525610008] [2024-11-09 19:55:09,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:55:09,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:55:09,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:55:09,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:55:09,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:55:09,295 INFO L87 Difference]: Start difference. First operand 26614 states and 52062 transitions. Second operand has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:55:11,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:55:11,381 INFO L93 Difference]: Finished difference Result 59205 states and 116124 transitions. [2024-11-09 19:55:11,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:55:11,381 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 275 [2024-11-09 19:55:11,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:55:11,431 INFO L225 Difference]: With dead ends: 59205 [2024-11-09 19:55:11,431 INFO L226 Difference]: Without dead ends: 32167 [2024-11-09 19:55:11,449 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:55:11,450 INFO L432 NwaCegarLoop]: 1112 mSDtfsCounter, 802 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 1912 mSolverCounterSat, 132 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 802 SdHoareTripleChecker+Valid, 1178 SdHoareTripleChecker+Invalid, 2044 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 132 IncrementalHoareTripleChecker+Valid, 1912 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-09 19:55:11,450 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [802 Valid, 1178 Invalid, 2044 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [132 Valid, 1912 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-09 19:55:11,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32167 states. [2024-11-09 19:55:11,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32167 to 32164. [2024-11-09 19:55:11,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32164 states, 32163 states have (on average 1.9468955010415696) internal successors, (62618), 32163 states have internal predecessors, (62618), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:55:11,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32164 states to 32164 states and 62618 transitions. [2024-11-09 19:55:11,810 INFO L78 Accepts]: Start accepts. Automaton has 32164 states and 62618 transitions. Word has length 275 [2024-11-09 19:55:11,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:55:11,811 INFO L471 AbstractCegarLoop]: Abstraction has 32164 states and 62618 transitions. [2024-11-09 19:55:11,811 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:55:11,811 INFO L276 IsEmpty]: Start isEmpty. Operand 32164 states and 62618 transitions. [2024-11-09 19:55:11,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2024-11-09 19:55:11,816 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:55:11,816 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-09 19:55:11,817 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-09 19:55:11,817 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:55:11,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:55:11,817 INFO L85 PathProgramCache]: Analyzing trace with hash -1104390679, now seen corresponding path program 1 times [2024-11-09 19:55:11,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:55:11,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640084520] [2024-11-09 19:55:11,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:55:11,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:55:11,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:55:11,984 INFO L134 CoverageAnalysis]: Checked inductivity of 292 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 266 trivial. 0 not checked. [2024-11-09 19:55:11,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:55:11,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640084520] [2024-11-09 19:55:11,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [640084520] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:55:11,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:55:11,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:55:11,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594842657] [2024-11-09 19:55:11,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:55:11,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:55:11,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:55:11,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:55:11,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:55:11,988 INFO L87 Difference]: Start difference. First operand 32164 states and 62618 transitions. Second operand has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:55:13,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:55:13,978 INFO L93 Difference]: Finished difference Result 68577 states and 133739 transitions. [2024-11-09 19:55:13,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:55:13,979 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 302 [2024-11-09 19:55:13,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:55:14,021 INFO L225 Difference]: With dead ends: 68577 [2024-11-09 19:55:14,022 INFO L226 Difference]: Without dead ends: 35989 [2024-11-09 19:55:14,046 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:55:14,046 INFO L432 NwaCegarLoop]: 1067 mSDtfsCounter, 797 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 1850 mSolverCounterSat, 163 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 797 SdHoareTripleChecker+Valid, 1129 SdHoareTripleChecker+Invalid, 2013 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 163 IncrementalHoareTripleChecker+Valid, 1850 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-09 19:55:14,047 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [797 Valid, 1129 Invalid, 2013 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [163 Valid, 1850 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-09 19:55:14,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35989 states. [2024-11-09 19:55:14,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35989 to 30865. [2024-11-09 19:55:14,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30865 states, 30864 states have (on average 1.9420036288232245) internal successors, (59938), 30864 states have internal predecessors, (59938), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:55:14,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30865 states to 30865 states and 59938 transitions. [2024-11-09 19:55:14,402 INFO L78 Accepts]: Start accepts. Automaton has 30865 states and 59938 transitions. Word has length 302 [2024-11-09 19:55:14,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:55:14,403 INFO L471 AbstractCegarLoop]: Abstraction has 30865 states and 59938 transitions. [2024-11-09 19:55:14,403 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:55:14,403 INFO L276 IsEmpty]: Start isEmpty. Operand 30865 states and 59938 transitions. [2024-11-09 19:55:14,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 310 [2024-11-09 19:55:14,407 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:55:14,408 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-09 19:55:14,408 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-09 19:55:14,408 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:55:14,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:55:14,408 INFO L85 PathProgramCache]: Analyzing trace with hash 697965607, now seen corresponding path program 1 times [2024-11-09 19:55:14,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:55:14,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157491663] [2024-11-09 19:55:14,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:55:14,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:55:14,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:55:14,824 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 184 proven. 0 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2024-11-09 19:55:14,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:55:14,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157491663] [2024-11-09 19:55:14,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [157491663] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:55:14,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:55:14,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:55:14,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064612977] [2024-11-09 19:55:14,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:55:14,826 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:55:14,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:55:14,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:55:14,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:55:14,827 INFO L87 Difference]: Start difference. First operand 30865 states and 59938 transitions. Second operand has 3 states, 3 states have (on average 78.66666666666667) internal successors, (236), 3 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:55:17,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:55:17,049 INFO L93 Difference]: Finished difference Result 71127 states and 138476 transitions. [2024-11-09 19:55:17,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:55:17,049 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 78.66666666666667) internal successors, (236), 3 states have internal predecessors, (236), 0 states have call successors, (0), 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 309 [2024-11-09 19:55:17,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:55:17,095 INFO L225 Difference]: With dead ends: 71127 [2024-11-09 19:55:17,095 INFO L226 Difference]: Without dead ends: 40264 [2024-11-09 19:55:17,115 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:55:17,116 INFO L432 NwaCegarLoop]: 1109 mSDtfsCounter, 675 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 1994 mSolverCounterSat, 134 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 675 SdHoareTripleChecker+Valid, 1162 SdHoareTripleChecker+Invalid, 2128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 134 IncrementalHoareTripleChecker+Valid, 1994 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-09 19:55:17,116 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [675 Valid, 1162 Invalid, 2128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [134 Valid, 1994 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-09 19:55:17,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40264 states. [2024-11-09 19:55:17,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40264 to 39394. [2024-11-09 19:55:17,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39394 states, 39393 states have (on average 1.9380092909907851) internal successors, (76344), 39393 states have internal predecessors, (76344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:55:17,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39394 states to 39394 states and 76344 transitions. [2024-11-09 19:55:17,685 INFO L78 Accepts]: Start accepts. Automaton has 39394 states and 76344 transitions. Word has length 309 [2024-11-09 19:55:17,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:55:17,685 INFO L471 AbstractCegarLoop]: Abstraction has 39394 states and 76344 transitions. [2024-11-09 19:55:17,685 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 78.66666666666667) internal successors, (236), 3 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:55:17,685 INFO L276 IsEmpty]: Start isEmpty. Operand 39394 states and 76344 transitions. [2024-11-09 19:55:17,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2024-11-09 19:55:17,688 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:55:17,688 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-09 19:55:17,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-09 19:55:17,688 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:55:17,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:55:17,689 INFO L85 PathProgramCache]: Analyzing trace with hash -1815652898, now seen corresponding path program 1 times [2024-11-09 19:55:17,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:55:17,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804685186] [2024-11-09 19:55:17,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:55:17,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:55:17,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:55:17,944 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2024-11-09 19:55:17,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:55:17,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804685186] [2024-11-09 19:55:17,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804685186] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:55:17,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:55:17,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:55:17,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366473483] [2024-11-09 19:55:17,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:55:17,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:55:17,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:55:17,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:55:17,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:55:17,947 INFO L87 Difference]: Start difference. First operand 39394 states and 76344 transitions. Second operand has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:55:20,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:55:20,089 INFO L93 Difference]: Finished difference Result 84752 states and 164358 transitions. [2024-11-09 19:55:20,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:55:20,090 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 0 states have call successors, (0), 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 314 [2024-11-09 19:55:20,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:55:20,142 INFO L225 Difference]: With dead ends: 84752 [2024-11-09 19:55:20,142 INFO L226 Difference]: Without dead ends: 44934 [2024-11-09 19:55:20,168 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:55:20,169 INFO L432 NwaCegarLoop]: 1016 mSDtfsCounter, 821 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 1903 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 821 SdHoareTripleChecker+Valid, 1062 SdHoareTripleChecker+Invalid, 2030 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 1903 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-09 19:55:20,169 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [821 Valid, 1062 Invalid, 2030 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 1903 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-09 19:55:20,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44934 states. [2024-11-09 19:55:20,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44934 to 44926. [2024-11-09 19:55:20,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44926 states, 44925 states have (on average 1.9341346688925989) internal successors, (86891), 44925 states have internal predecessors, (86891), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:55:21,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44926 states to 44926 states and 86891 transitions. [2024-11-09 19:55:21,042 INFO L78 Accepts]: Start accepts. Automaton has 44926 states and 86891 transitions. Word has length 314 [2024-11-09 19:55:21,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:55:21,043 INFO L471 AbstractCegarLoop]: Abstraction has 44926 states and 86891 transitions. [2024-11-09 19:55:21,043 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:55:21,043 INFO L276 IsEmpty]: Start isEmpty. Operand 44926 states and 86891 transitions. [2024-11-09 19:55:21,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 359 [2024-11-09 19:55:21,059 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:55:21,059 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-09 19:55:21,060 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-09 19:55:21,060 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:55:21,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:55:21,060 INFO L85 PathProgramCache]: Analyzing trace with hash 1882641928, now seen corresponding path program 1 times [2024-11-09 19:55:21,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:55:21,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112166222] [2024-11-09 19:55:21,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:55:21,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:55:21,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:55:21,571 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 215 proven. 0 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2024-11-09 19:55:21,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:55:21,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112166222] [2024-11-09 19:55:21,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112166222] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:55:21,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:55:21,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:55:21,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667426948] [2024-11-09 19:55:21,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:55:21,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:55:21,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:55:21,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:55:21,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:55:21,574 INFO L87 Difference]: Start difference. First operand 44926 states and 86891 transitions. Second operand has 3 states, 3 states have (on average 92.0) internal successors, (276), 3 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:55:23,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:55:23,881 INFO L93 Difference]: Finished difference Result 100978 states and 195462 transitions. [2024-11-09 19:55:23,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:55:23,882 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 92.0) internal successors, (276), 3 states have internal predecessors, (276), 0 states have call successors, (0), 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 358 [2024-11-09 19:55:23,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:55:23,947 INFO L225 Difference]: With dead ends: 100978 [2024-11-09 19:55:23,947 INFO L226 Difference]: Without dead ends: 56054 [2024-11-09 19:55:23,969 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:55:23,970 INFO L432 NwaCegarLoop]: 976 mSDtfsCounter, 696 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 1960 mSolverCounterSat, 167 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 696 SdHoareTripleChecker+Valid, 1009 SdHoareTripleChecker+Invalid, 2127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 167 IncrementalHoareTripleChecker+Valid, 1960 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-09 19:55:23,970 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [696 Valid, 1009 Invalid, 2127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [167 Valid, 1960 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-09 19:55:24,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56054 states. [2024-11-09 19:55:24,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56054 to 54754. [2024-11-09 19:55:24,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54754 states, 54753 states have (on average 1.9361861450514126) internal successors, (106012), 54753 states have internal predecessors, (106012), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:55:24,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54754 states to 54754 states and 106012 transitions. [2024-11-09 19:55:24,842 INFO L78 Accepts]: Start accepts. Automaton has 54754 states and 106012 transitions. Word has length 358 [2024-11-09 19:55:24,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:55:24,842 INFO L471 AbstractCegarLoop]: Abstraction has 54754 states and 106012 transitions. [2024-11-09 19:55:24,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 92.0) internal successors, (276), 3 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:55:24,843 INFO L276 IsEmpty]: Start isEmpty. Operand 54754 states and 106012 transitions. [2024-11-09 19:55:24,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 430 [2024-11-09 19:55:24,857 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:55:24,857 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-09 19:55:24,857 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-09 19:55:24,858 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:55:24,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:55:24,858 INFO L85 PathProgramCache]: Analyzing trace with hash 400143463, now seen corresponding path program 1 times [2024-11-09 19:55:24,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:55:24,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728142133] [2024-11-09 19:55:24,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:55:24,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:55:25,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:55:25,612 INFO L134 CoverageAnalysis]: Checked inductivity of 348 backedges. 265 proven. 0 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2024-11-09 19:55:25,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:55:25,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728142133] [2024-11-09 19:55:25,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1728142133] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:55:25,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:55:25,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:55:25,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445490705] [2024-11-09 19:55:25,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:55:25,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:55:25,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:55:25,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:55:25,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:55:25,614 INFO L87 Difference]: Start difference. First operand 54754 states and 106012 transitions. Second operand has 3 states, 3 states have (on average 115.66666666666667) internal successors, (347), 3 states have internal predecessors, (347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:55:27,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:55:27,700 INFO L93 Difference]: Finished difference Result 116335 states and 225259 transitions. [2024-11-09 19:55:27,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:55:27,701 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 115.66666666666667) internal successors, (347), 3 states have internal predecessors, (347), 0 states have call successors, (0), 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 429 [2024-11-09 19:55:27,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:55:27,777 INFO L225 Difference]: With dead ends: 116335 [2024-11-09 19:55:27,777 INFO L226 Difference]: Without dead ends: 61583 [2024-11-09 19:55:27,809 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:55:27,810 INFO L432 NwaCegarLoop]: 281 mSDtfsCounter, 664 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 1902 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 664 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 2021 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 1902 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-09 19:55:27,810 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [664 Valid, 329 Invalid, 2021 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 1902 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-09 19:55:27,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61583 states. [2024-11-09 19:55:28,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61583 to 59871. [2024-11-09 19:55:28,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59871 states, 59870 states have (on average 1.9324703524302655) internal successors, (115697), 59870 states have internal predecessors, (115697), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:55:29,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59871 states to 59871 states and 115697 transitions. [2024-11-09 19:55:29,071 INFO L78 Accepts]: Start accepts. Automaton has 59871 states and 115697 transitions. Word has length 429 [2024-11-09 19:55:29,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:55:29,071 INFO L471 AbstractCegarLoop]: Abstraction has 59871 states and 115697 transitions. [2024-11-09 19:55:29,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 115.66666666666667) internal successors, (347), 3 states have internal predecessors, (347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:55:29,072 INFO L276 IsEmpty]: Start isEmpty. Operand 59871 states and 115697 transitions. [2024-11-09 19:55:29,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 480 [2024-11-09 19:55:29,085 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:55:29,086 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-09 19:55:29,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-09 19:55:29,086 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:55:29,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:55:29,087 INFO L85 PathProgramCache]: Analyzing trace with hash -253909886, now seen corresponding path program 1 times [2024-11-09 19:55:29,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:55:29,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984801586] [2024-11-09 19:55:29,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:55:29,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:55:29,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:55:29,661 INFO L134 CoverageAnalysis]: Checked inductivity of 617 backedges. 345 proven. 0 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2024-11-09 19:55:29,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:55:29,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984801586] [2024-11-09 19:55:29,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984801586] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:55:29,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:55:29,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:55:29,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297658923] [2024-11-09 19:55:29,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:55:29,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:55:29,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:55:29,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:55:29,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:55:29,664 INFO L87 Difference]: Start difference. First operand 59871 states and 115697 transitions. Second operand has 3 states, 3 states have (on average 97.33333333333333) internal successors, (292), 3 states have internal predecessors, (292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:55:31,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:55:31,894 INFO L93 Difference]: Finished difference Result 131693 states and 254694 transitions. [2024-11-09 19:55:31,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:55:31,895 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 97.33333333333333) internal successors, (292), 3 states have internal predecessors, (292), 0 states have call successors, (0), 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 479 [2024-11-09 19:55:31,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:55:32,014 INFO L225 Difference]: With dead ends: 131693 [2024-11-09 19:55:32,014 INFO L226 Difference]: Without dead ends: 71824 [2024-11-09 19:55:32,249 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:55:32,250 INFO L432 NwaCegarLoop]: 280 mSDtfsCounter, 675 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 1884 mSolverCounterSat, 161 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 675 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 2045 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 161 IncrementalHoareTripleChecker+Valid, 1884 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-09 19:55:32,250 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [675 Valid, 328 Invalid, 2045 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [161 Valid, 1884 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-09 19:55:32,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71824 states. [2024-11-09 19:55:33,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71824 to 64561. [2024-11-09 19:55:33,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64561 states, 64560 states have (on average 1.93045229244114) internal successors, (124630), 64560 states have internal predecessors, (124630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:55:33,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64561 states to 64561 states and 124630 transitions. [2024-11-09 19:55:33,312 INFO L78 Accepts]: Start accepts. Automaton has 64561 states and 124630 transitions. Word has length 479 [2024-11-09 19:55:33,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:55:33,313 INFO L471 AbstractCegarLoop]: Abstraction has 64561 states and 124630 transitions. [2024-11-09 19:55:33,313 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 97.33333333333333) internal successors, (292), 3 states have internal predecessors, (292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:55:33,313 INFO L276 IsEmpty]: Start isEmpty. Operand 64561 states and 124630 transitions. [2024-11-09 19:55:33,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 491 [2024-11-09 19:55:33,324 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:55:33,324 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-09 19:55:33,324 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-09 19:55:33,324 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:55:33,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:55:33,325 INFO L85 PathProgramCache]: Analyzing trace with hash -292777609, now seen corresponding path program 1 times [2024-11-09 19:55:33,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:55:33,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052784987] [2024-11-09 19:55:33,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:55:33,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:55:33,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:55:33,868 INFO L134 CoverageAnalysis]: Checked inductivity of 626 backedges. 345 proven. 0 refuted. 0 times theorem prover too weak. 281 trivial. 0 not checked. [2024-11-09 19:55:33,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:55:33,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052784987] [2024-11-09 19:55:33,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1052784987] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:55:33,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:55:33,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 19:55:33,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959649135] [2024-11-09 19:55:33,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:55:33,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:55:33,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:55:33,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:55:33,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:55:33,870 INFO L87 Difference]: Start difference. First operand 64561 states and 124630 transitions. Second operand has 3 states, 3 states have (on average 98.33333333333333) internal successors, (295), 2 states have internal predecessors, (295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:55:35,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:55:35,323 INFO L93 Difference]: Finished difference Result 126974 states and 245191 transitions. [2024-11-09 19:55:35,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:55:35,329 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 98.33333333333333) internal successors, (295), 2 states have internal predecessors, (295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 490 [2024-11-09 19:55:35,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:55:35,427 INFO L225 Difference]: With dead ends: 126974 [2024-11-09 19:55:35,427 INFO L226 Difference]: Without dead ends: 62414 [2024-11-09 19:55:35,440 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:55:35,441 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 931 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 981 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 931 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 987 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 981 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-09 19:55:35,441 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [931 Valid, 84 Invalid, 987 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 981 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-09 19:55:35,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62414 states. [2024-11-09 19:55:36,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62414 to 62406. [2024-11-09 19:55:36,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62406 states, 62405 states have (on average 1.9312234596586813) internal successors, (120518), 62405 states have internal predecessors, (120518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:55:36,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62406 states to 62406 states and 120518 transitions. [2024-11-09 19:55:36,335 INFO L78 Accepts]: Start accepts. Automaton has 62406 states and 120518 transitions. Word has length 490 [2024-11-09 19:55:36,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:55:36,336 INFO L471 AbstractCegarLoop]: Abstraction has 62406 states and 120518 transitions. [2024-11-09 19:55:36,336 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 98.33333333333333) internal successors, (295), 2 states have internal predecessors, (295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:55:36,336 INFO L276 IsEmpty]: Start isEmpty. Operand 62406 states and 120518 transitions. [2024-11-09 19:55:36,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 495 [2024-11-09 19:55:36,352 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:55:36,352 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-09 19:55:36,352 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-09 19:55:36,352 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:55:36,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:55:36,353 INFO L85 PathProgramCache]: Analyzing trace with hash 1189033547, now seen corresponding path program 1 times [2024-11-09 19:55:36,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:55:36,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539236465] [2024-11-09 19:55:36,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:55:36,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:55:36,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:55:36,633 INFO L134 CoverageAnalysis]: Checked inductivity of 596 backedges. 354 proven. 0 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2024-11-09 19:55:36,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:55:36,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539236465] [2024-11-09 19:55:36,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1539236465] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:55:36,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:55:36,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:55:36,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296743185] [2024-11-09 19:55:36,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:55:36,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:55:36,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:55:36,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:55:36,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:55:36,637 INFO L87 Difference]: Start difference. First operand 62406 states and 120518 transitions. Second operand has 3 states, 3 states have (on average 111.0) internal successors, (333), 3 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:55:39,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:55:39,144 INFO L93 Difference]: Finished difference Result 132485 states and 255537 transitions. [2024-11-09 19:55:39,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:55:39,145 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 111.0) internal successors, (333), 3 states have internal predecessors, (333), 0 states have call successors, (0), 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 494 [2024-11-09 19:55:39,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:55:39,232 INFO L225 Difference]: With dead ends: 132485 [2024-11-09 19:55:39,233 INFO L226 Difference]: Without dead ends: 70081 [2024-11-09 19:55:39,270 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:55:39,271 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 692 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 1836 mSolverCounterSat, 247 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 692 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 2083 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 247 IncrementalHoareTripleChecker+Valid, 1836 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-09 19:55:39,271 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [692 Valid, 123 Invalid, 2083 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [247 Valid, 1836 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-09 19:55:39,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70081 states. [2024-11-09 19:55:40,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70081 to 56396. [2024-11-09 19:55:40,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56396 states, 56395 states have (on average 1.9251529390903448) internal successors, (108569), 56395 states have internal predecessors, (108569), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:55:40,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56396 states to 56396 states and 108569 transitions. [2024-11-09 19:55:40,620 INFO L78 Accepts]: Start accepts. Automaton has 56396 states and 108569 transitions. Word has length 494 [2024-11-09 19:55:40,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:55:40,620 INFO L471 AbstractCegarLoop]: Abstraction has 56396 states and 108569 transitions. [2024-11-09 19:55:40,620 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.0) internal successors, (333), 3 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:55:40,621 INFO L276 IsEmpty]: Start isEmpty. Operand 56396 states and 108569 transitions. [2024-11-09 19:55:40,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 593 [2024-11-09 19:55:40,641 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:55:40,641 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:55:40,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-09 19:55:40,642 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:55:40,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:55:40,642 INFO L85 PathProgramCache]: Analyzing trace with hash 1356455671, now seen corresponding path program 1 times [2024-11-09 19:55:40,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:55:40,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550027192] [2024-11-09 19:55:40,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:55:40,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:55:40,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:55:41,051 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2024-11-09 19:55:41,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:55:41,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550027192] [2024-11-09 19:55:41,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550027192] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:55:41,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:55:41,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:55:41,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449850014] [2024-11-09 19:55:41,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:55:41,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:55:41,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:55:41,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:55:41,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:55:41,053 INFO L87 Difference]: Start difference. First operand 56396 states and 108569 transitions. Second operand has 3 states, 3 states have (on average 143.66666666666666) internal successors, (431), 3 states have internal predecessors, (431), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)