./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_label30.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label30.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e9187c2a2102d3e400be280528e6f5828841c3bd8908371ec9602651e1a68303 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-13 23:38:24,298 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 23:38:24,343 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 23:38:24,348 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 23:38:24,348 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 23:38:24,371 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 23:38:24,371 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 23:38:24,371 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 23:38:24,372 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 23:38:24,373 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 23:38:24,374 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 23:38:24,374 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 23:38:24,375 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 23:38:24,376 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 23:38:24,376 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 23:38:24,377 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 23:38:24,377 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 23:38:24,377 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 23:38:24,377 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 23:38:24,377 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 23:38:24,378 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 23:38:24,379 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 23:38:24,380 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 23:38:24,380 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 23:38:24,380 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 23:38:24,380 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 23:38:24,380 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 23:38:24,381 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 23:38:24,381 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 23:38:24,381 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 23:38:24,381 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 23:38:24,381 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 23:38:24,381 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 23:38:24,382 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 23:38:24,382 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 23:38:24,382 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 23:38:24,382 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 23:38:24,382 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 23:38:24,382 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 23:38:24,382 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 23:38:24,383 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 23:38:24,384 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 23:38:24,384 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e9187c2a2102d3e400be280528e6f5828841c3bd8908371ec9602651e1a68303 [2024-10-13 23:38:24,598 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 23:38:24,617 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 23:38:24,619 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 23:38:24,620 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 23:38:24,621 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 23:38:24,621 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label30.c [2024-10-13 23:38:25,929 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 23:38:26,299 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 23:38:26,300 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label30.c [2024-10-13 23:38:26,324 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/392b80da6/5cc8b411100843a4b9cecb473ea8d8f6/FLAG75d36ffbf [2024-10-13 23:38:26,337 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/392b80da6/5cc8b411100843a4b9cecb473ea8d8f6 [2024-10-13 23:38:26,339 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 23:38:26,358 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 23:38:26,360 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 23:38:26,360 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 23:38:26,369 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 23:38:26,369 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 11:38:26" (1/1) ... [2024-10-13 23:38:26,370 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71df56d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:38:26, skipping insertion in model container [2024-10-13 23:38:26,370 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 11:38:26" (1/1) ... [2024-10-13 23:38:26,449 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 23:38:26,625 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_label30.c[2990,3003] [2024-10-13 23:38:27,333 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 23:38:27,340 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 23:38:27,358 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_label30.c[2990,3003] [2024-10-13 23:38:27,701 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 23:38:27,735 INFO L204 MainTranslator]: Completed translation [2024-10-13 23:38:27,735 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:38:27 WrapperNode [2024-10-13 23:38:27,735 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 23:38:27,736 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 23:38:27,736 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 23:38:27,736 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 23:38:27,748 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:38:27" (1/1) ... [2024-10-13 23:38:27,805 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:38:27" (1/1) ... [2024-10-13 23:38:28,222 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 5587 [2024-10-13 23:38:28,223 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 23:38:28,223 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 23:38:28,223 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 23:38:28,223 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 23:38:28,232 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:38:27" (1/1) ... [2024-10-13 23:38:28,232 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:38:27" (1/1) ... [2024-10-13 23:38:28,329 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:38:27" (1/1) ... [2024-10-13 23:38:28,585 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-13 23:38:28,586 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:38:27" (1/1) ... [2024-10-13 23:38:28,586 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:38:27" (1/1) ... [2024-10-13 23:38:28,877 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:38:27" (1/1) ... [2024-10-13 23:38:28,938 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:38:27" (1/1) ... [2024-10-13 23:38:28,979 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:38:27" (1/1) ... [2024-10-13 23:38:29,019 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:38:27" (1/1) ... [2024-10-13 23:38:29,143 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 23:38:29,144 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 23:38:29,145 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 23:38:29,145 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 23:38:29,146 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:38:27" (1/1) ... [2024-10-13 23:38:29,150 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 23:38:29,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 23:38:29,174 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 23:38:29,179 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 23:38:29,220 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 23:38:29,220 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 23:38:29,220 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 23:38:29,221 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 23:38:29,274 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 23:38:29,276 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 23:38:35,297 INFO L? ?]: Removed 738 outVars from TransFormulas that were not future-live. [2024-10-13 23:38:35,297 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 23:38:35,369 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 23:38:35,370 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 23:38:35,370 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 11:38:35 BoogieIcfgContainer [2024-10-13 23:38:35,370 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 23:38:35,372 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 23:38:35,373 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 23:38:35,375 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 23:38:35,376 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 11:38:26" (1/3) ... [2024-10-13 23:38:35,376 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45e792a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 11:38:35, skipping insertion in model container [2024-10-13 23:38:35,376 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:38:27" (2/3) ... [2024-10-13 23:38:35,376 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45e792a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 11:38:35, skipping insertion in model container [2024-10-13 23:38:35,377 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 11:38:35" (3/3) ... [2024-10-13 23:38:35,377 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem13_label30.c [2024-10-13 23:38:35,391 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 23:38:35,391 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 23:38:35,493 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 23:38:35,497 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;@48411343, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 23:38:35,498 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 23:38:35,503 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-13 23:38:35,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-13 23:38:35,508 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:38:35,508 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:38:35,509 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:38:35,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:38:35,512 INFO L85 PathProgramCache]: Analyzing trace with hash -1590151318, now seen corresponding path program 1 times [2024-10-13 23:38:35,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:38:35,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028069437] [2024-10-13 23:38:35,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:38:35,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:38:35,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:38:35,668 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-13 23:38:35,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:38:35,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028069437] [2024-10-13 23:38:35,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028069437] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:38:35,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:38:35,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 23:38:35,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805446952] [2024-10-13 23:38:35,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:38:35,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 23:38:35,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:38:35,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 23:38:35,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 23:38:35,696 INFO L87 Difference]: Start difference. First operand has 1036 states, 1034 states have (on average 1.877176015473888) internal successors, (1941), 1035 states have internal predecessors, (1941), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 0 states have call successors, (0), 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-13 23:38:35,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:38:35,783 INFO L93 Difference]: Finished difference Result 2071 states and 3881 transitions. [2024-10-13 23:38:35,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 23:38:35,785 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 0 states have call successors, (0), 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 18 [2024-10-13 23:38:35,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:38:35,801 INFO L225 Difference]: With dead ends: 2071 [2024-10-13 23:38:35,801 INFO L226 Difference]: Without dead ends: 1034 [2024-10-13 23:38:35,806 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-13 23:38:35,809 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-13 23:38:35,809 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-13 23:38:35,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1034 states. [2024-10-13 23:38:35,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1034 to 1034. [2024-10-13 23:38:35,883 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-13 23:38:35,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1034 states to 1034 states and 1876 transitions. [2024-10-13 23:38:35,887 INFO L78 Accepts]: Start accepts. Automaton has 1034 states and 1876 transitions. Word has length 18 [2024-10-13 23:38:35,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:38:35,888 INFO L471 AbstractCegarLoop]: Abstraction has 1034 states and 1876 transitions. [2024-10-13 23:38:35,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 0 states have call successors, (0), 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-13 23:38:35,888 INFO L276 IsEmpty]: Start isEmpty. Operand 1034 states and 1876 transitions. [2024-10-13 23:38:35,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-13 23:38:35,889 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:38:35,889 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:38:35,889 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 23:38:35,889 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:38:35,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:38:35,890 INFO L85 PathProgramCache]: Analyzing trace with hash -83440488, now seen corresponding path program 1 times [2024-10-13 23:38:35,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:38:35,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096478516] [2024-10-13 23:38:35,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:38:35,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:38:35,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:38:35,992 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-13 23:38:35,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:38:35,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096478516] [2024-10-13 23:38:35,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096478516] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:38:35,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:38:35,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 23:38:35,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212594895] [2024-10-13 23:38:35,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:38:35,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:38:35,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:38:35,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:38:35,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:38:35,995 INFO L87 Difference]: Start difference. First operand 1034 states and 1876 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 2 states have internal predecessors, (18), 0 states have call successors, (0), 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-13 23:38:39,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:38:39,227 INFO L93 Difference]: Finished difference Result 2931 states and 5350 transitions. [2024-10-13 23:38:39,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:38:39,228 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 2 states have internal predecessors, (18), 0 states have call successors, (0), 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 18 [2024-10-13 23:38:39,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:38:39,233 INFO L225 Difference]: With dead ends: 2931 [2024-10-13 23:38:39,234 INFO L226 Difference]: Without dead ends: 1898 [2024-10-13 23:38:39,234 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-13 23:38:39,235 INFO L432 NwaCegarLoop]: 426 mSDtfsCounter, 996 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 2875 mSolverCounterSat, 560 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 996 SdHoareTripleChecker+Valid, 594 SdHoareTripleChecker+Invalid, 3435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 560 IncrementalHoareTripleChecker+Valid, 2875 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-10-13 23:38:39,236 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [996 Valid, 594 Invalid, 3435 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [560 Valid, 2875 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-10-13 23:38:39,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1898 states. [2024-10-13 23:38:39,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1898 to 1893. [2024-10-13 23:38:39,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1893 states, 1892 states have (on average 1.73784355179704) internal successors, (3288), 1892 states have internal predecessors, (3288), 0 states have call successors, (0), 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-13 23:38:39,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1893 states to 1893 states and 3288 transitions. [2024-10-13 23:38:39,277 INFO L78 Accepts]: Start accepts. Automaton has 1893 states and 3288 transitions. Word has length 18 [2024-10-13 23:38:39,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:38:39,277 INFO L471 AbstractCegarLoop]: Abstraction has 1893 states and 3288 transitions. [2024-10-13 23:38:39,278 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 2 states have internal predecessors, (18), 0 states have call successors, (0), 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-13 23:38:39,278 INFO L276 IsEmpty]: Start isEmpty. Operand 1893 states and 3288 transitions. [2024-10-13 23:38:39,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-10-13 23:38:39,283 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:38:39,283 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-13 23:38:39,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 23:38:39,283 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:38:39,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:38:39,284 INFO L85 PathProgramCache]: Analyzing trace with hash -359171613, now seen corresponding path program 1 times [2024-10-13 23:38:39,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:38:39,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766761787] [2024-10-13 23:38:39,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:38:39,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:38:39,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:38:39,512 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 23:38:39,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:38:39,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766761787] [2024-10-13 23:38:39,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [766761787] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:38:39,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:38:39,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 23:38:39,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818331495] [2024-10-13 23:38:39,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:38:39,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:38:39,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:38:39,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:38:39,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:38:39,514 INFO L87 Difference]: Start difference. First operand 1893 states and 3288 transitions. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 2 states have internal predecessors, (83), 0 states have call successors, (0), 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-13 23:38:42,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:38:42,754 INFO L93 Difference]: Finished difference Result 5383 states and 9440 transitions. [2024-10-13 23:38:42,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:38:42,755 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 2 states have internal predecessors, (83), 0 states have call successors, (0), 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 83 [2024-10-13 23:38:42,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:38:42,765 INFO L225 Difference]: With dead ends: 5383 [2024-10-13 23:38:42,765 INFO L226 Difference]: Without dead ends: 3491 [2024-10-13 23:38:42,767 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-13 23:38:42,768 INFO L432 NwaCegarLoop]: 858 mSDtfsCounter, 922 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 2311 mSolverCounterSat, 879 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 922 SdHoareTripleChecker+Valid, 1011 SdHoareTripleChecker+Invalid, 3190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 879 IncrementalHoareTripleChecker+Valid, 2311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-10-13 23:38:42,769 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [922 Valid, 1011 Invalid, 3190 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [879 Valid, 2311 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-10-13 23:38:42,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3491 states. [2024-10-13 23:38:42,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3491 to 3490. [2024-10-13 23:38:42,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3490 states, 3489 states have (on average 1.5385497277156779) internal successors, (5368), 3489 states have internal predecessors, (5368), 0 states have call successors, (0), 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-13 23:38:42,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3490 states to 3490 states and 5368 transitions. [2024-10-13 23:38:42,824 INFO L78 Accepts]: Start accepts. Automaton has 3490 states and 5368 transitions. Word has length 83 [2024-10-13 23:38:42,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:38:42,825 INFO L471 AbstractCegarLoop]: Abstraction has 3490 states and 5368 transitions. [2024-10-13 23:38:42,825 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 2 states have internal predecessors, (83), 0 states have call successors, (0), 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-13 23:38:42,825 INFO L276 IsEmpty]: Start isEmpty. Operand 3490 states and 5368 transitions. [2024-10-13 23:38:42,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-10-13 23:38:42,827 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:38:42,827 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-13 23:38:42,827 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 23:38:42,827 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:38:42,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:38:42,828 INFO L85 PathProgramCache]: Analyzing trace with hash -1795843832, now seen corresponding path program 1 times [2024-10-13 23:38:42,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:38:42,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966786660] [2024-10-13 23:38:42,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:38:42,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:38:42,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:38:42,931 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 23:38:42,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:38:42,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966786660] [2024-10-13 23:38:42,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1966786660] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:38:42,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:38:42,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 23:38:42,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148623634] [2024-10-13 23:38:42,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:38:42,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:38:42,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:38:42,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:38:42,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:38:42,935 INFO L87 Difference]: Start difference. First operand 3490 states and 5368 transitions. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 2 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:38:46,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:38:46,103 INFO L93 Difference]: Finished difference Result 10168 states and 15699 transitions. [2024-10-13 23:38:46,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:38:46,103 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 2 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85 [2024-10-13 23:38:46,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:38:46,120 INFO L225 Difference]: With dead ends: 10168 [2024-10-13 23:38:46,120 INFO L226 Difference]: Without dead ends: 6679 [2024-10-13 23:38:46,125 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-13 23:38:46,126 INFO L432 NwaCegarLoop]: 712 mSDtfsCounter, 977 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 2534 mSolverCounterSat, 775 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 977 SdHoareTripleChecker+Valid, 845 SdHoareTripleChecker+Invalid, 3309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 775 IncrementalHoareTripleChecker+Valid, 2534 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-10-13 23:38:46,127 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [977 Valid, 845 Invalid, 3309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [775 Valid, 2534 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-10-13 23:38:46,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6679 states. [2024-10-13 23:38:46,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6679 to 6668. [2024-10-13 23:38:46,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6668 states, 6667 states have (on average 1.3752812359382032) internal successors, (9169), 6667 states have internal predecessors, (9169), 0 states have call successors, (0), 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-13 23:38:46,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6668 states to 6668 states and 9169 transitions. [2024-10-13 23:38:46,202 INFO L78 Accepts]: Start accepts. Automaton has 6668 states and 9169 transitions. Word has length 85 [2024-10-13 23:38:46,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:38:46,203 INFO L471 AbstractCegarLoop]: Abstraction has 6668 states and 9169 transitions. [2024-10-13 23:38:46,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 2 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:38:46,203 INFO L276 IsEmpty]: Start isEmpty. Operand 6668 states and 9169 transitions. [2024-10-13 23:38:46,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-10-13 23:38:46,205 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:38:46,205 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:38:46,205 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 23:38:46,205 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:38:46,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:38:46,207 INFO L85 PathProgramCache]: Analyzing trace with hash -2096419818, now seen corresponding path program 1 times [2024-10-13 23:38:46,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:38:46,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425360823] [2024-10-13 23:38:46,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:38:46,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:38:46,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:38:46,552 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 23:38:46,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:38:46,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425360823] [2024-10-13 23:38:46,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [425360823] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:38:46,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:38:46,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 23:38:46,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120407713] [2024-10-13 23:38:46,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:38:46,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:38:46,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:38:46,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:38:46,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:38:46,555 INFO L87 Difference]: Start difference. First operand 6668 states and 9169 transitions. Second operand has 3 states, 3 states have (on average 43.0) internal successors, (129), 2 states have internal predecessors, (129), 0 states have call successors, (0), 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-13 23:38:49,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:38:49,216 INFO L93 Difference]: Finished difference Result 14122 states and 19184 transitions. [2024-10-13 23:38:49,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:38:49,216 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.0) internal successors, (129), 2 states have internal predecessors, (129), 0 states have call successors, (0), 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 129 [2024-10-13 23:38:49,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:38:49,233 INFO L225 Difference]: With dead ends: 14122 [2024-10-13 23:38:49,233 INFO L226 Difference]: Without dead ends: 7455 [2024-10-13 23:38:49,238 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-13 23:38:49,239 INFO L432 NwaCegarLoop]: 1084 mSDtfsCounter, 678 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 2524 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 678 SdHoareTripleChecker+Valid, 1213 SdHoareTripleChecker+Invalid, 2578 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 2524 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-10-13 23:38:49,239 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [678 Valid, 1213 Invalid, 2578 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 2524 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-10-13 23:38:49,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7455 states. [2024-10-13 23:38:49,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7455 to 7455. [2024-10-13 23:38:49,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7455 states, 7454 states have (on average 1.3363294875234772) internal successors, (9961), 7454 states have internal predecessors, (9961), 0 states have call successors, (0), 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-13 23:38:49,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7455 states to 7455 states and 9961 transitions. [2024-10-13 23:38:49,318 INFO L78 Accepts]: Start accepts. Automaton has 7455 states and 9961 transitions. Word has length 129 [2024-10-13 23:38:49,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:38:49,318 INFO L471 AbstractCegarLoop]: Abstraction has 7455 states and 9961 transitions. [2024-10-13 23:38:49,319 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.0) internal successors, (129), 2 states have internal predecessors, (129), 0 states have call successors, (0), 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-13 23:38:49,319 INFO L276 IsEmpty]: Start isEmpty. Operand 7455 states and 9961 transitions. [2024-10-13 23:38:49,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-10-13 23:38:49,320 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:38:49,320 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:38:49,320 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 23:38:49,321 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:38:49,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:38:49,321 INFO L85 PathProgramCache]: Analyzing trace with hash 552859904, now seen corresponding path program 1 times [2024-10-13 23:38:49,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:38:49,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041689260] [2024-10-13 23:38:49,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:38:49,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:38:49,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:38:49,715 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 23:38:49,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:38:49,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041689260] [2024-10-13 23:38:49,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041689260] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 23:38:49,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1615574269] [2024-10-13 23:38:49,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:38:49,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 23:38:49,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 23:38:49,719 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 23:38:49,723 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-13 23:38:49,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:38:49,796 INFO L255 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 23:38:49,801 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 23:38:49,958 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-13 23:38:49,958 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 23:38:49,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1615574269] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:38:49,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 23:38:49,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2024-10-13 23:38:49,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585761641] [2024-10-13 23:38:49,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:38:49,962 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:38:49,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:38:49,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:38:49,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-13 23:38:49,962 INFO L87 Difference]: Start difference. First operand 7455 states and 9961 transitions. Second operand has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 2 states have internal predecessors, (128), 0 states have call successors, (0), 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-13 23:38:53,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:38:53,149 INFO L93 Difference]: Finished difference Result 19655 states and 26990 transitions. [2024-10-13 23:38:53,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:38:53,153 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 2 states have internal predecessors, (128), 0 states have call successors, (0), 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 143 [2024-10-13 23:38:53,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:38:53,196 INFO L225 Difference]: With dead ends: 19655 [2024-10-13 23:38:53,196 INFO L226 Difference]: Without dead ends: 12988 [2024-10-13 23:38:53,203 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-13 23:38:53,204 INFO L432 NwaCegarLoop]: 1069 mSDtfsCounter, 737 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 2527 mSolverCounterSat, 779 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 737 SdHoareTripleChecker+Valid, 1220 SdHoareTripleChecker+Invalid, 3306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 779 IncrementalHoareTripleChecker+Valid, 2527 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-10-13 23:38:53,204 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [737 Valid, 1220 Invalid, 3306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [779 Valid, 2527 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-10-13 23:38:53,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12988 states. [2024-10-13 23:38:53,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12988 to 12971. [2024-10-13 23:38:53,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12971 states, 12970 states have (on average 1.235929067077872) internal successors, (16030), 12970 states have internal predecessors, (16030), 0 states have call successors, (0), 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-13 23:38:53,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12971 states to 12971 states and 16030 transitions. [2024-10-13 23:38:53,358 INFO L78 Accepts]: Start accepts. Automaton has 12971 states and 16030 transitions. Word has length 143 [2024-10-13 23:38:53,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:38:53,359 INFO L471 AbstractCegarLoop]: Abstraction has 12971 states and 16030 transitions. [2024-10-13 23:38:53,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 2 states have internal predecessors, (128), 0 states have call successors, (0), 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-13 23:38:53,360 INFO L276 IsEmpty]: Start isEmpty. Operand 12971 states and 16030 transitions. [2024-10-13 23:38:53,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2024-10-13 23:38:53,364 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:38:53,364 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 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-13 23:38:53,378 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-13 23:38:53,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-10-13 23:38:53,565 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:38:53,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:38:53,566 INFO L85 PathProgramCache]: Analyzing trace with hash -2104096943, now seen corresponding path program 1 times [2024-10-13 23:38:53,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:38:53,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068937964] [2024-10-13 23:38:53,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:38:53,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:38:53,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:38:53,794 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2024-10-13 23:38:53,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:38:53,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068937964] [2024-10-13 23:38:53,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1068937964] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:38:53,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:38:53,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 23:38:53,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313548024] [2024-10-13 23:38:53,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:38:53,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:38:53,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:38:53,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:38:53,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:38:53,797 INFO L87 Difference]: Start difference. First operand 12971 states and 16030 transitions. Second operand has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 2 states have internal predecessors, (136), 0 states have call successors, (0), 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-13 23:38:56,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:38:56,567 INFO L93 Difference]: Finished difference Result 22791 states and 28650 transitions. [2024-10-13 23:38:56,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:38:56,568 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 2 states have internal predecessors, (136), 0 states have call successors, (0), 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 230 [2024-10-13 23:38:56,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:38:56,586 INFO L225 Difference]: With dead ends: 22791 [2024-10-13 23:38:56,587 INFO L226 Difference]: Without dead ends: 12979 [2024-10-13 23:38:56,595 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-13 23:38:56,596 INFO L432 NwaCegarLoop]: 1025 mSDtfsCounter, 728 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 2715 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 728 SdHoareTripleChecker+Valid, 1209 SdHoareTripleChecker+Invalid, 2719 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 2715 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-10-13 23:38:56,597 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [728 Valid, 1209 Invalid, 2719 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 2715 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-10-13 23:38:56,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12979 states. [2024-10-13 23:38:56,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12979 to 12971. [2024-10-13 23:38:56,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12971 states, 12970 states have (on average 1.2347725520431765) internal successors, (16015), 12970 states have internal predecessors, (16015), 0 states have call successors, (0), 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-13 23:38:56,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12971 states to 12971 states and 16015 transitions. [2024-10-13 23:38:56,802 INFO L78 Accepts]: Start accepts. Automaton has 12971 states and 16015 transitions. Word has length 230 [2024-10-13 23:38:56,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:38:56,803 INFO L471 AbstractCegarLoop]: Abstraction has 12971 states and 16015 transitions. [2024-10-13 23:38:56,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 2 states have internal predecessors, (136), 0 states have call successors, (0), 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-13 23:38:56,803 INFO L276 IsEmpty]: Start isEmpty. Operand 12971 states and 16015 transitions. [2024-10-13 23:38:56,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2024-10-13 23:38:56,805 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:38:56,805 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 23:38:56,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-13 23:38:56,807 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:38:56,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:38:56,808 INFO L85 PathProgramCache]: Analyzing trace with hash 1090410935, now seen corresponding path program 1 times [2024-10-13 23:38:56,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:38:56,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346121342] [2024-10-13 23:38:56,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:38:56,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:38:56,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:38:56,945 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 23:38:56,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:38:56,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346121342] [2024-10-13 23:38:56,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1346121342] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:38:56,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:38:56,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:38:56,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596474418] [2024-10-13 23:38:56,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:38:56,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:38:56,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:38:56,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:38:56,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:38:56,947 INFO L87 Difference]: Start difference. First operand 12971 states and 16015 transitions. Second operand has 3 states, 3 states have (on average 77.33333333333333) internal successors, (232), 3 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:38:59,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:38:59,919 INFO L93 Difference]: Finished difference Result 36165 states and 45133 transitions. [2024-10-13 23:38:59,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:38:59,920 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 77.33333333333333) internal successors, (232), 3 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 232 [2024-10-13 23:38:59,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:38:59,954 INFO L225 Difference]: With dead ends: 36165 [2024-10-13 23:38:59,955 INFO L226 Difference]: Without dead ends: 23195 [2024-10-13 23:38:59,969 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-13 23:38:59,969 INFO L432 NwaCegarLoop]: 1849 mSDtfsCounter, 841 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 2480 mSolverCounterSat, 807 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 841 SdHoareTripleChecker+Valid, 1986 SdHoareTripleChecker+Invalid, 3287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 807 IncrementalHoareTripleChecker+Valid, 2480 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-10-13 23:38:59,970 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [841 Valid, 1986 Invalid, 3287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [807 Valid, 2480 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-10-13 23:38:59,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23195 states. [2024-10-13 23:39:00,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23195 to 22403. [2024-10-13 23:39:00,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22403 states, 22402 states have (on average 1.1931970359789303) internal successors, (26730), 22402 states have internal predecessors, (26730), 0 states have call successors, (0), 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-13 23:39:00,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22403 states to 22403 states and 26730 transitions. [2024-10-13 23:39:00,174 INFO L78 Accepts]: Start accepts. Automaton has 22403 states and 26730 transitions. Word has length 232 [2024-10-13 23:39:00,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:39:00,174 INFO L471 AbstractCegarLoop]: Abstraction has 22403 states and 26730 transitions. [2024-10-13 23:39:00,174 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 77.33333333333333) internal successors, (232), 3 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:39:00,175 INFO L276 IsEmpty]: Start isEmpty. Operand 22403 states and 26730 transitions. [2024-10-13 23:39:00,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2024-10-13 23:39:00,177 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:39:00,177 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:39:00,177 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-13 23:39:00,177 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:39:00,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:39:00,178 INFO L85 PathProgramCache]: Analyzing trace with hash 853892039, now seen corresponding path program 1 times [2024-10-13 23:39:00,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:39:00,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969164565] [2024-10-13 23:39:00,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:39:00,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:39:00,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:39:00,289 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 238 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-10-13 23:39:00,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:39:00,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969164565] [2024-10-13 23:39:00,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [969164565] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:39:00,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:39:00,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:39:00,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670259573] [2024-10-13 23:39:00,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:39:00,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:39:00,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:39:00,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:39:00,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:39:00,293 INFO L87 Difference]: Start difference. First operand 22403 states and 26730 transitions. Second operand has 3 states, 3 states have (on average 79.33333333333333) internal successors, (238), 3 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:39:03,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:39:03,559 INFO L93 Difference]: Finished difference Result 55045 states and 66947 transitions. [2024-10-13 23:39:03,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:39:03,560 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 79.33333333333333) internal successors, (238), 3 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 254 [2024-10-13 23:39:03,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:39:03,596 INFO L225 Difference]: With dead ends: 55045 [2024-10-13 23:39:03,596 INFO L226 Difference]: Without dead ends: 33430 [2024-10-13 23:39:03,612 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-13 23:39:03,613 INFO L432 NwaCegarLoop]: 808 mSDtfsCounter, 881 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 2385 mSolverCounterSat, 903 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 881 SdHoareTripleChecker+Valid, 926 SdHoareTripleChecker+Invalid, 3288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 903 IncrementalHoareTripleChecker+Valid, 2385 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-10-13 23:39:03,613 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [881 Valid, 926 Invalid, 3288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [903 Valid, 2385 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-10-13 23:39:03,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33430 states. [2024-10-13 23:39:04,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33430 to 32634. [2024-10-13 23:39:04,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32634 states, 32633 states have (on average 1.1761407164526707) internal successors, (38381), 32633 states have internal predecessors, (38381), 0 states have call successors, (0), 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-13 23:39:04,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32634 states to 32634 states and 38381 transitions. [2024-10-13 23:39:04,112 INFO L78 Accepts]: Start accepts. Automaton has 32634 states and 38381 transitions. Word has length 254 [2024-10-13 23:39:04,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:39:04,113 INFO L471 AbstractCegarLoop]: Abstraction has 32634 states and 38381 transitions. [2024-10-13 23:39:04,113 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 79.33333333333333) internal successors, (238), 3 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:39:04,113 INFO L276 IsEmpty]: Start isEmpty. Operand 32634 states and 38381 transitions. [2024-10-13 23:39:04,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 310 [2024-10-13 23:39:04,117 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:39:04,118 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-13 23:39:04,118 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-13 23:39:04,118 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:39:04,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:39:04,119 INFO L85 PathProgramCache]: Analyzing trace with hash 259643358, now seen corresponding path program 1 times [2024-10-13 23:39:04,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:39:04,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496642191] [2024-10-13 23:39:04,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:39:04,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:39:04,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:39:04,350 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2024-10-13 23:39:04,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:39:04,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496642191] [2024-10-13 23:39:04,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1496642191] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:39:04,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:39:04,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:39:04,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828588238] [2024-10-13 23:39:04,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:39:04,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:39:04,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:39:04,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:39:04,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:39:04,352 INFO L87 Difference]: Start difference. First operand 32634 states and 38381 transitions. Second operand has 3 states, 3 states have (on average 62.0) internal successors, (186), 3 states have internal predecessors, (186), 0 states have call successors, (0), 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-13 23:39:07,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:39:07,847 INFO L93 Difference]: Finished difference Result 76293 states and 91192 transitions. [2024-10-13 23:39:07,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:39:07,848 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 62.0) internal successors, (186), 3 states have internal predecessors, (186), 0 states have call successors, (0), 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 309 [2024-10-13 23:39:07,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:39:07,956 INFO L225 Difference]: With dead ends: 76293 [2024-10-13 23:39:07,957 INFO L226 Difference]: Without dead ends: 44447 [2024-10-13 23:39:08,006 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:39:08,011 INFO L432 NwaCegarLoop]: 1804 mSDtfsCounter, 845 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 2551 mSolverCounterSat, 723 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 845 SdHoareTripleChecker+Valid, 1947 SdHoareTripleChecker+Invalid, 3274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 723 IncrementalHoareTripleChecker+Valid, 2551 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2024-10-13 23:39:08,011 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [845 Valid, 1947 Invalid, 3274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [723 Valid, 2551 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2024-10-13 23:39:08,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44447 states. [2024-10-13 23:39:08,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44447 to 43656. [2024-10-13 23:39:08,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43656 states, 43655 states have (on average 1.1516664757759707) internal successors, (50276), 43655 states have internal predecessors, (50276), 0 states have call successors, (0), 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-13 23:39:08,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43656 states to 43656 states and 50276 transitions. [2024-10-13 23:39:08,726 INFO L78 Accepts]: Start accepts. Automaton has 43656 states and 50276 transitions. Word has length 309 [2024-10-13 23:39:08,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:39:08,726 INFO L471 AbstractCegarLoop]: Abstraction has 43656 states and 50276 transitions. [2024-10-13 23:39:08,727 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 62.0) internal successors, (186), 3 states have internal predecessors, (186), 0 states have call successors, (0), 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-13 23:39:08,727 INFO L276 IsEmpty]: Start isEmpty. Operand 43656 states and 50276 transitions. [2024-10-13 23:39:08,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2024-10-13 23:39:08,734 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:39:08,734 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:39:08,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-13 23:39:08,734 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:39:08,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:39:08,738 INFO L85 PathProgramCache]: Analyzing trace with hash 692274144, now seen corresponding path program 1 times [2024-10-13 23:39:08,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:39:08,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768249702] [2024-10-13 23:39:08,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:39:08,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:39:08,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:39:09,745 INFO L134 CoverageAnalysis]: Checked inductivity of 292 backedges. 165 proven. 110 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-10-13 23:39:09,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:39:09,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768249702] [2024-10-13 23:39:09,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768249702] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 23:39:09,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [813566317] [2024-10-13 23:39:09,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:39:09,747 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 23:39:09,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 23:39:09,752 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 23:39:09,755 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-13 23:39:09,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:39:09,868 INFO L255 TraceCheckSpWp]: Trace formula consists of 459 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 23:39:09,877 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 23:39:09,965 INFO L134 CoverageAnalysis]: Checked inductivity of 292 backedges. 179 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2024-10-13 23:39:09,965 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 23:39:09,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [813566317] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:39:09,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 23:39:09,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2024-10-13 23:39:09,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410436276] [2024-10-13 23:39:09,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:39:09,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:39:09,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:39:09,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:39:09,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-13 23:39:09,967 INFO L87 Difference]: Start difference. First operand 43656 states and 50276 transitions. Second operand has 3 states, 3 states have (on average 70.66666666666667) internal successors, (212), 3 states have internal predecessors, (212), 0 states have call successors, (0), 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-13 23:39:12,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:39:12,930 INFO L93 Difference]: Finished difference Result 86515 states and 99751 transitions. [2024-10-13 23:39:12,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:39:12,931 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 70.66666666666667) internal successors, (212), 3 states have internal predecessors, (212), 0 states have call successors, (0), 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 324 [2024-10-13 23:39:12,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:39:13,001 INFO L225 Difference]: With dead ends: 86515 [2024-10-13 23:39:13,001 INFO L226 Difference]: Without dead ends: 43647 [2024-10-13 23:39:13,053 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 328 GetRequests, 323 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-13 23:39:13,054 INFO L432 NwaCegarLoop]: 687 mSDtfsCounter, 1075 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 2396 mSolverCounterSat, 527 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1075 SdHoareTripleChecker+Valid, 816 SdHoareTripleChecker+Invalid, 2923 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 527 IncrementalHoareTripleChecker+Valid, 2396 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-10-13 23:39:13,054 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1075 Valid, 816 Invalid, 2923 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [527 Valid, 2396 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-10-13 23:39:13,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43647 states. [2024-10-13 23:39:13,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43647 to 43646. [2024-10-13 23:39:13,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43646 states, 43645 states have (on average 1.1132775804788635) internal successors, (48589), 43645 states have internal predecessors, (48589), 0 states have call successors, (0), 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-13 23:39:13,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43646 states to 43646 states and 48589 transitions. [2024-10-13 23:39:13,769 INFO L78 Accepts]: Start accepts. Automaton has 43646 states and 48589 transitions. Word has length 324 [2024-10-13 23:39:13,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:39:13,769 INFO L471 AbstractCegarLoop]: Abstraction has 43646 states and 48589 transitions. [2024-10-13 23:39:13,769 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 70.66666666666667) internal successors, (212), 3 states have internal predecessors, (212), 0 states have call successors, (0), 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-13 23:39:13,770 INFO L276 IsEmpty]: Start isEmpty. Operand 43646 states and 48589 transitions. [2024-10-13 23:39:13,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 344 [2024-10-13 23:39:13,775 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:39:13,775 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:39:13,789 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-13 23:39:13,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-10-13 23:39:13,976 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:39:13,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:39:13,977 INFO L85 PathProgramCache]: Analyzing trace with hash 1432506898, now seen corresponding path program 1 times [2024-10-13 23:39:13,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:39:13,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994321610] [2024-10-13 23:39:13,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:39:13,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:39:14,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:39:14,388 INFO L134 CoverageAnalysis]: Checked inductivity of 500 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 433 trivial. 0 not checked. [2024-10-13 23:39:14,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:39:14,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994321610] [2024-10-13 23:39:14,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994321610] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:39:14,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:39:14,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:39:14,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158283607] [2024-10-13 23:39:14,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:39:14,388 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:39:14,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:39:14,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:39:14,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:39:14,389 INFO L87 Difference]: Start difference. First operand 43646 states and 48589 transitions. Second operand has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 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-13 23:39:17,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:39:17,132 INFO L93 Difference]: Finished difference Result 86502 states and 96384 transitions. [2024-10-13 23:39:17,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:39:17,132 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 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 343 [2024-10-13 23:39:17,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:39:17,172 INFO L225 Difference]: With dead ends: 86502 [2024-10-13 23:39:17,172 INFO L226 Difference]: Without dead ends: 43644 [2024-10-13 23:39:17,197 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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-13 23:39:17,197 INFO L432 NwaCegarLoop]: 1340 mSDtfsCounter, 1183 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 2464 mSolverCounterSat, 444 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1183 SdHoareTripleChecker+Valid, 1418 SdHoareTripleChecker+Invalid, 2908 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 444 IncrementalHoareTripleChecker+Valid, 2464 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-10-13 23:39:17,197 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1183 Valid, 1418 Invalid, 2908 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [444 Valid, 2464 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-10-13 23:39:17,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43644 states. [2024-10-13 23:39:17,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43644 to 43643. [2024-10-13 23:39:17,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43643 states, 43642 states have (on average 1.0865908986755877) internal successors, (47421), 43642 states have internal predecessors, (47421), 0 states have call successors, (0), 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-13 23:39:17,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43643 states to 43643 states and 47421 transitions. [2024-10-13 23:39:17,689 INFO L78 Accepts]: Start accepts. Automaton has 43643 states and 47421 transitions. Word has length 343 [2024-10-13 23:39:17,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:39:17,689 INFO L471 AbstractCegarLoop]: Abstraction has 43643 states and 47421 transitions. [2024-10-13 23:39:17,689 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 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-13 23:39:17,689 INFO L276 IsEmpty]: Start isEmpty. Operand 43643 states and 47421 transitions. [2024-10-13 23:39:17,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 367 [2024-10-13 23:39:17,695 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:39:17,695 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:39:17,695 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-13 23:39:17,695 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:39:17,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:39:17,696 INFO L85 PathProgramCache]: Analyzing trace with hash -1958894111, now seen corresponding path program 1 times [2024-10-13 23:39:17,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:39:17,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087925468] [2024-10-13 23:39:17,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:39:17,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:39:17,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:39:17,844 INFO L134 CoverageAnalysis]: Checked inductivity of 523 backedges. 424 proven. 0 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2024-10-13 23:39:17,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:39:17,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087925468] [2024-10-13 23:39:17,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087925468] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:39:17,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:39:17,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:39:17,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629663343] [2024-10-13 23:39:17,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:39:17,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 23:39:17,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:39:17,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 23:39:17,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 23:39:17,846 INFO L87 Difference]: Start difference. First operand 43643 states and 47421 transitions. Second operand has 4 states, 4 states have (on average 71.5) internal successors, (286), 3 states have internal predecessors, (286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:39:23,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:39:23,639 INFO L93 Difference]: Finished difference Result 150459 states and 163809 transitions. [2024-10-13 23:39:23,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 23:39:23,640 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 71.5) internal successors, (286), 3 states have internal predecessors, (286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 366 [2024-10-13 23:39:23,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:39:23,751 INFO L225 Difference]: With dead ends: 150459 [2024-10-13 23:39:23,751 INFO L226 Difference]: Without dead ends: 107604 [2024-10-13 23:39:23,785 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-13 23:39:23,786 INFO L432 NwaCegarLoop]: 564 mSDtfsCounter, 1705 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 6637 mSolverCounterSat, 1034 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1705 SdHoareTripleChecker+Valid, 799 SdHoareTripleChecker+Invalid, 7671 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1034 IncrementalHoareTripleChecker+Valid, 6637 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2024-10-13 23:39:23,786 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1705 Valid, 799 Invalid, 7671 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1034 Valid, 6637 Invalid, 0 Unknown, 0 Unchecked, 5.4s Time] [2024-10-13 23:39:23,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107604 states. [2024-10-13 23:39:24,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107604 to 104325. [2024-10-13 23:39:24,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104325 states, 104324 states have (on average 1.0794448065641655) internal successors, (112612), 104324 states have internal predecessors, (112612), 0 states have call successors, (0), 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-13 23:39:25,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104325 states to 104325 states and 112612 transitions. [2024-10-13 23:39:25,280 INFO L78 Accepts]: Start accepts. Automaton has 104325 states and 112612 transitions. Word has length 366 [2024-10-13 23:39:25,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:39:25,281 INFO L471 AbstractCegarLoop]: Abstraction has 104325 states and 112612 transitions. [2024-10-13 23:39:25,281 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 71.5) internal successors, (286), 3 states have internal predecessors, (286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:39:25,281 INFO L276 IsEmpty]: Start isEmpty. Operand 104325 states and 112612 transitions. [2024-10-13 23:39:25,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 410 [2024-10-13 23:39:25,290 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:39:25,290 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:39:25,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-13 23:39:25,293 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:39:25,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:39:25,294 INFO L85 PathProgramCache]: Analyzing trace with hash 2137838249, now seen corresponding path program 1 times [2024-10-13 23:39:25,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:39:25,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393334897] [2024-10-13 23:39:25,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:39:25,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:39:25,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:39:26,674 INFO L134 CoverageAnalysis]: Checked inductivity of 543 backedges. 331 proven. 113 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2024-10-13 23:39:26,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:39:26,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393334897] [2024-10-13 23:39:26,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393334897] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 23:39:26,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1476808177] [2024-10-13 23:39:26,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:39:26,675 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 23:39:26,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 23:39:26,677 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 23:39:26,680 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-13 23:39:26,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:39:26,796 INFO L255 TraceCheckSpWp]: Trace formula consists of 573 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 23:39:26,801 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 23:39:27,315 INFO L134 CoverageAnalysis]: Checked inductivity of 543 backedges. 331 proven. 0 refuted. 0 times theorem prover too weak. 212 trivial. 0 not checked. [2024-10-13 23:39:27,317 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 23:39:27,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1476808177] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:39:27,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 23:39:27,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [7] total 8 [2024-10-13 23:39:27,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440937944] [2024-10-13 23:39:27,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:39:27,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:39:27,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:39:27,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:39:27,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-10-13 23:39:27,320 INFO L87 Difference]: Start difference. First operand 104325 states and 112612 transitions. Second operand has 3 states, 3 states have (on average 72.33333333333333) internal successors, (217), 2 states have internal predecessors, (217), 0 states have call successors, (0), 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-13 23:39:30,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:39:30,025 INFO L93 Difference]: Finished difference Result 202357 states and 218744 transitions. [2024-10-13 23:39:30,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:39:30,026 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 72.33333333333333) internal successors, (217), 2 states have internal predecessors, (217), 0 states have call successors, (0), 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 409 [2024-10-13 23:39:30,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:39:30,139 INFO L225 Difference]: With dead ends: 202357 [2024-10-13 23:39:30,139 INFO L226 Difference]: Without dead ends: 108271 [2024-10-13 23:39:30,186 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 415 GetRequests, 408 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-10-13 23:39:30,187 INFO L432 NwaCegarLoop]: 1031 mSDtfsCounter, 683 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 2464 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 683 SdHoareTripleChecker+Valid, 1165 SdHoareTripleChecker+Invalid, 2576 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 2464 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-10-13 23:39:30,187 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [683 Valid, 1165 Invalid, 2576 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 2464 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-10-13 23:39:30,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108271 states. [2024-10-13 23:39:31,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108271 to 106687. [2024-10-13 23:39:31,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106687 states, 106686 states have (on average 1.0717619931387437) internal successors, (114342), 106686 states have internal predecessors, (114342), 0 states have call successors, (0), 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-13 23:39:31,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106687 states to 106687 states and 114342 transitions. [2024-10-13 23:39:31,591 INFO L78 Accepts]: Start accepts. Automaton has 106687 states and 114342 transitions. Word has length 409 [2024-10-13 23:39:31,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:39:31,591 INFO L471 AbstractCegarLoop]: Abstraction has 106687 states and 114342 transitions. [2024-10-13 23:39:31,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 72.33333333333333) internal successors, (217), 2 states have internal predecessors, (217), 0 states have call successors, (0), 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-13 23:39:31,591 INFO L276 IsEmpty]: Start isEmpty. Operand 106687 states and 114342 transitions. [2024-10-13 23:39:31,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 456 [2024-10-13 23:39:31,597 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:39:31,597 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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] [2024-10-13 23:39:31,612 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-13 23:39:31,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 23:39:31,801 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:39:31,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:39:31,802 INFO L85 PathProgramCache]: Analyzing trace with hash 1367269932, now seen corresponding path program 1 times [2024-10-13 23:39:31,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:39:31,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584538899] [2024-10-13 23:39:31,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:39:31,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:39:31,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:39:32,191 INFO L134 CoverageAnalysis]: Checked inductivity of 866 backedges. 679 proven. 0 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2024-10-13 23:39:32,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:39:32,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584538899] [2024-10-13 23:39:32,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1584538899] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:39:32,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:39:32,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:39:32,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698247721] [2024-10-13 23:39:32,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:39:32,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:39:32,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:39:32,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:39:32,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:39:32,193 INFO L87 Difference]: Start difference. First operand 106687 states and 114342 transitions. Second operand has 3 states, 3 states have (on average 96.0) internal successors, (288), 3 states have internal predecessors, (288), 0 states have call successors, (0), 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-13 23:39:35,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:39:35,264 INFO L93 Difference]: Finished difference Result 214165 states and 229486 transitions. [2024-10-13 23:39:35,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:39:35,264 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 96.0) internal successors, (288), 3 states have internal predecessors, (288), 0 states have call successors, (0), 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 455 [2024-10-13 23:39:35,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:39:35,537 INFO L225 Difference]: With dead ends: 214165 [2024-10-13 23:39:35,537 INFO L226 Difference]: Without dead ends: 108266 [2024-10-13 23:39:35,583 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-13 23:39:35,583 INFO L432 NwaCegarLoop]: 1349 mSDtfsCounter, 938 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 2397 mSolverCounterSat, 583 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 938 SdHoareTripleChecker+Valid, 1433 SdHoareTripleChecker+Invalid, 2980 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 583 IncrementalHoareTripleChecker+Valid, 2397 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-10-13 23:39:35,584 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [938 Valid, 1433 Invalid, 2980 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [583 Valid, 2397 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-10-13 23:39:35,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108266 states. [2024-10-13 23:39:36,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108266 to 106677. [2024-10-13 23:39:36,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106677 states, 106676 states have (on average 1.0612133938280401) internal successors, (113206), 106676 states have internal predecessors, (113206), 0 states have call successors, (0), 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-13 23:39:36,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106677 states to 106677 states and 113206 transitions. [2024-10-13 23:39:36,783 INFO L78 Accepts]: Start accepts. Automaton has 106677 states and 113206 transitions. Word has length 455 [2024-10-13 23:39:36,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:39:36,784 INFO L471 AbstractCegarLoop]: Abstraction has 106677 states and 113206 transitions. [2024-10-13 23:39:36,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 96.0) internal successors, (288), 3 states have internal predecessors, (288), 0 states have call successors, (0), 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-13 23:39:36,784 INFO L276 IsEmpty]: Start isEmpty. Operand 106677 states and 113206 transitions. [2024-10-13 23:39:36,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 480 [2024-10-13 23:39:36,793 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:39:36,794 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:39:36,794 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-13 23:39:36,794 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:39:36,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:39:36,794 INFO L85 PathProgramCache]: Analyzing trace with hash 1960972138, now seen corresponding path program 1 times [2024-10-13 23:39:36,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:39:36,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258508461] [2024-10-13 23:39:36,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:39:36,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:39:36,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:39:37,083 INFO L134 CoverageAnalysis]: Checked inductivity of 833 backedges. 655 proven. 0 refuted. 0 times theorem prover too weak. 178 trivial. 0 not checked. [2024-10-13 23:39:37,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:39:37,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258508461] [2024-10-13 23:39:37,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [258508461] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:39:37,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:39:37,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:39:37,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77814725] [2024-10-13 23:39:37,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:39:37,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:39:37,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:39:37,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:39:37,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:39:37,086 INFO L87 Difference]: Start difference. First operand 106677 states and 113206 transitions. Second operand has 3 states, 3 states have (on average 101.33333333333333) internal successors, (304), 3 states have internal predecessors, (304), 0 states have call successors, (0), 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-13 23:39:40,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:39:40,456 INFO L93 Difference]: Finished difference Result 237755 states and 253281 transitions. [2024-10-13 23:39:40,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:39:40,457 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 101.33333333333333) internal successors, (304), 3 states have internal predecessors, (304), 0 states have call successors, (0), 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 479 [2024-10-13 23:39:40,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:39:40,602 INFO L225 Difference]: With dead ends: 237755 [2024-10-13 23:39:40,603 INFO L226 Difference]: Without dead ends: 131866 [2024-10-13 23:39:40,634 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-13 23:39:40,635 INFO L432 NwaCegarLoop]: 664 mSDtfsCounter, 875 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 2345 mSolverCounterSat, 739 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 875 SdHoareTripleChecker+Valid, 743 SdHoareTripleChecker+Invalid, 3084 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 739 IncrementalHoareTripleChecker+Valid, 2345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-10-13 23:39:40,635 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [875 Valid, 743 Invalid, 3084 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [739 Valid, 2345 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-10-13 23:39:40,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131866 states. [2024-10-13 23:39:42,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131866 to 130273. [2024-10-13 23:39:42,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130273 states, 130272 states have (on average 1.0593220338983051) internal successors, (138000), 130272 states have internal predecessors, (138000), 0 states have call successors, (0), 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-13 23:39:42,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130273 states to 130273 states and 138000 transitions. [2024-10-13 23:39:42,264 INFO L78 Accepts]: Start accepts. Automaton has 130273 states and 138000 transitions. Word has length 479 [2024-10-13 23:39:42,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:39:42,264 INFO L471 AbstractCegarLoop]: Abstraction has 130273 states and 138000 transitions. [2024-10-13 23:39:42,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 101.33333333333333) internal successors, (304), 3 states have internal predecessors, (304), 0 states have call successors, (0), 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-13 23:39:42,265 INFO L276 IsEmpty]: Start isEmpty. Operand 130273 states and 138000 transitions. [2024-10-13 23:39:42,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 497 [2024-10-13 23:39:42,276 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:39:42,276 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:39:42,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-13 23:39:42,277 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:39:42,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:39:42,277 INFO L85 PathProgramCache]: Analyzing trace with hash -756631509, now seen corresponding path program 1 times [2024-10-13 23:39:42,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:39:42,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263644942] [2024-10-13 23:39:42,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:39:42,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:39:42,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:39:42,531 INFO L134 CoverageAnalysis]: Checked inductivity of 866 backedges. 326 proven. 0 refuted. 0 times theorem prover too weak. 540 trivial. 0 not checked. [2024-10-13 23:39:42,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:39:42,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263644942] [2024-10-13 23:39:42,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [263644942] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:39:42,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:39:42,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 23:39:42,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608764876] [2024-10-13 23:39:42,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:39:42,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:39:42,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:39:42,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:39:42,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:39:42,534 INFO L87 Difference]: Start difference. First operand 130273 states and 138000 transitions. Second operand has 3 states, 3 states have (on average 71.66666666666667) internal successors, (215), 2 states have internal predecessors, (215), 0 states have call successors, (0), 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-13 23:39:44,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:39:44,649 INFO L93 Difference]: Finished difference Result 245570 states and 260680 transitions. [2024-10-13 23:39:44,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:39:44,650 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 71.66666666666667) internal successors, (215), 2 states have internal predecessors, (215), 0 states have call successors, (0), 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 496 [2024-10-13 23:39:44,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:39:44,789 INFO L225 Difference]: With dead ends: 245570 [2024-10-13 23:39:44,789 INFO L226 Difference]: Without dead ends: 129470 [2024-10-13 23:39:44,848 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-13 23:39:44,849 INFO L432 NwaCegarLoop]: 292 mSDtfsCounter, 1610 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1464 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1610 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 1476 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1464 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-13 23:39:44,849 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1610 Valid, 292 Invalid, 1476 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1464 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-13 23:39:44,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129470 states. [2024-10-13 23:39:46,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129470 to 129469. [2024-10-13 23:39:46,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129469 states, 129468 states have (on average 1.0591420273735594) internal successors, (137125), 129468 states have internal predecessors, (137125), 0 states have call successors, (0), 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-13 23:39:46,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129469 states to 129469 states and 137125 transitions. [2024-10-13 23:39:46,435 INFO L78 Accepts]: Start accepts. Automaton has 129469 states and 137125 transitions. Word has length 496 [2024-10-13 23:39:46,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:39:46,435 INFO L471 AbstractCegarLoop]: Abstraction has 129469 states and 137125 transitions. [2024-10-13 23:39:46,435 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 71.66666666666667) internal successors, (215), 2 states have internal predecessors, (215), 0 states have call successors, (0), 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-13 23:39:46,436 INFO L276 IsEmpty]: Start isEmpty. Operand 129469 states and 137125 transitions. [2024-10-13 23:39:46,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 499 [2024-10-13 23:39:46,441 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:39:46,441 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:39:46,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-13 23:39:46,442 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:39:46,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:39:46,442 INFO L85 PathProgramCache]: Analyzing trace with hash -1126311793, now seen corresponding path program 1 times [2024-10-13 23:39:46,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:39:46,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060266268] [2024-10-13 23:39:46,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:39:46,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:39:46,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:39:46,952 INFO L134 CoverageAnalysis]: Checked inductivity of 921 backedges. 632 proven. 0 refuted. 0 times theorem prover too weak. 289 trivial. 0 not checked. [2024-10-13 23:39:46,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:39:46,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060266268] [2024-10-13 23:39:46,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2060266268] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:39:46,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:39:46,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:39:46,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040581912] [2024-10-13 23:39:46,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:39:46,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:39:46,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:39:46,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:39:46,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:39:46,955 INFO L87 Difference]: Start difference. First operand 129469 states and 137125 transitions. Second operand has 3 states, 3 states have (on average 100.0) internal successors, (300), 3 states have internal predecessors, (300), 0 states have call successors, (0), 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-13 23:39:50,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:39:50,552 INFO L93 Difference]: Finished difference Result 258953 states and 274252 transitions. [2024-10-13 23:39:50,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:39:50,553 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 100.0) internal successors, (300), 3 states have internal predecessors, (300), 0 states have call successors, (0), 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 498 [2024-10-13 23:39:50,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:39:50,690 INFO L225 Difference]: With dead ends: 258953 [2024-10-13 23:39:50,691 INFO L226 Difference]: Without dead ends: 128698 [2024-10-13 23:39:50,734 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-13 23:39:50,735 INFO L432 NwaCegarLoop]: 1659 mSDtfsCounter, 791 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 2439 mSolverCounterSat, 404 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 791 SdHoareTripleChecker+Valid, 1797 SdHoareTripleChecker+Invalid, 2843 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 404 IncrementalHoareTripleChecker+Valid, 2439 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-10-13 23:39:50,735 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [791 Valid, 1797 Invalid, 2843 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [404 Valid, 2439 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-10-13 23:39:50,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128698 states. [2024-10-13 23:39:51,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128698 to 127106. [2024-10-13 23:39:51,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127106 states, 127105 states have (on average 1.046017072499115) internal successors, (132954), 127105 states have internal predecessors, (132954), 0 states have call successors, (0), 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-13 23:39:51,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127106 states to 127106 states and 132954 transitions. [2024-10-13 23:39:51,939 INFO L78 Accepts]: Start accepts. Automaton has 127106 states and 132954 transitions. Word has length 498 [2024-10-13 23:39:51,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:39:51,939 INFO L471 AbstractCegarLoop]: Abstraction has 127106 states and 132954 transitions. [2024-10-13 23:39:51,939 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 100.0) internal successors, (300), 3 states have internal predecessors, (300), 0 states have call successors, (0), 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-13 23:39:51,939 INFO L276 IsEmpty]: Start isEmpty. Operand 127106 states and 132954 transitions. [2024-10-13 23:39:51,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 508 [2024-10-13 23:39:51,944 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:39:51,945 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:39:51,945 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-13 23:39:51,945 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:39:51,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:39:51,949 INFO L85 PathProgramCache]: Analyzing trace with hash 1855309537, now seen corresponding path program 1 times [2024-10-13 23:39:51,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:39:51,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313091495] [2024-10-13 23:39:51,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:39:51,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:39:52,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:39:52,635 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 591 proven. 0 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2024-10-13 23:39:52,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:39:52,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313091495] [2024-10-13 23:39:52,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313091495] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:39:52,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:39:52,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:39:52,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21967823] [2024-10-13 23:39:52,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:39:52,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:39:52,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:39:52,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:39:52,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:39:52,637 INFO L87 Difference]: Start difference. First operand 127106 states and 132954 transitions. Second operand has 3 states, 3 states have (on average 110.66666666666667) internal successors, (332), 3 states have internal predecessors, (332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)