./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/Problem13_label21.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/Problem13_label21.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 14f7b86bfc883455824a54ae68bb832997924960967cf306b251b3f457d9ff4b --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-10 23:28:03,885 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-10 23:28:03,937 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:28:03,943 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-10 23:28:03,945 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-10 23:28:03,966 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-10 23:28:03,967 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-10 23:28:03,967 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-10 23:28:03,967 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-10 23:28:03,968 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-10 23:28:03,968 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-10 23:28:03,969 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-10 23:28:03,969 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-10 23:28:03,970 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-10 23:28:03,970 INFO L153 SettingsManager]: * Use SBE=true [2024-10-10 23:28:03,971 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-10 23:28:03,972 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-10 23:28:03,974 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-10 23:28:03,974 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-10 23:28:03,974 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-10 23:28:03,975 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-10 23:28:03,976 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-10 23:28:03,976 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-10 23:28:03,977 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-10 23:28:03,977 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-10 23:28:03,977 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-10 23:28:03,977 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-10 23:28:03,977 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-10 23:28:03,978 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-10 23:28:03,978 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-10 23:28:03,978 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-10 23:28:03,979 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-10 23:28:03,979 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 23:28:03,979 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-10 23:28:03,980 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-10 23:28:03,980 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-10 23:28:03,980 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-10 23:28:03,980 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-10 23:28:03,981 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-10 23:28:03,981 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-10 23:28:03,981 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-10 23:28:03,981 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-10 23:28:03,981 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 -> 14f7b86bfc883455824a54ae68bb832997924960967cf306b251b3f457d9ff4b [2024-10-10 23:28:04,185 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-10 23:28:04,204 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-10 23:28:04,207 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-10 23:28:04,208 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-10 23:28:04,208 INFO L274 PluginConnector]: CDTParser initialized [2024-10-10 23:28:04,209 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label21.c [2024-10-10 23:28:05,425 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-10 23:28:05,838 INFO L384 CDTParser]: Found 1 translation units. [2024-10-10 23:28:05,840 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label21.c [2024-10-10 23:28:05,861 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/5f0d595db/b4a745dbc647476088728e13e2ce76df/FLAGbbc9239e7 [2024-10-10 23:28:05,887 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/5f0d595db/b4a745dbc647476088728e13e2ce76df [2024-10-10 23:28:05,890 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-10 23:28:05,892 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-10 23:28:05,893 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-10 23:28:05,893 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-10 23:28:05,897 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-10 23:28:05,898 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 11:28:05" (1/1) ... [2024-10-10 23:28:05,899 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@10a53c80 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:28:05, skipping insertion in model container [2024-10-10 23:28:05,900 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 11:28:05" (1/1) ... [2024-10-10 23:28:05,974 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-10 23:28:06,167 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/Problem13_label21.c[3130,3143] [2024-10-10 23:28:06,774 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 23:28:06,783 INFO L200 MainTranslator]: Completed pre-run [2024-10-10 23:28:06,799 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/Problem13_label21.c[3130,3143] [2024-10-10 23:28:07,181 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 23:28:07,200 INFO L204 MainTranslator]: Completed translation [2024-10-10 23:28:07,201 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:28:07 WrapperNode [2024-10-10 23:28:07,201 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-10 23:28:07,202 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-10 23:28:07,202 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-10 23:28:07,202 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-10 23:28:07,207 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:28:07" (1/1) ... [2024-10-10 23:28:07,251 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:28:07" (1/1) ... [2024-10-10 23:28:07,610 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 5587 [2024-10-10 23:28:07,611 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-10 23:28:07,611 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-10 23:28:07,611 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-10 23:28:07,612 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-10 23:28:07,621 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:28:07" (1/1) ... [2024-10-10 23:28:07,621 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:28:07" (1/1) ... [2024-10-10 23:28:07,713 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:28:07" (1/1) ... [2024-10-10 23:28:07,902 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:28:07,902 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:28:07" (1/1) ... [2024-10-10 23:28:07,902 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:28:07" (1/1) ... [2024-10-10 23:28:08,125 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:28:07" (1/1) ... [2024-10-10 23:28:08,161 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:28:07" (1/1) ... [2024-10-10 23:28:08,184 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:28:07" (1/1) ... [2024-10-10 23:28:08,203 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:28:07" (1/1) ... [2024-10-10 23:28:08,246 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-10 23:28:08,247 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-10 23:28:08,247 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-10 23:28:08,247 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-10 23:28:08,248 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:28:07" (1/1) ... [2024-10-10 23:28:08,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 23:28:08,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:28:08,272 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:28:08,273 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:28:08,302 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-10 23:28:08,303 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-10 23:28:08,303 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-10 23:28:08,303 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-10 23:28:08,355 INFO L238 CfgBuilder]: Building ICFG [2024-10-10 23:28:08,357 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-10 23:28:12,724 INFO L? ?]: Removed 738 outVars from TransFormulas that were not future-live. [2024-10-10 23:28:12,725 INFO L287 CfgBuilder]: Performing block encoding [2024-10-10 23:28:12,816 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-10 23:28:12,816 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-10 23:28:12,817 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 11:28:12 BoogieIcfgContainer [2024-10-10 23:28:12,817 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-10 23:28:12,819 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-10 23:28:12,819 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-10 23:28:12,821 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-10 23:28:12,821 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.10 11:28:05" (1/3) ... [2024-10-10 23:28:12,822 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47351de6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 11:28:12, skipping insertion in model container [2024-10-10 23:28:12,822 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:28:07" (2/3) ... [2024-10-10 23:28:12,822 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47351de6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 11:28:12, skipping insertion in model container [2024-10-10 23:28:12,822 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 11:28:12" (3/3) ... [2024-10-10 23:28:12,823 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem13_label21.c [2024-10-10 23:28:12,835 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-10 23:28:12,836 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-10 23:28:12,907 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-10 23:28:12,912 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;@1cf15e2d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-10 23:28:12,912 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-10 23:28:12,920 INFO L276 IsEmpty]: Start isEmpty. Operand has 1036 states, 1034 states have (on average 1.877176015473888) internal successors, (1941), 1035 states have internal predecessors, (1941), 0 states have call successors, (0), 0 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:28:12,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-10 23:28:12,924 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:28:12,925 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:28:12,925 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:28:12,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:28:12,929 INFO L85 PathProgramCache]: Analyzing trace with hash -2045375979, now seen corresponding path program 1 times [2024-10-10 23:28:12,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:28:12,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720423200] [2024-10-10 23:28:12,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:28:12,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:28:13,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:28:13,069 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:28:13,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:28:13,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720423200] [2024-10-10 23:28:13,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1720423200] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:28:13,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:28:13,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:28:13,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123196637] [2024-10-10 23:28:13,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:28:13,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-10 23:28:13,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:28:13,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-10 23:28:13,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-10 23:28:13,137 INFO L87 Difference]: Start difference. First operand has 1036 states, 1034 states have (on average 1.877176015473888) internal successors, (1941), 1035 states have internal predecessors, (1941), 0 states have call successors, (0), 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 9.5) internal successors, (19), 2 states have internal predecessors, (19), 0 states have call successors, (0), 0 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:28:13,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:28:13,270 INFO L93 Difference]: Finished difference Result 2071 states and 3881 transitions. [2024-10-10 23:28:13,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-10 23:28:13,274 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 0 states have call successors, (0), 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 19 [2024-10-10 23:28:13,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:28:13,300 INFO L225 Difference]: With dead ends: 2071 [2024-10-10 23:28:13,301 INFO L226 Difference]: Without dead ends: 1034 [2024-10-10 23:28:13,306 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:28:13,313 INFO L432 NwaCegarLoop]: 1876 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, 1876 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:28:13,314 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1876 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 23:28:13,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1034 states. [2024-10-10 23:28:13,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1034 to 1034. [2024-10-10 23:28:13,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1034 states, 1033 states have (on average 1.8160696999031947) internal successors, (1876), 1033 states have internal predecessors, (1876), 0 states have call successors, (0), 0 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:28:13,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1034 states to 1034 states and 1876 transitions. [2024-10-10 23:28:13,459 INFO L78 Accepts]: Start accepts. Automaton has 1034 states and 1876 transitions. Word has length 19 [2024-10-10 23:28:13,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:28:13,460 INFO L471 AbstractCegarLoop]: Abstraction has 1034 states and 1876 transitions. [2024-10-10 23:28:13,460 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 0 states have call successors, (0), 0 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:28:13,460 INFO L276 IsEmpty]: Start isEmpty. Operand 1034 states and 1876 transitions. [2024-10-10 23:28:13,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-10 23:28:13,462 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:28:13,462 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:28:13,466 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-10 23:28:13,467 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:28:13,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:28:13,467 INFO L85 PathProgramCache]: Analyzing trace with hash 1708316331, now seen corresponding path program 1 times [2024-10-10 23:28:13,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:28:13,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227103326] [2024-10-10 23:28:13,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:28:13,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:28:13,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:28:13,607 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:28:13,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:28:13,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227103326] [2024-10-10 23:28:13,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [227103326] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:28:13,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:28:13,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:28:13,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620750248] [2024-10-10 23:28:13,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:28:13,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:28:13,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:28:13,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:28:13,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:28:13,612 INFO L87 Difference]: Start difference. First operand 1034 states and 1876 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 2 states have internal predecessors, (19), 0 states have call successors, (0), 0 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:28:17,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:28:17,485 INFO L93 Difference]: Finished difference Result 2976 states and 5471 transitions. [2024-10-10 23:28:17,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:28:17,486 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 2 states have internal predecessors, (19), 0 states have call successors, (0), 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 19 [2024-10-10 23:28:17,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:28:17,494 INFO L225 Difference]: With dead ends: 2976 [2024-10-10 23:28:17,494 INFO L226 Difference]: Without dead ends: 1943 [2024-10-10 23:28:17,497 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:28:17,498 INFO L432 NwaCegarLoop]: 404 mSDtfsCounter, 935 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 3050 mSolverCounterSat, 532 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 935 SdHoareTripleChecker+Valid, 538 SdHoareTripleChecker+Invalid, 3582 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 532 IncrementalHoareTripleChecker+Valid, 3050 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2024-10-10 23:28:17,499 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [935 Valid, 538 Invalid, 3582 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [532 Valid, 3050 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2024-10-10 23:28:17,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1943 states. [2024-10-10 23:28:17,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1943 to 1872. [2024-10-10 23:28:17,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1872 states, 1871 states have (on average 1.7397113842864778) internal successors, (3255), 1871 states have internal predecessors, (3255), 0 states have call successors, (0), 0 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:28:17,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1872 states to 1872 states and 3255 transitions. [2024-10-10 23:28:17,537 INFO L78 Accepts]: Start accepts. Automaton has 1872 states and 3255 transitions. Word has length 19 [2024-10-10 23:28:17,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:28:17,537 INFO L471 AbstractCegarLoop]: Abstraction has 1872 states and 3255 transitions. [2024-10-10 23:28:17,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 2 states have internal predecessors, (19), 0 states have call successors, (0), 0 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:28:17,537 INFO L276 IsEmpty]: Start isEmpty. Operand 1872 states and 3255 transitions. [2024-10-10 23:28:17,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-10-10 23:28:17,541 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:28:17,541 INFO L215 NwaCegarLoop]: trace histogram [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:28:17,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-10 23:28:17,542 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:28:17,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:28:17,543 INFO L85 PathProgramCache]: Analyzing trace with hash -873867679, now seen corresponding path program 1 times [2024-10-10 23:28:17,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:28:17,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45666651] [2024-10-10 23:28:17,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:28:17,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:28:17,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:28:17,846 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:28:17,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:28:17,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45666651] [2024-10-10 23:28:17,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [45666651] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:28:17,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:28:17,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:28:17,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035908576] [2024-10-10 23:28:17,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:28:17,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:28:17,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:28:17,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:28:17,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:28:17,851 INFO L87 Difference]: Start difference. First operand 1872 states and 3255 transitions. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 2 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:28:20,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:28:20,752 INFO L93 Difference]: Finished difference Result 5350 states and 9368 transitions. [2024-10-10 23:28:20,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:28:20,752 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 2 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 84 [2024-10-10 23:28:20,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:28:20,763 INFO L225 Difference]: With dead ends: 5350 [2024-10-10 23:28:20,764 INFO L226 Difference]: Without dead ends: 3479 [2024-10-10 23:28:20,768 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:28:20,768 INFO L432 NwaCegarLoop]: 924 mSDtfsCounter, 884 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 2339 mSolverCounterSat, 878 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 884 SdHoareTripleChecker+Valid, 1077 SdHoareTripleChecker+Invalid, 3217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 878 IncrementalHoareTripleChecker+Valid, 2339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-10-10 23:28:20,770 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [884 Valid, 1077 Invalid, 3217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [878 Valid, 2339 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-10-10 23:28:20,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3479 states. [2024-10-10 23:28:20,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3479 to 3478. [2024-10-10 23:28:20,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3478 states, 3477 states have (on average 1.5188380788035662) internal successors, (5281), 3477 states have internal predecessors, (5281), 0 states have call successors, (0), 0 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:28:20,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3478 states to 3478 states and 5281 transitions. [2024-10-10 23:28:20,826 INFO L78 Accepts]: Start accepts. Automaton has 3478 states and 5281 transitions. Word has length 84 [2024-10-10 23:28:20,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:28:20,827 INFO L471 AbstractCegarLoop]: Abstraction has 3478 states and 5281 transitions. [2024-10-10 23:28:20,827 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 2 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:28:20,830 INFO L276 IsEmpty]: Start isEmpty. Operand 3478 states and 5281 transitions. [2024-10-10 23:28:20,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-10-10 23:28:20,833 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:28:20,833 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-10 23:28:20,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-10 23:28:20,833 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:28:20,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:28:20,834 INFO L85 PathProgramCache]: Analyzing trace with hash -790808676, now seen corresponding path program 1 times [2024-10-10 23:28:20,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:28:20,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698528549] [2024-10-10 23:28:20,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:28:20,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:28:20,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:28:20,954 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:28:20,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:28:20,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698528549] [2024-10-10 23:28:20,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698528549] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:28:20,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:28:20,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:28:20,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655118479] [2024-10-10 23:28:20,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:28:20,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:28:20,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:28:20,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:28:20,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:28:20,958 INFO L87 Difference]: Start difference. First operand 3478 states and 5281 transitions. Second operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 2 states have internal predecessors, (86), 0 states have call successors, (0), 0 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:28:23,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:28:23,495 INFO L93 Difference]: Finished difference Result 10141 states and 15437 transitions. [2024-10-10 23:28:23,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:28:23,496 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 2 states have internal predecessors, (86), 0 states have call successors, (0), 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 86 [2024-10-10 23:28:23,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:28:23,514 INFO L225 Difference]: With dead ends: 10141 [2024-10-10 23:28:23,514 INFO L226 Difference]: Without dead ends: 6664 [2024-10-10 23:28:23,519 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:28:23,520 INFO L432 NwaCegarLoop]: 742 mSDtfsCounter, 976 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 2554 mSolverCounterSat, 772 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 976 SdHoareTripleChecker+Valid, 875 SdHoareTripleChecker+Invalid, 3326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 772 IncrementalHoareTripleChecker+Valid, 2554 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-10-10 23:28:23,522 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [976 Valid, 875 Invalid, 3326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [772 Valid, 2554 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-10-10 23:28:23,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6664 states. [2024-10-10 23:28:23,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6664 to 6656. [2024-10-10 23:28:23,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6656 states, 6655 states have (on average 1.3729526671675432) internal successors, (9137), 6655 states have internal predecessors, (9137), 0 states have call successors, (0), 0 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:28:23,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6656 states to 6656 states and 9137 transitions. [2024-10-10 23:28:23,601 INFO L78 Accepts]: Start accepts. Automaton has 6656 states and 9137 transitions. Word has length 86 [2024-10-10 23:28:23,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:28:23,602 INFO L471 AbstractCegarLoop]: Abstraction has 6656 states and 9137 transitions. [2024-10-10 23:28:23,602 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 2 states have internal predecessors, (86), 0 states have call successors, (0), 0 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:28:23,602 INFO L276 IsEmpty]: Start isEmpty. Operand 6656 states and 9137 transitions. [2024-10-10 23:28:23,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-10 23:28:23,605 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:28:23,606 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-10 23:28:23,606 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-10 23:28:23,606 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:28:23,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:28:23,606 INFO L85 PathProgramCache]: Analyzing trace with hash 370520461, now seen corresponding path program 1 times [2024-10-10 23:28:23,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:28:23,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895107107] [2024-10-10 23:28:23,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:28:23,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:28:23,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:28:23,704 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:28:23,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:28:23,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895107107] [2024-10-10 23:28:23,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895107107] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:28:23,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:28:23,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:28:23,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769298197] [2024-10-10 23:28:23,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:28:23,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:28:23,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:28:23,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:28:23,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:28:23,708 INFO L87 Difference]: Start difference. First operand 6656 states and 9137 transitions. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 2 states have internal predecessors, (92), 0 states have call successors, (0), 0 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:28:26,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:28:26,146 INFO L93 Difference]: Finished difference Result 19636 states and 26968 transitions. [2024-10-10 23:28:26,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:28:26,147 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 2 states have internal predecessors, (92), 0 states have call successors, (0), 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 92 [2024-10-10 23:28:26,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:28:26,179 INFO L225 Difference]: With dead ends: 19636 [2024-10-10 23:28:26,179 INFO L226 Difference]: Without dead ends: 12981 [2024-10-10 23:28:26,194 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:28:26,196 INFO L432 NwaCegarLoop]: 1010 mSDtfsCounter, 792 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 2486 mSolverCounterSat, 792 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 792 SdHoareTripleChecker+Valid, 1160 SdHoareTripleChecker+Invalid, 3278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 792 IncrementalHoareTripleChecker+Valid, 2486 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-10-10 23:28:26,197 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [792 Valid, 1160 Invalid, 3278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [792 Valid, 2486 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-10-10 23:28:26,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12981 states. [2024-10-10 23:28:26,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12981 to 12963. [2024-10-10 23:28:26,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12963 states, 12962 states have (on average 1.2390834747724118) internal successors, (16061), 12962 states have internal predecessors, (16061), 0 states have call successors, (0), 0 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:28:26,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12963 states to 12963 states and 16061 transitions. [2024-10-10 23:28:26,409 INFO L78 Accepts]: Start accepts. Automaton has 12963 states and 16061 transitions. Word has length 92 [2024-10-10 23:28:26,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:28:26,409 INFO L471 AbstractCegarLoop]: Abstraction has 12963 states and 16061 transitions. [2024-10-10 23:28:26,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 2 states have internal predecessors, (92), 0 states have call successors, (0), 0 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:28:26,409 INFO L276 IsEmpty]: Start isEmpty. Operand 12963 states and 16061 transitions. [2024-10-10 23:28:26,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-10-10 23:28:26,413 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:28:26,413 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-10 23:28:26,413 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-10 23:28:26,414 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:28:26,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:28:26,414 INFO L85 PathProgramCache]: Analyzing trace with hash -1892637787, now seen corresponding path program 1 times [2024-10-10 23:28:26,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:28:26,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201475808] [2024-10-10 23:28:26,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:28:26,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:28:26,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:28:26,545 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-10-10 23:28:26,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:28:26,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201475808] [2024-10-10 23:28:26,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1201475808] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:28:26,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:28:26,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:28:26,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064016588] [2024-10-10 23:28:26,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:28:26,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:28:26,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:28:26,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:28:26,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:28:26,548 INFO L87 Difference]: Start difference. First operand 12963 states and 16061 transitions. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 2 states have internal predecessors, (92), 0 states have call successors, (0), 0 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:28:29,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:28:29,201 INFO L93 Difference]: Finished difference Result 37780 states and 46951 transitions. [2024-10-10 23:28:29,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:28:29,202 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 2 states have internal predecessors, (92), 0 states have call successors, (0), 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 108 [2024-10-10 23:28:29,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:28:29,239 INFO L225 Difference]: With dead ends: 37780 [2024-10-10 23:28:29,240 INFO L226 Difference]: Without dead ends: 24818 [2024-10-10 23:28:29,256 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:28:29,257 INFO L432 NwaCegarLoop]: 532 mSDtfsCounter, 914 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 2920 mSolverCounterSat, 531 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 914 SdHoareTripleChecker+Valid, 697 SdHoareTripleChecker+Invalid, 3451 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 531 IncrementalHoareTripleChecker+Valid, 2920 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-10-10 23:28:29,257 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [914 Valid, 697 Invalid, 3451 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [531 Valid, 2920 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-10-10 23:28:29,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24818 states. [2024-10-10 23:28:29,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24818 to 24811. [2024-10-10 23:28:29,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24811 states, 24810 states have (on average 1.2119709794437727) internal successors, (30069), 24810 states have internal predecessors, (30069), 0 states have call successors, (0), 0 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:28:29,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24811 states to 24811 states and 30069 transitions. [2024-10-10 23:28:29,528 INFO L78 Accepts]: Start accepts. Automaton has 24811 states and 30069 transitions. Word has length 108 [2024-10-10 23:28:29,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:28:29,528 INFO L471 AbstractCegarLoop]: Abstraction has 24811 states and 30069 transitions. [2024-10-10 23:28:29,529 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 2 states have internal predecessors, (92), 0 states have call successors, (0), 0 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:28:29,529 INFO L276 IsEmpty]: Start isEmpty. Operand 24811 states and 30069 transitions. [2024-10-10 23:28:29,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-10-10 23:28:29,530 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:28:29,530 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-10 23:28:29,530 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-10 23:28:29,530 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:28:29,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:28:29,531 INFO L85 PathProgramCache]: Analyzing trace with hash 1540503247, now seen corresponding path program 1 times [2024-10-10 23:28:29,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:28:29,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340385289] [2024-10-10 23:28:29,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:28:29,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:28:29,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:28:29,801 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:28:29,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:28:29,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340385289] [2024-10-10 23:28:29,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [340385289] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:28:29,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:28:29,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:28:29,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536854783] [2024-10-10 23:28:29,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:28:29,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:28:29,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:28:29,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:28:29,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:28:29,804 INFO L87 Difference]: Start difference. First operand 24811 states and 30069 transitions. Second operand has 3 states, 3 states have (on average 45.0) internal successors, (135), 2 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:28:32,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:28:32,254 INFO L93 Difference]: Finished difference Result 44111 states and 54198 transitions. [2024-10-10 23:28:32,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:28:32,255 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 2 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 135 [2024-10-10 23:28:32,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:28:32,304 INFO L225 Difference]: With dead ends: 44111 [2024-10-10 23:28:32,304 INFO L226 Difference]: Without dead ends: 24820 [2024-10-10 23:28:32,325 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:28:32,328 INFO L432 NwaCegarLoop]: 1025 mSDtfsCounter, 730 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 2714 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 730 SdHoareTripleChecker+Valid, 1209 SdHoareTripleChecker+Invalid, 2718 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 2714 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-10-10 23:28:32,328 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [730 Valid, 1209 Invalid, 2718 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 2714 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-10-10 23:28:32,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24820 states. [2024-10-10 23:28:32,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24820 to 24811. [2024-10-10 23:28:32,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24811 states, 24810 states have (on average 1.2105602579604997) internal successors, (30034), 24810 states have internal predecessors, (30034), 0 states have call successors, (0), 0 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:28:32,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24811 states to 24811 states and 30034 transitions. [2024-10-10 23:28:32,561 INFO L78 Accepts]: Start accepts. Automaton has 24811 states and 30034 transitions. Word has length 135 [2024-10-10 23:28:32,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:28:32,562 INFO L471 AbstractCegarLoop]: Abstraction has 24811 states and 30034 transitions. [2024-10-10 23:28:32,562 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 2 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:28:32,562 INFO L276 IsEmpty]: Start isEmpty. Operand 24811 states and 30034 transitions. [2024-10-10 23:28:32,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2024-10-10 23:28:32,564 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:28:32,564 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:28:32,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-10 23:28:32,565 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:28:32,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:28:32,565 INFO L85 PathProgramCache]: Analyzing trace with hash -1808815860, now seen corresponding path program 1 times [2024-10-10 23:28:32,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:28:32,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126570721] [2024-10-10 23:28:32,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:28:32,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:28:32,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:28:32,704 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 123 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:28:32,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:28:32,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126570721] [2024-10-10 23:28:32,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [126570721] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:28:32,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:28:32,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:28:32,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342182973] [2024-10-10 23:28:32,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:28:32,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:28:32,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:28:32,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:28:32,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:28:32,706 INFO L87 Difference]: Start difference. First operand 24811 states and 30034 transitions. Second operand has 3 states, 3 states have (on average 77.66666666666667) internal successors, (233), 3 states have internal predecessors, (233), 0 states have call successors, (0), 0 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:28:35,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:28:35,398 INFO L93 Difference]: Finished difference Result 70073 states and 85508 transitions. [2024-10-10 23:28:35,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:28:35,399 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 77.66666666666667) internal successors, (233), 3 states have internal predecessors, (233), 0 states have call successors, (0), 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 233 [2024-10-10 23:28:35,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:28:35,448 INFO L225 Difference]: With dead ends: 70073 [2024-10-10 23:28:35,448 INFO L226 Difference]: Without dead ends: 45263 [2024-10-10 23:28:35,464 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:28:35,465 INFO L432 NwaCegarLoop]: 1847 mSDtfsCounter, 840 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 2480 mSolverCounterSat, 807 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 840 SdHoareTripleChecker+Valid, 1984 SdHoareTripleChecker+Invalid, 3287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 807 IncrementalHoareTripleChecker+Valid, 2480 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-10-10 23:28:35,465 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [840 Valid, 1984 Invalid, 3287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [807 Valid, 2480 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-10-10 23:28:35,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45263 states. [2024-10-10 23:28:35,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45263 to 42892. [2024-10-10 23:28:35,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42892 states, 42891 states have (on average 1.1765871628080482) internal successors, (50465), 42891 states have internal predecessors, (50465), 0 states have call successors, (0), 0 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:28:35,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42892 states to 42892 states and 50465 transitions. [2024-10-10 23:28:35,830 INFO L78 Accepts]: Start accepts. Automaton has 42892 states and 50465 transitions. Word has length 233 [2024-10-10 23:28:35,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:28:35,830 INFO L471 AbstractCegarLoop]: Abstraction has 42892 states and 50465 transitions. [2024-10-10 23:28:35,831 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 77.66666666666667) internal successors, (233), 3 states have internal predecessors, (233), 0 states have call successors, (0), 0 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:28:35,831 INFO L276 IsEmpty]: Start isEmpty. Operand 42892 states and 50465 transitions. [2024-10-10 23:28:35,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-10-10 23:28:35,833 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:28:35,833 INFO L215 NwaCegarLoop]: trace histogram [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, 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, 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:28:35,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-10 23:28:35,833 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:28:35,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:28:35,834 INFO L85 PathProgramCache]: Analyzing trace with hash 1334013812, now seen corresponding path program 1 times [2024-10-10 23:28:35,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:28:35,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545285333] [2024-10-10 23:28:35,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:28:35,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:28:35,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:28:36,148 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 155 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2024-10-10 23:28:36,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:28:36,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545285333] [2024-10-10 23:28:36,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545285333] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:28:36,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:28:36,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:28:36,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631723363] [2024-10-10 23:28:36,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:28:36,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:28:36,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:28:36,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:28:36,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:28:36,151 INFO L87 Difference]: Start difference. First operand 42892 states and 50465 transitions. Second operand has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 0 states have call successors, (0), 0 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:28:38,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:28:38,605 INFO L93 Difference]: Finished difference Result 84996 states and 100132 transitions. [2024-10-10 23:28:38,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:28:38,606 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 0 states have call successors, (0), 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 248 [2024-10-10 23:28:38,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:28:38,651 INFO L225 Difference]: With dead ends: 84996 [2024-10-10 23:28:38,651 INFO L226 Difference]: Without dead ends: 42892 [2024-10-10 23:28:38,679 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:28:38,680 INFO L432 NwaCegarLoop]: 1064 mSDtfsCounter, 700 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 2504 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 700 SdHoareTripleChecker+Valid, 1193 SdHoareTripleChecker+Invalid, 2508 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 2504 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-10-10 23:28:38,680 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [700 Valid, 1193 Invalid, 2508 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 2504 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-10-10 23:28:38,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42892 states. [2024-10-10 23:28:39,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42892 to 42892. [2024-10-10 23:28:39,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42892 states, 42891 states have (on average 1.1764705882352942) internal successors, (50460), 42891 states have internal predecessors, (50460), 0 states have call successors, (0), 0 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:28:39,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42892 states to 42892 states and 50460 transitions. [2024-10-10 23:28:39,201 INFO L78 Accepts]: Start accepts. Automaton has 42892 states and 50460 transitions. Word has length 248 [2024-10-10 23:28:39,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:28:39,202 INFO L471 AbstractCegarLoop]: Abstraction has 42892 states and 50460 transitions. [2024-10-10 23:28:39,202 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 0 states have call successors, (0), 0 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:28:39,202 INFO L276 IsEmpty]: Start isEmpty. Operand 42892 states and 50460 transitions. [2024-10-10 23:28:39,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2024-10-10 23:28:39,204 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:28:39,205 INFO L215 NwaCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 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:28:39,205 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-10 23:28:39,205 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:28:39,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:28:39,205 INFO L85 PathProgramCache]: Analyzing trace with hash 1504502843, now seen corresponding path program 1 times [2024-10-10 23:28:39,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:28:39,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482625739] [2024-10-10 23:28:39,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:28:39,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:28:39,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:28:39,330 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 240 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-10 23:28:39,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:28:39,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482625739] [2024-10-10 23:28:39,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1482625739] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:28:39,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:28:39,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:28:39,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21257872] [2024-10-10 23:28:39,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:28:39,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:28:39,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:28:39,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:28:39,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:28:39,334 INFO L87 Difference]: Start difference. First operand 42892 states and 50460 transitions. Second operand has 3 states, 3 states have (on average 79.33333333333333) internal successors, (238), 3 states have internal predecessors, (238), 0 states have call successors, (0), 0 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:28:41,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:28:41,995 INFO L93 Difference]: Finished difference Result 104681 states and 125380 transitions. [2024-10-10 23:28:41,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:28:41,996 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 79.33333333333333) internal successors, (238), 3 states have internal predecessors, (238), 0 states have call successors, (0), 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 255 [2024-10-10 23:28:41,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:28:42,061 INFO L225 Difference]: With dead ends: 104681 [2024-10-10 23:28:42,061 INFO L226 Difference]: Without dead ends: 62577 [2024-10-10 23:28:42,093 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:28:42,094 INFO L432 NwaCegarLoop]: 811 mSDtfsCounter, 882 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 2387 mSolverCounterSat, 900 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 882 SdHoareTripleChecker+Valid, 928 SdHoareTripleChecker+Invalid, 3287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 900 IncrementalHoareTripleChecker+Valid, 2387 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-10-10 23:28:42,094 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [882 Valid, 928 Invalid, 3287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [900 Valid, 2387 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-10-10 23:28:42,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62577 states. [2024-10-10 23:28:42,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62577 to 60993. [2024-10-10 23:28:42,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60993 states, 60992 states have (on average 1.1660545645330536) internal successors, (71120), 60992 states have internal predecessors, (71120), 0 states have call successors, (0), 0 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:28:42,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60993 states to 60993 states and 71120 transitions. [2024-10-10 23:28:42,770 INFO L78 Accepts]: Start accepts. Automaton has 60993 states and 71120 transitions. Word has length 255 [2024-10-10 23:28:42,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:28:42,771 INFO L471 AbstractCegarLoop]: Abstraction has 60993 states and 71120 transitions. [2024-10-10 23:28:42,771 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 79.33333333333333) internal successors, (238), 3 states have internal predecessors, (238), 0 states have call successors, (0), 0 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:28:42,771 INFO L276 IsEmpty]: Start isEmpty. Operand 60993 states and 71120 transitions. [2024-10-10 23:28:42,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2024-10-10 23:28:42,773 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:28:42,773 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-10 23:28:42,773 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-10 23:28:42,773 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:28:42,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:28:42,773 INFO L85 PathProgramCache]: Analyzing trace with hash 682756360, now seen corresponding path program 1 times [2024-10-10 23:28:42,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:28:42,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294981565] [2024-10-10 23:28:42,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:28:42,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:28:42,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:28:43,973 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 35 proven. 113 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:28:43,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:28:43,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294981565] [2024-10-10 23:28:43,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1294981565] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 23:28:43,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1028491785] [2024-10-10 23:28:43,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:28:43,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:28:43,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:28:43,975 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:28:43,977 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:28:44,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:28:44,091 INFO L255 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-10 23:28:44,103 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 23:28:44,160 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2024-10-10 23:28:44,160 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 23:28:44,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1028491785] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:28:44,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 23:28:44,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2024-10-10 23:28:44,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032702229] [2024-10-10 23:28:44,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:28:44,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:28:44,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:28:44,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:28:44,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-10-10 23:28:44,162 INFO L87 Difference]: Start difference. First operand 60993 states and 71120 transitions. Second operand has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 0 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:28:46,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:28:46,780 INFO L93 Difference]: Finished difference Result 121196 states and 141446 transitions. [2024-10-10 23:28:46,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:28:46,781 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 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 260 [2024-10-10 23:28:46,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:28:46,841 INFO L225 Difference]: With dead ends: 121196 [2024-10-10 23:28:46,841 INFO L226 Difference]: Without dead ends: 60991 [2024-10-10 23:28:46,876 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 259 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-10-10 23:28:46,876 INFO L432 NwaCegarLoop]: 1356 mSDtfsCounter, 1187 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 2470 mSolverCounterSat, 446 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1187 SdHoareTripleChecker+Valid, 1436 SdHoareTripleChecker+Invalid, 2916 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 446 IncrementalHoareTripleChecker+Valid, 2470 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-10-10 23:28:46,876 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1187 Valid, 1436 Invalid, 2916 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [446 Valid, 2470 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-10-10 23:28:46,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60991 states. [2024-10-10 23:28:47,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60991 to 60990. [2024-10-10 23:28:47,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60990 states, 60989 states have (on average 1.1285313745101575) internal successors, (68828), 60989 states have internal predecessors, (68828), 0 states have call successors, (0), 0 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:28:47,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60990 states to 60990 states and 68828 transitions. [2024-10-10 23:28:47,417 INFO L78 Accepts]: Start accepts. Automaton has 60990 states and 68828 transitions. Word has length 260 [2024-10-10 23:28:47,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:28:47,417 INFO L471 AbstractCegarLoop]: Abstraction has 60990 states and 68828 transitions. [2024-10-10 23:28:47,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 0 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:28:47,417 INFO L276 IsEmpty]: Start isEmpty. Operand 60990 states and 68828 transitions. [2024-10-10 23:28:47,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2024-10-10 23:28:47,422 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:28:47,422 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-10 23:28:47,435 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:28:47,622 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,SelfDestructingSolverStorable10 [2024-10-10 23:28:47,623 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:28:47,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:28:47,623 INFO L85 PathProgramCache]: Analyzing trace with hash 554785925, now seen corresponding path program 1 times [2024-10-10 23:28:47,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:28:47,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778081049] [2024-10-10 23:28:47,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:28:47,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:28:47,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:28:48,053 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2024-10-10 23:28:48,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:28:48,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778081049] [2024-10-10 23:28:48,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [778081049] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:28:48,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:28:48,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:28:48,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407762722] [2024-10-10 23:28:48,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:28:48,054 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:28:48,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:28:48,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:28:48,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:28:48,055 INFO L87 Difference]: Start difference. First operand 60990 states and 68828 transitions. Second operand has 3 states, 3 states have (on average 62.333333333333336) internal successors, (187), 3 states have internal predecessors, (187), 0 states have call successors, (0), 0 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:28:51,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:28:51,250 INFO L93 Difference]: Finished difference Result 140088 states and 159777 transitions. [2024-10-10 23:28:51,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:28:51,251 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 62.333333333333336) internal successors, (187), 3 states have internal predecessors, (187), 0 states have call successors, (0), 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 310 [2024-10-10 23:28:51,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:28:51,325 INFO L225 Difference]: With dead ends: 140088 [2024-10-10 23:28:51,325 INFO L226 Difference]: Without dead ends: 79886 [2024-10-10 23:28:51,334 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:28:51,335 INFO L432 NwaCegarLoop]: 1808 mSDtfsCounter, 840 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 2555 mSolverCounterSat, 722 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 840 SdHoareTripleChecker+Valid, 1950 SdHoareTripleChecker+Invalid, 3277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 722 IncrementalHoareTripleChecker+Valid, 2555 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-10-10 23:28:51,335 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [840 Valid, 1950 Invalid, 3277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [722 Valid, 2555 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-10-10 23:28:51,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79886 states. [2024-10-10 23:28:51,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79886 to 79095. [2024-10-10 23:28:51,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79095 states, 79094 states have (on average 1.1100083445014792) internal successors, (87795), 79094 states have internal predecessors, (87795), 0 states have call successors, (0), 0 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:28:52,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79095 states to 79095 states and 87795 transitions. [2024-10-10 23:28:52,019 INFO L78 Accepts]: Start accepts. Automaton has 79095 states and 87795 transitions. Word has length 310 [2024-10-10 23:28:52,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:28:52,019 INFO L471 AbstractCegarLoop]: Abstraction has 79095 states and 87795 transitions. [2024-10-10 23:28:52,019 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 62.333333333333336) internal successors, (187), 3 states have internal predecessors, (187), 0 states have call successors, (0), 0 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:28:52,019 INFO L276 IsEmpty]: Start isEmpty. Operand 79095 states and 87795 transitions. [2024-10-10 23:28:52,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 326 [2024-10-10 23:28:52,022 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:28:52,022 INFO L215 NwaCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:28:52,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-10 23:28:52,022 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:28:52,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:28:52,022 INFO L85 PathProgramCache]: Analyzing trace with hash -1195026524, now seen corresponding path program 1 times [2024-10-10 23:28:52,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:28:52,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309428084] [2024-10-10 23:28:52,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:28:52,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:28:52,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:28:52,872 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 167 proven. 110 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-10 23:28:52,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:28:52,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309428084] [2024-10-10 23:28:52,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309428084] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 23:28:52,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [406916687] [2024-10-10 23:28:52,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:28:52,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:28:52,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:28:52,874 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:28:52,875 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:28:52,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:28:52,968 INFO L255 TraceCheckSpWp]: Trace formula consists of 461 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-10 23:28:52,971 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 23:28:53,076 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 182 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2024-10-10 23:28:53,076 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 23:28:53,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [406916687] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:28:53,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 23:28:53,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2024-10-10 23:28:53,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960613286] [2024-10-10 23:28:53,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:28:53,078 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:28:53,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:28:53,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:28:53,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-10 23:28:53,080 INFO L87 Difference]: Start difference. First operand 79095 states and 87795 transitions. Second operand has 3 states, 3 states have (on average 71.0) internal successors, (213), 3 states have internal predecessors, (213), 0 states have call successors, (0), 0 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:28:55,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:28:55,891 INFO L93 Difference]: Finished difference Result 157393 states and 174789 transitions. [2024-10-10 23:28:55,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:28:55,892 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 71.0) internal successors, (213), 3 states have internal predecessors, (213), 0 states have call successors, (0), 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 325 [2024-10-10 23:28:55,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:28:55,977 INFO L225 Difference]: With dead ends: 157393 [2024-10-10 23:28:55,977 INFO L226 Difference]: Without dead ends: 79086 [2024-10-10 23:28:55,995 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 329 GetRequests, 324 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-10 23:28:55,995 INFO L432 NwaCegarLoop]: 682 mSDtfsCounter, 1073 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 2394 mSolverCounterSat, 527 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1073 SdHoareTripleChecker+Valid, 809 SdHoareTripleChecker+Invalid, 2921 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 527 IncrementalHoareTripleChecker+Valid, 2394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-10-10 23:28:55,995 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1073 Valid, 809 Invalid, 2921 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [527 Valid, 2394 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-10-10 23:28:56,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79086 states. [2024-10-10 23:28:56,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79086 to 79085. [2024-10-10 23:28:56,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79085 states, 79084 states have (on average 1.0809013201153204) internal successors, (85482), 79084 states have internal predecessors, (85482), 0 states have call successors, (0), 0 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:28:56,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79085 states to 79085 states and 85482 transitions. [2024-10-10 23:28:56,916 INFO L78 Accepts]: Start accepts. Automaton has 79085 states and 85482 transitions. Word has length 325 [2024-10-10 23:28:56,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:28:56,916 INFO L471 AbstractCegarLoop]: Abstraction has 79085 states and 85482 transitions. [2024-10-10 23:28:56,916 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 71.0) internal successors, (213), 3 states have internal predecessors, (213), 0 states have call successors, (0), 0 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:28:56,916 INFO L276 IsEmpty]: Start isEmpty. Operand 79085 states and 85482 transitions. [2024-10-10 23:28:56,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 368 [2024-10-10 23:28:56,924 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:28:56,924 INFO L215 NwaCegarLoop]: trace histogram [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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:28:56,955 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:28:57,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:28:57,125 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:28:57,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:28:57,126 INFO L85 PathProgramCache]: Analyzing trace with hash -281232766, now seen corresponding path program 1 times [2024-10-10 23:28:57,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:28:57,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929071206] [2024-10-10 23:28:57,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:28:57,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:28:57,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:28:57,376 INFO L134 CoverageAnalysis]: Checked inductivity of 527 backedges. 426 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2024-10-10 23:28:57,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:28:57,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929071206] [2024-10-10 23:28:57,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929071206] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:28:57,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:28:57,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:28:57,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167237678] [2024-10-10 23:28:57,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:28:57,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:28:57,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:28:57,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:28:57,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:28:57,377 INFO L87 Difference]: Start difference. First operand 79085 states and 85482 transitions. Second operand has 4 states, 4 states have (on average 71.5) internal successors, (286), 3 states have internal predecessors, (286), 0 states have call successors, (0), 0 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:29:03,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:29:03,076 INFO L93 Difference]: Finished difference Result 221340 states and 239936 transitions. [2024-10-10 23:29:03,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 23:29:03,076 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 71.5) internal successors, (286), 3 states have internal predecessors, (286), 0 states have call successors, (0), 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 367 [2024-10-10 23:29:03,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:29:03,212 INFO L225 Difference]: With dead ends: 221340 [2024-10-10 23:29:03,212 INFO L226 Difference]: Without dead ends: 143043 [2024-10-10 23:29:03,383 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:29:03,385 INFO L432 NwaCegarLoop]: 549 mSDtfsCounter, 1707 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 6621 mSolverCounterSat, 1039 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1707 SdHoareTripleChecker+Valid, 783 SdHoareTripleChecker+Invalid, 7660 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1039 IncrementalHoareTripleChecker+Valid, 6621 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2024-10-10 23:29:03,385 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1707 Valid, 783 Invalid, 7660 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1039 Valid, 6621 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2024-10-10 23:29:03,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143043 states. [2024-10-10 23:29:04,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143043 to 139765. [2024-10-10 23:29:04,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139765 states, 139764 states have (on average 1.0780530036346985) internal successors, (150673), 139764 states have internal predecessors, (150673), 0 states have call successors, (0), 0 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:29:04,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139765 states to 139765 states and 150673 transitions. [2024-10-10 23:29:04,658 INFO L78 Accepts]: Start accepts. Automaton has 139765 states and 150673 transitions. Word has length 367 [2024-10-10 23:29:04,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:29:04,659 INFO L471 AbstractCegarLoop]: Abstraction has 139765 states and 150673 transitions. [2024-10-10 23:29:04,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 71.5) internal successors, (286), 3 states have internal predecessors, (286), 0 states have call successors, (0), 0 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:29:04,659 INFO L276 IsEmpty]: Start isEmpty. Operand 139765 states and 150673 transitions. [2024-10-10 23:29:04,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 368 [2024-10-10 23:29:04,662 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:29:04,662 INFO L215 NwaCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:29:04,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-10 23:29:04,663 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:29:04,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:29:04,663 INFO L85 PathProgramCache]: Analyzing trace with hash -467210533, now seen corresponding path program 1 times [2024-10-10 23:29:04,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:29:04,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185627297] [2024-10-10 23:29:04,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:29:04,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:29:04,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:29:05,899 INFO L134 CoverageAnalysis]: Checked inductivity of 379 backedges. 251 proven. 110 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-10 23:29:05,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:29:05,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185627297] [2024-10-10 23:29:05,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1185627297] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 23:29:05,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [788671806] [2024-10-10 23:29:05,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:29:05,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:29:05,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:29:05,902 INFO L229 MonitoredProcess]: Starting monitored process 4 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:29:05,903 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-10 23:29:05,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:29:05,999 INFO L255 TraceCheckSpWp]: Trace formula consists of 497 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-10 23:29:06,001 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 23:29:06,098 INFO L134 CoverageAnalysis]: Checked inductivity of 379 backedges. 266 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2024-10-10 23:29:06,098 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 23:29:06,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [788671806] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:29:06,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 23:29:06,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2024-10-10 23:29:06,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454002644] [2024-10-10 23:29:06,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:29:06,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:29:06,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:29:06,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:29:06,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-10 23:29:06,100 INFO L87 Difference]: Start difference. First operand 139765 states and 150673 transitions. Second operand has 3 states, 3 states have (on average 85.0) internal successors, (255), 3 states have internal predecessors, (255), 0 states have call successors, (0), 0 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:29:09,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:29:09,038 INFO L93 Difference]: Finished difference Result 276365 states and 299724 transitions. [2024-10-10 23:29:09,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:29:09,038 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 85.0) internal successors, (255), 3 states have internal predecessors, (255), 0 states have call successors, (0), 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 367 [2024-10-10 23:29:09,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:29:09,195 INFO L225 Difference]: With dead ends: 276365 [2024-10-10 23:29:09,195 INFO L226 Difference]: Without dead ends: 151564 [2024-10-10 23:29:09,235 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 371 GetRequests, 366 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-10 23:29:09,236 INFO L432 NwaCegarLoop]: 387 mSDtfsCounter, 1214 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 2263 mSolverCounterSat, 933 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1214 SdHoareTripleChecker+Valid, 403 SdHoareTripleChecker+Invalid, 3196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 933 IncrementalHoareTripleChecker+Valid, 2263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-10-10 23:29:09,236 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1214 Valid, 403 Invalid, 3196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [933 Valid, 2263 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-10-10 23:29:09,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151564 states. [2024-10-10 23:29:10,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151564 to 151564. [2024-10-10 23:29:10,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151564 states, 151563 states have (on average 1.0783436590724649) internal successors, (163437), 151563 states have internal predecessors, (163437), 0 states have call successors, (0), 0 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:29:11,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151564 states to 151564 states and 163437 transitions. [2024-10-10 23:29:11,147 INFO L78 Accepts]: Start accepts. Automaton has 151564 states and 163437 transitions. Word has length 367 [2024-10-10 23:29:11,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:29:11,148 INFO L471 AbstractCegarLoop]: Abstraction has 151564 states and 163437 transitions. [2024-10-10 23:29:11,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 85.0) internal successors, (255), 3 states have internal predecessors, (255), 0 states have call successors, (0), 0 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:29:11,148 INFO L276 IsEmpty]: Start isEmpty. Operand 151564 states and 163437 transitions. [2024-10-10 23:29:11,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 411 [2024-10-10 23:29:11,153 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:29:11,153 INFO L215 NwaCegarLoop]: trace histogram [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, 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, 2, 2, 2, 2, 2, 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] [2024-10-10 23:29:11,165 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-10 23:29:11,353 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:29:11,353 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:29:11,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:29:11,354 INFO L85 PathProgramCache]: Analyzing trace with hash 2096681402, now seen corresponding path program 1 times [2024-10-10 23:29:11,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:29:11,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241885901] [2024-10-10 23:29:11,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:29:11,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:29:11,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:29:12,205 INFO L134 CoverageAnalysis]: Checked inductivity of 547 backedges. 336 proven. 110 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2024-10-10 23:29:12,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:29:12,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241885901] [2024-10-10 23:29:12,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1241885901] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 23:29:12,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1125451876] [2024-10-10 23:29:12,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:29:12,206 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:29:12,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:29:12,208 INFO L229 MonitoredProcess]: Starting monitored process 5 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:29:12,209 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-10 23:29:12,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:29:12,401 INFO L255 TraceCheckSpWp]: Trace formula consists of 575 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-10 23:29:12,404 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 23:29:12,440 INFO L134 CoverageAnalysis]: Checked inductivity of 547 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 476 trivial. 0 not checked. [2024-10-10 23:29:12,441 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 23:29:12,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1125451876] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:29:12,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 23:29:12,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2024-10-10 23:29:12,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513070401] [2024-10-10 23:29:12,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:29:12,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:29:12,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:29:12,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:29:12,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-10 23:29:12,442 INFO L87 Difference]: Start difference. First operand 151564 states and 163437 transitions. Second operand has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:29:15,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:29:15,633 INFO L93 Difference]: Finished difference Result 303914 states and 327667 transitions. [2024-10-10 23:29:15,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:29:15,634 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 410 [2024-10-10 23:29:15,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:29:15,811 INFO L225 Difference]: With dead ends: 303914 [2024-10-10 23:29:15,812 INFO L226 Difference]: Without dead ends: 153138 [2024-10-10 23:29:15,886 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 414 GetRequests, 409 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-10 23:29:15,887 INFO L432 NwaCegarLoop]: 1384 mSDtfsCounter, 1018 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 2482 mSolverCounterSat, 599 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1018 SdHoareTripleChecker+Valid, 1467 SdHoareTripleChecker+Invalid, 3081 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 599 IncrementalHoareTripleChecker+Valid, 2482 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-10-10 23:29:15,887 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1018 Valid, 1467 Invalid, 3081 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [599 Valid, 2482 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-10-10 23:29:15,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153138 states. [2024-10-10 23:29:17,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153138 to 151549. [2024-10-10 23:29:17,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151549 states, 151548 states have (on average 1.0654512101776334) internal successors, (161467), 151548 states have internal predecessors, (161467), 0 states have call successors, (0), 0 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:29:17,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151549 states to 151549 states and 161467 transitions. [2024-10-10 23:29:17,587 INFO L78 Accepts]: Start accepts. Automaton has 151549 states and 161467 transitions. Word has length 410 [2024-10-10 23:29:17,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:29:17,587 INFO L471 AbstractCegarLoop]: Abstraction has 151549 states and 161467 transitions. [2024-10-10 23:29:17,587 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:29:17,587 INFO L276 IsEmpty]: Start isEmpty. Operand 151549 states and 161467 transitions. [2024-10-10 23:29:17,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 429 [2024-10-10 23:29:17,592 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:29:17,592 INFO L215 NwaCegarLoop]: trace histogram [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, 4, 4, 4, 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, 2, 2, 2, 2, 2, 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] [2024-10-10 23:29:17,605 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-10 23:29:17,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-10-10 23:29:17,793 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:29:17,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:29:17,794 INFO L85 PathProgramCache]: Analyzing trace with hash 1932067565, now seen corresponding path program 1 times [2024-10-10 23:29:17,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:29:17,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844366645] [2024-10-10 23:29:17,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:29:17,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:29:17,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:29:19,133 INFO L134 CoverageAnalysis]: Checked inductivity of 601 backedges. 369 proven. 113 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2024-10-10 23:29:19,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:29:19,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844366645] [2024-10-10 23:29:19,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [844366645] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 23:29:19,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1318403658] [2024-10-10 23:29:19,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:29:19,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:29:19,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:29:19,136 INFO L229 MonitoredProcess]: Starting monitored process 6 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:29:19,137 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-10 23:29:19,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:29:19,283 INFO L255 TraceCheckSpWp]: Trace formula consists of 596 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-10 23:29:19,288 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 23:29:19,383 INFO L134 CoverageAnalysis]: Checked inductivity of 601 backedges. 319 proven. 0 refuted. 0 times theorem prover too weak. 282 trivial. 0 not checked. [2024-10-10 23:29:19,383 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 23:29:19,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1318403658] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:29:19,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 23:29:19,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2024-10-10 23:29:19,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10478680] [2024-10-10 23:29:19,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:29:19,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:29:19,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:29:19,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:29:19,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-10-10 23:29:19,386 INFO L87 Difference]: Start difference. First operand 151549 states and 161467 transitions. Second operand has 3 states, 3 states have (on average 77.33333333333333) internal successors, (232), 3 states have internal predecessors, (232), 0 states have call successors, (0), 0 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:29:22,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:29:22,393 INFO L93 Difference]: Finished difference Result 333798 states and 356595 transitions. [2024-10-10 23:29:22,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:29:22,393 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 77.33333333333333) internal successors, (232), 3 states have internal predecessors, (232), 0 states have call successors, (0), 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 428 [2024-10-10 23:29:22,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:29:22,595 INFO L225 Difference]: With dead ends: 333798 [2024-10-10 23:29:22,595 INFO L226 Difference]: Without dead ends: 183037 [2024-10-10 23:29:22,684 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 434 GetRequests, 427 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-10-10 23:29:22,684 INFO L432 NwaCegarLoop]: 1639 mSDtfsCounter, 843 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 2494 mSolverCounterSat, 506 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 843 SdHoareTripleChecker+Valid, 1756 SdHoareTripleChecker+Invalid, 3000 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 506 IncrementalHoareTripleChecker+Valid, 2494 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-10-10 23:29:22,684 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [843 Valid, 1756 Invalid, 3000 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [506 Valid, 2494 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-10-10 23:29:22,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183037 states. [2024-10-10 23:29:24,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183037 to 180666. [2024-10-10 23:29:24,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180666 states, 180665 states have (on average 1.0652146237511415) internal successors, (192447), 180665 states have internal predecessors, (192447), 0 states have call successors, (0), 0 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:29:24,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180666 states to 180666 states and 192447 transitions. [2024-10-10 23:29:24,963 INFO L78 Accepts]: Start accepts. Automaton has 180666 states and 192447 transitions. Word has length 428 [2024-10-10 23:29:24,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:29:24,963 INFO L471 AbstractCegarLoop]: Abstraction has 180666 states and 192447 transitions. [2024-10-10 23:29:24,963 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 77.33333333333333) internal successors, (232), 3 states have internal predecessors, (232), 0 states have call successors, (0), 0 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:29:24,963 INFO L276 IsEmpty]: Start isEmpty. Operand 180666 states and 192447 transitions. [2024-10-10 23:29:24,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 451 [2024-10-10 23:29:24,977 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:29:24,978 INFO L215 NwaCegarLoop]: trace histogram [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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2024-10-10 23:29:25,001 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-10 23:29:25,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-10-10 23:29:25,179 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:29:25,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:29:25,179 INFO L85 PathProgramCache]: Analyzing trace with hash 1632394364, now seen corresponding path program 1 times [2024-10-10 23:29:25,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:29:25,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096085633] [2024-10-10 23:29:25,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:29:25,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:29:25,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:29:25,374 INFO L134 CoverageAnalysis]: Checked inductivity of 640 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 569 trivial. 0 not checked. [2024-10-10 23:29:25,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:29:25,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096085633] [2024-10-10 23:29:25,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096085633] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:29:25,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:29:25,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-10 23:29:25,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256703404] [2024-10-10 23:29:25,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:29:25,375 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:29:25,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:29:25,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:29:25,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:29:25,376 INFO L87 Difference]: Start difference. First operand 180666 states and 192447 transitions. Second operand has 4 states, 4 states have (on average 39.0) internal successors, (156), 4 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)