./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label37.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label37.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a60dbc2f79c578f373d1608befa1a0be5fe97eed98271e53ccf8c768ad5b972e --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-10 23:29:35,139 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-10 23:29:35,210 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-10 23:29:35,217 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-10 23:29:35,217 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-10 23:29:35,248 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-10 23:29:35,249 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-10 23:29:35,249 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-10 23:29:35,251 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-10 23:29:35,252 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-10 23:29:35,252 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-10 23:29:35,253 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-10 23:29:35,254 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-10 23:29:35,254 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-10 23:29:35,256 INFO L153 SettingsManager]: * Use SBE=true [2024-10-10 23:29:35,256 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-10 23:29:35,257 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-10 23:29:35,257 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-10 23:29:35,257 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-10 23:29:35,258 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-10 23:29:35,258 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-10 23:29:35,262 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-10 23:29:35,262 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-10 23:29:35,263 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-10 23:29:35,263 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-10 23:29:35,263 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-10 23:29:35,263 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-10 23:29:35,264 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-10 23:29:35,264 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-10 23:29:35,264 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-10 23:29:35,264 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-10 23:29:35,265 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-10 23:29:35,265 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 23:29:35,265 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-10 23:29:35,266 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-10 23:29:35,266 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-10 23:29:35,266 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-10 23:29:35,266 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-10 23:29:35,266 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-10 23:29:35,267 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-10 23:29:35,267 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-10 23:29:35,269 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-10 23:29:35,269 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a60dbc2f79c578f373d1608befa1a0be5fe97eed98271e53ccf8c768ad5b972e [2024-10-10 23:29:35,521 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-10 23:29:35,545 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-10 23:29:35,548 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-10 23:29:35,549 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-10 23:29:35,549 INFO L274 PluginConnector]: CDTParser initialized [2024-10-10 23:29:35,550 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label37.c [2024-10-10 23:29:37,020 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-10 23:29:37,522 INFO L384 CDTParser]: Found 1 translation units. [2024-10-10 23:29:37,523 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label37.c [2024-10-10 23:29:37,555 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/0179968c4/f1955d9cdcbc45988940f51189a0ffc1/FLAGee611febd [2024-10-10 23:29:37,572 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/0179968c4/f1955d9cdcbc45988940f51189a0ffc1 [2024-10-10 23:29:37,574 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-10 23:29:37,576 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-10 23:29:37,578 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-10 23:29:37,579 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-10 23:29:37,584 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-10 23:29:37,585 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 11:29:37" (1/1) ... [2024-10-10 23:29:37,586 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b17df45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:29:37, skipping insertion in model container [2024-10-10 23:29:37,586 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 11:29:37" (1/1) ... [2024-10-10 23:29:37,691 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-10 23:29:37,959 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label37.c[7700,7713] [2024-10-10 23:29:38,825 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 23:29:38,838 INFO L200 MainTranslator]: Completed pre-run [2024-10-10 23:29:38,870 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label37.c[7700,7713] [2024-10-10 23:29:39,317 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 23:29:39,344 INFO L204 MainTranslator]: Completed translation [2024-10-10 23:29:39,345 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:29:39 WrapperNode [2024-10-10 23:29:39,345 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-10 23:29:39,346 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-10 23:29:39,346 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-10 23:29:39,346 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-10 23:29:39,353 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:29:39" (1/1) ... [2024-10-10 23:29:39,426 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:29:39" (1/1) ... [2024-10-10 23:29:40,076 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 5587 [2024-10-10 23:29:40,077 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-10 23:29:40,078 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-10 23:29:40,078 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-10 23:29:40,078 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-10 23:29:40,100 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:29:39" (1/1) ... [2024-10-10 23:29:40,100 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:29:39" (1/1) ... [2024-10-10 23:29:40,342 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:29:39" (1/1) ... [2024-10-10 23:29:40,593 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-10 23:29:40,594 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:29:39" (1/1) ... [2024-10-10 23:29:40,594 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:29:39" (1/1) ... [2024-10-10 23:29:40,801 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:29:39" (1/1) ... [2024-10-10 23:29:40,840 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:29:39" (1/1) ... [2024-10-10 23:29:40,904 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:29:39" (1/1) ... [2024-10-10 23:29:40,930 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:29:39" (1/1) ... [2024-10-10 23:29:40,994 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-10 23:29:40,996 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-10 23:29:40,996 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-10 23:29:40,997 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-10 23:29:40,998 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:29:39" (1/1) ... [2024-10-10 23:29:41,003 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 23:29:41,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:29:41,142 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-10 23:29:41,144 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-10 23:29:41,181 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-10 23:29:41,181 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-10 23:29:41,182 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-10 23:29:41,182 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-10 23:29:41,292 INFO L238 CfgBuilder]: Building ICFG [2024-10-10 23:29:41,294 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-10 23:29:46,745 INFO L? ?]: Removed 738 outVars from TransFormulas that were not future-live. [2024-10-10 23:29:46,745 INFO L287 CfgBuilder]: Performing block encoding [2024-10-10 23:29:46,822 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-10 23:29:46,822 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-10 23:29:46,823 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 11:29:46 BoogieIcfgContainer [2024-10-10 23:29:46,823 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-10 23:29:46,825 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-10 23:29:46,826 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-10 23:29:46,829 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-10 23:29:46,829 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.10 11:29:37" (1/3) ... [2024-10-10 23:29:46,830 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@232b4f49 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 11:29:46, skipping insertion in model container [2024-10-10 23:29:46,830 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:29:39" (2/3) ... [2024-10-10 23:29:46,830 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@232b4f49 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 11:29:46, skipping insertion in model container [2024-10-10 23:29:46,831 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 11:29:46" (3/3) ... [2024-10-10 23:29:46,832 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem13_label37.c [2024-10-10 23:29:46,849 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-10 23:29:46,849 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-10 23:29:46,947 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-10 23:29:46,953 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;@74f83d15, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-10 23:29:46,954 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-10 23:29:46,963 INFO L276 IsEmpty]: Start isEmpty. Operand has 1036 states, 1034 states have (on average 1.877176015473888) internal successors, (1941), 1035 states have internal predecessors, (1941), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:29:46,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-10-10 23:29:46,971 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:29:46,973 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:29:46,974 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:29:46,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:29:46,979 INFO L85 PathProgramCache]: Analyzing trace with hash 837721711, now seen corresponding path program 1 times [2024-10-10 23:29:46,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:29:46,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055401698] [2024-10-10 23:29:46,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:29:46,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:29:47,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:29:47,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:29:47,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:29:47,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055401698] [2024-10-10 23:29:47,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2055401698] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:29:47,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:29:47,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:29:47,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873659609] [2024-10-10 23:29:47,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:29:47,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-10 23:29:47,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:29:47,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-10 23:29:47,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-10 23:29:47,219 INFO L87 Difference]: Start difference. First operand has 1036 states, 1034 states have (on average 1.877176015473888) internal successors, (1941), 1035 states have internal predecessors, (1941), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:29:47,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:29:47,319 INFO L93 Difference]: Finished difference Result 2071 states and 3881 transitions. [2024-10-10 23:29:47,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-10 23:29:47,326 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 0 states have call successors, (0), 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 53 [2024-10-10 23:29:47,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:29:47,345 INFO L225 Difference]: With dead ends: 2071 [2024-10-10 23:29:47,345 INFO L226 Difference]: Without dead ends: 1034 [2024-10-10 23:29:47,353 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-10 23:29:47,356 INFO L432 NwaCegarLoop]: 1876 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1876 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 23:29:47,357 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1876 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 23:29:47,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1034 states. [2024-10-10 23:29:47,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1034 to 1034. [2024-10-10 23:29:47,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1034 states, 1033 states have (on average 1.8160696999031947) internal successors, (1876), 1033 states have internal predecessors, (1876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:29:47,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1034 states to 1034 states and 1876 transitions. [2024-10-10 23:29:47,452 INFO L78 Accepts]: Start accepts. Automaton has 1034 states and 1876 transitions. Word has length 53 [2024-10-10 23:29:47,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:29:47,453 INFO L471 AbstractCegarLoop]: Abstraction has 1034 states and 1876 transitions. [2024-10-10 23:29:47,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:29:47,453 INFO L276 IsEmpty]: Start isEmpty. Operand 1034 states and 1876 transitions. [2024-10-10 23:29:47,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-10-10 23:29:47,454 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:29:47,454 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:29:47,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-10 23:29:47,456 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:29:47,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:29:47,456 INFO L85 PathProgramCache]: Analyzing trace with hash -1468642349, now seen corresponding path program 1 times [2024-10-10 23:29:47,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:29:47,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452147302] [2024-10-10 23:29:47,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:29:47,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:29:47,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:29:47,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:29:47,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:29:47,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452147302] [2024-10-10 23:29:47,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [452147302] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:29:47,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:29:47,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:29:47,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553784383] [2024-10-10 23:29:47,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:29:47,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:29:47,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:29:47,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:29:47,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:29:47,690 INFO L87 Difference]: Start difference. First operand 1034 states and 1876 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 2 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:29:51,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:29:51,998 INFO L93 Difference]: Finished difference Result 2976 states and 5471 transitions. [2024-10-10 23:29:51,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:29:51,999 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 2 states have internal predecessors, (53), 0 states have call successors, (0), 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 53 [2024-10-10 23:29:51,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:29:52,008 INFO L225 Difference]: With dead ends: 2976 [2024-10-10 23:29:52,009 INFO L226 Difference]: Without dead ends: 1943 [2024-10-10 23:29:52,012 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:29:52,013 INFO L432 NwaCegarLoop]: 404 mSDtfsCounter, 901 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 3050 mSolverCounterSat, 532 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 901 SdHoareTripleChecker+Valid, 538 SdHoareTripleChecker+Invalid, 3582 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 532 IncrementalHoareTripleChecker+Valid, 3050 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2024-10-10 23:29:52,014 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [901 Valid, 538 Invalid, 3582 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [532 Valid, 3050 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2024-10-10 23:29:52,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1943 states. [2024-10-10 23:29:52,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1943 to 1872. [2024-10-10 23:29:52,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1872 states, 1871 states have (on average 1.7397113842864778) internal successors, (3255), 1871 states have internal predecessors, (3255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:29:52,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1872 states to 1872 states and 3255 transitions. [2024-10-10 23:29:52,073 INFO L78 Accepts]: Start accepts. Automaton has 1872 states and 3255 transitions. Word has length 53 [2024-10-10 23:29:52,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:29:52,074 INFO L471 AbstractCegarLoop]: Abstraction has 1872 states and 3255 transitions. [2024-10-10 23:29:52,075 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 2 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:29:52,075 INFO L276 IsEmpty]: Start isEmpty. Operand 1872 states and 3255 transitions. [2024-10-10 23:29:52,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-10-10 23:29:52,080 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:29:52,081 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:29:52,081 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-10 23:29:52,081 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:29:52,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:29:52,082 INFO L85 PathProgramCache]: Analyzing trace with hash -216706007, now seen corresponding path program 1 times [2024-10-10 23:29:52,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:29:52,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183266806] [2024-10-10 23:29:52,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:29:52,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:29:52,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:29:52,338 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:29:52,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:29:52,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183266806] [2024-10-10 23:29:52,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183266806] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:29:52,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:29:52,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:29:52,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852736394] [2024-10-10 23:29:52,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:29:52,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:29:52,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:29:52,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:29:52,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:29:52,343 INFO L87 Difference]: Start difference. First operand 1872 states and 3255 transitions. Second operand has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 2 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:29:55,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:29:55,927 INFO L93 Difference]: Finished difference Result 5350 states and 9368 transitions. [2024-10-10 23:29:55,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:29:55,928 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 2 states have internal predecessors, (118), 0 states have call successors, (0), 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 118 [2024-10-10 23:29:55,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:29:55,942 INFO L225 Difference]: With dead ends: 5350 [2024-10-10 23:29:55,942 INFO L226 Difference]: Without dead ends: 3479 [2024-10-10 23:29:55,945 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:29:55,947 INFO L432 NwaCegarLoop]: 924 mSDtfsCounter, 884 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 2339 mSolverCounterSat, 878 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 884 SdHoareTripleChecker+Valid, 1077 SdHoareTripleChecker+Invalid, 3217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 878 IncrementalHoareTripleChecker+Valid, 2339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2024-10-10 23:29:55,947 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [884 Valid, 1077 Invalid, 3217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [878 Valid, 2339 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2024-10-10 23:29:55,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3479 states. [2024-10-10 23:29:56,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3479 to 3478. [2024-10-10 23:29:56,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3478 states, 3477 states have (on average 1.5188380788035662) internal successors, (5281), 3477 states have internal predecessors, (5281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:29:56,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3478 states to 3478 states and 5281 transitions. [2024-10-10 23:29:56,027 INFO L78 Accepts]: Start accepts. Automaton has 3478 states and 5281 transitions. Word has length 118 [2024-10-10 23:29:56,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:29:56,029 INFO L471 AbstractCegarLoop]: Abstraction has 3478 states and 5281 transitions. [2024-10-10 23:29:56,030 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 2 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:29:56,030 INFO L276 IsEmpty]: Start isEmpty. Operand 3478 states and 5281 transitions. [2024-10-10 23:29:56,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-10-10 23:29:56,035 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:29:56,035 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:29:56,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-10 23:29:56,036 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:29:56,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:29:56,037 INFO L85 PathProgramCache]: Analyzing trace with hash 1373609636, now seen corresponding path program 1 times [2024-10-10 23:29:56,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:29:56,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332410917] [2024-10-10 23:29:56,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:29:56,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:29:56,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:29:56,270 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:29:56,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:29:56,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332410917] [2024-10-10 23:29:56,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [332410917] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:29:56,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:29:56,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:29:56,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831670260] [2024-10-10 23:29:56,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:29:56,273 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:29:56,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:29:56,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:29:56,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:29:56,275 INFO L87 Difference]: Start difference. First operand 3478 states and 5281 transitions. Second operand has 3 states, 3 states have (on average 40.0) internal successors, (120), 2 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:29:59,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:29:59,506 INFO L93 Difference]: Finished difference Result 10141 states and 15437 transitions. [2024-10-10 23:29:59,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:29:59,507 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 2 states have internal predecessors, (120), 0 states have call successors, (0), 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 120 [2024-10-10 23:29:59,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:29:59,531 INFO L225 Difference]: With dead ends: 10141 [2024-10-10 23:29:59,531 INFO L226 Difference]: Without dead ends: 6664 [2024-10-10 23:29:59,539 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:29:59,540 INFO L432 NwaCegarLoop]: 742 mSDtfsCounter, 976 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 2554 mSolverCounterSat, 772 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 976 SdHoareTripleChecker+Valid, 875 SdHoareTripleChecker+Invalid, 3326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 772 IncrementalHoareTripleChecker+Valid, 2554 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-10-10 23:29:59,541 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [976 Valid, 875 Invalid, 3326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [772 Valid, 2554 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-10-10 23:29:59,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6664 states. [2024-10-10 23:29:59,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6664 to 6656. [2024-10-10 23:29:59,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6656 states, 6655 states have (on average 1.3729526671675432) internal successors, (9137), 6655 states have internal predecessors, (9137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:29:59,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6656 states to 6656 states and 9137 transitions. [2024-10-10 23:29:59,652 INFO L78 Accepts]: Start accepts. Automaton has 6656 states and 9137 transitions. Word has length 120 [2024-10-10 23:29:59,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:29:59,654 INFO L471 AbstractCegarLoop]: Abstraction has 6656 states and 9137 transitions. [2024-10-10 23:29:59,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 2 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:29:59,655 INFO L276 IsEmpty]: Start isEmpty. Operand 6656 states and 9137 transitions. [2024-10-10 23:29:59,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-10-10 23:29:59,658 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:29:59,659 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-10 23:29:59,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-10 23:29:59,659 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:29:59,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:29:59,659 INFO L85 PathProgramCache]: Analyzing trace with hash -1065139115, now seen corresponding path program 1 times [2024-10-10 23:29:59,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:29:59,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624904314] [2024-10-10 23:29:59,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:29:59,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:29:59,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:29:59,855 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:29:59,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:29:59,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624904314] [2024-10-10 23:29:59,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [624904314] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:29:59,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:29:59,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:29:59,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417964595] [2024-10-10 23:29:59,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:29:59,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:29:59,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:29:59,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:29:59,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:29:59,860 INFO L87 Difference]: Start difference. First operand 6656 states and 9137 transitions. Second operand has 3 states, 3 states have (on average 42.0) internal successors, (126), 2 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:30:02,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:30:02,866 INFO L93 Difference]: Finished difference Result 19636 states and 26968 transitions. [2024-10-10 23:30:02,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:30:02,867 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 2 states have internal predecessors, (126), 0 states have call successors, (0), 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 126 [2024-10-10 23:30:02,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:30:02,918 INFO L225 Difference]: With dead ends: 19636 [2024-10-10 23:30:02,918 INFO L226 Difference]: Without dead ends: 12981 [2024-10-10 23:30:02,932 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:30:02,933 INFO L432 NwaCegarLoop]: 1010 mSDtfsCounter, 791 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 2486 mSolverCounterSat, 792 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 791 SdHoareTripleChecker+Valid, 1161 SdHoareTripleChecker+Invalid, 3278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 792 IncrementalHoareTripleChecker+Valid, 2486 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-10-10 23:30:02,933 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [791 Valid, 1161 Invalid, 3278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [792 Valid, 2486 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-10-10 23:30:02,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12981 states. [2024-10-10 23:30:03,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12981 to 12174. [2024-10-10 23:30:03,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12174 states, 12173 states have (on average 1.2529368274049124) internal successors, (15252), 12173 states have internal predecessors, (15252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:30:03,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12174 states to 12174 states and 15252 transitions. [2024-10-10 23:30:03,148 INFO L78 Accepts]: Start accepts. Automaton has 12174 states and 15252 transitions. Word has length 126 [2024-10-10 23:30:03,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:30:03,150 INFO L471 AbstractCegarLoop]: Abstraction has 12174 states and 15252 transitions. [2024-10-10 23:30:03,150 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 2 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:30:03,150 INFO L276 IsEmpty]: Start isEmpty. Operand 12174 states and 15252 transitions. [2024-10-10 23:30:03,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-10-10 23:30:03,152 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:30:03,153 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-10 23:30:03,153 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-10 23:30:03,153 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:30:03,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:30:03,154 INFO L85 PathProgramCache]: Analyzing trace with hash -192712595, now seen corresponding path program 1 times [2024-10-10 23:30:03,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:30:03,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80705057] [2024-10-10 23:30:03,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:30:03,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:30:03,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:30:03,470 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:30:03,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:30:03,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80705057] [2024-10-10 23:30:03,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80705057] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:30:03,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:30:03,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:30:03,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512803202] [2024-10-10 23:30:03,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:30:03,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:30:03,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:30:03,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:30:03,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:30:03,474 INFO L87 Difference]: Start difference. First operand 12174 states and 15252 transitions. Second operand has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 2 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:30:06,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:30:06,812 INFO L93 Difference]: Finished difference Result 25134 states and 31305 transitions. [2024-10-10 23:30:06,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:30:06,813 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 2 states have internal predecessors, (142), 0 states have call successors, (0), 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 142 [2024-10-10 23:30:06,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:30:06,837 INFO L225 Difference]: With dead ends: 25134 [2024-10-10 23:30:06,838 INFO L226 Difference]: Without dead ends: 12961 [2024-10-10 23:30:06,852 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:30:06,854 INFO L432 NwaCegarLoop]: 1081 mSDtfsCounter, 700 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 2521 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 700 SdHoareTripleChecker+Valid, 1210 SdHoareTripleChecker+Invalid, 2530 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 2521 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-10-10 23:30:06,856 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [700 Valid, 1210 Invalid, 2530 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 2521 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-10-10 23:30:06,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12961 states. [2024-10-10 23:30:07,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12961 to 12961. [2024-10-10 23:30:07,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12961 states, 12960 states have (on average 1.237962962962963) internal successors, (16044), 12960 states have internal predecessors, (16044), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:30:07,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12961 states to 12961 states and 16044 transitions. [2024-10-10 23:30:07,073 INFO L78 Accepts]: Start accepts. Automaton has 12961 states and 16044 transitions. Word has length 142 [2024-10-10 23:30:07,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:30:07,074 INFO L471 AbstractCegarLoop]: Abstraction has 12961 states and 16044 transitions. [2024-10-10 23:30:07,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 2 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:30:07,075 INFO L276 IsEmpty]: Start isEmpty. Operand 12961 states and 16044 transitions. [2024-10-10 23:30:07,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-10-10 23:30:07,076 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:30:07,076 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-10 23:30:07,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-10 23:30:07,076 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:30:07,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:30:07,077 INFO L85 PathProgramCache]: Analyzing trace with hash -893508172, now seen corresponding path program 1 times [2024-10-10 23:30:07,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:30:07,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674416502] [2024-10-10 23:30:07,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:30:07,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:30:07,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:30:07,210 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:30:07,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:30:07,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674416502] [2024-10-10 23:30:07,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1674416502] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:30:07,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:30:07,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:30:07,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990351153] [2024-10-10 23:30:07,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:30:07,212 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:30:07,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:30:07,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:30:07,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:30:07,213 INFO L87 Difference]: Start difference. First operand 12961 states and 16044 transitions. Second operand has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:30:10,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:30:10,346 INFO L93 Difference]: Finished difference Result 31447 states and 39969 transitions. [2024-10-10 23:30:10,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:30:10,346 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 149 [2024-10-10 23:30:10,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:30:10,381 INFO L225 Difference]: With dead ends: 31447 [2024-10-10 23:30:10,382 INFO L226 Difference]: Without dead ends: 19274 [2024-10-10 23:30:10,400 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:30:10,404 INFO L432 NwaCegarLoop]: 835 mSDtfsCounter, 908 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 2392 mSolverCounterSat, 908 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 908 SdHoareTripleChecker+Valid, 955 SdHoareTripleChecker+Invalid, 3300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 908 IncrementalHoareTripleChecker+Valid, 2392 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-10-10 23:30:10,404 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [908 Valid, 955 Invalid, 3300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [908 Valid, 2392 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-10-10 23:30:10,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19274 states. [2024-10-10 23:30:10,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19274 to 18477. [2024-10-10 23:30:10,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18477 states, 18476 states have (on average 1.2248322147651007) internal successors, (22630), 18476 states have internal predecessors, (22630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:30:10,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18477 states to 18477 states and 22630 transitions. [2024-10-10 23:30:10,793 INFO L78 Accepts]: Start accepts. Automaton has 18477 states and 22630 transitions. Word has length 149 [2024-10-10 23:30:10,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:30:10,794 INFO L471 AbstractCegarLoop]: Abstraction has 18477 states and 22630 transitions. [2024-10-10 23:30:10,794 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:30:10,794 INFO L276 IsEmpty]: Start isEmpty. Operand 18477 states and 22630 transitions. [2024-10-10 23:30:10,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2024-10-10 23:30:10,797 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:30:10,797 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:30:10,797 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-10 23:30:10,798 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:30:10,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:30:10,798 INFO L85 PathProgramCache]: Analyzing trace with hash 747261356, now seen corresponding path program 1 times [2024-10-10 23:30:10,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:30:10,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200241102] [2024-10-10 23:30:10,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:30:10,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:30:10,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:30:11,011 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2024-10-10 23:30:11,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:30:11,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200241102] [2024-10-10 23:30:11,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200241102] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:30:11,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:30:11,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:30:11,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501050542] [2024-10-10 23:30:11,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:30:11,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:30:11,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:30:11,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:30:11,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:30:11,015 INFO L87 Difference]: Start difference. First operand 18477 states and 22630 transitions. Second operand has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:30:14,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:30:14,155 INFO L93 Difference]: Finished difference Result 42486 states and 53152 transitions. [2024-10-10 23:30:14,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:30:14,156 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 0 states have call successors, (0), 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-10 23:30:14,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:30:14,197 INFO L225 Difference]: With dead ends: 42486 [2024-10-10 23:30:14,197 INFO L226 Difference]: Without dead ends: 24797 [2024-10-10 23:30:14,220 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:30:14,221 INFO L432 NwaCegarLoop]: 702 mSDtfsCounter, 995 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 2390 mSolverCounterSat, 1023 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 995 SdHoareTripleChecker+Valid, 793 SdHoareTripleChecker+Invalid, 3413 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1023 IncrementalHoareTripleChecker+Valid, 2390 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-10-10 23:30:14,221 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [995 Valid, 793 Invalid, 3413 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1023 Valid, 2390 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-10-10 23:30:14,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24797 states. [2024-10-10 23:30:14,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24797 to 24785. [2024-10-10 23:30:14,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24785 states, 24784 states have (on average 1.2302695287282117) internal successors, (30491), 24784 states have internal predecessors, (30491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:30:14,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24785 states to 24785 states and 30491 transitions. [2024-10-10 23:30:14,537 INFO L78 Accepts]: Start accepts. Automaton has 24785 states and 30491 transitions. Word has length 238 [2024-10-10 23:30:14,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:30:14,538 INFO L471 AbstractCegarLoop]: Abstraction has 24785 states and 30491 transitions. [2024-10-10 23:30:14,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:30:14,538 INFO L276 IsEmpty]: Start isEmpty. Operand 24785 states and 30491 transitions. [2024-10-10 23:30:14,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2024-10-10 23:30:14,549 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:30:14,549 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:30:14,549 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-10 23:30:14,549 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:30:14,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:30:14,550 INFO L85 PathProgramCache]: Analyzing trace with hash 1764351605, now seen corresponding path program 1 times [2024-10-10 23:30:14,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:30:14,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722142218] [2024-10-10 23:30:14,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:30:14,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:30:14,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:30:15,201 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 198 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:30:15,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:30:15,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722142218] [2024-10-10 23:30:15,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1722142218] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:30:15,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:30:15,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:30:15,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523865066] [2024-10-10 23:30:15,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:30:15,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:30:15,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:30:15,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:30:15,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:30:15,206 INFO L87 Difference]: Start difference. First operand 24785 states and 30491 transitions. Second operand has 4 states, 4 states have (on average 78.75) internal successors, (315), 3 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:30:20,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:30:20,340 INFO L93 Difference]: Finished difference Result 73223 states and 90679 transitions. [2024-10-10 23:30:20,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 23:30:20,343 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 78.75) internal successors, (315), 3 states have internal predecessors, (315), 0 states have call successors, (0), 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 315 [2024-10-10 23:30:20,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:30:20,414 INFO L225 Difference]: With dead ends: 73223 [2024-10-10 23:30:20,415 INFO L226 Difference]: Without dead ends: 49226 [2024-10-10 23:30:20,449 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:30:20,449 INFO L432 NwaCegarLoop]: 543 mSDtfsCounter, 1519 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 5506 mSolverCounterSat, 679 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1519 SdHoareTripleChecker+Valid, 849 SdHoareTripleChecker+Invalid, 6185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 679 IncrementalHoareTripleChecker+Valid, 5506 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2024-10-10 23:30:20,450 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1519 Valid, 849 Invalid, 6185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [679 Valid, 5506 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2024-10-10 23:30:20,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49226 states. [2024-10-10 23:30:21,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49226 to 49212. [2024-10-10 23:30:21,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49212 states, 49211 states have (on average 1.2030033935502225) internal successors, (59201), 49211 states have internal predecessors, (59201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:30:21,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49212 states to 49212 states and 59201 transitions. [2024-10-10 23:30:21,182 INFO L78 Accepts]: Start accepts. Automaton has 49212 states and 59201 transitions. Word has length 315 [2024-10-10 23:30:21,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:30:21,186 INFO L471 AbstractCegarLoop]: Abstraction has 49212 states and 59201 transitions. [2024-10-10 23:30:21,187 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 78.75) internal successors, (315), 3 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:30:21,187 INFO L276 IsEmpty]: Start isEmpty. Operand 49212 states and 59201 transitions. [2024-10-10 23:30:21,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 342 [2024-10-10 23:30:21,195 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:30:21,195 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:30:21,195 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-10 23:30:21,195 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:30:21,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:30:21,196 INFO L85 PathProgramCache]: Analyzing trace with hash -1073051411, now seen corresponding path program 1 times [2024-10-10 23:30:21,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:30:21,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479130398] [2024-10-10 23:30:21,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:30:21,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:30:21,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:30:21,487 INFO L134 CoverageAnalysis]: Checked inductivity of 431 backedges. 379 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-10-10 23:30:21,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:30:21,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479130398] [2024-10-10 23:30:21,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479130398] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:30:21,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:30:21,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:30:21,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505303659] [2024-10-10 23:30:21,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:30:21,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:30:21,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:30:21,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:30:21,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:30:21,490 INFO L87 Difference]: Start difference. First operand 49212 states and 59201 transitions. Second operand has 4 states, 4 states have (on average 72.5) internal successors, (290), 3 states have internal predecessors, (290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:30:28,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:30:28,022 INFO L93 Difference]: Finished difference Result 138780 states and 168387 transitions. [2024-10-10 23:30:28,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 23:30:28,022 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 72.5) internal successors, (290), 3 states have internal predecessors, (290), 0 states have call successors, (0), 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 341 [2024-10-10 23:30:28,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:30:28,110 INFO L225 Difference]: With dead ends: 138780 [2024-10-10 23:30:28,110 INFO L226 Difference]: Without dead ends: 90356 [2024-10-10 23:30:28,138 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:30:28,139 INFO L432 NwaCegarLoop]: 877 mSDtfsCounter, 1719 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 6390 mSolverCounterSat, 1036 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1719 SdHoareTripleChecker+Valid, 1082 SdHoareTripleChecker+Invalid, 7426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1036 IncrementalHoareTripleChecker+Valid, 6390 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.0s IncrementalHoareTripleChecker+Time [2024-10-10 23:30:28,139 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1719 Valid, 1082 Invalid, 7426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1036 Valid, 6390 Invalid, 0 Unknown, 0 Unchecked, 6.0s Time] [2024-10-10 23:30:28,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90356 states. [2024-10-10 23:30:29,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90356 to 90226. [2024-10-10 23:30:29,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90226 states, 90225 states have (on average 1.1906677750069272) internal successors, (107428), 90225 states have internal predecessors, (107428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:30:29,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90226 states to 90226 states and 107428 transitions. [2024-10-10 23:30:29,333 INFO L78 Accepts]: Start accepts. Automaton has 90226 states and 107428 transitions. Word has length 341 [2024-10-10 23:30:29,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:30:29,333 INFO L471 AbstractCegarLoop]: Abstraction has 90226 states and 107428 transitions. [2024-10-10 23:30:29,333 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 72.5) internal successors, (290), 3 states have internal predecessors, (290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:30:29,333 INFO L276 IsEmpty]: Start isEmpty. Operand 90226 states and 107428 transitions. [2024-10-10 23:30:29,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 345 [2024-10-10 23:30:29,598 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:30:29,599 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:30:29,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-10 23:30:29,599 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:30:29,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:30:29,600 INFO L85 PathProgramCache]: Analyzing trace with hash -1700485331, now seen corresponding path program 1 times [2024-10-10 23:30:29,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:30:29,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67149923] [2024-10-10 23:30:29,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:30:29,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:30:29,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:30:31,173 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 117 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:30:31,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:30:31,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67149923] [2024-10-10 23:30:31,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67149923] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 23:30:31,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [60931535] [2024-10-10 23:30:31,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:30:31,174 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:30:31,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:30:31,177 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 23:30:31,178 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-10 23:30:31,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:30:31,334 INFO L255 TraceCheckSpWp]: Trace formula consists of 451 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-10 23:30:31,345 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 23:30:32,153 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2024-10-10 23:30:32,154 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 23:30:32,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [60931535] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:30:32,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 23:30:32,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2024-10-10 23:30:32,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107550913] [2024-10-10 23:30:32,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:30:32,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:30:32,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:30:32,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:30:32,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-10 23:30:32,156 INFO L87 Difference]: Start difference. First operand 90226 states and 107428 transitions. Second operand has 3 states, 3 states have (on average 73.66666666666667) internal successors, (221), 2 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:30:35,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:30:35,421 INFO L93 Difference]: Finished difference Result 167866 states and 201403 transitions. [2024-10-10 23:30:35,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:30:35,422 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 73.66666666666667) internal successors, (221), 2 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 344 [2024-10-10 23:30:35,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:30:35,525 INFO L225 Difference]: With dead ends: 167866 [2024-10-10 23:30:35,526 INFO L226 Difference]: Without dead ends: 93389 [2024-10-10 23:30:35,554 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 348 GetRequests, 343 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-10 23:30:35,555 INFO L432 NwaCegarLoop]: 1086 mSDtfsCounter, 643 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 2506 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 643 SdHoareTripleChecker+Valid, 1223 SdHoareTripleChecker+Invalid, 2617 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 2506 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-10-10 23:30:35,555 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [643 Valid, 1223 Invalid, 2617 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 2506 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-10-10 23:30:35,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93389 states. [2024-10-10 23:30:36,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93389 to 91800. [2024-10-10 23:30:36,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91800 states, 91799 states have (on average 1.1878342901338794) internal successors, (109042), 91799 states have internal predecessors, (109042), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:30:36,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91800 states to 91800 states and 109042 transitions. [2024-10-10 23:30:36,969 INFO L78 Accepts]: Start accepts. Automaton has 91800 states and 109042 transitions. Word has length 344 [2024-10-10 23:30:36,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:30:36,970 INFO L471 AbstractCegarLoop]: Abstraction has 91800 states and 109042 transitions. [2024-10-10 23:30:36,970 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 73.66666666666667) internal successors, (221), 2 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:30:36,970 INFO L276 IsEmpty]: Start isEmpty. Operand 91800 states and 109042 transitions. [2024-10-10 23:30:36,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 403 [2024-10-10 23:30:36,981 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:30:36,981 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:30:37,040 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-10 23:30:37,190 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-10-10 23:30:37,191 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:30:37,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:30:37,191 INFO L85 PathProgramCache]: Analyzing trace with hash 1152875487, now seen corresponding path program 1 times [2024-10-10 23:30:37,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:30:37,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988146547] [2024-10-10 23:30:37,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:30:37,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:30:37,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:30:37,875 INFO L134 CoverageAnalysis]: Checked inductivity of 692 backedges. 531 proven. 0 refuted. 0 times theorem prover too weak. 161 trivial. 0 not checked. [2024-10-10 23:30:37,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:30:37,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988146547] [2024-10-10 23:30:37,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988146547] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:30:37,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:30:37,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:30:37,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729540638] [2024-10-10 23:30:37,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:30:37,877 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:30:37,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:30:37,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:30:37,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:30:37,878 INFO L87 Difference]: Start difference. First operand 91800 states and 109042 transitions. Second operand has 3 states, 3 states have (on average 81.0) internal successors, (243), 3 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:30:41,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:30:41,275 INFO L93 Difference]: Finished difference Result 182816 states and 217303 transitions. [2024-10-10 23:30:41,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:30:41,275 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 81.0) internal successors, (243), 3 states have internal predecessors, (243), 0 states have call successors, (0), 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 402 [2024-10-10 23:30:41,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:30:41,385 INFO L225 Difference]: With dead ends: 182816 [2024-10-10 23:30:41,385 INFO L226 Difference]: Without dead ends: 91804 [2024-10-10 23:30:41,413 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:30:41,414 INFO L432 NwaCegarLoop]: 1423 mSDtfsCounter, 954 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 2496 mSolverCounterSat, 614 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 954 SdHoareTripleChecker+Valid, 1517 SdHoareTripleChecker+Invalid, 3110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 614 IncrementalHoareTripleChecker+Valid, 2496 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-10-10 23:30:41,414 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [954 Valid, 1517 Invalid, 3110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [614 Valid, 2496 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-10-10 23:30:41,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91804 states. [2024-10-10 23:30:42,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91804 to 91792. [2024-10-10 23:30:42,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91792 states, 91791 states have (on average 1.1373010425858745) internal successors, (104394), 91791 states have internal predecessors, (104394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:30:42,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91792 states to 91792 states and 104394 transitions. [2024-10-10 23:30:42,483 INFO L78 Accepts]: Start accepts. Automaton has 91792 states and 104394 transitions. Word has length 402 [2024-10-10 23:30:42,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:30:42,484 INFO L471 AbstractCegarLoop]: Abstraction has 91792 states and 104394 transitions. [2024-10-10 23:30:42,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 81.0) internal successors, (243), 3 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:30:42,484 INFO L276 IsEmpty]: Start isEmpty. Operand 91792 states and 104394 transitions. [2024-10-10 23:30:42,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 427 [2024-10-10 23:30:42,492 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:30:42,493 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2024-10-10 23:30:42,493 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-10 23:30:42,493 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:30:42,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:30:42,494 INFO L85 PathProgramCache]: Analyzing trace with hash -806872421, now seen corresponding path program 1 times [2024-10-10 23:30:42,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:30:42,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316154845] [2024-10-10 23:30:42,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:30:42,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:30:42,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:30:43,157 INFO L134 CoverageAnalysis]: Checked inductivity of 694 backedges. 370 proven. 0 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [2024-10-10 23:30:43,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:30:43,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316154845] [2024-10-10 23:30:43,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316154845] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:30:43,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:30:43,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:30:43,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36817447] [2024-10-10 23:30:43,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:30:43,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:30:43,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:30:43,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:30:43,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:30:43,160 INFO L87 Difference]: Start difference. First operand 91792 states and 104394 transitions. Second operand has 3 states, 3 states have (on average 64.33333333333333) internal successors, (193), 2 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:30:47,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:30:47,043 INFO L93 Difference]: Finished difference Result 167846 states and 192283 transitions. [2024-10-10 23:30:47,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:30:47,044 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 64.33333333333333) internal successors, (193), 2 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 426 [2024-10-10 23:30:47,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:30:47,158 INFO L225 Difference]: With dead ends: 167846 [2024-10-10 23:30:47,158 INFO L226 Difference]: Without dead ends: 91803 [2024-10-10 23:30:47,369 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:30:47,370 INFO L432 NwaCegarLoop]: 1050 mSDtfsCounter, 725 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 2730 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 725 SdHoareTripleChecker+Valid, 1232 SdHoareTripleChecker+Invalid, 2734 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 2730 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2024-10-10 23:30:47,370 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [725 Valid, 1232 Invalid, 2734 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 2730 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2024-10-10 23:30:47,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91803 states. [2024-10-10 23:30:48,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91803 to 91792. [2024-10-10 23:30:48,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91792 states, 91791 states have (on average 1.136756326873005) internal successors, (104344), 91791 states have internal predecessors, (104344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:30:48,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91792 states to 91792 states and 104344 transitions. [2024-10-10 23:30:48,218 INFO L78 Accepts]: Start accepts. Automaton has 91792 states and 104344 transitions. Word has length 426 [2024-10-10 23:30:48,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:30:48,219 INFO L471 AbstractCegarLoop]: Abstraction has 91792 states and 104344 transitions. [2024-10-10 23:30:48,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 64.33333333333333) internal successors, (193), 2 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:30:48,219 INFO L276 IsEmpty]: Start isEmpty. Operand 91792 states and 104344 transitions. [2024-10-10 23:30:48,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 434 [2024-10-10 23:30:48,225 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:30:48,226 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-10 23:30:48,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-10 23:30:48,226 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:30:48,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:30:48,227 INFO L85 PathProgramCache]: Analyzing trace with hash 969704117, now seen corresponding path program 1 times [2024-10-10 23:30:48,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:30:48,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695312504] [2024-10-10 23:30:48,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:30:48,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:30:48,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:30:48,429 INFO L134 CoverageAnalysis]: Checked inductivity of 456 backedges. 404 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-10-10 23:30:48,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:30:48,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695312504] [2024-10-10 23:30:48,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695312504] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:30:48,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:30:48,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:30:48,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380184260] [2024-10-10 23:30:48,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:30:48,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:30:48,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:30:48,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:30:48,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:30:48,434 INFO L87 Difference]: Start difference. First operand 91792 states and 104344 transitions. Second operand has 3 states, 3 states have (on average 127.33333333333333) internal successors, (382), 3 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)