./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem12_label35.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/Problem12_label35.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 d2c88e57f95302454037a8b8cda92c4c6c828f58a1c1642f9d0e242d65cc598d --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-09 19:27:34,144 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 19:27:34,222 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 19:27:34,229 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 19:27:34,230 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 19:27:34,262 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 19:27:34,262 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 19:27:34,263 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 19:27:34,265 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 19:27:34,266 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 19:27:34,267 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 19:27:34,267 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 19:27:34,268 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 19:27:34,270 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 19:27:34,270 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 19:27:34,271 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 19:27:34,271 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 19:27:34,271 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 19:27:34,275 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 19:27:34,275 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 19:27:34,275 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 19:27:34,276 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 19:27:34,276 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 19:27:34,277 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 19:27:34,277 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 19:27:34,277 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 19:27:34,277 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 19:27:34,278 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 19:27:34,278 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-09 19:27:34,278 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 19:27:34,279 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 19:27:34,279 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 19:27:34,279 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 19:27:34,279 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 19:27:34,280 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 19:27:34,280 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 19:27:34,280 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 19:27:34,280 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 19:27:34,281 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 19:27:34,281 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 19:27:34,281 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 19:27:34,283 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 19:27:34,283 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 -> d2c88e57f95302454037a8b8cda92c4c6c828f58a1c1642f9d0e242d65cc598d [2024-11-09 19:27:34,552 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 19:27:34,573 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 19:27:34,577 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 19:27:34,578 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 19:27:34,579 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 19:27:34,580 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem12_label35.c [2024-11-09 19:27:36,044 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 19:27:36,508 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 19:27:36,510 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem12_label35.c [2024-11-09 19:27:36,550 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/371c42fad/01d55d4a482a4e228881efefa555066f/FLAGb84fbd0d3 [2024-11-09 19:27:36,567 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/371c42fad/01d55d4a482a4e228881efefa555066f [2024-11-09 19:27:36,571 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 19:27:36,572 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 19:27:36,574 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 19:27:36,575 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 19:27:36,580 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 19:27:36,581 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:27:36" (1/1) ... [2024-11-09 19:27:36,582 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54818fcc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:27:36, skipping insertion in model container [2024-11-09 19:27:36,584 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:27:36" (1/1) ... [2024-11-09 19:27:36,687 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 19:27:36,928 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/Problem12_label35.c[1310,1323] [2024-11-09 19:27:37,788 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 19:27:37,798 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 19:27:37,812 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/Problem12_label35.c[1310,1323] [2024-11-09 19:27:38,151 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 19:27:38,176 INFO L204 MainTranslator]: Completed translation [2024-11-09 19:27:38,177 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:27:38 WrapperNode [2024-11-09 19:27:38,178 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 19:27:38,179 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 19:27:38,179 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 19:27:38,179 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 19:27:38,185 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:27:38" (1/1) ... [2024-11-09 19:27:38,234 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:27:38" (1/1) ... [2024-11-09 19:27:38,570 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 4760 [2024-11-09 19:27:38,571 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 19:27:38,572 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 19:27:38,572 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 19:27:38,572 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 19:27:38,581 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:27:38" (1/1) ... [2024-11-09 19:27:38,582 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:27:38" (1/1) ... [2024-11-09 19:27:38,619 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:27:38" (1/1) ... [2024-11-09 19:27:38,796 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:27:38,797 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:27:38" (1/1) ... [2024-11-09 19:27:38,797 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:27:38" (1/1) ... [2024-11-09 19:27:38,898 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:27:38" (1/1) ... [2024-11-09 19:27:38,916 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:27:38" (1/1) ... [2024-11-09 19:27:38,936 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:27:38" (1/1) ... [2024-11-09 19:27:38,954 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:27:38" (1/1) ... [2024-11-09 19:27:39,026 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 19:27:39,028 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-09 19:27:39,028 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-09 19:27:39,029 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-09 19:27:39,029 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:27:38" (1/1) ... [2024-11-09 19:27:39,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 19:27:39,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 19:27:39,064 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:27:39,066 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:27:39,176 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 19:27:39,177 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 19:27:39,177 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 19:27:39,177 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 19:27:39,246 INFO L256 CfgBuilder]: Building ICFG [2024-11-09 19:27:39,247 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 19:27:44,494 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L4665: havoc calculate_output3_#t~ret11#1; [2024-11-09 19:27:44,495 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1696: havoc calculate_output_#t~ret9#1; [2024-11-09 19:27:44,495 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L3175: havoc calculate_output2_#t~ret10#1; [2024-11-09 19:27:44,938 INFO L? ?]: Removed 2039 outVars from TransFormulas that were not future-live. [2024-11-09 19:27:44,940 INFO L307 CfgBuilder]: Performing block encoding [2024-11-09 19:27:44,979 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 19:27:44,979 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 19:27:44,980 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 07:27:44 BoogieIcfgContainer [2024-11-09 19:27:44,980 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-09 19:27:44,982 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 19:27:44,984 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 19:27:44,987 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 19:27:44,987 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 07:27:36" (1/3) ... [2024-11-09 19:27:44,988 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@352167c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:27:44, skipping insertion in model container [2024-11-09 19:27:44,989 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:27:38" (2/3) ... [2024-11-09 19:27:44,989 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@352167c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:27:44, skipping insertion in model container [2024-11-09 19:27:44,989 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 07:27:44" (3/3) ... [2024-11-09 19:27:44,991 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem12_label35.c [2024-11-09 19:27:45,006 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 19:27:45,007 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 19:27:45,096 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 19:27:45,102 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;@a585a04, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 19:27:45,103 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 19:27:45,113 INFO L276 IsEmpty]: Start isEmpty. Operand has 821 states, 819 states have (on average 2.744810744810745) internal successors, (2248), 820 states have internal predecessors, (2248), 0 states have call successors, (0), 0 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:27:45,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-09 19:27:45,118 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:27:45,118 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:27:45,119 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:27:45,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:27:45,123 INFO L85 PathProgramCache]: Analyzing trace with hash 1721831834, now seen corresponding path program 1 times [2024-11-09 19:27:45,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:27:45,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596159275] [2024-11-09 19:27:45,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:27:45,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:27:45,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:27:45,349 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:27:45,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:27:45,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596159275] [2024-11-09 19:27:45,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596159275] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:27:45,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:27:45,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 19:27:45,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135836972] [2024-11-09 19:27:45,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:27:45,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:27:45,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:27:45,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:27:45,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:27:45,379 INFO L87 Difference]: Start difference. First operand has 821 states, 819 states have (on average 2.744810744810745) internal successors, (2248), 820 states have internal predecessors, (2248), 0 states have call successors, (0), 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 3.0) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 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:27:49,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:27:49,734 INFO L93 Difference]: Finished difference Result 2394 states and 6675 transitions. [2024-11-09 19:27:49,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:27:49,737 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 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 9 [2024-11-09 19:27:49,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:27:49,773 INFO L225 Difference]: With dead ends: 2394 [2024-11-09 19:27:49,773 INFO L226 Difference]: Without dead ends: 1509 [2024-11-09 19:27:49,780 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:27:49,785 INFO L432 NwaCegarLoop]: 473 mSDtfsCounter, 1507 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 3694 mSolverCounterSat, 651 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1507 SdHoareTripleChecker+Valid, 485 SdHoareTripleChecker+Invalid, 4345 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 651 IncrementalHoareTripleChecker+Valid, 3694 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2024-11-09 19:27:49,788 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1507 Valid, 485 Invalid, 4345 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [651 Valid, 3694 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2024-11-09 19:27:49,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1509 states. [2024-11-09 19:27:49,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1509 to 1509. [2024-11-09 19:27:49,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1509 states, 1508 states have (on average 2.5391246684350133) internal successors, (3829), 1508 states have internal predecessors, (3829), 0 states have call successors, (0), 0 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:27:49,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1509 states to 1509 states and 3829 transitions. [2024-11-09 19:27:49,908 INFO L78 Accepts]: Start accepts. Automaton has 1509 states and 3829 transitions. Word has length 9 [2024-11-09 19:27:49,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:27:49,909 INFO L471 AbstractCegarLoop]: Abstraction has 1509 states and 3829 transitions. [2024-11-09 19:27:49,909 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 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:27:49,909 INFO L276 IsEmpty]: Start isEmpty. Operand 1509 states and 3829 transitions. [2024-11-09 19:27:49,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-09 19:27:49,912 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:27:49,912 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-09 19:27:49,913 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 19:27:49,913 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:27:49,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:27:49,914 INFO L85 PathProgramCache]: Analyzing trace with hash 1989443295, now seen corresponding path program 1 times [2024-11-09 19:27:49,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:27:49,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445259426] [2024-11-09 19:27:49,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:27:49,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:27:49,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:27:50,230 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 19:27:50,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:27:50,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445259426] [2024-11-09 19:27:50,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445259426] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:27:50,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:27:50,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:27:50,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358319225] [2024-11-09 19:27:50,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:27:50,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:27:50,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:27:50,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:27:50,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:27:50,237 INFO L87 Difference]: Start difference. First operand 1509 states and 3829 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 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:27:54,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:27:54,399 INFO L93 Difference]: Finished difference Result 4520 states and 11481 transitions. [2024-11-09 19:27:54,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:27:54,400 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 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 81 [2024-11-09 19:27:54,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:27:54,413 INFO L225 Difference]: With dead ends: 4520 [2024-11-09 19:27:54,413 INFO L226 Difference]: Without dead ends: 3013 [2024-11-09 19:27:54,415 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:27:54,418 INFO L432 NwaCegarLoop]: 2066 mSDtfsCounter, 1452 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 3342 mSolverCounterSat, 885 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1452 SdHoareTripleChecker+Valid, 2076 SdHoareTripleChecker+Invalid, 4227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 885 IncrementalHoareTripleChecker+Valid, 3342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2024-11-09 19:27:54,418 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1452 Valid, 2076 Invalid, 4227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [885 Valid, 3342 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2024-11-09 19:27:54,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3013 states. [2024-11-09 19:27:54,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3013 to 3013. [2024-11-09 19:27:54,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3013 states, 3012 states have (on average 2.2659362549800797) internal successors, (6825), 3012 states have internal predecessors, (6825), 0 states have call successors, (0), 0 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:27:54,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3013 states to 3013 states and 6825 transitions. [2024-11-09 19:27:54,482 INFO L78 Accepts]: Start accepts. Automaton has 3013 states and 6825 transitions. Word has length 81 [2024-11-09 19:27:54,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:27:54,483 INFO L471 AbstractCegarLoop]: Abstraction has 3013 states and 6825 transitions. [2024-11-09 19:27:54,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 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:27:54,484 INFO L276 IsEmpty]: Start isEmpty. Operand 3013 states and 6825 transitions. [2024-11-09 19:27:54,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-09 19:27:54,487 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:27:54,488 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-09 19:27:54,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 19:27:54,488 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:27:54,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:27:54,489 INFO L85 PathProgramCache]: Analyzing trace with hash 532559619, now seen corresponding path program 1 times [2024-11-09 19:27:54,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:27:54,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952732498] [2024-11-09 19:27:54,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:27:54,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:27:54,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:27:54,670 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 19:27:54,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:27:54,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952732498] [2024-11-09 19:27:54,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [952732498] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:27:54,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:27:54,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 19:27:54,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277605180] [2024-11-09 19:27:54,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:27:54,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:27:54,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:27:54,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:27:54,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:27:54,673 INFO L87 Difference]: Start difference. First operand 3013 states and 6825 transitions. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 2 states have internal predecessors, (84), 0 states have call successors, (0), 0 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:27:58,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:27:58,613 INFO L93 Difference]: Finished difference Result 9035 states and 20471 transitions. [2024-11-09 19:27:58,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:27:58,614 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 2 states have internal predecessors, (84), 0 states have call successors, (0), 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 84 [2024-11-09 19:27:58,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:27:58,641 INFO L225 Difference]: With dead ends: 9035 [2024-11-09 19:27:58,644 INFO L226 Difference]: Without dead ends: 6024 [2024-11-09 19:27:58,650 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:27:58,653 INFO L432 NwaCegarLoop]: 586 mSDtfsCounter, 1408 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 3680 mSolverCounterSat, 628 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1408 SdHoareTripleChecker+Valid, 595 SdHoareTripleChecker+Invalid, 4308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 628 IncrementalHoareTripleChecker+Valid, 3680 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2024-11-09 19:27:58,653 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1408 Valid, 595 Invalid, 4308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [628 Valid, 3680 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2024-11-09 19:27:58,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6024 states. [2024-11-09 19:27:58,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6024 to 6021. [2024-11-09 19:27:58,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6021 states, 6020 states have (on average 2.1461794019933556) internal successors, (12920), 6020 states have internal predecessors, (12920), 0 states have call successors, (0), 0 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:27:58,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6021 states to 6021 states and 12920 transitions. [2024-11-09 19:27:58,834 INFO L78 Accepts]: Start accepts. Automaton has 6021 states and 12920 transitions. Word has length 84 [2024-11-09 19:27:58,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:27:58,835 INFO L471 AbstractCegarLoop]: Abstraction has 6021 states and 12920 transitions. [2024-11-09 19:27:58,835 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 2 states have internal predecessors, (84), 0 states have call successors, (0), 0 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:27:58,835 INFO L276 IsEmpty]: Start isEmpty. Operand 6021 states and 12920 transitions. [2024-11-09 19:27:58,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-09 19:27:58,839 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:27:58,840 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-09 19:27:58,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 19:27:58,840 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:27:58,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:27:58,841 INFO L85 PathProgramCache]: Analyzing trace with hash -171097749, now seen corresponding path program 1 times [2024-11-09 19:27:58,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:27:58,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437183748] [2024-11-09 19:27:58,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:27:58,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:27:58,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:27:59,222 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 19:27:59,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:27:59,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437183748] [2024-11-09 19:27:59,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1437183748] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:27:59,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:27:59,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 19:27:59,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064442339] [2024-11-09 19:27:59,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:27:59,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 19:27:59,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:27:59,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 19:27:59,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 19:27:59,226 INFO L87 Difference]: Start difference. First operand 6021 states and 12920 transitions. Second operand has 5 states, 5 states have (on average 17.0) internal successors, (85), 4 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:28:03,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:28:03,309 INFO L93 Difference]: Finished difference Result 12792 states and 27360 transitions. [2024-11-09 19:28:03,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 19:28:03,309 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.0) internal successors, (85), 4 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 85 [2024-11-09 19:28:03,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:28:03,336 INFO L225 Difference]: With dead ends: 12792 [2024-11-09 19:28:03,336 INFO L226 Difference]: Without dead ends: 6773 [2024-11-09 19:28:03,343 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-09 19:28:03,345 INFO L432 NwaCegarLoop]: 693 mSDtfsCounter, 2938 mSDsluCounter, 482 mSDsCounter, 0 mSdLazyCounter, 5192 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2938 SdHoareTripleChecker+Valid, 1175 SdHoareTripleChecker+Invalid, 5275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 5192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2024-11-09 19:28:03,345 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2938 Valid, 1175 Invalid, 5275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 5192 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2024-11-09 19:28:03,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6773 states. [2024-11-09 19:28:03,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6773 to 6773. [2024-11-09 19:28:03,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6773 states, 6772 states have (on average 2.120200826934436) internal successors, (14358), 6772 states have internal predecessors, (14358), 0 states have call successors, (0), 0 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:28:03,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6773 states to 6773 states and 14358 transitions. [2024-11-09 19:28:03,460 INFO L78 Accepts]: Start accepts. Automaton has 6773 states and 14358 transitions. Word has length 85 [2024-11-09 19:28:03,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:28:03,461 INFO L471 AbstractCegarLoop]: Abstraction has 6773 states and 14358 transitions. [2024-11-09 19:28:03,461 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.0) internal successors, (85), 4 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:28:03,461 INFO L276 IsEmpty]: Start isEmpty. Operand 6773 states and 14358 transitions. [2024-11-09 19:28:03,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-11-09 19:28:03,463 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:28:03,467 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-09 19:28:03,467 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 19:28:03,468 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:28:03,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:28:03,468 INFO L85 PathProgramCache]: Analyzing trace with hash -352267956, now seen corresponding path program 1 times [2024-11-09 19:28:03,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:28:03,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079373037] [2024-11-09 19:28:03,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:28:03,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:28:03,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:28:03,827 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 19:28:03,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:28:03,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079373037] [2024-11-09 19:28:03,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1079373037] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:28:03,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:28:03,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:28:03,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128338981] [2024-11-09 19:28:03,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:28:03,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 19:28:03,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:28:03,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 19:28:03,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 19:28:03,833 INFO L87 Difference]: Start difference. First operand 6773 states and 14358 transitions. Second operand has 4 states, 4 states have (on average 37.5) internal successors, (150), 3 states have internal predecessors, (150), 0 states have call successors, (0), 0 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:28:08,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:28:08,143 INFO L93 Difference]: Finished difference Result 15841 states and 33411 transitions. [2024-11-09 19:28:08,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 19:28:08,144 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 37.5) internal successors, (150), 3 states have internal predecessors, (150), 0 states have call successors, (0), 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 150 [2024-11-09 19:28:08,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:28:08,166 INFO L225 Difference]: With dead ends: 15841 [2024-11-09 19:28:08,167 INFO L226 Difference]: Without dead ends: 8280 [2024-11-09 19:28:08,174 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 19:28:08,175 INFO L432 NwaCegarLoop]: 699 mSDtfsCounter, 1371 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 5846 mSolverCounterSat, 207 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1371 SdHoareTripleChecker+Valid, 723 SdHoareTripleChecker+Invalid, 6053 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 207 IncrementalHoareTripleChecker+Valid, 5846 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2024-11-09 19:28:08,176 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1371 Valid, 723 Invalid, 6053 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [207 Valid, 5846 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2024-11-09 19:28:08,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8280 states. [2024-11-09 19:28:08,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8280 to 8277. [2024-11-09 19:28:08,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8277 states, 8276 states have (on average 2.084461092315128) internal successors, (17251), 8276 states have internal predecessors, (17251), 0 states have call successors, (0), 0 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:28:08,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8277 states to 8277 states and 17251 transitions. [2024-11-09 19:28:08,303 INFO L78 Accepts]: Start accepts. Automaton has 8277 states and 17251 transitions. Word has length 150 [2024-11-09 19:28:08,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:28:08,305 INFO L471 AbstractCegarLoop]: Abstraction has 8277 states and 17251 transitions. [2024-11-09 19:28:08,305 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.5) internal successors, (150), 3 states have internal predecessors, (150), 0 states have call successors, (0), 0 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:28:08,305 INFO L276 IsEmpty]: Start isEmpty. Operand 8277 states and 17251 transitions. [2024-11-09 19:28:08,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2024-11-09 19:28:08,308 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:28:08,308 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28:08,308 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 19:28:08,308 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:28:08,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:28:08,309 INFO L85 PathProgramCache]: Analyzing trace with hash -1507771188, now seen corresponding path program 1 times [2024-11-09 19:28:08,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:28:08,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225345547] [2024-11-09 19:28:08,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:28:08,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:28:08,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:28:08,536 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2024-11-09 19:28:08,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:28:08,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225345547] [2024-11-09 19:28:08,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1225345547] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:28:08,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:28:08,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 19:28:08,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700810792] [2024-11-09 19:28:08,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:28:08,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:28:08,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:28:08,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:28:08,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:28:08,540 INFO L87 Difference]: Start difference. First operand 8277 states and 17251 transitions. Second operand has 3 states, 3 states have (on average 51.0) internal successors, (153), 2 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:28:12,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:28:12,064 INFO L93 Difference]: Finished difference Result 19560 states and 41512 transitions. [2024-11-09 19:28:12,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:28:12,065 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 2 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 226 [2024-11-09 19:28:12,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:28:12,089 INFO L225 Difference]: With dead ends: 19560 [2024-11-09 19:28:12,090 INFO L226 Difference]: Without dead ends: 12037 [2024-11-09 19:28:12,098 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:28:12,100 INFO L432 NwaCegarLoop]: 490 mSDtfsCounter, 1350 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 3353 mSolverCounterSat, 840 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1350 SdHoareTripleChecker+Valid, 497 SdHoareTripleChecker+Invalid, 4193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 840 IncrementalHoareTripleChecker+Valid, 3353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2024-11-09 19:28:12,100 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1350 Valid, 497 Invalid, 4193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [840 Valid, 3353 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2024-11-09 19:28:12,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12037 states. [2024-11-09 19:28:12,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12037 to 12037. [2024-11-09 19:28:12,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12037 states, 12036 states have (on average 2.06613492854769) internal successors, (24868), 12036 states have internal predecessors, (24868), 0 states have call successors, (0), 0 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:28:12,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12037 states to 12037 states and 24868 transitions. [2024-11-09 19:28:12,282 INFO L78 Accepts]: Start accepts. Automaton has 12037 states and 24868 transitions. Word has length 226 [2024-11-09 19:28:12,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:28:12,283 INFO L471 AbstractCegarLoop]: Abstraction has 12037 states and 24868 transitions. [2024-11-09 19:28:12,284 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 2 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:28:12,285 INFO L276 IsEmpty]: Start isEmpty. Operand 12037 states and 24868 transitions. [2024-11-09 19:28:12,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2024-11-09 19:28:12,287 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:28:12,287 INFO L215 NwaCegarLoop]: trace histogram [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, 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] [2024-11-09 19:28:12,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 19:28:12,288 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:28:12,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:28:12,288 INFO L85 PathProgramCache]: Analyzing trace with hash 1219401312, now seen corresponding path program 1 times [2024-11-09 19:28:12,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:28:12,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791774818] [2024-11-09 19:28:12,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:28:12,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:28:12,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:28:12,483 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 19:28:12,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:28:12,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791774818] [2024-11-09 19:28:12,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791774818] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:28:12,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:28:12,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:28:12,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007961855] [2024-11-09 19:28:12,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:28:12,485 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:28:12,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:28:12,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:28:12,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:28:12,486 INFO L87 Difference]: Start difference. First operand 12037 states and 24868 transitions. Second operand has 3 states, 3 states have (on average 79.0) internal successors, (237), 3 states have internal predecessors, (237), 0 states have call successors, (0), 0 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:28:16,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:28:16,445 INFO L93 Difference]: Finished difference Result 34600 states and 71724 transitions. [2024-11-09 19:28:16,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:28:16,445 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 79.0) internal successors, (237), 3 states have internal predecessors, (237), 0 states have call successors, (0), 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 237 [2024-11-09 19:28:16,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:28:16,484 INFO L225 Difference]: With dead ends: 34600 [2024-11-09 19:28:16,485 INFO L226 Difference]: Without dead ends: 23317 [2024-11-09 19:28:16,499 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:28:16,503 INFO L432 NwaCegarLoop]: 2020 mSDtfsCounter, 1348 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 4065 mSolverCounterSat, 373 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1348 SdHoareTripleChecker+Valid, 2030 SdHoareTripleChecker+Invalid, 4438 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 373 IncrementalHoareTripleChecker+Valid, 4065 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2024-11-09 19:28:16,503 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1348 Valid, 2030 Invalid, 4438 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [373 Valid, 4065 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2024-11-09 19:28:16,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23317 states. [2024-11-09 19:28:16,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23317 to 21813. [2024-11-09 19:28:16,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21813 states, 21812 states have (on average 2.055244819365487) internal successors, (44829), 21812 states have internal predecessors, (44829), 0 states have call successors, (0), 0 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:28:16,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21813 states to 21813 states and 44829 transitions. [2024-11-09 19:28:16,812 INFO L78 Accepts]: Start accepts. Automaton has 21813 states and 44829 transitions. Word has length 237 [2024-11-09 19:28:16,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:28:16,813 INFO L471 AbstractCegarLoop]: Abstraction has 21813 states and 44829 transitions. [2024-11-09 19:28:16,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 79.0) internal successors, (237), 3 states have internal predecessors, (237), 0 states have call successors, (0), 0 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:28:16,813 INFO L276 IsEmpty]: Start isEmpty. Operand 21813 states and 44829 transitions. [2024-11-09 19:28:16,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2024-11-09 19:28:16,815 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:28:16,816 INFO L215 NwaCegarLoop]: trace histogram [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, 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] [2024-11-09 19:28:16,816 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 19:28:16,816 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:28:16,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:28:16,817 INFO L85 PathProgramCache]: Analyzing trace with hash -591120404, now seen corresponding path program 1 times [2024-11-09 19:28:16,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:28:16,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388916210] [2024-11-09 19:28:16,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:28:16,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:28:16,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:28:17,180 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 42 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 19:28:17,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:28:17,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388916210] [2024-11-09 19:28:17,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [388916210] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 19:28:17,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [478109812] [2024-11-09 19:28:17,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:28:17,181 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 19:28:17,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 19:28:17,184 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:28:17,186 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:28:17,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:28:17,467 INFO L255 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 19:28:17,475 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 19:28:17,517 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2024-11-09 19:28:17,517 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 19:28:17,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [478109812] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:28:17,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 19:28:17,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2024-11-09 19:28:17,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977736909] [2024-11-09 19:28:17,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:28:17,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:28:17,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:28:17,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:28:17,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 19:28:17,520 INFO L87 Difference]: Start difference. First operand 21813 states and 44829 transitions. Second operand has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 0 states have call successors, (0), 0 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:28:21,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:28:21,349 INFO L93 Difference]: Finished difference Result 51144 states and 106136 transitions. [2024-11-09 19:28:21,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:28:21,350 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 0 states have call successors, (0), 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 241 [2024-11-09 19:28:21,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:28:21,401 INFO L225 Difference]: With dead ends: 51144 [2024-11-09 19:28:21,402 INFO L226 Difference]: Without dead ends: 30085 [2024-11-09 19:28:21,426 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 241 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 19:28:21,427 INFO L432 NwaCegarLoop]: 1567 mSDtfsCounter, 1504 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 3633 mSolverCounterSat, 779 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1504 SdHoareTripleChecker+Valid, 1577 SdHoareTripleChecker+Invalid, 4412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 779 IncrementalHoareTripleChecker+Valid, 3633 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2024-11-09 19:28:21,428 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1504 Valid, 1577 Invalid, 4412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [779 Valid, 3633 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2024-11-09 19:28:21,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30085 states. [2024-11-09 19:28:21,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30085 to 28581. [2024-11-09 19:28:21,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28581 states, 28580 states have (on average 2.0824002799160253) internal successors, (59515), 28580 states have internal predecessors, (59515), 0 states have call successors, (0), 0 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:28:22,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28581 states to 28581 states and 59515 transitions. [2024-11-09 19:28:22,036 INFO L78 Accepts]: Start accepts. Automaton has 28581 states and 59515 transitions. Word has length 241 [2024-11-09 19:28:22,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:28:22,037 INFO L471 AbstractCegarLoop]: Abstraction has 28581 states and 59515 transitions. [2024-11-09 19:28:22,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 0 states have call successors, (0), 0 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:28:22,037 INFO L276 IsEmpty]: Start isEmpty. Operand 28581 states and 59515 transitions. [2024-11-09 19:28:22,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2024-11-09 19:28:22,041 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:28:22,041 INFO L215 NwaCegarLoop]: trace histogram [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, 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] [2024-11-09 19:28:22,062 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-09 19:28:22,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 19:28:22,246 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:28:22,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:28:22,247 INFO L85 PathProgramCache]: Analyzing trace with hash 468547985, now seen corresponding path program 1 times [2024-11-09 19:28:22,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:28:22,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459808462] [2024-11-09 19:28:22,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:28:22,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:28:22,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:28:22,441 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 148 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2024-11-09 19:28:22,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:28:22,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459808462] [2024-11-09 19:28:22,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [459808462] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:28:22,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:28:22,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 19:28:22,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111800729] [2024-11-09 19:28:22,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:28:22,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:28:22,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:28:22,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:28:22,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:28:22,446 INFO L87 Difference]: Start difference. First operand 28581 states and 59515 transitions. Second operand has 3 states, 3 states have (on average 73.66666666666667) internal successors, (221), 2 states have internal predecessors, (221), 0 states have call successors, (0), 0 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:28:26,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:28:26,558 INFO L93 Difference]: Finished difference Result 75963 states and 159301 transitions. [2024-11-09 19:28:26,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:28:26,570 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 73.66666666666667) internal successors, (221), 2 states have internal predecessors, (221), 0 states have call successors, (0), 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 297 [2024-11-09 19:28:26,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:28:26,645 INFO L225 Difference]: With dead ends: 75963 [2024-11-09 19:28:26,645 INFO L226 Difference]: Without dead ends: 42120 [2024-11-09 19:28:26,660 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:28:26,661 INFO L432 NwaCegarLoop]: 304 mSDtfsCounter, 1525 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 3669 mSolverCounterSat, 464 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1525 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 4133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 464 IncrementalHoareTripleChecker+Valid, 3669 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2024-11-09 19:28:26,661 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1525 Valid, 313 Invalid, 4133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [464 Valid, 3669 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2024-11-09 19:28:26,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42120 states. [2024-11-09 19:28:27,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42120 to 36853. [2024-11-09 19:28:27,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36853 states, 36852 states have (on average 2.0610821665038532) internal successors, (75955), 36852 states have internal predecessors, (75955), 0 states have call successors, (0), 0 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:28:27,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36853 states to 36853 states and 75955 transitions. [2024-11-09 19:28:27,272 INFO L78 Accepts]: Start accepts. Automaton has 36853 states and 75955 transitions. Word has length 297 [2024-11-09 19:28:27,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:28:27,272 INFO L471 AbstractCegarLoop]: Abstraction has 36853 states and 75955 transitions. [2024-11-09 19:28:27,272 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 73.66666666666667) internal successors, (221), 2 states have internal predecessors, (221), 0 states have call successors, (0), 0 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:28:27,273 INFO L276 IsEmpty]: Start isEmpty. Operand 36853 states and 75955 transitions. [2024-11-09 19:28:27,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 381 [2024-11-09 19:28:27,282 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:28:27,283 INFO L215 NwaCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28:27,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 19:28:27,283 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:28:27,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:28:27,284 INFO L85 PathProgramCache]: Analyzing trace with hash -1977574080, now seen corresponding path program 1 times [2024-11-09 19:28:27,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:28:27,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983999651] [2024-11-09 19:28:27,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:28:27,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:28:27,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:28:27,880 INFO L134 CoverageAnalysis]: Checked inductivity of 453 backedges. 362 proven. 0 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2024-11-09 19:28:27,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:28:27,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983999651] [2024-11-09 19:28:27,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983999651] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:28:27,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:28:27,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:28:27,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37125666] [2024-11-09 19:28:27,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:28:27,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:28:27,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:28:27,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:28:27,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:28:27,884 INFO L87 Difference]: Start difference. First operand 36853 states and 75955 transitions. Second operand has 3 states, 3 states have (on average 97.0) internal successors, (291), 3 states have internal predecessors, (291), 0 states have call successors, (0), 0 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:28:31,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:28:31,881 INFO L93 Difference]: Finished difference Result 94008 states and 195212 transitions. [2024-11-09 19:28:31,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:28:31,881 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 97.0) internal successors, (291), 3 states have internal predecessors, (291), 0 states have call successors, (0), 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 380 [2024-11-09 19:28:31,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:28:31,961 INFO L225 Difference]: With dead ends: 94008 [2024-11-09 19:28:31,961 INFO L226 Difference]: Without dead ends: 57909 [2024-11-09 19:28:31,980 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:28:31,981 INFO L432 NwaCegarLoop]: 399 mSDtfsCounter, 1415 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 3554 mSolverCounterSat, 636 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1415 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 4190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 636 IncrementalHoareTripleChecker+Valid, 3554 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2024-11-09 19:28:31,981 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1415 Valid, 406 Invalid, 4190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [636 Valid, 3554 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2024-11-09 19:28:32,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57909 states. [2024-11-09 19:28:32,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57909 to 57909. [2024-11-09 19:28:32,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57909 states, 57908 states have (on average 2.0508565310492504) internal successors, (118761), 57908 states have internal predecessors, (118761), 0 states have call successors, (0), 0 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:28:33,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57909 states to 57909 states and 118761 transitions. [2024-11-09 19:28:33,135 INFO L78 Accepts]: Start accepts. Automaton has 57909 states and 118761 transitions. Word has length 380 [2024-11-09 19:28:33,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:28:33,135 INFO L471 AbstractCegarLoop]: Abstraction has 57909 states and 118761 transitions. [2024-11-09 19:28:33,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 97.0) internal successors, (291), 3 states have internal predecessors, (291), 0 states have call successors, (0), 0 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:28:33,136 INFO L276 IsEmpty]: Start isEmpty. Operand 57909 states and 118761 transitions. [2024-11-09 19:28:33,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 402 [2024-11-09 19:28:33,146 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:28:33,146 INFO L215 NwaCegarLoop]: trace histogram [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, 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, 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:28:33,146 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 19:28:33,147 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:28:33,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:28:33,149 INFO L85 PathProgramCache]: Analyzing trace with hash -948185799, now seen corresponding path program 1 times [2024-11-09 19:28:33,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:28:33,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930499025] [2024-11-09 19:28:33,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:28:33,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:28:33,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:28:33,656 INFO L134 CoverageAnalysis]: Checked inductivity of 333 backedges. 248 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2024-11-09 19:28:33,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:28:33,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930499025] [2024-11-09 19:28:33,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930499025] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:28:33,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:28:33,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:28:33,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990844597] [2024-11-09 19:28:33,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:28:33,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:28:33,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:28:33,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:28:33,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:28:33,659 INFO L87 Difference]: Start difference. First operand 57909 states and 118761 transitions. Second operand has 3 states, 3 states have (on average 105.66666666666667) internal successors, (317), 3 states have internal predecessors, (317), 0 states have call successors, (0), 0 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:28:37,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:28:37,762 INFO L93 Difference]: Finished difference Result 138376 states and 286164 transitions. [2024-11-09 19:28:37,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:28:37,763 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 105.66666666666667) internal successors, (317), 3 states have internal predecessors, (317), 0 states have call successors, (0), 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 401 [2024-11-09 19:28:37,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:28:38,017 INFO L225 Difference]: With dead ends: 138376 [2024-11-09 19:28:38,017 INFO L226 Difference]: Without dead ends: 81221 [2024-11-09 19:28:38,041 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:28:38,041 INFO L432 NwaCegarLoop]: 1882 mSDtfsCounter, 1291 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 3584 mSolverCounterSat, 494 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1291 SdHoareTripleChecker+Valid, 1892 SdHoareTripleChecker+Invalid, 4078 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 494 IncrementalHoareTripleChecker+Valid, 3584 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2024-11-09 19:28:38,042 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1291 Valid, 1892 Invalid, 4078 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [494 Valid, 3584 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2024-11-09 19:28:38,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81221 states. [2024-11-09 19:28:39,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81221 to 81221. [2024-11-09 19:28:39,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81221 states, 81220 states have (on average 2.029438561930559) internal successors, (164831), 81220 states have internal predecessors, (164831), 0 states have call successors, (0), 0 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:28:39,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81221 states to 81221 states and 164831 transitions. [2024-11-09 19:28:39,509 INFO L78 Accepts]: Start accepts. Automaton has 81221 states and 164831 transitions. Word has length 401 [2024-11-09 19:28:39,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:28:39,510 INFO L471 AbstractCegarLoop]: Abstraction has 81221 states and 164831 transitions. [2024-11-09 19:28:39,510 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 105.66666666666667) internal successors, (317), 3 states have internal predecessors, (317), 0 states have call successors, (0), 0 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:28:39,510 INFO L276 IsEmpty]: Start isEmpty. Operand 81221 states and 164831 transitions. [2024-11-09 19:28:39,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 413 [2024-11-09 19:28:39,517 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:28:39,517 INFO L215 NwaCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28:39,517 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 19:28:39,518 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:28:39,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:28:39,518 INFO L85 PathProgramCache]: Analyzing trace with hash 1307564256, now seen corresponding path program 1 times [2024-11-09 19:28:39,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:28:39,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701793849] [2024-11-09 19:28:39,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:28:39,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:28:39,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:28:40,016 INFO L134 CoverageAnalysis]: Checked inductivity of 485 backedges. 223 proven. 0 refuted. 0 times theorem prover too weak. 262 trivial. 0 not checked. [2024-11-09 19:28:40,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:28:40,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701793849] [2024-11-09 19:28:40,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [701793849] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:28:40,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:28:40,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:28:40,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563617821] [2024-11-09 19:28:40,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:28:40,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:28:40,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:28:40,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:28:40,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:28:40,020 INFO L87 Difference]: Start difference. First operand 81221 states and 164831 transitions. Second operand has 3 states, 3 states have (on average 74.0) internal successors, (222), 3 states have internal predecessors, (222), 0 states have call successors, (0), 0 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:28:44,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:28:44,821 INFO L93 Difference]: Finished difference Result 197032 states and 401319 transitions. [2024-11-09 19:28:44,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:28:44,821 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 74.0) internal successors, (222), 3 states have internal predecessors, (222), 0 states have call successors, (0), 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 412 [2024-11-09 19:28:44,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:28:44,995 INFO L225 Difference]: With dead ends: 197032 [2024-11-09 19:28:44,995 INFO L226 Difference]: Without dead ends: 113557 [2024-11-09 19:28:45,019 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:28:45,020 INFO L432 NwaCegarLoop]: 1974 mSDtfsCounter, 1387 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 3535 mSolverCounterSat, 591 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1387 SdHoareTripleChecker+Valid, 1984 SdHoareTripleChecker+Invalid, 4126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 591 IncrementalHoareTripleChecker+Valid, 3535 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2024-11-09 19:28:45,020 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1387 Valid, 1984 Invalid, 4126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [591 Valid, 3535 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2024-11-09 19:28:45,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113557 states. [2024-11-09 19:28:46,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113557 to 105285. [2024-11-09 19:28:46,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105285 states, 105284 states have (on average 2.009773564834163) internal successors, (211597), 105284 states have internal predecessors, (211597), 0 states have call successors, (0), 0 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:28:46,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105285 states to 105285 states and 211597 transitions. [2024-11-09 19:28:46,494 INFO L78 Accepts]: Start accepts. Automaton has 105285 states and 211597 transitions. Word has length 412 [2024-11-09 19:28:46,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:28:46,495 INFO L471 AbstractCegarLoop]: Abstraction has 105285 states and 211597 transitions. [2024-11-09 19:28:46,495 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 74.0) internal successors, (222), 3 states have internal predecessors, (222), 0 states have call successors, (0), 0 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:28:46,495 INFO L276 IsEmpty]: Start isEmpty. Operand 105285 states and 211597 transitions. [2024-11-09 19:28:46,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 431 [2024-11-09 19:28:46,503 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:28:46,503 INFO L215 NwaCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-09 19:28:46,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-09 19:28:46,504 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:28:46,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:28:46,504 INFO L85 PathProgramCache]: Analyzing trace with hash 467859883, now seen corresponding path program 1 times [2024-11-09 19:28:46,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:28:46,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318944101] [2024-11-09 19:28:46,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:28:46,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:28:46,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:28:47,594 INFO L134 CoverageAnalysis]: Checked inductivity of 321 backedges. 315 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-09 19:28:47,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:28:47,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318944101] [2024-11-09 19:28:47,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318944101] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:28:47,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:28:47,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:28:47,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970946655] [2024-11-09 19:28:47,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:28:47,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:28:47,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:28:47,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:28:47,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:28:47,598 INFO L87 Difference]: Start difference. First operand 105285 states and 211597 transitions. Second operand has 3 states, 3 states have (on average 141.66666666666666) internal successors, (425), 3 states have internal predecessors, (425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)