./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem18_label51.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4f9af400 extending candidate: java ['java'] extending candidate: /usr/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/oracle-jdk-bin-*/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/openjdk-*/bin/java ['java', '/usr/bin/java'] extending candidate: /usr/lib/jvm/java-*-openjdk-amd64/bin/java ['java', '/usr/bin/java', '/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java', '/usr/lib/jvm/java-17-openjdk-amd64/bin/java', '/usr/lib/jvm/java-11-openjdk-amd64/bin/java', '/usr/lib/jvm/java-1.17.0-openjdk-amd64/bin/java'] ['/root/.sdkman/candidates/java/21.0.5-tem/bin/java', '-Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config', '-Xmx15G', '-Xms4m', '-jar', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar', '-data', '@noDefault', '-ultimatedata', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data', '-tc', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml', '-i', '../sv-benchmarks/c/eca-rers2012/Problem18_label51.c', '-s', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf', '--cacsl2boogietranslator.entry.function', 'main', '--witnessprinter.witness.directory', '/storage/repos/ultimate-jdk21/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())) )\n\n', '--witnessprinter.graph.data.producer', 'Automizer', '--witnessprinter.graph.data.architecture', '32bit', '--witnessprinter.graph.data.programhash', 'b09204eec7fef585004b69b471b657e04a2a46cceef0cdf26e228e2dd271c194'] Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem18_label51.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 b09204eec7fef585004b69b471b657e04a2a46cceef0cdf26e228e2dd271c194 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-06 20:14:40,426 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-06 20:14:40,516 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-06 20:14:40,519 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-06 20:14:40,519 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-06 20:14:40,540 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-06 20:14:40,541 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-06 20:14:40,541 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-06 20:14:40,542 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-06 20:14:40,542 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-06 20:14:40,542 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-06 20:14:40,542 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-06 20:14:40,543 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-06 20:14:40,543 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-06 20:14:40,543 INFO L153 SettingsManager]: * Use SBE=true [2024-11-06 20:14:40,544 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-06 20:14:40,544 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-06 20:14:40,544 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-06 20:14:40,544 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-06 20:14:40,544 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-06 20:14:40,544 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-06 20:14:40,544 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-06 20:14:40,544 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-06 20:14:40,544 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-06 20:14:40,544 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-06 20:14:40,544 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-06 20:14:40,544 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-06 20:14:40,545 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-06 20:14:40,545 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-06 20:14:40,545 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-06 20:14:40,545 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-06 20:14:40,545 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-06 20:14:40,545 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 20:14:40,545 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-06 20:14:40,545 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-06 20:14:40,546 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-06 20:14:40,546 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-06 20:14:40,546 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-06 20:14:40,546 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-06 20:14:40,546 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-06 20:14:40,546 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-06 20:14:40,546 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-06 20:14:40,546 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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-jdk21/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 -> b09204eec7fef585004b69b471b657e04a2a46cceef0cdf26e228e2dd271c194 [2024-11-06 20:14:40,764 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-06 20:14:40,770 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-06 20:14:40,772 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-06 20:14:40,772 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-06 20:14:40,772 INFO L274 PluginConnector]: CDTParser initialized [2024-11-06 20:14:40,773 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem18_label51.c [2024-11-06 20:14:41,854 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-06 20:14:42,167 INFO L384 CDTParser]: Found 1 translation units. [2024-11-06 20:14:42,169 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem18_label51.c [2024-11-06 20:14:42,189 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b362cf6c8/16f10b0d0add4938ae454dc1df92fdaf/FLAG495d3d8cf [2024-11-06 20:14:42,423 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b362cf6c8/16f10b0d0add4938ae454dc1df92fdaf [2024-11-06 20:14:42,425 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-06 20:14:42,426 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-06 20:14:42,426 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-06 20:14:42,429 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-06 20:14:42,432 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-06 20:14:42,432 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 08:14:42" (1/1) ... [2024-11-06 20:14:42,434 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6dcbe383 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:14:42, skipping insertion in model container [2024-11-06 20:14:42,434 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 08:14:42" (1/1) ... [2024-11-06 20:14:42,489 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-06 20:14:42,630 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem18_label51.c[6263,6276] [2024-11-06 20:14:42,930 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 20:14:42,937 INFO L200 MainTranslator]: Completed pre-run [2024-11-06 20:14:42,953 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem18_label51.c[6263,6276] [2024-11-06 20:14:43,138 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 20:14:43,152 INFO L204 MainTranslator]: Completed translation [2024-11-06 20:14:43,153 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:14:43 WrapperNode [2024-11-06 20:14:43,154 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-06 20:14:43,154 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-06 20:14:43,155 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-06 20:14:43,155 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-06 20:14:43,171 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:14:43" (1/1) ... [2024-11-06 20:14:43,200 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:14:43" (1/1) ... [2024-11-06 20:14:43,335 INFO L138 Inliner]: procedures = 16, calls = 10, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 4135 [2024-11-06 20:14:43,336 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-06 20:14:43,336 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-06 20:14:43,336 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-06 20:14:43,336 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-06 20:14:43,363 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:14:43" (1/1) ... [2024-11-06 20:14:43,364 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:14:43" (1/1) ... [2024-11-06 20:14:43,387 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:14:43" (1/1) ... [2024-11-06 20:14:43,461 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-11-06 20:14:43,461 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:14:43" (1/1) ... [2024-11-06 20:14:43,461 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:14:43" (1/1) ... [2024-11-06 20:14:43,535 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:14:43" (1/1) ... [2024-11-06 20:14:43,579 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:14:43" (1/1) ... [2024-11-06 20:14:43,590 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:14:43" (1/1) ... [2024-11-06 20:14:43,600 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:14:43" (1/1) ... [2024-11-06 20:14:43,617 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-06 20:14:43,618 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-06 20:14:43,618 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-06 20:14:43,619 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-06 20:14:43,620 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:14:43" (1/1) ... [2024-11-06 20:14:43,625 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 20:14:43,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 20:14:43,643 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-06 20:14:43,646 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-06 20:14:43,662 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-06 20:14:43,662 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-06 20:14:43,662 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-06 20:14:43,662 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-06 20:14:43,718 INFO L238 CfgBuilder]: Building ICFG [2024-11-06 20:14:43,719 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-06 20:14:46,290 INFO L? ?]: Removed 639 outVars from TransFormulas that were not future-live. [2024-11-06 20:14:46,290 INFO L287 CfgBuilder]: Performing block encoding [2024-11-06 20:14:46,317 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-06 20:14:46,321 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-06 20:14:46,321 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 08:14:46 BoogieIcfgContainer [2024-11-06 20:14:46,322 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-06 20:14:46,323 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-06 20:14:46,323 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-06 20:14:46,327 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-06 20:14:46,327 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 08:14:42" (1/3) ... [2024-11-06 20:14:46,327 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@340df3f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 08:14:46, skipping insertion in model container [2024-11-06 20:14:46,328 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:14:43" (2/3) ... [2024-11-06 20:14:46,328 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@340df3f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 08:14:46, skipping insertion in model container [2024-11-06 20:14:46,328 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 08:14:46" (3/3) ... [2024-11-06 20:14:46,329 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem18_label51.c [2024-11-06 20:14:46,338 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-06 20:14:46,338 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-06 20:14:46,385 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-06 20:14:46,395 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;@d237160, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-06 20:14:46,395 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-06 20:14:46,400 INFO L276 IsEmpty]: Start isEmpty. Operand has 757 states, 755 states have (on average 1.9125827814569536) internal successors, (1444), 756 states have internal predecessors, (1444), 0 states have call successors, (0), 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-11-06 20:14:46,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-06 20:14:46,406 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 20:14:46,406 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 20:14:46,407 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 20:14:46,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 20:14:46,410 INFO L85 PathProgramCache]: Analyzing trace with hash -634083006, now seen corresponding path program 1 times [2024-11-06 20:14:46,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 20:14:46,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246753549] [2024-11-06 20:14:46,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:14:46,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 20:14:46,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:14:46,689 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 20:14:46,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 20:14:46,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246753549] [2024-11-06 20:14:46,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246753549] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 20:14:46,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 20:14:46,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 20:14:46,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843921020] [2024-11-06 20:14:46,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 20:14:46,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 20:14:46,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 20:14:46,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 20:14:46,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 20:14:46,715 INFO L87 Difference]: Start difference. First operand has 757 states, 755 states have (on average 1.9125827814569536) internal successors, (1444), 756 states have internal predecessors, (1444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 2 states have internal predecessors, (60), 0 states have call successors, (0), 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-11-06 20:14:49,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 20:14:49,050 INFO L93 Difference]: Finished difference Result 2221 states and 4282 transitions. [2024-11-06 20:14:49,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 20:14:49,052 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 2 states have internal predecessors, (60), 0 states have call successors, (0), 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 60 [2024-11-06 20:14:49,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 20:14:49,062 INFO L225 Difference]: With dead ends: 2221 [2024-11-06 20:14:49,062 INFO L226 Difference]: Without dead ends: 1384 [2024-11-06 20:14:49,065 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-11-06 20:14:49,066 INFO L432 NwaCegarLoop]: 478 mSDtfsCounter, 735 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 2069 mSolverCounterSat, 717 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 735 SdHoareTripleChecker+Valid, 487 SdHoareTripleChecker+Invalid, 2786 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 717 IncrementalHoareTripleChecker+Valid, 2069 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-06 20:14:49,067 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [735 Valid, 487 Invalid, 2786 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [717 Valid, 2069 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-06 20:14:49,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1384 states. [2024-11-06 20:14:49,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1384 to 1384. [2024-11-06 20:14:49,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1384 states, 1383 states have (on average 1.5994215473608098) internal successors, (2212), 1383 states have internal predecessors, (2212), 0 states have call successors, (0), 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-11-06 20:14:49,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1384 states to 1384 states and 2212 transitions. [2024-11-06 20:14:49,143 INFO L78 Accepts]: Start accepts. Automaton has 1384 states and 2212 transitions. Word has length 60 [2024-11-06 20:14:49,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 20:14:49,143 INFO L471 AbstractCegarLoop]: Abstraction has 1384 states and 2212 transitions. [2024-11-06 20:14:49,143 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 2 states have internal predecessors, (60), 0 states have call successors, (0), 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-11-06 20:14:49,143 INFO L276 IsEmpty]: Start isEmpty. Operand 1384 states and 2212 transitions. [2024-11-06 20:14:49,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-06 20:14:49,145 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 20:14:49,146 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 20:14:49,146 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-06 20:14:49,146 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 20:14:49,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 20:14:49,147 INFO L85 PathProgramCache]: Analyzing trace with hash -2118723022, now seen corresponding path program 1 times [2024-11-06 20:14:49,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 20:14:49,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653892033] [2024-11-06 20:14:49,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:14:49,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 20:14:49,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:14:49,326 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 20:14:49,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 20:14:49,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653892033] [2024-11-06 20:14:49,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [653892033] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 20:14:49,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 20:14:49,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 20:14:49,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330492291] [2024-11-06 20:14:49,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 20:14:49,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 20:14:49,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 20:14:49,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 20:14:49,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 20:14:49,329 INFO L87 Difference]: Start difference. First operand 1384 states and 2212 transitions. Second operand has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 2 states have internal predecessors, (125), 0 states have call successors, (0), 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-11-06 20:14:51,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 20:14:51,487 INFO L93 Difference]: Finished difference Result 4146 states and 6631 transitions. [2024-11-06 20:14:51,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 20:14:51,488 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 2 states have internal predecessors, (125), 0 states have call successors, (0), 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 125 [2024-11-06 20:14:51,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 20:14:51,497 INFO L225 Difference]: With dead ends: 4146 [2024-11-06 20:14:51,498 INFO L226 Difference]: Without dead ends: 2764 [2024-11-06 20:14:51,502 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-11-06 20:14:51,504 INFO L432 NwaCegarLoop]: 524 mSDtfsCounter, 714 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 1701 mSolverCounterSat, 918 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 714 SdHoareTripleChecker+Valid, 529 SdHoareTripleChecker+Invalid, 2619 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 918 IncrementalHoareTripleChecker+Valid, 1701 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-06 20:14:51,505 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [714 Valid, 529 Invalid, 2619 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [918 Valid, 1701 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-06 20:14:51,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2764 states. [2024-11-06 20:14:51,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2764 to 2764. [2024-11-06 20:14:51,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2764 states, 2763 states have (on average 1.3503438291711907) internal successors, (3731), 2763 states have internal predecessors, (3731), 0 states have call successors, (0), 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-11-06 20:14:51,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2764 states to 2764 states and 3731 transitions. [2024-11-06 20:14:51,550 INFO L78 Accepts]: Start accepts. Automaton has 2764 states and 3731 transitions. Word has length 125 [2024-11-06 20:14:51,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 20:14:51,552 INFO L471 AbstractCegarLoop]: Abstraction has 2764 states and 3731 transitions. [2024-11-06 20:14:51,552 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 2 states have internal predecessors, (125), 0 states have call successors, (0), 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-11-06 20:14:51,552 INFO L276 IsEmpty]: Start isEmpty. Operand 2764 states and 3731 transitions. [2024-11-06 20:14:51,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2024-11-06 20:14:51,557 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 20:14:51,558 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 20:14:51,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-06 20:14:51,558 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 20:14:51,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 20:14:51,561 INFO L85 PathProgramCache]: Analyzing trace with hash -566419061, now seen corresponding path program 1 times [2024-11-06 20:14:51,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 20:14:51,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53210552] [2024-11-06 20:14:51,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:14:51,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 20:14:51,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:14:52,014 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2024-11-06 20:14:52,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 20:14:52,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53210552] [2024-11-06 20:14:52,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53210552] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 20:14:52,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 20:14:52,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 20:14:52,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922537838] [2024-11-06 20:14:52,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 20:14:52,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-06 20:14:52,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 20:14:52,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-06 20:14:52,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-06 20:14:52,016 INFO L87 Difference]: Start difference. First operand 2764 states and 3731 transitions. Second operand has 4 states, 4 states have (on average 46.5) 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-11-06 20:14:54,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 20:14:54,748 INFO L93 Difference]: Finished difference Result 7596 states and 9794 transitions. [2024-11-06 20:14:54,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-06 20:14:54,748 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 46.5) 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 243 [2024-11-06 20:14:54,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 20:14:54,761 INFO L225 Difference]: With dead ends: 7596 [2024-11-06 20:14:54,761 INFO L226 Difference]: Without dead ends: 4834 [2024-11-06 20:14:54,764 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-06 20:14:54,767 INFO L432 NwaCegarLoop]: 624 mSDtfsCounter, 1873 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 4348 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1873 SdHoareTripleChecker+Valid, 641 SdHoareTripleChecker+Invalid, 4465 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 4348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-06 20:14:54,768 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1873 Valid, 641 Invalid, 4465 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 4348 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-11-06 20:14:54,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4834 states. [2024-11-06 20:14:54,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4834 to 4144. [2024-11-06 20:14:54,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4144 states, 4143 states have (on average 1.2698527636978034) internal successors, (5261), 4143 states have internal predecessors, (5261), 0 states have call successors, (0), 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-11-06 20:14:54,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4144 states to 4144 states and 5261 transitions. [2024-11-06 20:14:54,818 INFO L78 Accepts]: Start accepts. Automaton has 4144 states and 5261 transitions. Word has length 243 [2024-11-06 20:14:54,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 20:14:54,819 INFO L471 AbstractCegarLoop]: Abstraction has 4144 states and 5261 transitions. [2024-11-06 20:14:54,819 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 46.5) 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-11-06 20:14:54,819 INFO L276 IsEmpty]: Start isEmpty. Operand 4144 states and 5261 transitions. [2024-11-06 20:14:54,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 360 [2024-11-06 20:14:54,823 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 20:14:54,824 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-06 20:14:54,824 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-06 20:14:54,825 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 20:14:54,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 20:14:54,826 INFO L85 PathProgramCache]: Analyzing trace with hash -1228911640, now seen corresponding path program 1 times [2024-11-06 20:14:54,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 20:14:54,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081180330] [2024-11-06 20:14:54,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:14:54,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 20:14:54,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:14:55,214 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 41 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-06 20:14:55,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 20:14:55,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081180330] [2024-11-06 20:14:55,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081180330] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 20:14:55,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [361811256] [2024-11-06 20:14:55,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:14:55,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 20:14:55,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 20:14:55,217 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-06 20:14:55,219 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-06 20:14:55,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:14:55,316 INFO L255 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-06 20:14:55,326 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 20:14:55,693 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2024-11-06 20:14:55,693 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 20:14:55,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [361811256] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 20:14:55,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-06 20:14:55,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2024-11-06 20:14:55,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909658438] [2024-11-06 20:14:55,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 20:14:55,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 20:14:55,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 20:14:55,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 20:14:55,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-06 20:14:55,695 INFO L87 Difference]: Start difference. First operand 4144 states and 5261 transitions. Second operand has 3 states, 3 states have (on average 101.0) internal successors, (303), 2 states have internal predecessors, (303), 0 states have call successors, (0), 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-11-06 20:14:57,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 20:14:57,521 INFO L93 Difference]: Finished difference Result 12426 states and 15778 transitions. [2024-11-06 20:14:57,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 20:14:57,522 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 101.0) internal successors, (303), 2 states have internal predecessors, (303), 0 states have call successors, (0), 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 359 [2024-11-06 20:14:57,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 20:14:57,539 INFO L225 Difference]: With dead ends: 12426 [2024-11-06 20:14:57,539 INFO L226 Difference]: Without dead ends: 8284 [2024-11-06 20:14:57,544 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 361 GetRequests, 358 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-06 20:14:57,544 INFO L432 NwaCegarLoop]: 544 mSDtfsCounter, 398 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2331 mSolverCounterSat, 457 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 398 SdHoareTripleChecker+Valid, 550 SdHoareTripleChecker+Invalid, 2788 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 457 IncrementalHoareTripleChecker+Valid, 2331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-06 20:14:57,544 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [398 Valid, 550 Invalid, 2788 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [457 Valid, 2331 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-06 20:14:57,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8284 states. [2024-11-06 20:14:57,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8284 to 6904. [2024-11-06 20:14:57,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6904 states, 6903 states have (on average 1.2358394900767782) internal successors, (8531), 6903 states have internal predecessors, (8531), 0 states have call successors, (0), 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-11-06 20:14:57,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6904 states to 6904 states and 8531 transitions. [2024-11-06 20:14:57,647 INFO L78 Accepts]: Start accepts. Automaton has 6904 states and 8531 transitions. Word has length 359 [2024-11-06 20:14:57,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 20:14:57,648 INFO L471 AbstractCegarLoop]: Abstraction has 6904 states and 8531 transitions. [2024-11-06 20:14:57,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 101.0) internal successors, (303), 2 states have internal predecessors, (303), 0 states have call successors, (0), 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-11-06 20:14:57,649 INFO L276 IsEmpty]: Start isEmpty. Operand 6904 states and 8531 transitions. [2024-11-06 20:14:57,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 430 [2024-11-06 20:14:57,653 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 20:14:57,653 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-06 20:14:57,667 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-06 20:14:57,857 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 20:14:57,858 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 20:14:57,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 20:14:57,858 INFO L85 PathProgramCache]: Analyzing trace with hash 469551034, now seen corresponding path program 1 times [2024-11-06 20:14:57,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 20:14:57,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410328112] [2024-11-06 20:14:57,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:14:57,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 20:14:57,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:14:58,206 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 344 proven. 0 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2024-11-06 20:14:58,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 20:14:58,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410328112] [2024-11-06 20:14:58,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410328112] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 20:14:58,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 20:14:58,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 20:14:58,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098969647] [2024-11-06 20:14:58,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 20:14:58,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-06 20:14:58,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 20:14:58,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-06 20:14:58,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-06 20:14:58,208 INFO L87 Difference]: Start difference. First operand 6904 states and 8531 transitions. Second operand has 4 states, 4 states have (on average 88.75) internal successors, (355), 3 states have internal predecessors, (355), 0 states have call successors, (0), 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-11-06 20:15:00,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 20:15:00,004 INFO L93 Difference]: Finished difference Result 15239 states and 18535 transitions. [2024-11-06 20:15:00,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-06 20:15:00,005 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 88.75) internal successors, (355), 3 states have internal predecessors, (355), 0 states have call successors, (0), 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 429 [2024-11-06 20:15:00,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 20:15:00,022 INFO L225 Difference]: With dead ends: 15239 [2024-11-06 20:15:00,023 INFO L226 Difference]: Without dead ends: 8284 [2024-11-06 20:15:00,028 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-11-06 20:15:00,029 INFO L432 NwaCegarLoop]: 625 mSDtfsCounter, 529 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 2590 mSolverCounterSat, 381 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 529 SdHoareTripleChecker+Valid, 637 SdHoareTripleChecker+Invalid, 2971 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 381 IncrementalHoareTripleChecker+Valid, 2590 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-06 20:15:00,030 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [529 Valid, 637 Invalid, 2971 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [381 Valid, 2590 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-06 20:15:00,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8284 states. [2024-11-06 20:15:00,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8284 to 8284. [2024-11-06 20:15:00,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8284 states, 8283 states have (on average 1.154291923216226) internal successors, (9561), 8283 states have internal predecessors, (9561), 0 states have call successors, (0), 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-11-06 20:15:00,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8284 states to 8284 states and 9561 transitions. [2024-11-06 20:15:00,125 INFO L78 Accepts]: Start accepts. Automaton has 8284 states and 9561 transitions. Word has length 429 [2024-11-06 20:15:00,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 20:15:00,125 INFO L471 AbstractCegarLoop]: Abstraction has 8284 states and 9561 transitions. [2024-11-06 20:15:00,126 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 88.75) internal successors, (355), 3 states have internal predecessors, (355), 0 states have call successors, (0), 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-11-06 20:15:00,126 INFO L276 IsEmpty]: Start isEmpty. Operand 8284 states and 9561 transitions. [2024-11-06 20:15:00,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 445 [2024-11-06 20:15:00,130 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 20:15:00,130 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-06 20:15:00,130 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-06 20:15:00,130 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 20:15:00,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 20:15:00,131 INFO L85 PathProgramCache]: Analyzing trace with hash -151353574, now seen corresponding path program 1 times [2024-11-06 20:15:00,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 20:15:00,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330882021] [2024-11-06 20:15:00,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:15:00,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 20:15:00,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:15:00,382 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-06 20:15:00,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 20:15:00,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330882021] [2024-11-06 20:15:00,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1330882021] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 20:15:00,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 20:15:00,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 20:15:00,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296691922] [2024-11-06 20:15:00,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 20:15:00,384 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 20:15:00,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 20:15:00,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 20:15:00,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 20:15:00,385 INFO L87 Difference]: Start difference. First operand 8284 states and 9561 transitions. Second operand has 3 states, 3 states have (on average 120.33333333333333) internal successors, (361), 2 states have internal predecessors, (361), 0 states have call successors, (0), 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-11-06 20:15:01,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 20:15:01,798 INFO L93 Difference]: Finished difference Result 20016 states and 22949 transitions. [2024-11-06 20:15:01,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 20:15:01,799 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 120.33333333333333) internal successors, (361), 2 states have internal predecessors, (361), 0 states have call successors, (0), 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 444 [2024-11-06 20:15:01,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 20:15:01,821 INFO L225 Difference]: With dead ends: 20016 [2024-11-06 20:15:01,822 INFO L226 Difference]: Without dead ends: 11734 [2024-11-06 20:15:01,828 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-11-06 20:15:01,828 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 466 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 1791 mSolverCounterSat, 517 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 466 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 2308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 517 IncrementalHoareTripleChecker+Valid, 1791 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-06 20:15:01,828 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [466 Valid, 77 Invalid, 2308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [517 Valid, 1791 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-06 20:15:01,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11734 states. [2024-11-06 20:15:01,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11734 to 11734. [2024-11-06 20:15:01,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11734 states, 11733 states have (on average 1.119151112247507) internal successors, (13131), 11733 states have internal predecessors, (13131), 0 states have call successors, (0), 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-11-06 20:15:02,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11734 states to 11734 states and 13131 transitions. [2024-11-06 20:15:02,005 INFO L78 Accepts]: Start accepts. Automaton has 11734 states and 13131 transitions. Word has length 444 [2024-11-06 20:15:02,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 20:15:02,018 INFO L471 AbstractCegarLoop]: Abstraction has 11734 states and 13131 transitions. [2024-11-06 20:15:02,018 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 120.33333333333333) internal successors, (361), 2 states have internal predecessors, (361), 0 states have call successors, (0), 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-11-06 20:15:02,022 INFO L276 IsEmpty]: Start isEmpty. Operand 11734 states and 13131 transitions. [2024-11-06 20:15:02,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 453 [2024-11-06 20:15:02,034 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 20:15:02,034 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-06 20:15:02,035 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-06 20:15:02,035 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 20:15:02,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 20:15:02,035 INFO L85 PathProgramCache]: Analyzing trace with hash 1540429062, now seen corresponding path program 1 times [2024-11-06 20:15:02,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 20:15:02,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147323836] [2024-11-06 20:15:02,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:15:02,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 20:15:02,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:15:02,381 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 207 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 20:15:02,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 20:15:02,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147323836] [2024-11-06 20:15:02,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147323836] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 20:15:02,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 20:15:02,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 20:15:02,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878064087] [2024-11-06 20:15:02,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 20:15:02,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 20:15:02,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 20:15:02,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 20:15:02,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 20:15:02,385 INFO L87 Difference]: Start difference. First operand 11734 states and 13131 transitions. Second operand has 3 states, 3 states have (on average 150.66666666666666) internal successors, (452), 3 states have internal predecessors, (452), 0 states have call successors, (0), 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-11-06 20:15:03,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 20:15:03,918 INFO L93 Difference]: Finished difference Result 32436 states and 36566 transitions. [2024-11-06 20:15:03,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 20:15:03,919 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 150.66666666666666) internal successors, (452), 3 states have internal predecessors, (452), 0 states have call successors, (0), 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 452 [2024-11-06 20:15:03,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 20:15:03,965 INFO L225 Difference]: With dead ends: 32436 [2024-11-06 20:15:03,966 INFO L226 Difference]: Without dead ends: 20704 [2024-11-06 20:15:03,982 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-11-06 20:15:03,983 INFO L432 NwaCegarLoop]: 972 mSDtfsCounter, 601 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1955 mSolverCounterSat, 349 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 601 SdHoareTripleChecker+Valid, 978 SdHoareTripleChecker+Invalid, 2304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 349 IncrementalHoareTripleChecker+Valid, 1955 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-06 20:15:03,984 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [601 Valid, 978 Invalid, 2304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [349 Valid, 1955 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-06 20:15:04,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20704 states. [2024-11-06 20:15:04,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20704 to 20704. [2024-11-06 20:15:04,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20704 states, 20703 states have (on average 1.0932232043665169) internal successors, (22633), 20703 states have internal predecessors, (22633), 0 states have call successors, (0), 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-11-06 20:15:04,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20704 states to 20704 states and 22633 transitions. [2024-11-06 20:15:04,227 INFO L78 Accepts]: Start accepts. Automaton has 20704 states and 22633 transitions. Word has length 452 [2024-11-06 20:15:04,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 20:15:04,228 INFO L471 AbstractCegarLoop]: Abstraction has 20704 states and 22633 transitions. [2024-11-06 20:15:04,228 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 150.66666666666666) internal successors, (452), 3 states have internal predecessors, (452), 0 states have call successors, (0), 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-11-06 20:15:04,228 INFO L276 IsEmpty]: Start isEmpty. Operand 20704 states and 22633 transitions. [2024-11-06 20:15:04,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 460 [2024-11-06 20:15:04,230 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 20:15:04,231 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-06 20:15:04,231 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-06 20:15:04,231 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 20:15:04,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 20:15:04,231 INFO L85 PathProgramCache]: Analyzing trace with hash 544603993, now seen corresponding path program 1 times [2024-11-06 20:15:04,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 20:15:04,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520921483] [2024-11-06 20:15:04,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:15:04,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 20:15:04,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:15:04,419 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2024-11-06 20:15:04,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 20:15:04,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520921483] [2024-11-06 20:15:04,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [520921483] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 20:15:04,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 20:15:04,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 20:15:04,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928147307] [2024-11-06 20:15:04,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 20:15:04,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 20:15:04,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 20:15:04,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 20:15:04,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 20:15:04,421 INFO L87 Difference]: Start difference. First operand 20704 states and 22633 transitions. Second operand has 3 states, 3 states have (on average 122.66666666666667) internal successors, (368), 3 states have internal predecessors, (368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 20:15:06,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 20:15:06,079 INFO L93 Difference]: Finished difference Result 48306 states and 53266 transitions. [2024-11-06 20:15:06,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 20:15:06,080 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 122.66666666666667) internal successors, (368), 3 states have internal predecessors, (368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 459 [2024-11-06 20:15:06,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 20:15:06,117 INFO L225 Difference]: With dead ends: 48306 [2024-11-06 20:15:06,117 INFO L226 Difference]: Without dead ends: 27604 [2024-11-06 20:15:06,130 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-11-06 20:15:06,131 INFO L432 NwaCegarLoop]: 1111 mSDtfsCounter, 640 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 1874 mSolverCounterSat, 495 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 640 SdHoareTripleChecker+Valid, 1118 SdHoareTripleChecker+Invalid, 2369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 495 IncrementalHoareTripleChecker+Valid, 1874 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-06 20:15:06,131 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [640 Valid, 1118 Invalid, 2369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [495 Valid, 1874 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-06 20:15:06,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27604 states. [2024-11-06 20:15:06,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27604 to 26914. [2024-11-06 20:15:06,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26914 states, 26913 states have (on average 1.0879129045442724) internal successors, (29279), 26913 states have internal predecessors, (29279), 0 states have call successors, (0), 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-11-06 20:15:06,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26914 states to 26914 states and 29279 transitions. [2024-11-06 20:15:06,384 INFO L78 Accepts]: Start accepts. Automaton has 26914 states and 29279 transitions. Word has length 459 [2024-11-06 20:15:06,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 20:15:06,384 INFO L471 AbstractCegarLoop]: Abstraction has 26914 states and 29279 transitions. [2024-11-06 20:15:06,384 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 122.66666666666667) internal successors, (368), 3 states have internal predecessors, (368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 20:15:06,385 INFO L276 IsEmpty]: Start isEmpty. Operand 26914 states and 29279 transitions. [2024-11-06 20:15:06,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2024-11-06 20:15:06,387 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 20:15:06,387 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-06 20:15:06,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-06 20:15:06,387 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 20:15:06,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 20:15:06,388 INFO L85 PathProgramCache]: Analyzing trace with hash -2072982020, now seen corresponding path program 1 times [2024-11-06 20:15:06,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 20:15:06,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983227132] [2024-11-06 20:15:06,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:15:06,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 20:15:06,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:15:06,643 INFO L134 CoverageAnalysis]: Checked inductivity of 232 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2024-11-06 20:15:06,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 20:15:06,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983227132] [2024-11-06 20:15:06,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1983227132] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 20:15:06,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 20:15:06,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 20:15:06,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129923464] [2024-11-06 20:15:06,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 20:15:06,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 20:15:06,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 20:15:06,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 20:15:06,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 20:15:06,645 INFO L87 Difference]: Start difference. First operand 26914 states and 29279 transitions. Second operand has 3 states, 3 states have (on average 122.66666666666667) internal successors, (368), 3 states have internal predecessors, (368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 20:15:08,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 20:15:08,264 INFO L93 Difference]: Finished difference Result 60036 states and 66062 transitions. [2024-11-06 20:15:08,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 20:15:08,265 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 122.66666666666667) internal successors, (368), 3 states have internal predecessors, (368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 484 [2024-11-06 20:15:08,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 20:15:08,301 INFO L225 Difference]: With dead ends: 60036 [2024-11-06 20:15:08,301 INFO L226 Difference]: Without dead ends: 33124 [2024-11-06 20:15:08,317 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-11-06 20:15:08,319 INFO L432 NwaCegarLoop]: 925 mSDtfsCounter, 671 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 1975 mSolverCounterSat, 290 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 671 SdHoareTripleChecker+Valid, 932 SdHoareTripleChecker+Invalid, 2265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 290 IncrementalHoareTripleChecker+Valid, 1975 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-06 20:15:08,319 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [671 Valid, 932 Invalid, 2265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [290 Valid, 1975 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-06 20:15:08,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33124 states. [2024-11-06 20:15:08,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33124 to 33124. [2024-11-06 20:15:08,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33124 states, 33123 states have (on average 1.0809407360444405) internal successors, (35804), 33123 states have internal predecessors, (35804), 0 states have call successors, (0), 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-11-06 20:15:08,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33124 states to 33124 states and 35804 transitions. [2024-11-06 20:15:08,672 INFO L78 Accepts]: Start accepts. Automaton has 33124 states and 35804 transitions. Word has length 484 [2024-11-06 20:15:08,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 20:15:08,672 INFO L471 AbstractCegarLoop]: Abstraction has 33124 states and 35804 transitions. [2024-11-06 20:15:08,672 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 122.66666666666667) internal successors, (368), 3 states have internal predecessors, (368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 20:15:08,672 INFO L276 IsEmpty]: Start isEmpty. Operand 33124 states and 35804 transitions. [2024-11-06 20:15:08,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 554 [2024-11-06 20:15:08,679 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 20:15:08,679 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-06 20:15:08,679 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-06 20:15:08,679 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 20:15:08,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 20:15:08,680 INFO L85 PathProgramCache]: Analyzing trace with hash 1770681774, now seen corresponding path program 1 times [2024-11-06 20:15:08,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 20:15:08,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900858956] [2024-11-06 20:15:08,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:15:08,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 20:15:08,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:15:08,991 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 310 proven. 0 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2024-11-06 20:15:08,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 20:15:08,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900858956] [2024-11-06 20:15:08,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [900858956] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 20:15:08,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 20:15:08,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 20:15:08,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748218096] [2024-11-06 20:15:08,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 20:15:08,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 20:15:08,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 20:15:08,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 20:15:08,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 20:15:08,993 INFO L87 Difference]: Start difference. First operand 33124 states and 35804 transitions. Second operand has 3 states, 3 states have (on average 145.66666666666666) internal successors, (437), 3 states have internal predecessors, (437), 0 states have call successors, (0), 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-11-06 20:15:10,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 20:15:10,440 INFO L93 Difference]: Finished difference Result 77286 states and 84152 transitions. [2024-11-06 20:15:10,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 20:15:10,441 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 145.66666666666666) internal successors, (437), 3 states have internal predecessors, (437), 0 states have call successors, (0), 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 553 [2024-11-06 20:15:10,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 20:15:10,483 INFO L225 Difference]: With dead ends: 77286 [2024-11-06 20:15:10,483 INFO L226 Difference]: Without dead ends: 39334 [2024-11-06 20:15:10,506 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-11-06 20:15:10,508 INFO L432 NwaCegarLoop]: 1088 mSDtfsCounter, 639 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 1706 mSolverCounterSat, 522 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 639 SdHoareTripleChecker+Valid, 1095 SdHoareTripleChecker+Invalid, 2228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 522 IncrementalHoareTripleChecker+Valid, 1706 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-06 20:15:10,508 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [639 Valid, 1095 Invalid, 2228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [522 Valid, 1706 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-06 20:15:10,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39334 states. [2024-11-06 20:15:10,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39334 to 36574. [2024-11-06 20:15:10,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36574 states, 36573 states have (on average 1.0474393678396632) internal successors, (38308), 36573 states have internal predecessors, (38308), 0 states have call successors, (0), 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-11-06 20:15:10,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36574 states to 36574 states and 38308 transitions. [2024-11-06 20:15:10,855 INFO L78 Accepts]: Start accepts. Automaton has 36574 states and 38308 transitions. Word has length 553 [2024-11-06 20:15:10,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 20:15:10,856 INFO L471 AbstractCegarLoop]: Abstraction has 36574 states and 38308 transitions. [2024-11-06 20:15:10,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 145.66666666666666) internal successors, (437), 3 states have internal predecessors, (437), 0 states have call successors, (0), 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-11-06 20:15:10,856 INFO L276 IsEmpty]: Start isEmpty. Operand 36574 states and 38308 transitions. [2024-11-06 20:15:10,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 603 [2024-11-06 20:15:10,860 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 20:15:10,861 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-06 20:15:10,861 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-06 20:15:10,861 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 20:15:10,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 20:15:10,861 INFO L85 PathProgramCache]: Analyzing trace with hash 2108725149, now seen corresponding path program 1 times [2024-11-06 20:15:10,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 20:15:10,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271296572] [2024-11-06 20:15:10,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:15:10,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 20:15:10,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:15:11,152 INFO L134 CoverageAnalysis]: Checked inductivity of 691 backedges. 473 proven. 0 refuted. 0 times theorem prover too weak. 218 trivial. 0 not checked. [2024-11-06 20:15:11,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 20:15:11,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271296572] [2024-11-06 20:15:11,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [271296572] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 20:15:11,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 20:15:11,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 20:15:11,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947654925] [2024-11-06 20:15:11,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 20:15:11,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 20:15:11,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 20:15:11,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 20:15:11,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 20:15:11,155 INFO L87 Difference]: Start difference. First operand 36574 states and 38308 transitions. Second operand has 3 states, 3 states have (on average 150.66666666666666) internal successors, (452), 3 states have internal predecessors, (452), 0 states have call successors, (0), 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-11-06 20:15:12,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 20:15:12,474 INFO L93 Difference]: Finished difference Result 82116 states and 86491 transitions. [2024-11-06 20:15:12,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 20:15:12,475 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 150.66666666666666) internal successors, (452), 3 states have internal predecessors, (452), 0 states have call successors, (0), 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 602 [2024-11-06 20:15:12,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 20:15:12,510 INFO L225 Difference]: With dead ends: 82116 [2024-11-06 20:15:12,510 INFO L226 Difference]: Without dead ends: 42784 [2024-11-06 20:15:12,525 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-11-06 20:15:12,525 INFO L432 NwaCegarLoop]: 932 mSDtfsCounter, 618 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 1659 mSolverCounterSat, 257 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 618 SdHoareTripleChecker+Valid, 939 SdHoareTripleChecker+Invalid, 1916 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 257 IncrementalHoareTripleChecker+Valid, 1659 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-06 20:15:12,526 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [618 Valid, 939 Invalid, 1916 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [257 Valid, 1659 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-06 20:15:12,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42784 states. [2024-11-06 20:15:12,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42784 to 42784. [2024-11-06 20:15:12,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42784 states, 42783 states have (on average 1.044363415375266) internal successors, (44681), 42783 states have internal predecessors, (44681), 0 states have call successors, (0), 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-11-06 20:15:12,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42784 states to 42784 states and 44681 transitions. [2024-11-06 20:15:12,782 INFO L78 Accepts]: Start accepts. Automaton has 42784 states and 44681 transitions. Word has length 602 [2024-11-06 20:15:12,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 20:15:12,783 INFO L471 AbstractCegarLoop]: Abstraction has 42784 states and 44681 transitions. [2024-11-06 20:15:12,783 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 150.66666666666666) internal successors, (452), 3 states have internal predecessors, (452), 0 states have call successors, (0), 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-11-06 20:15:12,783 INFO L276 IsEmpty]: Start isEmpty. Operand 42784 states and 44681 transitions. [2024-11-06 20:15:12,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 735 [2024-11-06 20:15:12,791 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 20:15:12,791 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 20:15:12,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-06 20:15:12,792 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 20:15:12,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 20:15:12,792 INFO L85 PathProgramCache]: Analyzing trace with hash -1376339021, now seen corresponding path program 1 times [2024-11-06 20:15:12,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 20:15:12,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725582030] [2024-11-06 20:15:12,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:15:12,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 20:15:12,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:15:13,179 INFO L134 CoverageAnalysis]: Checked inductivity of 859 backedges. 605 proven. 0 refuted. 0 times theorem prover too weak. 254 trivial. 0 not checked. [2024-11-06 20:15:13,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 20:15:13,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725582030] [2024-11-06 20:15:13,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725582030] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 20:15:13,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 20:15:13,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 20:15:13,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660434229] [2024-11-06 20:15:13,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 20:15:13,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 20:15:13,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 20:15:13,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 20:15:13,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 20:15:13,182 INFO L87 Difference]: Start difference. First operand 42784 states and 44681 transitions. Second operand has 3 states, 3 states have (on average 188.66666666666666) internal successors, (566), 3 states have internal predecessors, (566), 0 states have call successors, (0), 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-11-06 20:15:14,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 20:15:14,662 INFO L93 Difference]: Finished difference Result 95916 states and 100581 transitions. [2024-11-06 20:15:14,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 20:15:14,662 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 188.66666666666666) internal successors, (566), 3 states have internal predecessors, (566), 0 states have call successors, (0), 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 734 [2024-11-06 20:15:14,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 20:15:14,712 INFO L225 Difference]: With dead ends: 95916 [2024-11-06 20:15:14,713 INFO L226 Difference]: Without dead ends: 53134 [2024-11-06 20:15:14,742 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-11-06 20:15:14,742 INFO L432 NwaCegarLoop]: 969 mSDtfsCounter, 487 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 1777 mSolverCounterSat, 216 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 487 SdHoareTripleChecker+Valid, 976 SdHoareTripleChecker+Invalid, 1993 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 216 IncrementalHoareTripleChecker+Valid, 1777 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-06 20:15:14,742 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [487 Valid, 976 Invalid, 1993 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [216 Valid, 1777 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-06 20:15:14,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53134 states. [2024-11-06 20:15:15,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53134 to 53134. [2024-11-06 20:15:15,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53134 states, 53133 states have (on average 1.0423465642820846) internal successors, (55383), 53133 states have internal predecessors, (55383), 0 states have call successors, (0), 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-11-06 20:15:15,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53134 states to 53134 states and 55383 transitions. [2024-11-06 20:15:15,334 INFO L78 Accepts]: Start accepts. Automaton has 53134 states and 55383 transitions. Word has length 734 [2024-11-06 20:15:15,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 20:15:15,334 INFO L471 AbstractCegarLoop]: Abstraction has 53134 states and 55383 transitions. [2024-11-06 20:15:15,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 188.66666666666666) internal successors, (566), 3 states have internal predecessors, (566), 0 states have call successors, (0), 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-11-06 20:15:15,335 INFO L276 IsEmpty]: Start isEmpty. Operand 53134 states and 55383 transitions. [2024-11-06 20:15:15,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 754 [2024-11-06 20:15:15,343 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 20:15:15,343 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-06 20:15:15,344 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-06 20:15:15,344 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 20:15:15,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 20:15:15,344 INFO L85 PathProgramCache]: Analyzing trace with hash -508627303, now seen corresponding path program 1 times [2024-11-06 20:15:15,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 20:15:15,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598581469] [2024-11-06 20:15:15,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:15:15,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 20:15:15,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:15:15,603 INFO L134 CoverageAnalysis]: Checked inductivity of 898 backedges. 624 proven. 0 refuted. 0 times theorem prover too weak. 274 trivial. 0 not checked. [2024-11-06 20:15:15,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 20:15:15,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598581469] [2024-11-06 20:15:15,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598581469] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 20:15:15,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 20:15:15,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 20:15:15,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195075883] [2024-11-06 20:15:15,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 20:15:15,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 20:15:15,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 20:15:15,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 20:15:15,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 20:15:15,604 INFO L87 Difference]: Start difference. First operand 53134 states and 55383 transitions. Second operand has 3 states, 3 states have (on average 188.66666666666666) internal successors, (566), 3 states have internal predecessors, (566), 0 states have call successors, (0), 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-11-06 20:15:16,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 20:15:16,937 INFO L93 Difference]: Finished difference Result 115236 states and 120499 transitions. [2024-11-06 20:15:16,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 20:15:16,938 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 188.66666666666666) internal successors, (566), 3 states have internal predecessors, (566), 0 states have call successors, (0), 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 753 [2024-11-06 20:15:16,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 20:15:16,988 INFO L225 Difference]: With dead ends: 115236 [2024-11-06 20:15:16,988 INFO L226 Difference]: Without dead ends: 62104 [2024-11-06 20:15:17,016 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-11-06 20:15:17,016 INFO L432 NwaCegarLoop]: 257 mSDtfsCounter, 491 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1780 mSolverCounterSat, 191 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 491 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 1971 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 191 IncrementalHoareTripleChecker+Valid, 1780 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-06 20:15:17,017 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [491 Valid, 263 Invalid, 1971 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [191 Valid, 1780 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-06 20:15:17,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62104 states. [2024-11-06 20:15:17,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62104 to 60724. [2024-11-06 20:15:17,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60724 states, 60723 states have (on average 1.040561237093029) internal successors, (63186), 60723 states have internal predecessors, (63186), 0 states have call successors, (0), 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-11-06 20:15:17,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60724 states to 60724 states and 63186 transitions. [2024-11-06 20:15:17,556 INFO L78 Accepts]: Start accepts. Automaton has 60724 states and 63186 transitions. Word has length 753 [2024-11-06 20:15:17,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 20:15:17,557 INFO L471 AbstractCegarLoop]: Abstraction has 60724 states and 63186 transitions. [2024-11-06 20:15:17,557 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 188.66666666666666) internal successors, (566), 3 states have internal predecessors, (566), 0 states have call successors, (0), 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-11-06 20:15:17,557 INFO L276 IsEmpty]: Start isEmpty. Operand 60724 states and 63186 transitions. [2024-11-06 20:15:17,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1393 [2024-11-06 20:15:17,574 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 20:15:17,575 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 20:15:17,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-06 20:15:17,575 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 20:15:17,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 20:15:17,575 INFO L85 PathProgramCache]: Analyzing trace with hash 1412907657, now seen corresponding path program 1 times [2024-11-06 20:15:17,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 20:15:17,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386779527] [2024-11-06 20:15:17,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:15:17,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 20:15:17,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:15:18,256 INFO L134 CoverageAnalysis]: Checked inductivity of 2522 backedges. 1077 proven. 0 refuted. 0 times theorem prover too weak. 1445 trivial. 0 not checked. [2024-11-06 20:15:18,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 20:15:18,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386779527] [2024-11-06 20:15:18,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1386779527] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 20:15:18,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 20:15:18,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 20:15:18,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616599985] [2024-11-06 20:15:18,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 20:15:18,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 20:15:18,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 20:15:18,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 20:15:18,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 20:15:18,259 INFO L87 Difference]: Start difference. First operand 60724 states and 63186 transitions. Second operand has 3 states, 3 states have (on average 245.33333333333334) internal successors, (736), 3 states have internal predecessors, (736), 0 states have call successors, (0), 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-11-06 20:15:19,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 20:15:19,822 INFO L93 Difference]: Finished difference Result 140766 states and 146698 transitions. [2024-11-06 20:15:19,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 20:15:19,822 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 245.33333333333334) internal successors, (736), 3 states have internal predecessors, (736), 0 states have call successors, (0), 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 1392 [2024-11-06 20:15:19,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 20:15:19,902 INFO L225 Difference]: With dead ends: 140766 [2024-11-06 20:15:19,902 INFO L226 Difference]: Without dead ends: 80734 [2024-11-06 20:15:19,938 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-11-06 20:15:19,939 INFO L432 NwaCegarLoop]: 972 mSDtfsCounter, 538 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 1738 mSolverCounterSat, 230 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 538 SdHoareTripleChecker+Valid, 979 SdHoareTripleChecker+Invalid, 1968 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 230 IncrementalHoareTripleChecker+Valid, 1738 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-06 20:15:19,939 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [538 Valid, 979 Invalid, 1968 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [230 Valid, 1738 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-06 20:15:19,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80734 states. [2024-11-06 20:15:20,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80734 to 80734. [2024-11-06 20:15:20,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80734 states, 80733 states have (on average 1.034409720931961) internal successors, (83511), 80733 states have internal predecessors, (83511), 0 states have call successors, (0), 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-11-06 20:15:20,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80734 states to 80734 states and 83511 transitions. [2024-11-06 20:15:20,779 INFO L78 Accepts]: Start accepts. Automaton has 80734 states and 83511 transitions. Word has length 1392 [2024-11-06 20:15:20,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 20:15:20,780 INFO L471 AbstractCegarLoop]: Abstraction has 80734 states and 83511 transitions. [2024-11-06 20:15:20,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 245.33333333333334) internal successors, (736), 3 states have internal predecessors, (736), 0 states have call successors, (0), 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-11-06 20:15:20,780 INFO L276 IsEmpty]: Start isEmpty. Operand 80734 states and 83511 transitions. [2024-11-06 20:15:20,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1398 [2024-11-06 20:15:20,812 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 20:15:20,813 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 20:15:20,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-06 20:15:20,813 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 20:15:20,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 20:15:20,813 INFO L85 PathProgramCache]: Analyzing trace with hash 1076680414, now seen corresponding path program 1 times [2024-11-06 20:15:20,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 20:15:20,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240733147] [2024-11-06 20:15:20,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:15:20,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 20:15:20,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:15:22,077 INFO L134 CoverageAnalysis]: Checked inductivity of 2301 backedges. 1522 proven. 0 refuted. 0 times theorem prover too weak. 779 trivial. 0 not checked. [2024-11-06 20:15:22,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 20:15:22,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240733147] [2024-11-06 20:15:22,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240733147] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 20:15:22,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 20:15:22,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 20:15:22,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231852957] [2024-11-06 20:15:22,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 20:15:22,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-06 20:15:22,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 20:15:22,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-06 20:15:22,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-06 20:15:22,081 INFO L87 Difference]: Start difference. First operand 80734 states and 83511 transitions. Second operand has 4 states, 4 states have (on average 205.5) internal successors, (822), 3 states have internal predecessors, (822), 0 states have call successors, (0), 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-11-06 20:15:23,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 20:15:23,965 INFO L93 Difference]: Finished difference Result 162156 states and 167725 transitions. [2024-11-06 20:15:23,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-06 20:15:23,966 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 205.5) internal successors, (822), 3 states have internal predecessors, (822), 0 states have call successors, (0), 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 1397 [2024-11-06 20:15:23,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 20:15:24,041 INFO L225 Difference]: With dead ends: 162156 [2024-11-06 20:15:24,041 INFO L226 Difference]: Without dead ends: 82114 [2024-11-06 20:15:24,087 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-11-06 20:15:24,088 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 800 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 2724 mSolverCounterSat, 254 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 800 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 2978 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 254 IncrementalHoareTripleChecker+Valid, 2724 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-06 20:15:24,088 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [800 Valid, 86 Invalid, 2978 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [254 Valid, 2724 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-06 20:15:24,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82114 states. [2024-11-06 20:15:24,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82114 to 80044. [2024-11-06 20:15:24,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80044 states, 80043 states have (on average 1.034443986357333) internal successors, (82800), 80043 states have internal predecessors, (82800), 0 states have call successors, (0), 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-11-06 20:15:24,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80044 states to 80044 states and 82800 transitions. [2024-11-06 20:15:24,643 INFO L78 Accepts]: Start accepts. Automaton has 80044 states and 82800 transitions. Word has length 1397 [2024-11-06 20:15:24,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 20:15:24,644 INFO L471 AbstractCegarLoop]: Abstraction has 80044 states and 82800 transitions. [2024-11-06 20:15:24,644 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 205.5) internal successors, (822), 3 states have internal predecessors, (822), 0 states have call successors, (0), 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-11-06 20:15:24,644 INFO L276 IsEmpty]: Start isEmpty. Operand 80044 states and 82800 transitions. [2024-11-06 20:15:24,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1477 [2024-11-06 20:15:24,765 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 20:15:24,765 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 20:15:24,766 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-06 20:15:24,766 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 20:15:24,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 20:15:24,766 INFO L85 PathProgramCache]: Analyzing trace with hash 1980638668, now seen corresponding path program 1 times [2024-11-06 20:15:24,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 20:15:24,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070850174] [2024-11-06 20:15:24,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:15:24,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 20:15:24,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:15:26,840 INFO L134 CoverageAnalysis]: Checked inductivity of 2865 backedges. 908 proven. 0 refuted. 0 times theorem prover too weak. 1957 trivial. 0 not checked. [2024-11-06 20:15:26,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 20:15:26,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070850174] [2024-11-06 20:15:26,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070850174] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 20:15:26,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 20:15:26,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 20:15:26,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925966074] [2024-11-06 20:15:26,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 20:15:26,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 20:15:26,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 20:15:26,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 20:15:26,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 20:15:26,842 INFO L87 Difference]: Start difference. First operand 80044 states and 82800 transitions. Second operand has 3 states, 3 states have (on average 221.66666666666666) internal successors, (665), 3 states have internal predecessors, (665), 0 states have call successors, (0), 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-11-06 20:15:28,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 20:15:28,160 INFO L93 Difference]: Finished difference Result 161466 states and 166997 transitions. [2024-11-06 20:15:28,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 20:15:28,160 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 221.66666666666666) internal successors, (665), 3 states have internal predecessors, (665), 0 states have call successors, (0), 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 1476 [2024-11-06 20:15:28,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 20:15:28,234 INFO L225 Difference]: With dead ends: 161466 [2024-11-06 20:15:28,234 INFO L226 Difference]: Without dead ends: 80734 [2024-11-06 20:15:28,280 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 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-11-06 20:15:28,280 INFO L432 NwaCegarLoop]: 752 mSDtfsCounter, 645 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1664 mSolverCounterSat, 240 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 645 SdHoareTripleChecker+Valid, 758 SdHoareTripleChecker+Invalid, 1904 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 240 IncrementalHoareTripleChecker+Valid, 1664 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-06 20:15:28,280 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [645 Valid, 758 Invalid, 1904 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [240 Valid, 1664 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-06 20:15:28,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80734 states. [2024-11-06 20:15:28,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80734 to 80044. [2024-11-06 20:15:28,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80044 states, 80043 states have (on average 1.0293092462801243) internal successors, (82389), 80043 states have internal predecessors, (82389), 0 states have call successors, (0), 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-11-06 20:15:29,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80044 states to 80044 states and 82389 transitions. [2024-11-06 20:15:29,065 INFO L78 Accepts]: Start accepts. Automaton has 80044 states and 82389 transitions. Word has length 1476 [2024-11-06 20:15:29,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 20:15:29,066 INFO L471 AbstractCegarLoop]: Abstraction has 80044 states and 82389 transitions. [2024-11-06 20:15:29,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 221.66666666666666) internal successors, (665), 3 states have internal predecessors, (665), 0 states have call successors, (0), 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-11-06 20:15:29,067 INFO L276 IsEmpty]: Start isEmpty. Operand 80044 states and 82389 transitions. [2024-11-06 20:15:29,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1488 [2024-11-06 20:15:29,102 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 20:15:29,103 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-06 20:15:29,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-06 20:15:29,103 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 20:15:29,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 20:15:29,104 INFO L85 PathProgramCache]: Analyzing trace with hash 1051558629, now seen corresponding path program 1 times [2024-11-06 20:15:29,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 20:15:29,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627919835] [2024-11-06 20:15:29,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:15:29,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 20:15:29,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:15:30,043 INFO L134 CoverageAnalysis]: Checked inductivity of 2206 backedges. 291 proven. 0 refuted. 0 times theorem prover too weak. 1915 trivial. 0 not checked. [2024-11-06 20:15:30,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 20:15:30,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627919835] [2024-11-06 20:15:30,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1627919835] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 20:15:30,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 20:15:30,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 20:15:30,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245780300] [2024-11-06 20:15:30,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 20:15:30,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 20:15:30,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 20:15:30,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 20:15:30,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 20:15:30,045 INFO L87 Difference]: Start difference. First operand 80044 states and 82389 transitions. Second operand has 3 states, 3 states have (on average 193.66666666666666) internal successors, (581), 3 states have internal predecessors, (581), 0 states have call successors, (0), 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-11-06 20:15:31,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 20:15:31,393 INFO L93 Difference]: Finished difference Result 156636 states and 161223 transitions. [2024-11-06 20:15:31,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 20:15:31,393 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 193.66666666666666) internal successors, (581), 3 states have internal predecessors, (581), 0 states have call successors, (0), 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 1487 [2024-11-06 20:15:31,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 20:15:31,470 INFO L225 Difference]: With dead ends: 156636 [2024-11-06 20:15:31,470 INFO L226 Difference]: Without dead ends: 77284 [2024-11-06 20:15:31,517 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-11-06 20:15:31,517 INFO L432 NwaCegarLoop]: 880 mSDtfsCounter, 698 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 1602 mSolverCounterSat, 218 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 698 SdHoareTripleChecker+Valid, 887 SdHoareTripleChecker+Invalid, 1820 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 218 IncrementalHoareTripleChecker+Valid, 1602 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-06 20:15:31,517 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [698 Valid, 887 Invalid, 1820 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [218 Valid, 1602 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-06 20:15:31,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77284 states. [2024-11-06 20:15:32,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77284 to 75214. [2024-11-06 20:15:32,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75214 states, 75213 states have (on average 1.020501774959116) internal successors, (76755), 75213 states have internal predecessors, (76755), 0 states have call successors, (0), 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-11-06 20:15:32,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75214 states to 75214 states and 76755 transitions. [2024-11-06 20:15:32,381 INFO L78 Accepts]: Start accepts. Automaton has 75214 states and 76755 transitions. Word has length 1487 [2024-11-06 20:15:32,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 20:15:32,382 INFO L471 AbstractCegarLoop]: Abstraction has 75214 states and 76755 transitions. [2024-11-06 20:15:32,382 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 193.66666666666666) internal successors, (581), 3 states have internal predecessors, (581), 0 states have call successors, (0), 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-11-06 20:15:32,383 INFO L276 IsEmpty]: Start isEmpty. Operand 75214 states and 76755 transitions. [2024-11-06 20:15:32,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1531 [2024-11-06 20:15:32,405 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 20:15:32,405 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 20:15:32,405 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-06 20:15:32,406 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 20:15:32,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 20:15:32,406 INFO L85 PathProgramCache]: Analyzing trace with hash -2055528154, now seen corresponding path program 1 times [2024-11-06 20:15:32,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 20:15:32,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207739577] [2024-11-06 20:15:32,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:15:32,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 20:15:32,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:15:33,116 INFO L134 CoverageAnalysis]: Checked inductivity of 3349 backedges. 1780 proven. 0 refuted. 0 times theorem prover too weak. 1569 trivial. 0 not checked. [2024-11-06 20:15:33,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 20:15:33,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207739577] [2024-11-06 20:15:33,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207739577] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 20:15:33,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 20:15:33,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 20:15:33,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738371311] [2024-11-06 20:15:33,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 20:15:33,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 20:15:33,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 20:15:33,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 20:15:33,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 20:15:33,118 INFO L87 Difference]: Start difference. First operand 75214 states and 76755 transitions. Second operand has 3 states, 3 states have (on average 234.66666666666666) internal successors, (704), 3 states have internal predecessors, (704), 0 states have call successors, (0), 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-11-06 20:15:34,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 20:15:34,656 INFO L93 Difference]: Finished difference Result 151804 states and 154903 transitions. [2024-11-06 20:15:34,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 20:15:34,656 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 234.66666666666666) internal successors, (704), 3 states have internal predecessors, (704), 0 states have call successors, (0), 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 1530 [2024-11-06 20:15:34,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 20:15:34,658 INFO L225 Difference]: With dead ends: 151804 [2024-11-06 20:15:34,658 INFO L226 Difference]: Without dead ends: 0 [2024-11-06 20:15:34,705 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-11-06 20:15:34,705 INFO L432 NwaCegarLoop]: 935 mSDtfsCounter, 625 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1763 mSolverCounterSat, 216 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 625 SdHoareTripleChecker+Valid, 941 SdHoareTripleChecker+Invalid, 1979 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 216 IncrementalHoareTripleChecker+Valid, 1763 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-06 20:15:34,706 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [625 Valid, 941 Invalid, 1979 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [216 Valid, 1763 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-06 20:15:34,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-06 20:15:34,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-06 20:15:34,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 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-11-06 20:15:34,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-06 20:15:34,706 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1530 [2024-11-06 20:15:34,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 20:15:34,707 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-06 20:15:34,707 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 234.66666666666666) internal successors, (704), 3 states have internal predecessors, (704), 0 states have call successors, (0), 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-11-06 20:15:34,707 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-06 20:15:34,707 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-06 20:15:34,709 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-06 20:15:34,710 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-06 20:15:34,712 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 20:15:34,713 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-06 20:15:36,240 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-06 20:15:36,257 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 08:15:36 BoogieIcfgContainer [2024-11-06 20:15:36,257 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-06 20:15:36,257 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-06 20:15:36,257 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-06 20:15:36,257 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-06 20:15:36,258 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 08:14:46" (3/4) ... [2024-11-06 20:15:36,259 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-06 20:15:36,287 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2024-11-06 20:15:36,290 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-06 20:15:36,293 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-06 20:15:36,297 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-06 20:15:36,494 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-06 20:15:36,495 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-06 20:15:36,495 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-06 20:15:36,496 INFO L158 Benchmark]: Toolchain (without parser) took 54070.19ms. Allocated memory was 100.7MB in the beginning and 6.1GB in the end (delta: 6.0GB). Free memory was 68.2MB in the beginning and 4.8GB in the end (delta: -4.8GB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. [2024-11-06 20:15:36,496 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 83.9MB. Free memory is still 48.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-06 20:15:36,496 INFO L158 Benchmark]: CACSL2BoogieTranslator took 727.55ms. Allocated memory is still 100.7MB. Free memory was 68.0MB in the beginning and 29.6MB in the end (delta: 38.3MB). Peak memory consumption was 59.7MB. Max. memory is 16.1GB. [2024-11-06 20:15:36,496 INFO L158 Benchmark]: Boogie Procedure Inliner took 181.19ms. Allocated memory is still 100.7MB. Free memory was 29.6MB in the beginning and 26.0MB in the end (delta: 3.6MB). Peak memory consumption was 28.8MB. Max. memory is 16.1GB. [2024-11-06 20:15:36,496 INFO L158 Benchmark]: Boogie Preprocessor took 281.09ms. Allocated memory was 100.7MB in the beginning and 184.5MB in the end (delta: 83.9MB). Free memory was 26.0MB in the beginning and 102.0MB in the end (delta: -76.0MB). Peak memory consumption was 61.3MB. Max. memory is 16.1GB. [2024-11-06 20:15:36,497 INFO L158 Benchmark]: RCFGBuilder took 2703.27ms. Allocated memory was 184.5MB in the beginning and 369.1MB in the end (delta: 184.5MB). Free memory was 102.0MB in the beginning and 284.2MB in the end (delta: -182.2MB). Peak memory consumption was 219.1MB. Max. memory is 16.1GB. [2024-11-06 20:15:36,497 INFO L158 Benchmark]: TraceAbstraction took 49933.78ms. Allocated memory was 369.1MB in the beginning and 6.1GB in the end (delta: 5.7GB). Free memory was 284.2MB in the beginning and 4.9GB in the end (delta: -4.6GB). Peak memory consumption was 1.8GB. Max. memory is 16.1GB. [2024-11-06 20:15:36,498 INFO L158 Benchmark]: Witness Printer took 238.14ms. Allocated memory is still 6.1GB. Free memory was 4.9GB in the beginning and 4.8GB in the end (delta: 46.0MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2024-11-06 20:15:36,498 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 83.9MB. Free memory is still 48.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 727.55ms. Allocated memory is still 100.7MB. Free memory was 68.0MB in the beginning and 29.6MB in the end (delta: 38.3MB). Peak memory consumption was 59.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 181.19ms. Allocated memory is still 100.7MB. Free memory was 29.6MB in the beginning and 26.0MB in the end (delta: 3.6MB). Peak memory consumption was 28.8MB. Max. memory is 16.1GB. * Boogie Preprocessor took 281.09ms. Allocated memory was 100.7MB in the beginning and 184.5MB in the end (delta: 83.9MB). Free memory was 26.0MB in the beginning and 102.0MB in the end (delta: -76.0MB). Peak memory consumption was 61.3MB. Max. memory is 16.1GB. * RCFGBuilder took 2703.27ms. Allocated memory was 184.5MB in the beginning and 369.1MB in the end (delta: 184.5MB). Free memory was 102.0MB in the beginning and 284.2MB in the end (delta: -182.2MB). Peak memory consumption was 219.1MB. Max. memory is 16.1GB. * TraceAbstraction took 49933.78ms. Allocated memory was 369.1MB in the beginning and 6.1GB in the end (delta: 5.7GB). Free memory was 284.2MB in the beginning and 4.9GB in the end (delta: -4.6GB). Peak memory consumption was 1.8GB. Max. memory is 16.1GB. * Witness Printer took 238.14ms. Allocated memory is still 6.1GB. Free memory was 4.9GB in the beginning and 4.8GB in the end (delta: 46.0MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 199]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 757 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 48.3s, OverallIterations: 18, TraceHistogramMax: 9, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.3s, AutomataDifference: 31.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 12168 SdHoareTripleChecker+Valid, 27.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 12168 mSDsluCounter, 12873 SdHoareTripleChecker+Invalid, 22.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 138 mSDsCounter, 6585 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 37047 IncrementalHoareTripleChecker+Invalid, 43632 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6585 mSolverCounterUnsat, 12735 mSDtfsCounter, 37047 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 417 GetRequests, 393 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=80734occurred in iteration=14, InterpolantAutomatonStates: 57, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 6.2s AutomataMinimizationTime, 18 MinimizatonAttempts, 11730 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 8.7s InterpolantComputationTime, 13338 NumberOfCodeBlocks, 13338 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 13319 ConstructedInterpolants, 0 QuantifiedInterpolants, 23947 SizeOfPredicates, 0 NumberOfNonLiveVariables, 440 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 19 InterpolantComputations, 18 PerfectInterpolantSequences, 17699/17740 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 4269]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((a15 <= 4) && (418 <= a3)) && (a24 <= 3)) && (a24 != 3)) || ((((5 == a15) && (a24 <= 3)) && (a18 == 9)) && (a24 != 3))) || (((5 == a15) && (418 <= a3)) && (a18 == 10))) || (((5 == a15) && (a24 <= 3)) && (a18 == 12))) || (((5 == a15) && (a18 == 10)) && (a24 != 3))) || ((a24 == 0) && (a15 <= 4))) || (((3 <= a24) && (a15 <= 4)) && (a18 == 12))) || ((((a18 == 11) && (a24 <= 3)) && (a15 == 6)) && (a24 != 3))) || (((a24 <= 3) && (a18 == 9)) && (a15 == 6))) || (((a15 == 4) && (a18 == 10)) && (a3 <= 99))) || (((a24 <= 3) && (a18 == 12)) && (a15 == 6))) || (((a18 == 10) && (a24 <= 3)) && (a15 == 6))) || (((3 <= a24) && (a15 <= 4)) && (a18 == 10))) || ((a18 <= 8) && (5 == a15))) || ((5 == a15) && (a18 == 11))) || (((a15 <= 4) && (a18 == 12)) && (a3 <= 99))) || (((5 == a15) && (a18 == 12)) && (a3 <= 99))) || ((((a24 == 3) && (418 <= a3)) && (a18 == 11)) && (a15 == 6))) || (((a18 <= 8) && (a24 <= 3)) && (a15 == 6))) || (((a24 == 1) && (418 <= a3)) && (a15 == 6))) || ((a24 == 1) && (a15 <= 4))) || ((a15 <= 4) && (a18 == 11))) || ((a18 <= 8) && (a15 <= 4))) || ((a15 <= 4) && (a18 == 9))) || (((a24 == 1) && (a15 == 6)) && (a3 <= 99))) RESULT: Ultimate proved your program to be correct! [2024-11-06 20:15:36,521 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE