./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/Problem15_label00.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem15_label00.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e0fca5dbc26170dee357d8c920e255472ddf26c4f4efecf06bc9180208e51483 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 16:16:39,278 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 16:16:39,339 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-12 16:16:39,344 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 16:16:39,346 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 16:16:39,365 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 16:16:39,366 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 16:16:39,366 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 16:16:39,366 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 16:16:39,367 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 16:16:39,367 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 16:16:39,367 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 16:16:39,367 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 16:16:39,368 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 16:16:39,368 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 16:16:39,368 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 16:16:39,368 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 16:16:39,369 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 16:16:39,369 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 16:16:39,369 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 16:16:39,369 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 16:16:39,371 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 16:16:39,371 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 16:16:39,371 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 16:16:39,371 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 16:16:39,372 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 16:16:39,372 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 16:16:39,372 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 16:16:39,372 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 16:16:39,372 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 16:16:39,372 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 16:16:39,372 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 16:16:39,372 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 16:16:39,373 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 16:16:39,373 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 16:16:39,373 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 16:16:39,373 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 16:16:39,373 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 16:16:39,373 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 16:16:39,373 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 16:16:39,374 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 16:16:39,374 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 16:16:39,374 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e0fca5dbc26170dee357d8c920e255472ddf26c4f4efecf06bc9180208e51483 [2024-10-12 16:16:39,566 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 16:16:39,586 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 16:16:39,588 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 16:16:39,589 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 16:16:39,590 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 16:16:39,590 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem15_label00.c [2024-10-12 16:16:40,773 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 16:16:41,005 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 16:16:41,006 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem15_label00.c [2024-10-12 16:16:41,022 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/63c52ff81/036916dbb6df469c8cdcc79c2de0bfe6/FLAGa33c2e0db [2024-10-12 16:16:41,034 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/63c52ff81/036916dbb6df469c8cdcc79c2de0bfe6 [2024-10-12 16:16:41,036 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 16:16:41,037 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 16:16:41,039 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 16:16:41,039 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 16:16:41,042 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 16:16:41,043 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 04:16:41" (1/1) ... [2024-10-12 16:16:41,044 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46c0b0ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:16:41, skipping insertion in model container [2024-10-12 16:16:41,045 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 04:16:41" (1/1) ... [2024-10-12 16:16:41,089 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 16:16:41,263 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/Problem15_label00.c[1053,1066] [2024-10-12 16:16:41,525 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 16:16:41,533 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 16:16:41,544 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/Problem15_label00.c[1053,1066] [2024-10-12 16:16:41,678 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 16:16:41,693 INFO L204 MainTranslator]: Completed translation [2024-10-12 16:16:41,693 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:16:41 WrapperNode [2024-10-12 16:16:41,693 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 16:16:41,694 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 16:16:41,694 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 16:16:41,694 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 16:16:41,698 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:16:41" (1/1) ... [2024-10-12 16:16:41,732 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:16:41" (1/1) ... [2024-10-12 16:16:41,895 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1760 [2024-10-12 16:16:41,896 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 16:16:41,897 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 16:16:41,897 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 16:16:41,897 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 16:16:41,905 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:16:41" (1/1) ... [2024-10-12 16:16:41,905 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:16:41" (1/1) ... [2024-10-12 16:16:41,925 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:16:41" (1/1) ... [2024-10-12 16:16:42,010 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-12 16:16:42,011 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:16:41" (1/1) ... [2024-10-12 16:16:42,011 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:16:41" (1/1) ... [2024-10-12 16:16:42,078 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:16:41" (1/1) ... [2024-10-12 16:16:42,090 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:16:41" (1/1) ... [2024-10-12 16:16:42,107 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:16:41" (1/1) ... [2024-10-12 16:16:42,115 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:16:41" (1/1) ... [2024-10-12 16:16:42,139 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 16:16:42,140 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 16:16:42,141 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 16:16:42,141 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 16:16:42,142 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:16:41" (1/1) ... [2024-10-12 16:16:42,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 16:16:42,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 16:16:42,172 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-12 16:16:42,174 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-12 16:16:42,207 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 16:16:42,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 16:16:42,207 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 16:16:42,207 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 16:16:42,259 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 16:16:42,260 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 16:16:43,928 INFO L? ?]: Removed 246 outVars from TransFormulas that were not future-live. [2024-10-12 16:16:43,928 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 16:16:43,974 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 16:16:43,977 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-12 16:16:43,977 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 04:16:43 BoogieIcfgContainer [2024-10-12 16:16:43,977 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 16:16:43,979 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 16:16:43,979 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 16:16:43,982 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 16:16:43,982 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 04:16:41" (1/3) ... [2024-10-12 16:16:43,983 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@256179df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 04:16:43, skipping insertion in model container [2024-10-12 16:16:43,983 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:16:41" (2/3) ... [2024-10-12 16:16:43,983 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@256179df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 04:16:43, skipping insertion in model container [2024-10-12 16:16:43,983 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 04:16:43" (3/3) ... [2024-10-12 16:16:43,984 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem15_label00.c [2024-10-12 16:16:43,996 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 16:16:43,996 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-12 16:16:44,049 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 16:16:44,053 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;@4f4483af, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 16:16:44,053 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-12 16:16:44,059 INFO L276 IsEmpty]: Start isEmpty. Operand has 362 states, 360 states have (on average 1.9111111111111112) internal successors, (688), 361 states have internal predecessors, (688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:16:44,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-10-12 16:16:44,063 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:16:44,063 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-10-12 16:16:44,064 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:16:44,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:16:44,068 INFO L85 PathProgramCache]: Analyzing trace with hash 1781815696, now seen corresponding path program 1 times [2024-10-12 16:16:44,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:16:44,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353090751] [2024-10-12 16:16:44,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:16:44,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:16:44,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:16:44,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 16:16:44,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:16:44,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353090751] [2024-10-12 16:16:44,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [353090751] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:16:44,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:16:44,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 16:16:44,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52891135] [2024-10-12 16:16:44,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:16:44,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:16:44,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:16:44,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:16:44,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:16:44,269 INFO L87 Difference]: Start difference. First operand has 362 states, 360 states have (on average 1.9111111111111112) internal successors, (688), 361 states have internal predecessors, (688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:16:45,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:16:45,878 INFO L93 Difference]: Finished difference Result 1029 states and 1981 transitions. [2024-10-12 16:16:45,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:16:45,880 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 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 5 [2024-10-12 16:16:45,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:16:45,891 INFO L225 Difference]: With dead ends: 1029 [2024-10-12 16:16:45,891 INFO L226 Difference]: Without dead ends: 664 [2024-10-12 16:16:45,895 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-12 16:16:45,897 INFO L432 NwaCegarLoop]: 271 mSDtfsCounter, 313 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 918 mSolverCounterSat, 195 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 313 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 1113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 195 IncrementalHoareTripleChecker+Valid, 918 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-12 16:16:45,897 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [313 Valid, 318 Invalid, 1113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [195 Valid, 918 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-12 16:16:45,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 664 states. [2024-10-12 16:16:45,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 664 to 662. [2024-10-12 16:16:45,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 662 states, 661 states have (on average 1.4826021180030258) internal successors, (980), 661 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:16:45,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 980 transitions. [2024-10-12 16:16:45,965 INFO L78 Accepts]: Start accepts. Automaton has 662 states and 980 transitions. Word has length 5 [2024-10-12 16:16:45,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:16:45,965 INFO L471 AbstractCegarLoop]: Abstraction has 662 states and 980 transitions. [2024-10-12 16:16:45,966 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:16:45,966 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 980 transitions. [2024-10-12 16:16:45,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-10-12 16:16:45,967 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:16:45,967 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-12 16:16:45,968 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 16:16:45,968 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:16:45,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:16:45,968 INFO L85 PathProgramCache]: Analyzing trace with hash -1239293441, now seen corresponding path program 1 times [2024-10-12 16:16:45,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:16:45,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919782844] [2024-10-12 16:16:45,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:16:45,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:16:46,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:16:46,295 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 16:16:46,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:16:46,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919782844] [2024-10-12 16:16:46,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919782844] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:16:46,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:16:46,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 16:16:46,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308124586] [2024-10-12 16:16:46,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:16:46,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:16:46,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:16:46,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:16:46,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:16:46,302 INFO L87 Difference]: Start difference. First operand 662 states and 980 transitions. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 2 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:16:47,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:16:47,286 INFO L93 Difference]: Finished difference Result 1623 states and 2314 transitions. [2024-10-12 16:16:47,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:16:47,287 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 2 states have internal predecessors, (70), 0 states have call successors, (0), 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 70 [2024-10-12 16:16:47,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:16:47,291 INFO L225 Difference]: With dead ends: 1623 [2024-10-12 16:16:47,291 INFO L226 Difference]: Without dead ends: 962 [2024-10-12 16:16:47,292 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-12 16:16:47,293 INFO L432 NwaCegarLoop]: 297 mSDtfsCounter, 237 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 911 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 935 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 911 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-12 16:16:47,293 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 335 Invalid, 935 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 911 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-12 16:16:47,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 962 states. [2024-10-12 16:16:47,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 962 to 962. [2024-10-12 16:16:47,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 962 states, 961 states have (on average 1.3631633714880333) internal successors, (1310), 961 states have internal predecessors, (1310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:16:47,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 962 states to 962 states and 1310 transitions. [2024-10-12 16:16:47,310 INFO L78 Accepts]: Start accepts. Automaton has 962 states and 1310 transitions. Word has length 70 [2024-10-12 16:16:47,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:16:47,310 INFO L471 AbstractCegarLoop]: Abstraction has 962 states and 1310 transitions. [2024-10-12 16:16:47,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 2 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:16:47,311 INFO L276 IsEmpty]: Start isEmpty. Operand 962 states and 1310 transitions. [2024-10-12 16:16:47,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-10-12 16:16:47,312 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:16:47,313 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 16:16:47,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 16:16:47,313 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:16:47,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:16:47,313 INFO L85 PathProgramCache]: Analyzing trace with hash 1955604122, now seen corresponding path program 1 times [2024-10-12 16:16:47,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:16:47,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161011522] [2024-10-12 16:16:47,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:16:47,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:16:47,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:16:47,403 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 16:16:47,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:16:47,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161011522] [2024-10-12 16:16:47,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1161011522] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:16:47,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:16:47,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 16:16:47,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834459870] [2024-10-12 16:16:47,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:16:47,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:16:47,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:16:47,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:16:47,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:16:47,405 INFO L87 Difference]: Start difference. First operand 962 states and 1310 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 2 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:16:48,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:16:48,493 INFO L93 Difference]: Finished difference Result 2228 states and 3185 transitions. [2024-10-12 16:16:48,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:16:48,493 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 2 states have internal predecessors, (75), 0 states have call successors, (0), 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 75 [2024-10-12 16:16:48,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:16:48,497 INFO L225 Difference]: With dead ends: 2228 [2024-10-12 16:16:48,497 INFO L226 Difference]: Without dead ends: 1566 [2024-10-12 16:16:48,498 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-12 16:16:48,499 INFO L432 NwaCegarLoop]: 276 mSDtfsCounter, 258 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 840 mSolverCounterSat, 285 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 258 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 1125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 285 IncrementalHoareTripleChecker+Valid, 840 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-12 16:16:48,501 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [258 Valid, 314 Invalid, 1125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [285 Valid, 840 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-12 16:16:48,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1566 states. [2024-10-12 16:16:48,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1566 to 1265. [2024-10-12 16:16:48,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1265 states, 1264 states have (on average 1.3053797468354431) internal successors, (1650), 1264 states have internal predecessors, (1650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:16:48,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1265 states to 1265 states and 1650 transitions. [2024-10-12 16:16:48,523 INFO L78 Accepts]: Start accepts. Automaton has 1265 states and 1650 transitions. Word has length 75 [2024-10-12 16:16:48,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:16:48,524 INFO L471 AbstractCegarLoop]: Abstraction has 1265 states and 1650 transitions. [2024-10-12 16:16:48,525 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 2 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:16:48,525 INFO L276 IsEmpty]: Start isEmpty. Operand 1265 states and 1650 transitions. [2024-10-12 16:16:48,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-10-12 16:16:48,529 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:16:48,529 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-12 16:16:48,529 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-12 16:16:48,529 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:16:48,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:16:48,530 INFO L85 PathProgramCache]: Analyzing trace with hash -1446418672, now seen corresponding path program 1 times [2024-10-12 16:16:48,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:16:48,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030212216] [2024-10-12 16:16:48,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:16:48,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:16:48,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:16:48,655 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 16:16:48,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:16:48,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030212216] [2024-10-12 16:16:48,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1030212216] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:16:48,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:16:48,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:16:48,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900280990] [2024-10-12 16:16:48,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:16:48,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 16:16:48,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:16:48,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 16:16:48,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-12 16:16:48,659 INFO L87 Difference]: Start difference. First operand 1265 states and 1650 transitions. Second operand has 4 states, 4 states have (on average 24.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:16:50,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:16:50,820 INFO L93 Difference]: Finished difference Result 4669 states and 6173 transitions. [2024-10-12 16:16:50,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 16:16:50,821 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 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 96 [2024-10-12 16:16:50,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:16:50,829 INFO L225 Difference]: With dead ends: 4669 [2024-10-12 16:16:50,829 INFO L226 Difference]: Without dead ends: 3405 [2024-10-12 16:16:50,830 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-12 16:16:50,831 INFO L432 NwaCegarLoop]: 288 mSDtfsCounter, 557 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 2279 mSolverCounterSat, 269 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 557 SdHoareTripleChecker+Valid, 373 SdHoareTripleChecker+Invalid, 2548 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 269 IncrementalHoareTripleChecker+Valid, 2279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-10-12 16:16:50,831 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [557 Valid, 373 Invalid, 2548 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [269 Valid, 2279 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-10-12 16:16:50,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3405 states. [2024-10-12 16:16:50,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3405 to 3380. [2024-10-12 16:16:50,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3380 states, 3379 states have (on average 1.237348327907665) internal successors, (4181), 3379 states have internal predecessors, (4181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:16:50,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3380 states to 3380 states and 4181 transitions. [2024-10-12 16:16:50,867 INFO L78 Accepts]: Start accepts. Automaton has 3380 states and 4181 transitions. Word has length 96 [2024-10-12 16:16:50,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:16:50,868 INFO L471 AbstractCegarLoop]: Abstraction has 3380 states and 4181 transitions. [2024-10-12 16:16:50,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:16:50,868 INFO L276 IsEmpty]: Start isEmpty. Operand 3380 states and 4181 transitions. [2024-10-12 16:16:50,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-12 16:16:50,870 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:16:50,870 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 16:16:50,870 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-12 16:16:50,870 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:16:50,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:16:50,871 INFO L85 PathProgramCache]: Analyzing trace with hash -115110364, now seen corresponding path program 1 times [2024-10-12 16:16:50,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:16:50,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182128863] [2024-10-12 16:16:50,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:16:50,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:16:50,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:16:51,005 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2024-10-12 16:16:51,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:16:51,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182128863] [2024-10-12 16:16:51,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1182128863] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:16:51,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:16:51,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 16:16:51,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602417902] [2024-10-12 16:16:51,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:16:51,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:16:51,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:16:51,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:16:51,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:16:51,011 INFO L87 Difference]: Start difference. First operand 3380 states and 4181 transitions. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 2 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:16:51,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:16:51,964 INFO L93 Difference]: Finished difference Result 8562 states and 10759 transitions. [2024-10-12 16:16:51,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:16:51,964 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 2 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 162 [2024-10-12 16:16:51,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:16:51,975 INFO L225 Difference]: With dead ends: 8562 [2024-10-12 16:16:51,975 INFO L226 Difference]: Without dead ends: 5482 [2024-10-12 16:16:51,978 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-12 16:16:51,981 INFO L432 NwaCegarLoop]: 268 mSDtfsCounter, 257 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 792 mSolverCounterSat, 298 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 1090 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 298 IncrementalHoareTripleChecker+Valid, 792 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-12 16:16:51,982 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 335 Invalid, 1090 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [298 Valid, 792 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-12 16:16:51,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5482 states. [2024-10-12 16:16:52,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5482 to 5477. [2024-10-12 16:16:52,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5477 states, 5476 states have (on average 1.1694667640613587) internal successors, (6404), 5476 states have internal predecessors, (6404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:16:52,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5477 states to 5477 states and 6404 transitions. [2024-10-12 16:16:52,044 INFO L78 Accepts]: Start accepts. Automaton has 5477 states and 6404 transitions. Word has length 162 [2024-10-12 16:16:52,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:16:52,045 INFO L471 AbstractCegarLoop]: Abstraction has 5477 states and 6404 transitions. [2024-10-12 16:16:52,045 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 2 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:16:52,046 INFO L276 IsEmpty]: Start isEmpty. Operand 5477 states and 6404 transitions. [2024-10-12 16:16:52,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-10-12 16:16:52,048 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:16:52,049 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 16:16:52,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-12 16:16:52,049 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:16:52,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:16:52,049 INFO L85 PathProgramCache]: Analyzing trace with hash 1002172678, now seen corresponding path program 1 times [2024-10-12 16:16:52,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:16:52,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517909702] [2024-10-12 16:16:52,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:16:52,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:16:52,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:16:52,319 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 16:16:52,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:16:52,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517909702] [2024-10-12 16:16:52,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517909702] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:16:52,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:16:52,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 16:16:52,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854160120] [2024-10-12 16:16:52,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:16:52,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:16:52,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:16:52,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:16:52,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:16:52,321 INFO L87 Difference]: Start difference. First operand 5477 states and 6404 transitions. Second operand has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 2 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:16:53,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:16:53,192 INFO L93 Difference]: Finished difference Result 10654 states and 12496 transitions. [2024-10-12 16:16:53,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:16:53,193 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 2 states have internal predecessors, (163), 0 states have call successors, (0), 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 163 [2024-10-12 16:16:53,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:16:53,204 INFO L225 Difference]: With dead ends: 10654 [2024-10-12 16:16:53,205 INFO L226 Difference]: Without dead ends: 5477 [2024-10-12 16:16:53,209 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-12 16:16:53,211 INFO L432 NwaCegarLoop]: 322 mSDtfsCounter, 143 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 889 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 894 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 889 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-12 16:16:53,212 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 357 Invalid, 894 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 889 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-12 16:16:53,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5477 states. [2024-10-12 16:16:53,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5477 to 5477. [2024-10-12 16:16:53,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5477 states, 5476 states have (on average 1.1683710737764792) internal successors, (6398), 5476 states have internal predecessors, (6398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:16:53,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5477 states to 5477 states and 6398 transitions. [2024-10-12 16:16:53,267 INFO L78 Accepts]: Start accepts. Automaton has 5477 states and 6398 transitions. Word has length 163 [2024-10-12 16:16:53,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:16:53,267 INFO L471 AbstractCegarLoop]: Abstraction has 5477 states and 6398 transitions. [2024-10-12 16:16:53,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 2 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:16:53,268 INFO L276 IsEmpty]: Start isEmpty. Operand 5477 states and 6398 transitions. [2024-10-12 16:16:53,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2024-10-12 16:16:53,269 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:16:53,269 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 16:16:53,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-12 16:16:53,269 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:16:53,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:16:53,270 INFO L85 PathProgramCache]: Analyzing trace with hash -1012938695, now seen corresponding path program 1 times [2024-10-12 16:16:53,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:16:53,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072972513] [2024-10-12 16:16:53,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:16:53,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:16:53,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:16:53,422 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 16:16:53,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:16:53,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072972513] [2024-10-12 16:16:53,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072972513] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:16:53,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:16:53,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:16:53,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522886580] [2024-10-12 16:16:53,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:16:53,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 16:16:53,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:16:53,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 16:16:53,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-12 16:16:53,424 INFO L87 Difference]: Start difference. First operand 5477 states and 6398 transitions. Second operand has 4 states, 4 states have (on average 45.25) internal successors, (181), 3 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:16:55,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:16:55,306 INFO L93 Difference]: Finished difference Result 12183 states and 14318 transitions. [2024-10-12 16:16:55,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 16:16:55,306 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 45.25) internal successors, (181), 3 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 181 [2024-10-12 16:16:55,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:16:55,320 INFO L225 Difference]: With dead ends: 12183 [2024-10-12 16:16:55,320 INFO L226 Difference]: Without dead ends: 7006 [2024-10-12 16:16:55,324 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-12 16:16:55,326 INFO L432 NwaCegarLoop]: 299 mSDtfsCounter, 478 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 1966 mSolverCounterSat, 207 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 478 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 2173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 207 IncrementalHoareTripleChecker+Valid, 1966 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-12 16:16:55,327 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [478 Valid, 352 Invalid, 2173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [207 Valid, 1966 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-10-12 16:16:55,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7006 states. [2024-10-12 16:16:55,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7006 to 5785. [2024-10-12 16:16:55,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5785 states, 5784 states have (on average 1.1799792531120332) internal successors, (6825), 5784 states have internal predecessors, (6825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:16:55,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5785 states to 5785 states and 6825 transitions. [2024-10-12 16:16:55,390 INFO L78 Accepts]: Start accepts. Automaton has 5785 states and 6825 transitions. Word has length 181 [2024-10-12 16:16:55,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:16:55,391 INFO L471 AbstractCegarLoop]: Abstraction has 5785 states and 6825 transitions. [2024-10-12 16:16:55,391 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 45.25) internal successors, (181), 3 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:16:55,391 INFO L276 IsEmpty]: Start isEmpty. Operand 5785 states and 6825 transitions. [2024-10-12 16:16:55,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2024-10-12 16:16:55,392 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:16:55,393 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 16:16:55,393 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-12 16:16:55,393 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:16:55,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:16:55,393 INFO L85 PathProgramCache]: Analyzing trace with hash -1877061572, now seen corresponding path program 1 times [2024-10-12 16:16:55,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:16:55,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715364052] [2024-10-12 16:16:55,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:16:55,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:16:55,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:16:55,689 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 16:16:55,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:16:55,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715364052] [2024-10-12 16:16:55,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715364052] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:16:55,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:16:55,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:16:55,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511822903] [2024-10-12 16:16:55,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:16:55,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 16:16:55,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:16:55,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 16:16:55,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-12 16:16:55,692 INFO L87 Difference]: Start difference. First operand 5785 states and 6825 transitions. Second operand has 4 states, 4 states have (on average 59.5) 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-12 16:16:58,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:16:58,079 INFO L93 Difference]: Finished difference Result 13093 states and 15498 transitions. [2024-10-12 16:16:58,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 16:16:58,079 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 59.5) 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 238 [2024-10-12 16:16:58,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:16:58,093 INFO L225 Difference]: With dead ends: 13093 [2024-10-12 16:16:58,093 INFO L226 Difference]: Without dead ends: 7608 [2024-10-12 16:16:58,097 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-12 16:16:58,097 INFO L432 NwaCegarLoop]: 308 mSDtfsCounter, 419 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 2240 mSolverCounterSat, 164 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 419 SdHoareTripleChecker+Valid, 391 SdHoareTripleChecker+Invalid, 2404 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 164 IncrementalHoareTripleChecker+Valid, 2240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-10-12 16:16:58,098 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [419 Valid, 391 Invalid, 2404 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [164 Valid, 2240 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-10-12 16:16:58,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7608 states. [2024-10-12 16:16:58,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7608 to 6085. [2024-10-12 16:16:58,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6085 states, 6084 states have (on average 1.1750493096646943) internal successors, (7149), 6084 states have internal predecessors, (7149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:16:58,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6085 states to 6085 states and 7149 transitions. [2024-10-12 16:16:58,156 INFO L78 Accepts]: Start accepts. Automaton has 6085 states and 7149 transitions. Word has length 238 [2024-10-12 16:16:58,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:16:58,157 INFO L471 AbstractCegarLoop]: Abstraction has 6085 states and 7149 transitions. [2024-10-12 16:16:58,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 59.5) 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-12 16:16:58,157 INFO L276 IsEmpty]: Start isEmpty. Operand 6085 states and 7149 transitions. [2024-10-12 16:16:58,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2024-10-12 16:16:58,159 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:16:58,159 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 16:16:58,160 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-12 16:16:58,160 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:16:58,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:16:58,160 INFO L85 PathProgramCache]: Analyzing trace with hash -1899765632, now seen corresponding path program 1 times [2024-10-12 16:16:58,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:16:58,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661887831] [2024-10-12 16:16:58,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:16:58,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:16:58,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:16:58,333 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2024-10-12 16:16:58,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:16:58,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661887831] [2024-10-12 16:16:58,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [661887831] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:16:58,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:16:58,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:16:58,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282847333] [2024-10-12 16:16:58,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:16:58,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:16:58,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:16:58,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:16:58,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:16:58,334 INFO L87 Difference]: Start difference. First operand 6085 states and 7149 transitions. Second operand has 3 states, 3 states have (on average 67.66666666666667) internal successors, (203), 3 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:16:59,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:16:59,671 INFO L93 Difference]: Finished difference Result 14272 states and 17119 transitions. [2024-10-12 16:16:59,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:16:59,672 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 67.66666666666667) internal successors, (203), 3 states have internal predecessors, (203), 0 states have call successors, (0), 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 292 [2024-10-12 16:16:59,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:16:59,683 INFO L225 Difference]: With dead ends: 14272 [2024-10-12 16:16:59,683 INFO L226 Difference]: Without dead ends: 8487 [2024-10-12 16:16:59,687 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:16:59,688 INFO L432 NwaCegarLoop]: 630 mSDtfsCounter, 310 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 916 mSolverCounterSat, 237 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 310 SdHoareTripleChecker+Valid, 668 SdHoareTripleChecker+Invalid, 1153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 237 IncrementalHoareTripleChecker+Valid, 916 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-12 16:16:59,688 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [310 Valid, 668 Invalid, 1153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [237 Valid, 916 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-12 16:16:59,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8487 states. [2024-10-12 16:16:59,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8487 to 8483. [2024-10-12 16:16:59,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8483 states, 8482 states have (on average 1.1478424899787787) internal successors, (9736), 8482 states have internal predecessors, (9736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:16:59,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8483 states to 8483 states and 9736 transitions. [2024-10-12 16:16:59,790 INFO L78 Accepts]: Start accepts. Automaton has 8483 states and 9736 transitions. Word has length 292 [2024-10-12 16:16:59,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:16:59,790 INFO L471 AbstractCegarLoop]: Abstraction has 8483 states and 9736 transitions. [2024-10-12 16:16:59,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 67.66666666666667) internal successors, (203), 3 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:16:59,791 INFO L276 IsEmpty]: Start isEmpty. Operand 8483 states and 9736 transitions. [2024-10-12 16:16:59,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 352 [2024-10-12 16:16:59,794 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:16:59,794 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 16:16:59,794 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-12 16:16:59,794 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:16:59,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:16:59,795 INFO L85 PathProgramCache]: Analyzing trace with hash 586879821, now seen corresponding path program 1 times [2024-10-12 16:16:59,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:16:59,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649163954] [2024-10-12 16:16:59,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:16:59,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:16:59,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:16:59,979 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2024-10-12 16:16:59,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:16:59,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649163954] [2024-10-12 16:16:59,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649163954] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:16:59,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:16:59,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:16:59,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905665130] [2024-10-12 16:16:59,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:16:59,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:16:59,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:16:59,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:16:59,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:16:59,981 INFO L87 Difference]: Start difference. First operand 8483 states and 9736 transitions. Second operand has 3 states, 3 states have (on average 92.33333333333333) internal successors, (277), 3 states have internal predecessors, (277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:17:01,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:17:01,348 INFO L93 Difference]: Finished difference Result 19662 states and 22940 transitions. [2024-10-12 16:17:01,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:17:01,348 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 92.33333333333333) internal successors, (277), 3 states have internal predecessors, (277), 0 states have call successors, (0), 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 351 [2024-10-12 16:17:01,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:17:01,359 INFO L225 Difference]: With dead ends: 19662 [2024-10-12 16:17:01,360 INFO L226 Difference]: Without dead ends: 11479 [2024-10-12 16:17:01,364 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:17:01,365 INFO L432 NwaCegarLoop]: 596 mSDtfsCounter, 321 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 896 mSolverCounterSat, 226 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 321 SdHoareTripleChecker+Valid, 632 SdHoareTripleChecker+Invalid, 1122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 226 IncrementalHoareTripleChecker+Valid, 896 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-12 16:17:01,366 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [321 Valid, 632 Invalid, 1122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [226 Valid, 896 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-12 16:17:01,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11479 states. [2024-10-12 16:17:01,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11479 to 10582. [2024-10-12 16:17:01,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10582 states, 10581 states have (on average 1.1332577261128438) internal successors, (11991), 10581 states have internal predecessors, (11991), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:17:01,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10582 states to 10582 states and 11991 transitions. [2024-10-12 16:17:01,440 INFO L78 Accepts]: Start accepts. Automaton has 10582 states and 11991 transitions. Word has length 351 [2024-10-12 16:17:01,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:17:01,441 INFO L471 AbstractCegarLoop]: Abstraction has 10582 states and 11991 transitions. [2024-10-12 16:17:01,441 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 92.33333333333333) internal successors, (277), 3 states have internal predecessors, (277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:17:01,441 INFO L276 IsEmpty]: Start isEmpty. Operand 10582 states and 11991 transitions. [2024-10-12 16:17:01,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2024-10-12 16:17:01,444 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:17:01,445 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 16:17:01,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-12 16:17:01,445 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:17:01,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:17:01,446 INFO L85 PathProgramCache]: Analyzing trace with hash -746149381, now seen corresponding path program 1 times [2024-10-12 16:17:01,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:17:01,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465404951] [2024-10-12 16:17:01,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:17:01,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:17:01,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:17:02,082 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 7 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 16:17:02,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:17:02,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465404951] [2024-10-12 16:17:02,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465404951] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 16:17:02,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1582731954] [2024-10-12 16:17:02,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:17:02,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 16:17:02,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 16:17:02,085 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 16:17:02,089 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-12 16:17:02,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:17:02,207 INFO L255 TraceCheckSpWp]: Trace formula consists of 442 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-12 16:17:02,216 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 16:17:03,246 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 7 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 16:17:03,247 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 16:17:06,255 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 16:17:06,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1582731954] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-12 16:17:06,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-10-12 16:17:06,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 8 [2024-10-12 16:17:06,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220804874] [2024-10-12 16:17:06,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:17:06,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 16:17:06,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:17:06,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 16:17:06,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2024-10-12 16:17:06,257 INFO L87 Difference]: Start difference. First operand 10582 states and 11991 transitions. Second operand has 5 states, 5 states have (on average 70.4) internal successors, (352), 4 states have internal predecessors, (352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:17:09,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:17:09,604 INFO L93 Difference]: Finished difference Result 26293 states and 30186 transitions. [2024-10-12 16:17:09,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 16:17:09,604 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 70.4) internal successors, (352), 4 states have internal predecessors, (352), 0 states have call successors, (0), 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 352 [2024-10-12 16:17:09,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:17:09,621 INFO L225 Difference]: With dead ends: 26293 [2024-10-12 16:17:09,621 INFO L226 Difference]: Without dead ends: 16011 [2024-10-12 16:17:09,628 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 706 GetRequests, 698 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2024-10-12 16:17:09,629 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 683 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 2215 mSolverCounterSat, 1035 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 683 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 3250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1035 IncrementalHoareTripleChecker+Valid, 2215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-10-12 16:17:09,629 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [683 Valid, 114 Invalid, 3250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1035 Valid, 2215 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-10-12 16:17:09,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16011 states. [2024-10-12 16:17:09,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16011 to 11483. [2024-10-12 16:17:09,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11483 states, 11482 states have (on average 1.1698310398885212) internal successors, (13432), 11482 states have internal predecessors, (13432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:17:09,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11483 states to 11483 states and 13432 transitions. [2024-10-12 16:17:09,731 INFO L78 Accepts]: Start accepts. Automaton has 11483 states and 13432 transitions. Word has length 352 [2024-10-12 16:17:09,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:17:09,732 INFO L471 AbstractCegarLoop]: Abstraction has 11483 states and 13432 transitions. [2024-10-12 16:17:09,732 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 70.4) internal successors, (352), 4 states have internal predecessors, (352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:17:09,732 INFO L276 IsEmpty]: Start isEmpty. Operand 11483 states and 13432 transitions. [2024-10-12 16:17:09,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 369 [2024-10-12 16:17:09,733 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:17:09,734 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 16:17:09,747 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-12 16:17:09,938 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-10-12 16:17:09,939 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:17:09,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:17:09,940 INFO L85 PathProgramCache]: Analyzing trace with hash -253465236, now seen corresponding path program 1 times [2024-10-12 16:17:09,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:17:09,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68608404] [2024-10-12 16:17:09,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:17:09,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:17:09,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:17:10,153 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 16:17:10,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:17:10,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68608404] [2024-10-12 16:17:10,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68608404] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:17:10,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:17:10,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:17:10,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607629068] [2024-10-12 16:17:10,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:17:10,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:17:10,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:17:10,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:17:10,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:17:10,155 INFO L87 Difference]: Start difference. First operand 11483 states and 13432 transitions. Second operand has 3 states, 3 states have (on average 122.66666666666667) internal successors, (368), 3 states have internal predecessors, (368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:17:11,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:17:11,838 INFO L93 Difference]: Finished difference Result 25665 states and 30680 transitions. [2024-10-12 16:17:11,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:17:11,839 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 122.66666666666667) internal successors, (368), 3 states have internal predecessors, (368), 0 states have call successors, (0), 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 368 [2024-10-12 16:17:11,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:17:11,851 INFO L225 Difference]: With dead ends: 25665 [2024-10-12 16:17:11,851 INFO L226 Difference]: Without dead ends: 14482 [2024-10-12 16:17:11,859 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:17:11,861 INFO L432 NwaCegarLoop]: 583 mSDtfsCounter, 246 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 920 mSolverCounterSat, 217 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 620 SdHoareTripleChecker+Invalid, 1137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 217 IncrementalHoareTripleChecker+Valid, 920 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-12 16:17:11,861 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 620 Invalid, 1137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [217 Valid, 920 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-12 16:17:11,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14482 states. [2024-10-12 16:17:11,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14482 to 13577. [2024-10-12 16:17:11,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13577 states, 13576 states have (on average 1.1612404242781378) internal successors, (15765), 13576 states have internal predecessors, (15765), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:17:11,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13577 states to 13577 states and 15765 transitions. [2024-10-12 16:17:11,973 INFO L78 Accepts]: Start accepts. Automaton has 13577 states and 15765 transitions. Word has length 368 [2024-10-12 16:17:11,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:17:11,975 INFO L471 AbstractCegarLoop]: Abstraction has 13577 states and 15765 transitions. [2024-10-12 16:17:11,975 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 122.66666666666667) internal successors, (368), 3 states have internal predecessors, (368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:17:11,975 INFO L276 IsEmpty]: Start isEmpty. Operand 13577 states and 15765 transitions. [2024-10-12 16:17:11,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 415 [2024-10-12 16:17:11,977 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:17:11,977 INFO L215 NwaCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 16:17:11,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-12 16:17:11,978 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:17:11,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:17:11,978 INFO L85 PathProgramCache]: Analyzing trace with hash -675376714, now seen corresponding path program 1 times [2024-10-12 16:17:11,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:17:11,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171558400] [2024-10-12 16:17:11,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:17:11,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:17:12,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:17:12,141 INFO L134 CoverageAnalysis]: Checked inductivity of 311 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2024-10-12 16:17:12,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:17:12,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171558400] [2024-10-12 16:17:12,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171558400] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:17:12,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:17:12,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:17:12,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236315471] [2024-10-12 16:17:12,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:17:12,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:17:12,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:17:12,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:17:12,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:17:12,143 INFO L87 Difference]: Start difference. First operand 13577 states and 15765 transitions. Second operand has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 3 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:17:13,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:17:13,304 INFO L93 Difference]: Finished difference Result 34646 states and 40387 transitions. [2024-10-12 16:17:13,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:17:13,305 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 3 states have internal predecessors, (206), 0 states have call successors, (0), 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 414 [2024-10-12 16:17:13,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:17:13,327 INFO L225 Difference]: With dead ends: 34646 [2024-10-12 16:17:13,327 INFO L226 Difference]: Without dead ends: 21369 [2024-10-12 16:17:13,338 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:17:13,339 INFO L432 NwaCegarLoop]: 587 mSDtfsCounter, 321 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 1042 mSolverCounterSat, 170 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 321 SdHoareTripleChecker+Valid, 619 SdHoareTripleChecker+Invalid, 1212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 170 IncrementalHoareTripleChecker+Valid, 1042 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-12 16:17:13,339 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [321 Valid, 619 Invalid, 1212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [170 Valid, 1042 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-12 16:17:13,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21369 states. [2024-10-12 16:17:13,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21369 to 21055. [2024-10-12 16:17:13,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21055 states, 21054 states have (on average 1.1328963617364871) internal successors, (23852), 21054 states have internal predecessors, (23852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:17:13,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21055 states to 21055 states and 23852 transitions. [2024-10-12 16:17:13,534 INFO L78 Accepts]: Start accepts. Automaton has 21055 states and 23852 transitions. Word has length 414 [2024-10-12 16:17:13,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:17:13,534 INFO L471 AbstractCegarLoop]: Abstraction has 21055 states and 23852 transitions. [2024-10-12 16:17:13,534 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 3 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:17:13,534 INFO L276 IsEmpty]: Start isEmpty. Operand 21055 states and 23852 transitions. [2024-10-12 16:17:13,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 460 [2024-10-12 16:17:13,537 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:17:13,537 INFO L215 NwaCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 16:17:13,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-12 16:17:13,537 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:17:13,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:17:13,538 INFO L85 PathProgramCache]: Analyzing trace with hash 1037854379, now seen corresponding path program 1 times [2024-10-12 16:17:13,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:17:13,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105785031] [2024-10-12 16:17:13,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:17:13,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:17:13,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:17:14,085 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 4 proven. 266 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 16:17:14,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:17:14,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105785031] [2024-10-12 16:17:14,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [105785031] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 16:17:14,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [643096223] [2024-10-12 16:17:14,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:17:14,086 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 16:17:14,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 16:17:14,087 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 16:17:14,088 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-12 16:17:14,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:17:14,206 INFO L255 TraceCheckSpWp]: Trace formula consists of 577 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-12 16:17:14,212 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 16:17:14,636 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 4 proven. 266 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 16:17:14,636 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 16:17:15,141 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 85 proven. 185 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 16:17:15,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [643096223] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 16:17:15,141 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 16:17:15,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2024-10-12 16:17:15,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711225420] [2024-10-12 16:17:15,141 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 16:17:15,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-12 16:17:15,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:17:15,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-12 16:17:15,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2024-10-12 16:17:15,144 INFO L87 Difference]: Start difference. First operand 21055 states and 23852 transitions. Second operand has 13 states, 13 states have (on average 85.07692307692308) internal successors, (1106), 12 states have internal predecessors, (1106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:17:22,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:17:22,884 INFO L93 Difference]: Finished difference Result 85653 states and 97311 transitions. [2024-10-12 16:17:22,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-12 16:17:22,885 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 85.07692307692308) internal successors, (1106), 12 states have internal predecessors, (1106), 0 states have call successors, (0), 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 459 [2024-10-12 16:17:22,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:17:22,950 INFO L225 Difference]: With dead ends: 85653 [2024-10-12 16:17:22,950 INFO L226 Difference]: Without dead ends: 64898 [2024-10-12 16:17:22,967 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 928 GetRequests, 910 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=130, Invalid=250, Unknown=0, NotChecked=0, Total=380 [2024-10-12 16:17:22,968 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 5753 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 7594 mSolverCounterSat, 4364 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5753 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 11958 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4364 IncrementalHoareTripleChecker+Valid, 7594 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.3s IncrementalHoareTripleChecker+Time [2024-10-12 16:17:22,968 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5753 Valid, 292 Invalid, 11958 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4364 Valid, 7594 Invalid, 0 Unknown, 0 Unchecked, 7.3s Time] [2024-10-12 16:17:23,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64898 states. [2024-10-12 16:17:23,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64898 to 28248. [2024-10-12 16:17:23,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28248 states, 28247 states have (on average 1.1451835593160336) internal successors, (32348), 28247 states have internal predecessors, (32348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:17:23,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28248 states to 28248 states and 32348 transitions. [2024-10-12 16:17:23,512 INFO L78 Accepts]: Start accepts. Automaton has 28248 states and 32348 transitions. Word has length 459 [2024-10-12 16:17:23,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:17:23,513 INFO L471 AbstractCegarLoop]: Abstraction has 28248 states and 32348 transitions. [2024-10-12 16:17:23,513 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 85.07692307692308) internal successors, (1106), 12 states have internal predecessors, (1106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:17:23,513 INFO L276 IsEmpty]: Start isEmpty. Operand 28248 states and 32348 transitions. [2024-10-12 16:17:23,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 483 [2024-10-12 16:17:23,518 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:17:23,519 INFO L215 NwaCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 16:17:23,532 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-12 16:17:23,719 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-10-12 16:17:23,720 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:17:23,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:17:23,720 INFO L85 PathProgramCache]: Analyzing trace with hash 2087458615, now seen corresponding path program 1 times [2024-10-12 16:17:23,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:17:23,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532803596] [2024-10-12 16:17:23,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:17:23,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:17:23,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:17:24,478 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 83 proven. 233 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 16:17:24,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:17:24,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532803596] [2024-10-12 16:17:24,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [532803596] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 16:17:24,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1699502435] [2024-10-12 16:17:24,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:17:24,479 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 16:17:24,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 16:17:24,480 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 16:17:24,482 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-12 16:17:24,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:17:24,612 INFO L255 TraceCheckSpWp]: Trace formula consists of 597 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 16:17:24,620 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 16:17:36,527 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 210 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2024-10-12 16:17:36,527 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 16:17:36,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1699502435] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:17:36,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 16:17:36,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2024-10-12 16:17:36,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436575429] [2024-10-12 16:17:36,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:17:36,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:17:36,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:17:36,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:17:36,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-12 16:17:36,529 INFO L87 Difference]: Start difference. First operand 28248 states and 32348 transitions. Second operand has 3 states, 3 states have (on average 125.66666666666667) internal successors, (377), 3 states have internal predecessors, (377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:17:37,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:17:37,767 INFO L93 Difference]: Finished difference Result 68158 states and 78339 transitions. [2024-10-12 16:17:37,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:17:37,768 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 125.66666666666667) internal successors, (377), 3 states have internal predecessors, (377), 0 states have call successors, (0), 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 482 [2024-10-12 16:17:37,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:17:37,804 INFO L225 Difference]: With dead ends: 68158 [2024-10-12 16:17:37,805 INFO L226 Difference]: Without dead ends: 40210 [2024-10-12 16:17:37,826 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 486 GetRequests, 481 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-12 16:17:37,826 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 278 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 997 mSolverCounterSat, 183 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 1180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 183 IncrementalHoareTripleChecker+Valid, 997 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-12 16:17:37,826 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [278 Valid, 189 Invalid, 1180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [183 Valid, 997 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-12 16:17:37,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40210 states. [2024-10-12 16:17:38,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40210 to 31233. [2024-10-12 16:17:38,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31233 states, 31232 states have (on average 1.1592597336065573) internal successors, (36206), 31232 states have internal predecessors, (36206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:17:38,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31233 states to 31233 states and 36206 transitions. [2024-10-12 16:17:38,229 INFO L78 Accepts]: Start accepts. Automaton has 31233 states and 36206 transitions. Word has length 482 [2024-10-12 16:17:38,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:17:38,230 INFO L471 AbstractCegarLoop]: Abstraction has 31233 states and 36206 transitions. [2024-10-12 16:17:38,230 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 125.66666666666667) internal successors, (377), 3 states have internal predecessors, (377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:17:38,230 INFO L276 IsEmpty]: Start isEmpty. Operand 31233 states and 36206 transitions. [2024-10-12 16:17:38,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 491 [2024-10-12 16:17:38,234 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:17:38,234 INFO L215 NwaCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 16:17:38,247 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-12 16:17:38,435 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 16:17:38,435 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:17:38,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:17:38,436 INFO L85 PathProgramCache]: Analyzing trace with hash 1022333099, now seen corresponding path program 1 times [2024-10-12 16:17:38,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:17:38,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643912841] [2024-10-12 16:17:38,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:17:38,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:17:38,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:17:38,809 INFO L134 CoverageAnalysis]: Checked inductivity of 387 backedges. 344 proven. 39 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-12 16:17:38,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:17:38,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643912841] [2024-10-12 16:17:38,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1643912841] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 16:17:38,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [739079095] [2024-10-12 16:17:38,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:17:38,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 16:17:38,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 16:17:38,810 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 16:17:38,811 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-12 16:17:38,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:17:38,935 INFO L255 TraceCheckSpWp]: Trace formula consists of 602 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-12 16:17:38,939 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 16:17:39,476 INFO L134 CoverageAnalysis]: Checked inductivity of 387 backedges. 383 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-12 16:17:39,476 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 16:17:39,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [739079095] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:17:39,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 16:17:39,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-10-12 16:17:39,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780030735] [2024-10-12 16:17:39,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:17:39,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 16:17:39,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:17:39,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 16:17:39,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-10-12 16:17:39,478 INFO L87 Difference]: Start difference. First operand 31233 states and 36206 transitions. Second operand has 4 states, 4 states have (on average 121.75) internal successors, (487), 3 states have internal predecessors, (487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:17:41,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:17:41,010 INFO L93 Difference]: Finished difference Result 63962 states and 74046 transitions. [2024-10-12 16:17:41,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 16:17:41,011 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 121.75) internal successors, (487), 3 states have internal predecessors, (487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 490 [2024-10-12 16:17:41,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:17:41,041 INFO L225 Difference]: With dead ends: 63962 [2024-10-12 16:17:41,041 INFO L226 Difference]: Without dead ends: 32431 [2024-10-12 16:17:41,060 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 493 GetRequests, 488 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-10-12 16:17:41,061 INFO L432 NwaCegarLoop]: 317 mSDtfsCounter, 317 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 1505 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 317 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 1603 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 1505 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-12 16:17:41,061 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [317 Valid, 356 Invalid, 1603 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 1505 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-12 16:17:41,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32431 states. [2024-10-12 16:17:41,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32431 to 32130. [2024-10-12 16:17:41,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32130 states, 32129 states have (on average 1.1291979208814467) internal successors, (36280), 32129 states have internal predecessors, (36280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:17:41,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32130 states to 32130 states and 36280 transitions. [2024-10-12 16:17:41,484 INFO L78 Accepts]: Start accepts. Automaton has 32130 states and 36280 transitions. Word has length 490 [2024-10-12 16:17:41,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:17:41,485 INFO L471 AbstractCegarLoop]: Abstraction has 32130 states and 36280 transitions. [2024-10-12 16:17:41,485 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 121.75) internal successors, (487), 3 states have internal predecessors, (487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:17:41,485 INFO L276 IsEmpty]: Start isEmpty. Operand 32130 states and 36280 transitions. [2024-10-12 16:17:41,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 507 [2024-10-12 16:17:41,489 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:17:41,489 INFO L215 NwaCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 16:17:41,501 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-12 16:17:41,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-10-12 16:17:41,690 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:17:41,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:17:41,691 INFO L85 PathProgramCache]: Analyzing trace with hash -916863801, now seen corresponding path program 1 times [2024-10-12 16:17:41,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:17:41,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996613660] [2024-10-12 16:17:41,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:17:41,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:17:41,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:17:41,998 INFO L134 CoverageAnalysis]: Checked inductivity of 345 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 334 trivial. 0 not checked. [2024-10-12 16:17:41,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:17:41,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996613660] [2024-10-12 16:17:41,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996613660] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:17:41,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:17:41,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:17:42,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103892660] [2024-10-12 16:17:42,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:17:42,000 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:17:42,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:17:42,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:17:42,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:17:42,001 INFO L87 Difference]: Start difference. First operand 32130 states and 36280 transitions. Second operand has 3 states, 3 states have (on average 93.33333333333333) internal successors, (280), 3 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:17:43,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:17:43,196 INFO L93 Difference]: Finished difference Result 64256 states and 72587 transitions. [2024-10-12 16:17:43,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:17:43,197 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 93.33333333333333) internal successors, (280), 3 states have internal predecessors, (280), 0 states have call successors, (0), 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 506 [2024-10-12 16:17:43,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:17:43,228 INFO L225 Difference]: With dead ends: 64256 [2024-10-12 16:17:43,228 INFO L226 Difference]: Without dead ends: 32426 [2024-10-12 16:17:43,250 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:17:43,250 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 464 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 820 mSolverCounterSat, 155 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 464 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 975 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 155 IncrementalHoareTripleChecker+Valid, 820 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-12 16:17:43,251 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [464 Valid, 69 Invalid, 975 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [155 Valid, 820 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-12 16:17:43,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32426 states. [2024-10-12 16:17:43,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32426 to 32126. [2024-10-12 16:17:43,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32126 states, 32125 states have (on average 1.1291206225680934) internal successors, (36273), 32125 states have internal predecessors, (36273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:17:43,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32126 states to 32126 states and 36273 transitions. [2024-10-12 16:17:43,527 INFO L78 Accepts]: Start accepts. Automaton has 32126 states and 36273 transitions. Word has length 506 [2024-10-12 16:17:43,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:17:43,527 INFO L471 AbstractCegarLoop]: Abstraction has 32126 states and 36273 transitions. [2024-10-12 16:17:43,527 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 93.33333333333333) internal successors, (280), 3 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:17:43,527 INFO L276 IsEmpty]: Start isEmpty. Operand 32126 states and 36273 transitions. [2024-10-12 16:17:43,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 527 [2024-10-12 16:17:43,530 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:17:43,530 INFO L215 NwaCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 16:17:43,530 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-12 16:17:43,530 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:17:43,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:17:43,531 INFO L85 PathProgramCache]: Analyzing trace with hash -1484004811, now seen corresponding path program 1 times [2024-10-12 16:17:43,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:17:43,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591084564] [2024-10-12 16:17:43,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:17:43,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:17:43,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:17:43,688 INFO L134 CoverageAnalysis]: Checked inductivity of 472 backedges. 237 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2024-10-12 16:17:43,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:17:43,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591084564] [2024-10-12 16:17:43,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591084564] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:17:43,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:17:43,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:17:43,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791202443] [2024-10-12 16:17:43,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:17:43,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:17:43,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:17:43,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:17:43,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:17:43,690 INFO L87 Difference]: Start difference. First operand 32126 states and 36273 transitions. Second operand has 3 states, 3 states have (on average 119.0) internal successors, (357), 3 states have internal predecessors, (357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:17:44,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:17:44,690 INFO L93 Difference]: Finished difference Result 67839 states and 76674 transitions. [2024-10-12 16:17:44,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:17:44,691 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 119.0) internal successors, (357), 3 states have internal predecessors, (357), 0 states have call successors, (0), 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 526 [2024-10-12 16:17:44,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:17:44,722 INFO L225 Difference]: With dead ends: 67839 [2024-10-12 16:17:44,722 INFO L226 Difference]: Without dead ends: 35415 [2024-10-12 16:17:44,743 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:17:44,743 INFO L432 NwaCegarLoop]: 263 mSDtfsCounter, 242 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 740 mSolverCounterSat, 267 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 1007 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 267 IncrementalHoareTripleChecker+Valid, 740 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-12 16:17:44,743 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [242 Valid, 325 Invalid, 1007 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [267 Valid, 740 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-12 16:17:44,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35415 states. [2024-10-12 16:17:45,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35415 to 29431. [2024-10-12 16:17:45,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29431 states, 29430 states have (on average 1.1117567108392796) internal successors, (32719), 29430 states have internal predecessors, (32719), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:17:45,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29431 states to 29431 states and 32719 transitions. [2024-10-12 16:17:45,097 INFO L78 Accepts]: Start accepts. Automaton has 29431 states and 32719 transitions. Word has length 526 [2024-10-12 16:17:45,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:17:45,097 INFO L471 AbstractCegarLoop]: Abstraction has 29431 states and 32719 transitions. [2024-10-12 16:17:45,098 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 119.0) internal successors, (357), 3 states have internal predecessors, (357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:17:45,098 INFO L276 IsEmpty]: Start isEmpty. Operand 29431 states and 32719 transitions. [2024-10-12 16:17:45,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 581 [2024-10-12 16:17:45,105 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:17:45,105 INFO L215 NwaCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 16:17:45,105 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-12 16:17:45,105 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:17:45,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:17:45,106 INFO L85 PathProgramCache]: Analyzing trace with hash -191820470, now seen corresponding path program 1 times [2024-10-12 16:17:45,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:17:45,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160597352] [2024-10-12 16:17:45,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:17:45,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:17:45,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:17:45,703 INFO L134 CoverageAnalysis]: Checked inductivity of 421 backedges. 118 proven. 303 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 16:17:45,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:17:45,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160597352] [2024-10-12 16:17:45,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160597352] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 16:17:45,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [646098520] [2024-10-12 16:17:45,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:17:45,704 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 16:17:45,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 16:17:45,705 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 16:17:45,706 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-12 16:17:45,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:17:45,843 INFO L255 TraceCheckSpWp]: Trace formula consists of 696 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 16:17:45,847 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 16:17:50,723 INFO L134 CoverageAnalysis]: Checked inductivity of 421 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 410 trivial. 0 not checked. [2024-10-12 16:17:50,723 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 16:17:50,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [646098520] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:17:50,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 16:17:50,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2024-10-12 16:17:50,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463042058] [2024-10-12 16:17:50,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:17:50,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:17:50,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:17:50,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:17:50,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-12 16:17:50,725 INFO L87 Difference]: Start difference. First operand 29431 states and 32719 transitions. Second operand has 3 states, 3 states have (on average 92.66666666666667) internal successors, (278), 3 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)