./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem17_label14.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem17_label14.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 0ac429ca8e99b6512d8aadb8f8e502aadaca92db9137fa23838c552f61d5f382 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-10 23:45:50,775 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-10 23:45:50,842 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-10 23:45:50,848 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-10 23:45:50,850 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-10 23:45:50,885 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-10 23:45:50,887 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-10 23:45:50,887 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-10 23:45:50,888 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-10 23:45:50,888 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-10 23:45:50,889 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-10 23:45:50,889 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-10 23:45:50,890 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-10 23:45:50,892 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-10 23:45:50,893 INFO L153 SettingsManager]: * Use SBE=true [2024-10-10 23:45:50,893 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-10 23:45:50,894 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-10 23:45:50,894 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-10 23:45:50,894 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-10 23:45:50,894 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-10 23:45:50,895 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-10 23:45:50,895 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-10 23:45:50,896 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-10 23:45:50,896 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-10 23:45:50,896 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-10 23:45:50,897 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-10 23:45:50,897 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-10 23:45:50,901 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-10 23:45:50,902 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-10 23:45:50,902 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-10 23:45:50,902 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-10 23:45:50,902 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-10 23:45:50,903 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 23:45:50,903 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-10 23:45:50,903 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-10 23:45:50,903 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-10 23:45:50,904 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-10 23:45:50,904 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-10 23:45:50,904 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-10 23:45:50,904 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-10 23:45:50,904 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-10 23:45:50,905 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-10 23:45:50,906 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-clean/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-clean/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 -> 0ac429ca8e99b6512d8aadb8f8e502aadaca92db9137fa23838c552f61d5f382 [2024-10-10 23:45:51,181 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-10 23:45:51,209 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-10 23:45:51,212 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-10 23:45:51,213 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-10 23:45:51,214 INFO L274 PluginConnector]: CDTParser initialized [2024-10-10 23:45:51,215 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem17_label14.c [2024-10-10 23:45:52,687 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-10 23:45:53,098 INFO L384 CDTParser]: Found 1 translation units. [2024-10-10 23:45:53,100 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem17_label14.c [2024-10-10 23:45:53,127 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/0fc8a668e/35ed52bcd7034f98b7ddb042d1af28dc/FLAG8d3b6844e [2024-10-10 23:45:53,142 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/0fc8a668e/35ed52bcd7034f98b7ddb042d1af28dc [2024-10-10 23:45:53,145 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-10 23:45:53,148 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-10 23:45:53,149 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-10 23:45:53,149 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-10 23:45:53,155 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-10 23:45:53,157 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 11:45:53" (1/1) ... [2024-10-10 23:45:53,159 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@970624a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:45:53, skipping insertion in model container [2024-10-10 23:45:53,159 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 11:45:53" (1/1) ... [2024-10-10 23:45:53,247 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-10 23:45:53,524 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem17_label14.c[6990,7003] [2024-10-10 23:45:54,001 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 23:45:54,012 INFO L200 MainTranslator]: Completed pre-run [2024-10-10 23:45:54,032 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem17_label14.c[6990,7003] [2024-10-10 23:45:54,413 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 23:45:54,436 INFO L204 MainTranslator]: Completed translation [2024-10-10 23:45:54,437 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:45:54 WrapperNode [2024-10-10 23:45:54,437 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-10 23:45:54,438 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-10 23:45:54,438 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-10 23:45:54,439 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-10 23:45:54,445 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:45:54" (1/1) ... [2024-10-10 23:45:54,502 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:45:54" (1/1) ... [2024-10-10 23:45:54,824 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 2613 [2024-10-10 23:45:54,824 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-10 23:45:54,825 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-10 23:45:54,825 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-10 23:45:54,825 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-10 23:45:54,836 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:45:54" (1/1) ... [2024-10-10 23:45:54,836 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:45:54" (1/1) ... [2024-10-10 23:45:54,893 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:45:54" (1/1) ... [2024-10-10 23:45:55,033 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-10 23:45:55,033 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:45:54" (1/1) ... [2024-10-10 23:45:55,034 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:45:54" (1/1) ... [2024-10-10 23:45:55,173 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:45:54" (1/1) ... [2024-10-10 23:45:55,201 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:45:54" (1/1) ... [2024-10-10 23:45:55,248 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:45:54" (1/1) ... [2024-10-10 23:45:55,266 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:45:54" (1/1) ... [2024-10-10 23:45:55,317 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-10 23:45:55,319 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-10 23:45:55,319 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-10 23:45:55,320 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-10 23:45:55,321 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:45:54" (1/1) ... [2024-10-10 23:45:55,326 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 23:45:55,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:45:55,356 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-10 23:45:55,362 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-10 23:45:55,400 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-10 23:45:55,400 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-10 23:45:55,400 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-10 23:45:55,400 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-10 23:45:55,464 INFO L238 CfgBuilder]: Building ICFG [2024-10-10 23:45:55,466 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-10 23:45:58,440 INFO L? ?]: Removed 372 outVars from TransFormulas that were not future-live. [2024-10-10 23:45:58,440 INFO L287 CfgBuilder]: Performing block encoding [2024-10-10 23:45:58,504 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-10 23:45:58,504 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-10 23:45:58,505 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 11:45:58 BoogieIcfgContainer [2024-10-10 23:45:58,505 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-10 23:45:58,512 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-10 23:45:58,514 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-10 23:45:58,517 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-10 23:45:58,518 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.10 11:45:53" (1/3) ... [2024-10-10 23:45:58,518 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4aa818e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 11:45:58, skipping insertion in model container [2024-10-10 23:45:58,519 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:45:54" (2/3) ... [2024-10-10 23:45:58,519 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4aa818e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 11:45:58, skipping insertion in model container [2024-10-10 23:45:58,519 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 11:45:58" (3/3) ... [2024-10-10 23:45:58,521 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem17_label14.c [2024-10-10 23:45:58,537 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-10 23:45:58,538 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-10 23:45:58,612 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-10 23:45:58,619 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;@35617575, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-10 23:45:58,619 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-10 23:45:58,629 INFO L276 IsEmpty]: Start isEmpty. Operand has 528 states, 526 states have (on average 1.9011406844106464) internal successors, (1000), 527 states have internal predecessors, (1000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:45:58,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-10-10 23:45:58,637 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:45:58,639 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:45:58,640 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:45:58,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:45:58,646 INFO L85 PathProgramCache]: Analyzing trace with hash 1875961542, now seen corresponding path program 1 times [2024-10-10 23:45:58,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:45:58,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270974357] [2024-10-10 23:45:58,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:45:58,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:45:58,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:45:58,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:45:58,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:45:58,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270974357] [2024-10-10 23:45:58,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1270974357] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:45:58,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:45:58,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:45:58,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682897883] [2024-10-10 23:45:58,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:45:58,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-10 23:45:58,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:45:58,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-10 23:45:58,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-10 23:45:58,874 INFO L87 Difference]: Start difference. First operand has 528 states, 526 states have (on average 1.9011406844106464) internal successors, (1000), 527 states have internal predecessors, (1000), 0 states have call successors, (0), 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 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:45:58,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:45:58,962 INFO L93 Difference]: Finished difference Result 1055 states and 1999 transitions. [2024-10-10 23:45:58,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-10 23:45:58,966 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 0 states have call successors, (0), 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 46 [2024-10-10 23:45:58,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:45:58,982 INFO L225 Difference]: With dead ends: 1055 [2024-10-10 23:45:58,982 INFO L226 Difference]: Without dead ends: 526 [2024-10-10 23:45:58,987 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-10 23:45:58,992 INFO L432 NwaCegarLoop]: 935 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 935 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 23:45:58,993 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 935 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 23:45:59,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2024-10-10 23:45:59,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 526. [2024-10-10 23:45:59,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 526 states, 525 states have (on average 1.7809523809523808) internal successors, (935), 525 states have internal predecessors, (935), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:45:59,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 526 states and 935 transitions. [2024-10-10 23:45:59,067 INFO L78 Accepts]: Start accepts. Automaton has 526 states and 935 transitions. Word has length 46 [2024-10-10 23:45:59,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:45:59,067 INFO L471 AbstractCegarLoop]: Abstraction has 526 states and 935 transitions. [2024-10-10 23:45:59,068 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:45:59,068 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states and 935 transitions. [2024-10-10 23:45:59,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-10-10 23:45:59,070 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:45:59,070 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:45:59,071 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-10 23:45:59,071 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:45:59,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:45:59,072 INFO L85 PathProgramCache]: Analyzing trace with hash -862707287, now seen corresponding path program 1 times [2024-10-10 23:45:59,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:45:59,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882373027] [2024-10-10 23:45:59,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:45:59,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:45:59,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:45:59,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:45:59,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:45:59,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882373027] [2024-10-10 23:45:59,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882373027] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:45:59,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:45:59,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:45:59,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981842350] [2024-10-10 23:45:59,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:45:59,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:45:59,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:45:59,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:45:59,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:45:59,314 INFO L87 Difference]: Start difference. First operand 526 states and 935 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 2 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:46:01,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:46:01,567 INFO L93 Difference]: Finished difference Result 1499 states and 2693 transitions. [2024-10-10 23:46:01,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:46:01,568 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 2 states have internal predecessors, (46), 0 states have call successors, (0), 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 46 [2024-10-10 23:46:01,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:46:01,572 INFO L225 Difference]: With dead ends: 1499 [2024-10-10 23:46:01,572 INFO L226 Difference]: Without dead ends: 974 [2024-10-10 23:46:01,573 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-10-10 23:46:01,574 INFO L432 NwaCegarLoop]: 422 mSDtfsCounter, 427 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 1341 mSolverCounterSat, 325 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 427 SdHoareTripleChecker+Valid, 495 SdHoareTripleChecker+Invalid, 1666 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 325 IncrementalHoareTripleChecker+Valid, 1341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-10-10 23:46:01,575 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [427 Valid, 495 Invalid, 1666 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [325 Valid, 1341 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-10-10 23:46:01,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 974 states. [2024-10-10 23:46:01,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 974 to 971. [2024-10-10 23:46:01,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 971 states, 970 states have (on average 1.5082474226804123) internal successors, (1463), 970 states have internal predecessors, (1463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:46:01,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 971 states to 971 states and 1463 transitions. [2024-10-10 23:46:01,607 INFO L78 Accepts]: Start accepts. Automaton has 971 states and 1463 transitions. Word has length 46 [2024-10-10 23:46:01,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:46:01,608 INFO L471 AbstractCegarLoop]: Abstraction has 971 states and 1463 transitions. [2024-10-10 23:46:01,608 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 2 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:46:01,608 INFO L276 IsEmpty]: Start isEmpty. Operand 971 states and 1463 transitions. [2024-10-10 23:46:01,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-10-10 23:46:01,611 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:46:01,612 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-10 23:46:01,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-10 23:46:01,612 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:46:01,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:46:01,613 INFO L85 PathProgramCache]: Analyzing trace with hash -1191802020, now seen corresponding path program 1 times [2024-10-10 23:46:01,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:46:01,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680182723] [2024-10-10 23:46:01,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:46:01,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:46:01,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:46:01,947 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:46:01,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:46:01,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680182723] [2024-10-10 23:46:01,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [680182723] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:46:01,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:46:01,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:46:01,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386246344] [2024-10-10 23:46:01,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:46:01,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:46:01,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:46:01,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:46:01,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:46:01,953 INFO L87 Difference]: Start difference. First operand 971 states and 1463 transitions. Second operand has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:46:04,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:46:04,137 INFO L93 Difference]: Finished difference Result 2813 states and 4241 transitions. [2024-10-10 23:46:04,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:46:04,138 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 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 116 [2024-10-10 23:46:04,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:46:04,145 INFO L225 Difference]: With dead ends: 2813 [2024-10-10 23:46:04,146 INFO L226 Difference]: Without dead ends: 1843 [2024-10-10 23:46:04,148 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:46:04,150 INFO L432 NwaCegarLoop]: 851 mSDtfsCounter, 444 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 1284 mSolverCounterSat, 414 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 444 SdHoareTripleChecker+Valid, 918 SdHoareTripleChecker+Invalid, 1698 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 414 IncrementalHoareTripleChecker+Valid, 1284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-10-10 23:46:04,153 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [444 Valid, 918 Invalid, 1698 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [414 Valid, 1284 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-10-10 23:46:04,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1843 states. [2024-10-10 23:46:04,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1843 to 1841. [2024-10-10 23:46:04,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1841 states, 1840 states have (on average 1.3603260869565217) internal successors, (2503), 1840 states have internal predecessors, (2503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:46:04,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1841 states to 1841 states and 2503 transitions. [2024-10-10 23:46:04,192 INFO L78 Accepts]: Start accepts. Automaton has 1841 states and 2503 transitions. Word has length 116 [2024-10-10 23:46:04,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:46:04,194 INFO L471 AbstractCegarLoop]: Abstraction has 1841 states and 2503 transitions. [2024-10-10 23:46:04,195 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:46:04,195 INFO L276 IsEmpty]: Start isEmpty. Operand 1841 states and 2503 transitions. [2024-10-10 23:46:04,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-10-10 23:46:04,201 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:46:04,201 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-10 23:46:04,202 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-10 23:46:04,202 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:46:04,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:46:04,205 INFO L85 PathProgramCache]: Analyzing trace with hash -835249191, now seen corresponding path program 1 times [2024-10-10 23:46:04,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:46:04,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369774142] [2024-10-10 23:46:04,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:46:04,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:46:04,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:46:04,416 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:46:04,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:46:04,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369774142] [2024-10-10 23:46:04,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1369774142] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:46:04,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:46:04,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:46:04,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811140852] [2024-10-10 23:46:04,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:46:04,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:46:04,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:46:04,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:46:04,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:46:04,422 INFO L87 Difference]: Start difference. First operand 1841 states and 2503 transitions. Second operand has 3 states, 3 states have (on average 46.0) internal successors, (138), 2 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:46:06,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:46:06,177 INFO L93 Difference]: Finished difference Result 5394 states and 7325 transitions. [2024-10-10 23:46:06,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:46:06,178 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 2 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 138 [2024-10-10 23:46:06,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:46:06,187 INFO L225 Difference]: With dead ends: 5394 [2024-10-10 23:46:06,188 INFO L226 Difference]: Without dead ends: 2700 [2024-10-10 23:46:06,191 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-10-10 23:46:06,192 INFO L432 NwaCegarLoop]: 514 mSDtfsCounter, 368 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 1082 mSolverCounterSat, 548 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 368 SdHoareTripleChecker+Valid, 589 SdHoareTripleChecker+Invalid, 1630 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 548 IncrementalHoareTripleChecker+Valid, 1082 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-10 23:46:06,193 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [368 Valid, 589 Invalid, 1630 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [548 Valid, 1082 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-10 23:46:06,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2700 states. [2024-10-10 23:46:06,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2700 to 2700. [2024-10-10 23:46:06,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2700 states, 2699 states have (on average 1.1919229344201556) internal successors, (3217), 2699 states have internal predecessors, (3217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:46:06,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2700 states to 2700 states and 3217 transitions. [2024-10-10 23:46:06,243 INFO L78 Accepts]: Start accepts. Automaton has 2700 states and 3217 transitions. Word has length 138 [2024-10-10 23:46:06,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:46:06,244 INFO L471 AbstractCegarLoop]: Abstraction has 2700 states and 3217 transitions. [2024-10-10 23:46:06,244 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 2 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:46:06,244 INFO L276 IsEmpty]: Start isEmpty. Operand 2700 states and 3217 transitions. [2024-10-10 23:46:06,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2024-10-10 23:46:06,248 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:46:06,248 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:46:06,249 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-10 23:46:06,249 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:46:06,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:46:06,254 INFO L85 PathProgramCache]: Analyzing trace with hash -1741610618, now seen corresponding path program 1 times [2024-10-10 23:46:06,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:46:06,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284345260] [2024-10-10 23:46:06,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:46:06,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:46:06,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:46:06,530 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 157 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:46:06,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:46:06,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284345260] [2024-10-10 23:46:06,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1284345260] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:46:06,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:46:06,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:46:06,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944989606] [2024-10-10 23:46:06,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:46:06,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:46:06,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:46:06,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:46:06,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:46:06,536 INFO L87 Difference]: Start difference. First operand 2700 states and 3217 transitions. Second operand has 3 states, 3 states have (on average 66.0) internal successors, (198), 3 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:46:07,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:46:07,985 INFO L93 Difference]: Finished difference Result 7107 states and 8597 transitions. [2024-10-10 23:46:07,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:46:07,986 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 66.0) internal successors, (198), 3 states have internal predecessors, (198), 0 states have call successors, (0), 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 198 [2024-10-10 23:46:07,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:46:08,001 INFO L225 Difference]: With dead ends: 7107 [2024-10-10 23:46:08,001 INFO L226 Difference]: Without dead ends: 4408 [2024-10-10 23:46:08,006 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:46:08,007 INFO L432 NwaCegarLoop]: 724 mSDtfsCounter, 496 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 1137 mSolverCounterSat, 306 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 496 SdHoareTripleChecker+Valid, 781 SdHoareTripleChecker+Invalid, 1443 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 306 IncrementalHoareTripleChecker+Valid, 1137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-10 23:46:08,007 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [496 Valid, 781 Invalid, 1443 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [306 Valid, 1137 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-10 23:46:08,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4408 states. [2024-10-10 23:46:08,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4408 to 4408. [2024-10-10 23:46:08,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4408 states, 4407 states have (on average 1.1706376219650556) internal successors, (5159), 4407 states have internal predecessors, (5159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:46:08,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4408 states to 4408 states and 5159 transitions. [2024-10-10 23:46:08,082 INFO L78 Accepts]: Start accepts. Automaton has 4408 states and 5159 transitions. Word has length 198 [2024-10-10 23:46:08,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:46:08,083 INFO L471 AbstractCegarLoop]: Abstraction has 4408 states and 5159 transitions. [2024-10-10 23:46:08,084 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 66.0) internal successors, (198), 3 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:46:08,084 INFO L276 IsEmpty]: Start isEmpty. Operand 4408 states and 5159 transitions. [2024-10-10 23:46:08,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2024-10-10 23:46:08,089 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:46:08,089 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:46:08,089 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-10 23:46:08,089 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:46:08,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:46:08,090 INFO L85 PathProgramCache]: Analyzing trace with hash 1550923691, now seen corresponding path program 1 times [2024-10-10 23:46:08,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:46:08,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065194589] [2024-10-10 23:46:08,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:46:08,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:46:08,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:46:08,373 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-10-10 23:46:08,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:46:08,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065194589] [2024-10-10 23:46:08,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065194589] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:46:08,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:46:08,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:46:08,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81229753] [2024-10-10 23:46:08,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:46:08,375 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:46:08,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:46:08,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:46:08,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:46:08,376 INFO L87 Difference]: Start difference. First operand 4408 states and 5159 transitions. Second operand has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:46:10,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:46:10,103 INFO L93 Difference]: Finished difference Result 10935 states and 12969 transitions. [2024-10-10 23:46:10,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:46:10,104 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 200 [2024-10-10 23:46:10,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:46:10,127 INFO L225 Difference]: With dead ends: 10935 [2024-10-10 23:46:10,127 INFO L226 Difference]: Without dead ends: 6527 [2024-10-10 23:46:10,134 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:46:10,135 INFO L432 NwaCegarLoop]: 380 mSDtfsCounter, 403 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 1216 mSolverCounterSat, 274 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 403 SdHoareTripleChecker+Valid, 442 SdHoareTripleChecker+Invalid, 1490 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 274 IncrementalHoareTripleChecker+Valid, 1216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-10 23:46:10,136 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [403 Valid, 442 Invalid, 1490 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [274 Valid, 1216 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-10 23:46:10,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6527 states. [2024-10-10 23:46:10,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6527 to 4381. [2024-10-10 23:46:10,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4381 states, 4380 states have (on average 1.1684931506849314) internal successors, (5118), 4380 states have internal predecessors, (5118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:46:10,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4381 states to 4381 states and 5118 transitions. [2024-10-10 23:46:10,235 INFO L78 Accepts]: Start accepts. Automaton has 4381 states and 5118 transitions. Word has length 200 [2024-10-10 23:46:10,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:46:10,236 INFO L471 AbstractCegarLoop]: Abstraction has 4381 states and 5118 transitions. [2024-10-10 23:46:10,236 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:46:10,236 INFO L276 IsEmpty]: Start isEmpty. Operand 4381 states and 5118 transitions. [2024-10-10 23:46:10,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2024-10-10 23:46:10,242 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:46:10,242 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:46:10,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-10 23:46:10,243 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:46:10,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:46:10,243 INFO L85 PathProgramCache]: Analyzing trace with hash -2140280795, now seen corresponding path program 1 times [2024-10-10 23:46:10,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:46:10,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283973358] [2024-10-10 23:46:10,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:46:10,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:46:10,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:46:10,606 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2024-10-10 23:46:10,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:46:10,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283973358] [2024-10-10 23:46:10,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283973358] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:46:10,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:46:10,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:46:10,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406770786] [2024-10-10 23:46:10,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:46:10,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:46:10,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:46:10,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:46:10,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:46:10,610 INFO L87 Difference]: Start difference. First operand 4381 states and 5118 transitions. Second operand has 3 states, 3 states have (on average 61.666666666666664) internal successors, (185), 3 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:46:12,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:46:12,218 INFO L93 Difference]: Finished difference Result 10909 states and 12923 transitions. [2024-10-10 23:46:12,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:46:12,218 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 61.666666666666664) internal successors, (185), 3 states have internal predecessors, (185), 0 states have call successors, (0), 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 266 [2024-10-10 23:46:12,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:46:12,236 INFO L225 Difference]: With dead ends: 10909 [2024-10-10 23:46:12,237 INFO L226 Difference]: Without dead ends: 6529 [2024-10-10 23:46:12,243 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:46:12,244 INFO L432 NwaCegarLoop]: 365 mSDtfsCounter, 457 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 1295 mSolverCounterSat, 262 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 457 SdHoareTripleChecker+Valid, 411 SdHoareTripleChecker+Invalid, 1557 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 262 IncrementalHoareTripleChecker+Valid, 1295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-10 23:46:12,246 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [457 Valid, 411 Invalid, 1557 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [262 Valid, 1295 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-10 23:46:12,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6529 states. [2024-10-10 23:46:12,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6529 to 6095. [2024-10-10 23:46:12,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6095 states, 6094 states have (on average 1.1885461109287825) internal successors, (7243), 6094 states have internal predecessors, (7243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:46:12,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6095 states to 6095 states and 7243 transitions. [2024-10-10 23:46:12,354 INFO L78 Accepts]: Start accepts. Automaton has 6095 states and 7243 transitions. Word has length 266 [2024-10-10 23:46:12,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:46:12,355 INFO L471 AbstractCegarLoop]: Abstraction has 6095 states and 7243 transitions. [2024-10-10 23:46:12,355 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 61.666666666666664) internal successors, (185), 3 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:46:12,355 INFO L276 IsEmpty]: Start isEmpty. Operand 6095 states and 7243 transitions. [2024-10-10 23:46:12,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2024-10-10 23:46:12,362 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:46:12,362 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:46:12,363 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-10 23:46:12,363 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:46:12,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:46:12,364 INFO L85 PathProgramCache]: Analyzing trace with hash 991981609, now seen corresponding path program 1 times [2024-10-10 23:46:12,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:46:12,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601020232] [2024-10-10 23:46:12,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:46:12,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:46:12,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:46:12,722 INFO L134 CoverageAnalysis]: Checked inductivity of 348 backedges. 267 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2024-10-10 23:46:12,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:46:12,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601020232] [2024-10-10 23:46:12,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601020232] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:46:12,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:46:12,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:46:12,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490584470] [2024-10-10 23:46:12,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:46:12,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:46:12,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:46:12,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:46:12,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:46:12,729 INFO L87 Difference]: Start difference. First operand 6095 states and 7243 transitions. Second operand has 3 states, 3 states have (on average 66.0) internal successors, (198), 3 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:46:14,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:46:14,509 INFO L93 Difference]: Finished difference Result 15621 states and 18731 transitions. [2024-10-10 23:46:14,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:46:14,510 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 66.0) internal successors, (198), 3 states have internal predecessors, (198), 0 states have call successors, (0), 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 278 [2024-10-10 23:46:14,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:46:14,531 INFO L225 Difference]: With dead ends: 15621 [2024-10-10 23:46:14,531 INFO L226 Difference]: Without dead ends: 8652 [2024-10-10 23:46:14,540 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:46:14,541 INFO L432 NwaCegarLoop]: 583 mSDtfsCounter, 492 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 1239 mSolverCounterSat, 350 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 492 SdHoareTripleChecker+Valid, 625 SdHoareTripleChecker+Invalid, 1589 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 350 IncrementalHoareTripleChecker+Valid, 1239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-10 23:46:14,541 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [492 Valid, 625 Invalid, 1589 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [350 Valid, 1239 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-10 23:46:14,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8652 states. [2024-10-10 23:46:14,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8652 to 8221. [2024-10-10 23:46:14,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8221 states, 8220 states have (on average 1.1763990267639903) internal successors, (9670), 8220 states have internal predecessors, (9670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:46:14,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8221 states to 8221 states and 9670 transitions. [2024-10-10 23:46:14,669 INFO L78 Accepts]: Start accepts. Automaton has 8221 states and 9670 transitions. Word has length 278 [2024-10-10 23:46:14,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:46:14,670 INFO L471 AbstractCegarLoop]: Abstraction has 8221 states and 9670 transitions. [2024-10-10 23:46:14,670 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 66.0) internal successors, (198), 3 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:46:14,670 INFO L276 IsEmpty]: Start isEmpty. Operand 8221 states and 9670 transitions. [2024-10-10 23:46:14,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2024-10-10 23:46:14,675 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:46:14,676 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:46:14,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-10 23:46:14,676 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:46:14,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:46:14,677 INFO L85 PathProgramCache]: Analyzing trace with hash -1299949409, now seen corresponding path program 1 times [2024-10-10 23:46:14,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:46:14,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943670565] [2024-10-10 23:46:14,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:46:14,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:46:14,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:46:15,287 INFO L134 CoverageAnalysis]: Checked inductivity of 359 backedges. 277 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2024-10-10 23:46:15,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:46:15,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943670565] [2024-10-10 23:46:15,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [943670565] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:46:15,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:46:15,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-10 23:46:15,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216078362] [2024-10-10 23:46:15,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:46:15,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:46:15,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:46:15,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:46:15,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:46:15,295 INFO L87 Difference]: Start difference. First operand 8221 states and 9670 transitions. Second operand has 4 states, 4 states have (on average 56.25) internal successors, (225), 4 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:46:18,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:46:18,214 INFO L93 Difference]: Finished difference Result 30138 states and 35483 transitions. [2024-10-10 23:46:18,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 23:46:18,215 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 56.25) internal successors, (225), 4 states have internal predecessors, (225), 0 states have call successors, (0), 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 306 [2024-10-10 23:46:18,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:46:18,253 INFO L225 Difference]: With dead ends: 30138 [2024-10-10 23:46:18,254 INFO L226 Difference]: Without dead ends: 21063 [2024-10-10 23:46:18,266 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-10-10 23:46:18,267 INFO L432 NwaCegarLoop]: 157 mSDtfsCounter, 859 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 2649 mSolverCounterSat, 411 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 859 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 3060 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 411 IncrementalHoareTripleChecker+Valid, 2649 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-10-10 23:46:18,268 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [859 Valid, 269 Invalid, 3060 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [411 Valid, 2649 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-10-10 23:46:18,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21063 states. [2024-10-10 23:46:18,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21063 to 20595. [2024-10-10 23:46:18,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20595 states, 20594 states have (on average 1.1576187239001652) internal successors, (23840), 20594 states have internal predecessors, (23840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:46:18,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20595 states to 20595 states and 23840 transitions. [2024-10-10 23:46:18,699 INFO L78 Accepts]: Start accepts. Automaton has 20595 states and 23840 transitions. Word has length 306 [2024-10-10 23:46:18,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:46:18,700 INFO L471 AbstractCegarLoop]: Abstraction has 20595 states and 23840 transitions. [2024-10-10 23:46:18,701 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 56.25) internal successors, (225), 4 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:46:18,702 INFO L276 IsEmpty]: Start isEmpty. Operand 20595 states and 23840 transitions. [2024-10-10 23:46:18,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 388 [2024-10-10 23:46:18,713 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:46:18,713 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:46:18,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-10 23:46:18,715 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:46:18,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:46:18,715 INFO L85 PathProgramCache]: Analyzing trace with hash -883229706, now seen corresponding path program 1 times [2024-10-10 23:46:18,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:46:18,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467974230] [2024-10-10 23:46:18,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:46:18,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:46:18,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:46:19,260 INFO L134 CoverageAnalysis]: Checked inductivity of 359 backedges. 232 proven. 82 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-10-10 23:46:19,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:46:19,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467974230] [2024-10-10 23:46:19,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467974230] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 23:46:19,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1198890463] [2024-10-10 23:46:19,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:46:19,262 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:46:19,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:46:19,264 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 23:46:19,265 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-10 23:46:19,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:46:19,486 INFO L255 TraceCheckSpWp]: Trace formula consists of 511 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-10 23:46:19,506 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 23:46:20,010 INFO L134 CoverageAnalysis]: Checked inductivity of 359 backedges. 206 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:46:20,010 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-10 23:46:20,522 INFO L134 CoverageAnalysis]: Checked inductivity of 359 backedges. 359 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:46:20,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1198890463] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-10 23:46:20,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-10-10 23:46:20,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [3, 4] total 7 [2024-10-10 23:46:20,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128328756] [2024-10-10 23:46:20,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:46:20,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-10 23:46:20,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:46:20,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-10 23:46:20,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2024-10-10 23:46:20,524 INFO L87 Difference]: Start difference. First operand 20595 states and 23840 transitions. Second operand has 5 states, 5 states have (on average 77.4) internal successors, (387), 4 states have internal predecessors, (387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:46:23,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:46:23,600 INFO L93 Difference]: Finished difference Result 62900 states and 72226 transitions. [2024-10-10 23:46:23,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-10 23:46:23,601 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 77.4) internal successors, (387), 4 states have internal predecessors, (387), 0 states have call successors, (0), 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 387 [2024-10-10 23:46:23,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:46:23,681 INFO L225 Difference]: With dead ends: 62900 [2024-10-10 23:46:23,681 INFO L226 Difference]: Without dead ends: 41454 [2024-10-10 23:46:23,701 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 775 GetRequests, 769 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2024-10-10 23:46:23,702 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 1564 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 2602 mSolverCounterSat, 1041 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1564 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 3643 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1041 IncrementalHoareTripleChecker+Valid, 2602 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-10-10 23:46:23,704 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1564 Valid, 142 Invalid, 3643 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1041 Valid, 2602 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-10-10 23:46:23,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41454 states. [2024-10-10 23:46:24,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41454 to 41440. [2024-10-10 23:46:24,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41440 states, 41439 states have (on average 1.1064938825743864) internal successors, (45852), 41439 states have internal predecessors, (45852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:46:24,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41440 states to 41440 states and 45852 transitions. [2024-10-10 23:46:24,238 INFO L78 Accepts]: Start accepts. Automaton has 41440 states and 45852 transitions. Word has length 387 [2024-10-10 23:46:24,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:46:24,238 INFO L471 AbstractCegarLoop]: Abstraction has 41440 states and 45852 transitions. [2024-10-10 23:46:24,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 77.4) internal successors, (387), 4 states have internal predecessors, (387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:46:24,239 INFO L276 IsEmpty]: Start isEmpty. Operand 41440 states and 45852 transitions. [2024-10-10 23:46:24,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 427 [2024-10-10 23:46:24,253 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:46:24,254 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:46:24,273 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-10 23:46:24,455 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-10-10 23:46:24,455 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:46:24,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:46:24,456 INFO L85 PathProgramCache]: Analyzing trace with hash -1810051263, now seen corresponding path program 1 times [2024-10-10 23:46:24,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:46:24,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479311053] [2024-10-10 23:46:24,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:46:24,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:46:24,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:46:25,358 INFO L134 CoverageAnalysis]: Checked inductivity of 663 backedges. 349 proven. 45 refuted. 0 times theorem prover too weak. 269 trivial. 0 not checked. [2024-10-10 23:46:25,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:46:25,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479311053] [2024-10-10 23:46:25,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479311053] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 23:46:25,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [903654435] [2024-10-10 23:46:25,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:46:25,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:46:25,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:46:25,362 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 23:46:25,364 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-10 23:46:25,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:46:25,529 INFO L255 TraceCheckSpWp]: Trace formula consists of 571 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-10 23:46:25,535 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 23:46:26,029 INFO L134 CoverageAnalysis]: Checked inductivity of 663 backedges. 419 proven. 82 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2024-10-10 23:46:26,029 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-10 23:46:27,143 INFO L134 CoverageAnalysis]: Checked inductivity of 663 backedges. 419 proven. 82 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2024-10-10 23:46:27,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [903654435] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-10 23:46:27,143 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-10 23:46:27,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 9 [2024-10-10 23:46:27,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989021336] [2024-10-10 23:46:27,144 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-10 23:46:27,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-10 23:46:27,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:46:27,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-10 23:46:27,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-10-10 23:46:27,147 INFO L87 Difference]: Start difference. First operand 41440 states and 45852 transitions. Second operand has 9 states, 9 states have (on average 82.11111111111111) internal successors, (739), 9 states have internal predecessors, (739), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:46:38,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:46:38,751 INFO L93 Difference]: Finished difference Result 124224 states and 136978 transitions. [2024-10-10 23:46:38,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-10 23:46:38,751 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 82.11111111111111) internal successors, (739), 9 states have internal predecessors, (739), 0 states have call successors, (0), 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 426 [2024-10-10 23:46:38,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:46:38,865 INFO L225 Difference]: With dead ends: 124224 [2024-10-10 23:46:38,865 INFO L226 Difference]: Without dead ends: 80229 [2024-10-10 23:46:38,903 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 885 GetRequests, 863 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=150, Invalid=402, Unknown=0, NotChecked=0, Total=552 [2024-10-10 23:46:38,903 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 8788 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 15017 mSolverCounterSat, 1857 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8788 SdHoareTripleChecker+Valid, 432 SdHoareTripleChecker+Invalid, 16874 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1857 IncrementalHoareTripleChecker+Valid, 15017 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.6s IncrementalHoareTripleChecker+Time [2024-10-10 23:46:38,904 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8788 Valid, 432 Invalid, 16874 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1857 Valid, 15017 Invalid, 0 Unknown, 0 Unchecked, 10.6s Time] [2024-10-10 23:46:38,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80229 states. [2024-10-10 23:46:39,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80229 to 60151. [2024-10-10 23:46:39,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60151 states, 60150 states have (on average 1.0845552784704904) internal successors, (65236), 60150 states have internal predecessors, (65236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:46:40,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60151 states to 60151 states and 65236 transitions. [2024-10-10 23:46:40,095 INFO L78 Accepts]: Start accepts. Automaton has 60151 states and 65236 transitions. Word has length 426 [2024-10-10 23:46:40,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:46:40,096 INFO L471 AbstractCegarLoop]: Abstraction has 60151 states and 65236 transitions. [2024-10-10 23:46:40,096 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 82.11111111111111) internal successors, (739), 9 states have internal predecessors, (739), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:46:40,096 INFO L276 IsEmpty]: Start isEmpty. Operand 60151 states and 65236 transitions. [2024-10-10 23:46:40,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 526 [2024-10-10 23:46:40,117 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:46:40,118 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:46:40,135 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-10 23:46:40,318 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:46:40,319 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:46:40,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:46:40,320 INFO L85 PathProgramCache]: Analyzing trace with hash 1868855272, now seen corresponding path program 1 times [2024-10-10 23:46:40,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:46:40,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782327132] [2024-10-10 23:46:40,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:46:40,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:46:40,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:46:41,194 INFO L134 CoverageAnalysis]: Checked inductivity of 698 backedges. 453 proven. 0 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2024-10-10 23:46:41,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:46:41,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782327132] [2024-10-10 23:46:41,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [782327132] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:46:41,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:46:41,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:46:41,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734693715] [2024-10-10 23:46:41,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:46:41,195 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:46:41,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:46:41,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:46:41,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:46:41,196 INFO L87 Difference]: Start difference. First operand 60151 states and 65236 transitions. Second operand has 3 states, 3 states have (on average 121.0) internal successors, (363), 3 states have internal predecessors, (363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:46:42,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:46:42,882 INFO L93 Difference]: Finished difference Result 139868 states and 151843 transitions. [2024-10-10 23:46:42,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:46:42,882 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 121.0) internal successors, (363), 3 states have internal predecessors, (363), 0 states have call successors, (0), 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 525 [2024-10-10 23:46:42,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:46:42,986 INFO L225 Difference]: With dead ends: 139868 [2024-10-10 23:46:42,986 INFO L226 Difference]: Without dead ends: 80143 [2024-10-10 23:46:43,034 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:46:43,035 INFO L432 NwaCegarLoop]: 675 mSDtfsCounter, 344 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 1177 mSolverCounterSat, 160 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 344 SdHoareTripleChecker+Valid, 711 SdHoareTripleChecker+Invalid, 1337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 160 IncrementalHoareTripleChecker+Valid, 1177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-10 23:46:43,036 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [344 Valid, 711 Invalid, 1337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [160 Valid, 1177 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-10 23:46:43,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80143 states. [2024-10-10 23:46:43,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80143 to 76729. [2024-10-10 23:46:44,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76729 states, 76728 states have (on average 1.0734021478469398) internal successors, (82360), 76728 states have internal predecessors, (82360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:46:44,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76729 states to 76729 states and 82360 transitions. [2024-10-10 23:46:44,455 INFO L78 Accepts]: Start accepts. Automaton has 76729 states and 82360 transitions. Word has length 525 [2024-10-10 23:46:44,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:46:44,457 INFO L471 AbstractCegarLoop]: Abstraction has 76729 states and 82360 transitions. [2024-10-10 23:46:44,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 121.0) internal successors, (363), 3 states have internal predecessors, (363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:46:44,458 INFO L276 IsEmpty]: Start isEmpty. Operand 76729 states and 82360 transitions. [2024-10-10 23:46:44,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 561 [2024-10-10 23:46:44,472 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:46:44,473 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:46:44,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-10 23:46:44,473 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:46:44,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:46:44,474 INFO L85 PathProgramCache]: Analyzing trace with hash 1977361089, now seen corresponding path program 1 times [2024-10-10 23:46:44,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:46:44,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700007470] [2024-10-10 23:46:44,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:46:44,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:46:44,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:46:44,958 INFO L134 CoverageAnalysis]: Checked inductivity of 698 backedges. 408 proven. 0 refuted. 0 times theorem prover too weak. 290 trivial. 0 not checked. [2024-10-10 23:46:44,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:46:44,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700007470] [2024-10-10 23:46:44,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [700007470] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:46:44,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:46:44,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:46:44,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763372330] [2024-10-10 23:46:44,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:46:44,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:46:44,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:46:44,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:46:44,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:46:44,963 INFO L87 Difference]: Start difference. First operand 76729 states and 82360 transitions. Second operand has 3 states, 3 states have (on average 118.0) internal successors, (354), 3 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:46:46,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:46:46,769 INFO L93 Difference]: Finished difference Result 159418 states and 171297 transitions. [2024-10-10 23:46:46,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:46:46,773 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 118.0) internal successors, (354), 3 states have internal predecessors, (354), 0 states have call successors, (0), 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 560 [2024-10-10 23:46:46,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:46:46,908 INFO L225 Difference]: With dead ends: 159418 [2024-10-10 23:46:46,908 INFO L226 Difference]: Without dead ends: 83540 [2024-10-10 23:46:46,928 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:46:46,929 INFO L432 NwaCegarLoop]: 622 mSDtfsCounter, 487 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 1136 mSolverCounterSat, 164 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 487 SdHoareTripleChecker+Valid, 659 SdHoareTripleChecker+Invalid, 1300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 164 IncrementalHoareTripleChecker+Valid, 1136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-10 23:46:46,929 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [487 Valid, 659 Invalid, 1300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [164 Valid, 1136 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-10 23:46:47,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83540 states. [2024-10-10 23:46:47,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83540 to 83532. [2024-10-10 23:46:47,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83532 states, 83531 states have (on average 1.0698423339837904) internal successors, (89365), 83531 states have internal predecessors, (89365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:46:47,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83532 states to 83532 states and 89365 transitions. [2024-10-10 23:46:47,983 INFO L78 Accepts]: Start accepts. Automaton has 83532 states and 89365 transitions. Word has length 560 [2024-10-10 23:46:47,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:46:47,984 INFO L471 AbstractCegarLoop]: Abstraction has 83532 states and 89365 transitions. [2024-10-10 23:46:47,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 118.0) internal successors, (354), 3 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:46:47,984 INFO L276 IsEmpty]: Start isEmpty. Operand 83532 states and 89365 transitions. [2024-10-10 23:46:48,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 600 [2024-10-10 23:46:48,004 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:46:48,005 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:46:48,005 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-10 23:46:48,005 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:46:48,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:46:48,006 INFO L85 PathProgramCache]: Analyzing trace with hash 2123407723, now seen corresponding path program 1 times [2024-10-10 23:46:48,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:46:48,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542110680] [2024-10-10 23:46:48,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:46:48,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:46:48,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:46:48,772 INFO L134 CoverageAnalysis]: Checked inductivity of 793 backedges. 481 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-10 23:46:48,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:46:48,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542110680] [2024-10-10 23:46:48,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1542110680] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:46:48,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:46:48,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:46:48,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204019065] [2024-10-10 23:46:48,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:46:48,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:46:48,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:46:48,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:46:48,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:46:48,777 INFO L87 Difference]: Start difference. First operand 83532 states and 89365 transitions. Second operand has 3 states, 3 states have (on average 123.66666666666667) internal successors, (371), 3 states have internal predecessors, (371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:46:50,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:46:50,449 INFO L93 Difference]: Finished difference Result 179406 states and 191996 transitions. [2024-10-10 23:46:50,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:46:50,450 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 123.66666666666667) internal successors, (371), 3 states have internal predecessors, (371), 0 states have call successors, (0), 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 599 [2024-10-10 23:46:50,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:46:50,572 INFO L225 Difference]: With dead ends: 179406 [2024-10-10 23:46:50,572 INFO L226 Difference]: Without dead ends: 96725 [2024-10-10 23:46:50,625 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:46:50,625 INFO L432 NwaCegarLoop]: 713 mSDtfsCounter, 344 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 1171 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 344 SdHoareTripleChecker+Valid, 765 SdHoareTripleChecker+Invalid, 1243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 1171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-10 23:46:50,625 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [344 Valid, 765 Invalid, 1243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 1171 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-10 23:46:50,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96725 states. [2024-10-10 23:46:51,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96725 to 92046. [2024-10-10 23:46:51,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92046 states, 92045 states have (on average 1.067304036069314) internal successors, (98240), 92045 states have internal predecessors, (98240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:46:51,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92046 states to 92046 states and 98240 transitions. [2024-10-10 23:46:51,936 INFO L78 Accepts]: Start accepts. Automaton has 92046 states and 98240 transitions. Word has length 599 [2024-10-10 23:46:51,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:46:51,936 INFO L471 AbstractCegarLoop]: Abstraction has 92046 states and 98240 transitions. [2024-10-10 23:46:51,937 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 123.66666666666667) internal successors, (371), 3 states have internal predecessors, (371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:46:51,937 INFO L276 IsEmpty]: Start isEmpty. Operand 92046 states and 98240 transitions. [2024-10-10 23:46:51,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 614 [2024-10-10 23:46:51,958 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:46:51,959 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 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] [2024-10-10 23:46:51,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-10 23:46:51,959 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:46:51,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:46:51,960 INFO L85 PathProgramCache]: Analyzing trace with hash 1076266840, now seen corresponding path program 1 times [2024-10-10 23:46:51,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:46:51,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191273065] [2024-10-10 23:46:51,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:46:51,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:46:52,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:46:53,316 INFO L134 CoverageAnalysis]: Checked inductivity of 1088 backedges. 578 proven. 0 refuted. 0 times theorem prover too weak. 510 trivial. 0 not checked. [2024-10-10 23:46:53,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:46:53,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191273065] [2024-10-10 23:46:53,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [191273065] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:46:53,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:46:53,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-10 23:46:53,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163045172] [2024-10-10 23:46:53,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:46:53,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:46:53,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:46:53,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:46:53,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:46:53,319 INFO L87 Difference]: Start difference. First operand 92046 states and 98240 transitions. Second operand has 4 states, 4 states have (on average 83.75) internal successors, (335), 4 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:46:55,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:46:55,926 INFO L93 Difference]: Finished difference Result 195620 states and 208756 transitions. [2024-10-10 23:46:55,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 23:46:55,927 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 83.75) internal successors, (335), 4 states have internal predecessors, (335), 0 states have call successors, (0), 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 613 [2024-10-10 23:46:55,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:46:56,053 INFO L225 Difference]: With dead ends: 195620 [2024-10-10 23:46:56,054 INFO L226 Difference]: Without dead ends: 106125 [2024-10-10 23:46:56,095 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-10-10 23:46:56,096 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 804 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 2387 mSolverCounterSat, 394 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 804 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 2781 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 394 IncrementalHoareTripleChecker+Valid, 2387 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-10-10 23:46:56,097 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [804 Valid, 163 Invalid, 2781 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [394 Valid, 2387 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-10-10 23:46:56,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106125 states. [2024-10-10 23:46:57,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106125 to 98005. [2024-10-10 23:46:57,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98005 states, 98004 states have (on average 1.067854373290886) internal successors, (104654), 98004 states have internal predecessors, (104654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:46:57,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98005 states to 98005 states and 104654 transitions. [2024-10-10 23:46:57,592 INFO L78 Accepts]: Start accepts. Automaton has 98005 states and 104654 transitions. Word has length 613 [2024-10-10 23:46:57,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:46:57,593 INFO L471 AbstractCegarLoop]: Abstraction has 98005 states and 104654 transitions. [2024-10-10 23:46:57,593 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 83.75) internal successors, (335), 4 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:46:57,593 INFO L276 IsEmpty]: Start isEmpty. Operand 98005 states and 104654 transitions. [2024-10-10 23:46:57,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 616 [2024-10-10 23:46:57,629 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:46:57,630 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:46:57,630 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-10 23:46:57,630 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:46:57,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:46:57,631 INFO L85 PathProgramCache]: Analyzing trace with hash 1575299010, now seen corresponding path program 1 times [2024-10-10 23:46:57,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:46:57,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968580168] [2024-10-10 23:46:57,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:46:57,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:46:57,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:46:58,248 INFO L134 CoverageAnalysis]: Checked inductivity of 1048 backedges. 805 proven. 0 refuted. 0 times theorem prover too weak. 243 trivial. 0 not checked. [2024-10-10 23:46:58,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:46:58,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968580168] [2024-10-10 23:46:58,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968580168] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:46:58,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:46:58,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:46:58,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769760113] [2024-10-10 23:46:58,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:46:58,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:46:58,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:46:58,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:46:58,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:46:58,253 INFO L87 Difference]: Start difference. First operand 98005 states and 104654 transitions. Second operand has 3 states, 3 states have (on average 140.0) internal successors, (420), 3 states have internal predecessors, (420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:47:00,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:47:00,147 INFO L93 Difference]: Finished difference Result 209632 states and 224314 transitions. [2024-10-10 23:47:00,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:47:00,147 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 140.0) internal successors, (420), 3 states have internal predecessors, (420), 0 states have call successors, (0), 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 615 [2024-10-10 23:47:00,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:47:00,282 INFO L225 Difference]: With dead ends: 209632 [2024-10-10 23:47:00,282 INFO L226 Difference]: Without dead ends: 114178 [2024-10-10 23:47:00,341 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:47:00,342 INFO L432 NwaCegarLoop]: 228 mSDtfsCounter, 264 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 1142 mSolverCounterSat, 194 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 1336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 194 IncrementalHoareTripleChecker+Valid, 1142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-10 23:47:00,342 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [264 Valid, 272 Invalid, 1336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [194 Valid, 1142 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-10 23:47:00,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114178 states. [2024-10-10 23:47:01,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114178 to 105654. [2024-10-10 23:47:01,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105654 states, 105653 states have (on average 1.0608501415009512) internal successors, (112082), 105653 states have internal predecessors, (112082), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:47:02,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105654 states to 105654 states and 112082 transitions. [2024-10-10 23:47:02,116 INFO L78 Accepts]: Start accepts. Automaton has 105654 states and 112082 transitions. Word has length 615 [2024-10-10 23:47:02,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:47:02,117 INFO L471 AbstractCegarLoop]: Abstraction has 105654 states and 112082 transitions. [2024-10-10 23:47:02,117 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 140.0) internal successors, (420), 3 states have internal predecessors, (420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:47:02,117 INFO L276 IsEmpty]: Start isEmpty. Operand 105654 states and 112082 transitions. [2024-10-10 23:47:02,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 704 [2024-10-10 23:47:02,137 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:47:02,138 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:47:02,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-10 23:47:02,138 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:47:02,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:47:02,139 INFO L85 PathProgramCache]: Analyzing trace with hash 305097946, now seen corresponding path program 1 times [2024-10-10 23:47:02,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:47:02,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196953389] [2024-10-10 23:47:02,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:47:02,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:47:02,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:47:02,484 INFO L134 CoverageAnalysis]: Checked inductivity of 1536 backedges. 862 proven. 0 refuted. 0 times theorem prover too weak. 674 trivial. 0 not checked. [2024-10-10 23:47:02,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:47:02,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196953389] [2024-10-10 23:47:02,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [196953389] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:47:02,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:47:02,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:47:02,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319932795] [2024-10-10 23:47:02,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:47:02,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:47:02,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:47:02,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:47:02,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:47:02,487 INFO L87 Difference]: Start difference. First operand 105654 states and 112082 transitions. Second operand has 3 states, 3 states have (on average 108.0) internal successors, (324), 2 states have internal predecessors, (324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:47:03,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:47:03,761 INFO L93 Difference]: Finished difference Result 193406 states and 204914 transitions. [2024-10-10 23:47:03,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:47:03,762 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 108.0) internal successors, (324), 2 states have internal predecessors, (324), 0 states have call successors, (0), 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 703 [2024-10-10 23:47:03,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:47:03,872 INFO L225 Difference]: With dead ends: 193406 [2024-10-10 23:47:03,872 INFO L226 Difference]: Without dead ends: 90302 [2024-10-10 23:47:03,926 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-10-10 23:47:03,927 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 557 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 619 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 557 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 625 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 619 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-10 23:47:03,927 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [557 Valid, 71 Invalid, 625 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 619 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-10 23:47:03,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90302 states. [2024-10-10 23:47:05,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90302 to 88584. [2024-10-10 23:47:05,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88584 states, 88583 states have (on average 1.057313480013095) internal successors, (93660), 88583 states have internal predecessors, (93660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:47:05,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88584 states to 88584 states and 93660 transitions. [2024-10-10 23:47:05,170 INFO L78 Accepts]: Start accepts. Automaton has 88584 states and 93660 transitions. Word has length 703 [2024-10-10 23:47:05,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:47:05,170 INFO L471 AbstractCegarLoop]: Abstraction has 88584 states and 93660 transitions. [2024-10-10 23:47:05,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 108.0) internal successors, (324), 2 states have internal predecessors, (324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:47:05,171 INFO L276 IsEmpty]: Start isEmpty. Operand 88584 states and 93660 transitions. [2024-10-10 23:47:05,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 713 [2024-10-10 23:47:05,189 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:47:05,190 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:47:05,190 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-10 23:47:05,190 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:47:05,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:47:05,191 INFO L85 PathProgramCache]: Analyzing trace with hash -560315343, now seen corresponding path program 1 times [2024-10-10 23:47:05,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:47:05,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123180429] [2024-10-10 23:47:05,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:47:05,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:47:05,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:47:05,952 INFO L134 CoverageAnalysis]: Checked inductivity of 1192 backedges. 948 proven. 0 refuted. 0 times theorem prover too weak. 244 trivial. 0 not checked. [2024-10-10 23:47:05,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:47:05,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123180429] [2024-10-10 23:47:05,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123180429] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:47:05,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:47:05,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:47:05,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234901516] [2024-10-10 23:47:05,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:47:05,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:47:05,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:47:05,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:47:05,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:47:05,955 INFO L87 Difference]: Start difference. First operand 88584 states and 93660 transitions. Second operand has 3 states, 3 states have (on average 172.0) internal successors, (516), 3 states have internal predecessors, (516), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)