./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem13_label49.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/Problem13_label49.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', 'dec1bbc02769dd31e26f469fb506a4ddb52de0bafeec9822b4b5ac4641b246bd'] 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/Problem13_label49.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 dec1bbc02769dd31e26f469fb506a4ddb52de0bafeec9822b4b5ac4641b246bd --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-06 19:50:32,315 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-06 19:50:32,402 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-06 19:50:32,407 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-06 19:50:32,407 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-06 19:50:32,420 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-06 19:50:32,422 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-06 19:50:32,422 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-06 19:50:32,422 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-06 19:50:32,423 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-06 19:50:32,423 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-06 19:50:32,423 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-06 19:50:32,424 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-06 19:50:32,424 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-06 19:50:32,424 INFO L153 SettingsManager]: * Use SBE=true [2024-11-06 19:50:32,424 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-06 19:50:32,424 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-06 19:50:32,424 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-06 19:50:32,424 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-06 19:50:32,425 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-06 19:50:32,425 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-06 19:50:32,425 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-06 19:50:32,425 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-06 19:50:32,425 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-06 19:50:32,425 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-06 19:50:32,425 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-06 19:50:32,425 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-06 19:50:32,425 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-06 19:50:32,426 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-06 19:50:32,426 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-06 19:50:32,426 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-06 19:50:32,426 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-06 19:50:32,426 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 19:50:32,426 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-06 19:50:32,426 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-06 19:50:32,426 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-06 19:50:32,427 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-06 19:50:32,427 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-06 19:50:32,427 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-06 19:50:32,427 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-06 19:50:32,427 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-06 19:50:32,427 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-06 19:50:32,427 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 -> dec1bbc02769dd31e26f469fb506a4ddb52de0bafeec9822b4b5ac4641b246bd [2024-11-06 19:50:32,665 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-06 19:50:32,675 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-06 19:50:32,676 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-06 19:50:32,677 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-06 19:50:32,681 INFO L274 PluginConnector]: CDTParser initialized [2024-11-06 19:50:32,682 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem13_label49.c [2024-11-06 19:50:33,850 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-06 19:50:34,256 INFO L384 CDTParser]: Found 1 translation units. [2024-11-06 19:50:34,256 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label49.c [2024-11-06 19:50:34,284 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cbed8e005/12eafea431ae468c908326a4c04bdff2/FLAG8df3ddf8a [2024-11-06 19:50:34,430 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cbed8e005/12eafea431ae468c908326a4c04bdff2 [2024-11-06 19:50:34,432 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-06 19:50:34,434 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-06 19:50:34,435 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-06 19:50:34,435 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-06 19:50:34,439 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-06 19:50:34,440 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 07:50:34" (1/1) ... [2024-11-06 19:50:34,440 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d639a60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:50:34, skipping insertion in model container [2024-11-06 19:50:34,441 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 07:50:34" (1/1) ... [2024-11-06 19:50:34,564 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-06 19:50:34,797 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/Problem13_label49.c[8258,8271] [2024-11-06 19:50:35,290 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 19:50:35,297 INFO L200 MainTranslator]: Completed pre-run [2024-11-06 19:50:35,313 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/Problem13_label49.c[8258,8271] [2024-11-06 19:50:35,707 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 19:50:35,756 INFO L204 MainTranslator]: Completed translation [2024-11-06 19:50:35,757 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:50:35 WrapperNode [2024-11-06 19:50:35,761 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-06 19:50:35,762 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-06 19:50:35,762 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-06 19:50:35,762 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-06 19:50:35,771 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:50:35" (1/1) ... [2024-11-06 19:50:35,825 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:50:35" (1/1) ... [2024-11-06 19:50:36,248 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 5587 [2024-11-06 19:50:36,248 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-06 19:50:36,249 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-06 19:50:36,253 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-06 19:50:36,253 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-06 19:50:36,265 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:50:35" (1/1) ... [2024-11-06 19:50:36,265 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:50:35" (1/1) ... [2024-11-06 19:50:36,366 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:50:35" (1/1) ... [2024-11-06 19:50:36,588 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 19:50:36,588 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:50:35" (1/1) ... [2024-11-06 19:50:36,588 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:50:35" (1/1) ... [2024-11-06 19:50:36,728 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:50:35" (1/1) ... [2024-11-06 19:50:36,760 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:50:35" (1/1) ... [2024-11-06 19:50:36,800 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:50:35" (1/1) ... [2024-11-06 19:50:36,822 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:50:35" (1/1) ... [2024-11-06 19:50:36,882 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-06 19:50:36,883 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-06 19:50:36,884 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-06 19:50:36,884 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-06 19:50:36,885 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:50:35" (1/1) ... [2024-11-06 19:50:36,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 19:50:36,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 19:50:36,916 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 19:50:36,925 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 19:50:36,939 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-06 19:50:36,939 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-06 19:50:36,939 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-06 19:50:36,939 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-06 19:50:37,004 INFO L238 CfgBuilder]: Building ICFG [2024-11-06 19:50:37,005 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-06 19:50:42,739 INFO L? ?]: Removed 738 outVars from TransFormulas that were not future-live. [2024-11-06 19:50:42,740 INFO L287 CfgBuilder]: Performing block encoding [2024-11-06 19:50:42,772 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-06 19:50:42,772 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-06 19:50:42,773 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 07:50:42 BoogieIcfgContainer [2024-11-06 19:50:42,773 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-06 19:50:42,774 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-06 19:50:42,776 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-06 19:50:42,779 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-06 19:50:42,780 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 07:50:34" (1/3) ... [2024-11-06 19:50:42,780 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e9ac208 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 07:50:42, skipping insertion in model container [2024-11-06 19:50:42,780 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:50:35" (2/3) ... [2024-11-06 19:50:42,780 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e9ac208 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 07:50:42, skipping insertion in model container [2024-11-06 19:50:42,780 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 07:50:42" (3/3) ... [2024-11-06 19:50:42,781 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem13_label49.c [2024-11-06 19:50:42,792 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-06 19:50:42,792 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-06 19:50:42,865 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-06 19:50:42,873 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;@2fc83973, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-06 19:50:42,875 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-06 19:50:42,882 INFO L276 IsEmpty]: Start isEmpty. Operand has 1098 states, 1096 states have (on average 1.8275547445255473) internal successors, (2003), 1097 states have internal predecessors, (2003), 0 states have call successors, (0), 0 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 19:50:42,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-06 19:50:42,889 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:50:42,890 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] [2024-11-06 19:50:42,891 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:50:42,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:50:42,895 INFO L85 PathProgramCache]: Analyzing trace with hash -2074400678, now seen corresponding path program 1 times [2024-11-06 19:50:42,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:50:42,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793446369] [2024-11-06 19:50:42,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:50:42,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:50:43,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:50:43,200 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 19:50:43,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:50:43,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793446369] [2024-11-06 19:50:43,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793446369] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:50:43,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:50:43,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 19:50:43,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093327089] [2024-11-06 19:50:43,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:50:43,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:50:43,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:50:43,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:50:43,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:50:43,230 INFO L87 Difference]: Start difference. First operand has 1098 states, 1096 states have (on average 1.8275547445255473) internal successors, (2003), 1097 states have internal predecessors, (2003), 0 states have call successors, (0), 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 19.333333333333332) internal successors, (58), 2 states have internal predecessors, (58), 0 states have call successors, (0), 0 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 19:50:46,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:50:46,652 INFO L93 Difference]: Finished difference Result 3035 states and 5643 transitions. [2024-11-06 19:50:46,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:50:46,654 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 2 states have internal predecessors, (58), 0 states have call successors, (0), 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 58 [2024-11-06 19:50:46,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:50:46,677 INFO L225 Difference]: With dead ends: 3035 [2024-11-06 19:50:46,677 INFO L226 Difference]: Without dead ends: 1873 [2024-11-06 19:50:46,685 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 19:50:46,688 INFO L432 NwaCegarLoop]: 991 mSDtfsCounter, 847 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 2505 mSolverCounterSat, 858 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 847 SdHoareTripleChecker+Valid, 1145 SdHoareTripleChecker+Invalid, 3363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 858 IncrementalHoareTripleChecker+Valid, 2505 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2024-11-06 19:50:46,689 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [847 Valid, 1145 Invalid, 3363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [858 Valid, 2505 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2024-11-06 19:50:46,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1873 states. [2024-11-06 19:50:46,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1873 to 1859. [2024-11-06 19:50:46,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1859 states, 1858 states have (on average 1.5441334768568353) internal successors, (2869), 1858 states have internal predecessors, (2869), 0 states have call successors, (0), 0 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 19:50:46,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1859 states to 1859 states and 2869 transitions. [2024-11-06 19:50:46,885 INFO L78 Accepts]: Start accepts. Automaton has 1859 states and 2869 transitions. Word has length 58 [2024-11-06 19:50:46,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:50:46,885 INFO L471 AbstractCegarLoop]: Abstraction has 1859 states and 2869 transitions. [2024-11-06 19:50:46,885 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 2 states have internal predecessors, (58), 0 states have call successors, (0), 0 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 19:50:46,885 INFO L276 IsEmpty]: Start isEmpty. Operand 1859 states and 2869 transitions. [2024-11-06 19:50:46,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-06 19:50:46,892 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:50:46,892 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, 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 19:50:46,896 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-06 19:50:46,897 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:50:46,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:50:46,897 INFO L85 PathProgramCache]: Analyzing trace with hash 463715077, now seen corresponding path program 1 times [2024-11-06 19:50:46,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:50:46,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192914689] [2024-11-06 19:50:46,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:50:46,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:50:46,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:50:47,288 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 19:50:47,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:50:47,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192914689] [2024-11-06 19:50:47,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192914689] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:50:47,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:50:47,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 19:50:47,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337316153] [2024-11-06 19:50:47,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:50:47,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:50:47,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:50:47,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:50:47,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:50:47,295 INFO L87 Difference]: Start difference. First operand 1859 states and 2869 transitions. Second operand has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 2 states have internal predecessors, (130), 0 states have call successors, (0), 0 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 19:50:50,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:50:50,323 INFO L93 Difference]: Finished difference Result 5317 states and 8229 transitions. [2024-11-06 19:50:50,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:50:50,323 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 2 states have internal predecessors, (130), 0 states have call successors, (0), 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 130 [2024-11-06 19:50:50,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:50:50,332 INFO L225 Difference]: With dead ends: 5317 [2024-11-06 19:50:50,332 INFO L226 Difference]: Without dead ends: 3460 [2024-11-06 19:50:50,334 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 19:50:50,334 INFO L432 NwaCegarLoop]: 1039 mSDtfsCounter, 826 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 2402 mSolverCounterSat, 877 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 826 SdHoareTripleChecker+Valid, 1192 SdHoareTripleChecker+Invalid, 3279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 877 IncrementalHoareTripleChecker+Valid, 2402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-11-06 19:50:50,335 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [826 Valid, 1192 Invalid, 3279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [877 Valid, 2402 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-11-06 19:50:50,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3460 states. [2024-11-06 19:50:50,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3460 to 3459. [2024-11-06 19:50:50,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3459 states, 3458 states have (on average 1.3805668016194332) internal successors, (4774), 3458 states have internal predecessors, (4774), 0 states have call successors, (0), 0 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 19:50:50,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3459 states to 3459 states and 4774 transitions. [2024-11-06 19:50:50,374 INFO L78 Accepts]: Start accepts. Automaton has 3459 states and 4774 transitions. Word has length 130 [2024-11-06 19:50:50,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:50:50,374 INFO L471 AbstractCegarLoop]: Abstraction has 3459 states and 4774 transitions. [2024-11-06 19:50:50,374 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 2 states have internal predecessors, (130), 0 states have call successors, (0), 0 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 19:50:50,374 INFO L276 IsEmpty]: Start isEmpty. Operand 3459 states and 4774 transitions. [2024-11-06 19:50:50,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-06 19:50:50,379 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:50:50,379 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:50:50,379 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-06 19:50:50,379 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:50:50,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:50:50,380 INFO L85 PathProgramCache]: Analyzing trace with hash -1209172164, now seen corresponding path program 1 times [2024-11-06 19:50:50,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:50:50,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488958212] [2024-11-06 19:50:50,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:50:50,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:50:50,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:50:50,717 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 19:50:50,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:50:50,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488958212] [2024-11-06 19:50:50,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [488958212] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:50:50,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:50:50,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:50:50,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554452339] [2024-11-06 19:50:50,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:50:50,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-06 19:50:50,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:50:50,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-06 19:50:50,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-06 19:50:50,721 INFO L87 Difference]: Start difference. First operand 3459 states and 4774 transitions. Second operand has 4 states, 4 states have (on average 36.0) internal successors, (144), 3 states have internal predecessors, (144), 0 states have call successors, (0), 0 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 19:50:54,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:50:54,812 INFO L93 Difference]: Finished difference Result 10870 states and 14768 transitions. [2024-11-06 19:50:54,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-06 19:50:54,813 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 36.0) internal successors, (144), 3 states have internal predecessors, (144), 0 states have call successors, (0), 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 144 [2024-11-06 19:50:54,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:50:54,830 INFO L225 Difference]: With dead ends: 10870 [2024-11-06 19:50:54,830 INFO L226 Difference]: Without dead ends: 7413 [2024-11-06 19:50:54,834 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 19:50:54,834 INFO L432 NwaCegarLoop]: 709 mSDtfsCounter, 2582 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 4117 mSolverCounterSat, 831 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2582 SdHoareTripleChecker+Valid, 1003 SdHoareTripleChecker+Invalid, 4948 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 831 IncrementalHoareTripleChecker+Valid, 4117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2024-11-06 19:50:54,834 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2582 Valid, 1003 Invalid, 4948 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [831 Valid, 4117 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2024-11-06 19:50:54,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7413 states. [2024-11-06 19:50:54,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7413 to 7412. [2024-11-06 19:50:54,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7412 states, 7411 states have (on average 1.2698691134799622) internal successors, (9411), 7411 states have internal predecessors, (9411), 0 states have call successors, (0), 0 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 19:50:54,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7412 states to 7412 states and 9411 transitions. [2024-11-06 19:50:54,996 INFO L78 Accepts]: Start accepts. Automaton has 7412 states and 9411 transitions. Word has length 144 [2024-11-06 19:50:54,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:50:54,997 INFO L471 AbstractCegarLoop]: Abstraction has 7412 states and 9411 transitions. [2024-11-06 19:50:55,001 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.0) internal successors, (144), 3 states have internal predecessors, (144), 0 states have call successors, (0), 0 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 19:50:55,001 INFO L276 IsEmpty]: Start isEmpty. Operand 7412 states and 9411 transitions. [2024-11-06 19:50:55,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2024-11-06 19:50:55,003 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:50:55,004 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, 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] [2024-11-06 19:50:55,004 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-06 19:50:55,004 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:50:55,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:50:55,010 INFO L85 PathProgramCache]: Analyzing trace with hash -56416910, now seen corresponding path program 1 times [2024-11-06 19:50:55,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:50:55,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333984754] [2024-11-06 19:50:55,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:50:55,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:50:55,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:50:55,355 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-11-06 19:50:55,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:50:55,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333984754] [2024-11-06 19:50:55,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1333984754] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:50:55,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:50:55,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 19:50:55,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561831390] [2024-11-06 19:50:55,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:50:55,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:50:55,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:50:55,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:50:55,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:50:55,359 INFO L87 Difference]: Start difference. First operand 7412 states and 9411 transitions. Second operand has 3 states, 3 states have (on average 52.0) internal successors, (156), 2 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:50:58,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:50:58,429 INFO L93 Difference]: Finished difference Result 20357 states and 26252 transitions. [2024-11-06 19:50:58,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:50:58,429 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 2 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 225 [2024-11-06 19:50:58,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:50:58,465 INFO L225 Difference]: With dead ends: 20357 [2024-11-06 19:50:58,465 INFO L226 Difference]: Without dead ends: 13734 [2024-11-06 19:50:58,481 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 19:50:58,482 INFO L432 NwaCegarLoop]: 851 mSDtfsCounter, 889 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 2576 mSolverCounterSat, 747 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 889 SdHoareTripleChecker+Valid, 980 SdHoareTripleChecker+Invalid, 3323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 747 IncrementalHoareTripleChecker+Valid, 2576 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-11-06 19:50:58,482 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [889 Valid, 980 Invalid, 3323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [747 Valid, 2576 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-11-06 19:50:58,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13734 states. [2024-11-06 19:50:58,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13734 to 12937. [2024-11-06 19:50:58,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12937 states, 12936 states have (on average 1.215213358070501) internal successors, (15720), 12936 states have internal predecessors, (15720), 0 states have call successors, (0), 0 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 19:50:58,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12937 states to 12937 states and 15720 transitions. [2024-11-06 19:50:58,652 INFO L78 Accepts]: Start accepts. Automaton has 12937 states and 15720 transitions. Word has length 225 [2024-11-06 19:50:58,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:50:58,653 INFO L471 AbstractCegarLoop]: Abstraction has 12937 states and 15720 transitions. [2024-11-06 19:50:58,653 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 2 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:50:58,653 INFO L276 IsEmpty]: Start isEmpty. Operand 12937 states and 15720 transitions. [2024-11-06 19:50:58,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2024-11-06 19:50:58,656 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:50:58,657 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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 19:50:58,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-06 19:50:58,657 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:50:58,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:50:58,657 INFO L85 PathProgramCache]: Analyzing trace with hash 1823781410, now seen corresponding path program 1 times [2024-11-06 19:50:58,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:50:58,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637042673] [2024-11-06 19:50:58,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:50:58,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:50:58,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:50:58,815 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 206 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 19:50:58,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:50:58,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637042673] [2024-11-06 19:50:58,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1637042673] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:50:58,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:50:58,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:50:58,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396808351] [2024-11-06 19:50:58,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:50:58,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:50:58,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:50:58,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:50:58,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:50:58,818 INFO L87 Difference]: Start difference. First operand 12937 states and 15720 transitions. Second operand has 3 states, 3 states have (on average 85.66666666666667) internal successors, (257), 3 states have internal predecessors, (257), 0 states have call successors, (0), 0 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 19:51:01,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:51:01,844 INFO L93 Difference]: Finished difference Result 31392 states and 39119 transitions. [2024-11-06 19:51:01,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:51:01,845 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 85.66666666666667) internal successors, (257), 3 states have internal predecessors, (257), 0 states have call successors, (0), 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 257 [2024-11-06 19:51:01,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:51:01,891 INFO L225 Difference]: With dead ends: 31392 [2024-11-06 19:51:01,891 INFO L226 Difference]: Without dead ends: 19244 [2024-11-06 19:51:01,904 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 19:51:01,905 INFO L432 NwaCegarLoop]: 809 mSDtfsCounter, 858 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 2381 mSolverCounterSat, 914 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 858 SdHoareTripleChecker+Valid, 926 SdHoareTripleChecker+Invalid, 3295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 914 IncrementalHoareTripleChecker+Valid, 2381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-11-06 19:51:01,906 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [858 Valid, 926 Invalid, 3295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [914 Valid, 2381 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-11-06 19:51:01,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19244 states. [2024-11-06 19:51:02,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19244 to 18447. [2024-11-06 19:51:02,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18447 states, 18446 states have (on average 1.2024287108316165) internal successors, (22180), 18446 states have internal predecessors, (22180), 0 states have call successors, (0), 0 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 19:51:02,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18447 states to 18447 states and 22180 transitions. [2024-11-06 19:51:02,280 INFO L78 Accepts]: Start accepts. Automaton has 18447 states and 22180 transitions. Word has length 257 [2024-11-06 19:51:02,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:51:02,281 INFO L471 AbstractCegarLoop]: Abstraction has 18447 states and 22180 transitions. [2024-11-06 19:51:02,281 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 85.66666666666667) internal successors, (257), 3 states have internal predecessors, (257), 0 states have call successors, (0), 0 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 19:51:02,281 INFO L276 IsEmpty]: Start isEmpty. Operand 18447 states and 22180 transitions. [2024-11-06 19:51:02,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 347 [2024-11-06 19:51:02,292 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:51:02,292 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 19:51:02,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-06 19:51:02,296 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:51:02,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:51:02,297 INFO L85 PathProgramCache]: Analyzing trace with hash 988861624, now seen corresponding path program 1 times [2024-11-06 19:51:02,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:51:02,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439253398] [2024-11-06 19:51:02,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:51:02,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:51:02,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:51:02,595 INFO L134 CoverageAnalysis]: Checked inductivity of 439 backedges. 167 proven. 0 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2024-11-06 19:51:02,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:51:02,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439253398] [2024-11-06 19:51:02,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [439253398] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:51:02,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:51:02,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:51:02,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240768563] [2024-11-06 19:51:02,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:51:02,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:51:02,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:51:02,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:51:02,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:51:02,597 INFO L87 Difference]: Start difference. First operand 18447 states and 22180 transitions. Second operand has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 0 states have call successors, (0), 0 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 19:51:05,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:51:05,727 INFO L93 Difference]: Finished difference Result 42412 states and 52037 transitions. [2024-11-06 19:51:05,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:51:05,727 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 0 states have call successors, (0), 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 346 [2024-11-06 19:51:05,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:51:05,768 INFO L225 Difference]: With dead ends: 42412 [2024-11-06 19:51:05,769 INFO L226 Difference]: Without dead ends: 24754 [2024-11-06 19:51:05,784 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 19:51:05,786 INFO L432 NwaCegarLoop]: 1796 mSDtfsCounter, 812 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 2542 mSolverCounterSat, 723 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 812 SdHoareTripleChecker+Valid, 1947 SdHoareTripleChecker+Invalid, 3265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 723 IncrementalHoareTripleChecker+Valid, 2542 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-11-06 19:51:05,786 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [812 Valid, 1947 Invalid, 3265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [723 Valid, 2542 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-11-06 19:51:05,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24754 states. [2024-11-06 19:51:05,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24754 to 23962. [2024-11-06 19:51:06,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23962 states, 23961 states have (on average 1.1787070656483452) internal successors, (28243), 23961 states have internal predecessors, (28243), 0 states have call successors, (0), 0 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 19:51:06,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23962 states to 23962 states and 28243 transitions. [2024-11-06 19:51:06,045 INFO L78 Accepts]: Start accepts. Automaton has 23962 states and 28243 transitions. Word has length 346 [2024-11-06 19:51:06,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:51:06,046 INFO L471 AbstractCegarLoop]: Abstraction has 23962 states and 28243 transitions. [2024-11-06 19:51:06,046 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 0 states have call successors, (0), 0 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 19:51:06,047 INFO L276 IsEmpty]: Start isEmpty. Operand 23962 states and 28243 transitions. [2024-11-06 19:51:06,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 356 [2024-11-06 19:51:06,051 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:51:06,051 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 19:51:06,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-06 19:51:06,052 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:51:06,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:51:06,052 INFO L85 PathProgramCache]: Analyzing trace with hash 522484062, now seen corresponding path program 1 times [2024-11-06 19:51:06,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:51:06,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643144546] [2024-11-06 19:51:06,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:51:06,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:51:06,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:51:06,288 INFO L134 CoverageAnalysis]: Checked inductivity of 457 backedges. 401 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2024-11-06 19:51:06,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:51:06,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643144546] [2024-11-06 19:51:06,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [643144546] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:51:06,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:51:06,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:51:06,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050409387] [2024-11-06 19:51:06,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:51:06,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-06 19:51:06,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:51:06,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-06 19:51:06,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-06 19:51:06,290 INFO L87 Difference]: Start difference. First operand 23962 states and 28243 transitions. Second operand has 4 states, 4 states have (on average 75.0) internal successors, (300), 3 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:51:12,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:51:12,228 INFO L93 Difference]: Finished difference Result 89062 states and 105283 transitions. [2024-11-06 19:51:12,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-06 19:51:12,228 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 75.0) internal successors, (300), 3 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 355 [2024-11-06 19:51:12,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:51:12,300 INFO L225 Difference]: With dead ends: 89062 [2024-11-06 19:51:12,301 INFO L226 Difference]: Without dead ends: 65889 [2024-11-06 19:51:12,319 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 19:51:12,320 INFO L432 NwaCegarLoop]: 436 mSDtfsCounter, 1742 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 6024 mSolverCounterSat, 1214 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1742 SdHoareTripleChecker+Valid, 637 SdHoareTripleChecker+Invalid, 7238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1214 IncrementalHoareTripleChecker+Valid, 6024 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.6s IncrementalHoareTripleChecker+Time [2024-11-06 19:51:12,320 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1742 Valid, 637 Invalid, 7238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1214 Valid, 6024 Invalid, 0 Unknown, 0 Unchecked, 5.6s Time] [2024-11-06 19:51:12,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65889 states. [2024-11-06 19:51:12,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65889 to 64189. [2024-11-06 19:51:12,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64189 states, 64188 states have (on average 1.1559325730666168) internal successors, (74197), 64188 states have internal predecessors, (74197), 0 states have call successors, (0), 0 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 19:51:12,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64189 states to 64189 states and 74197 transitions. [2024-11-06 19:51:12,929 INFO L78 Accepts]: Start accepts. Automaton has 64189 states and 74197 transitions. Word has length 355 [2024-11-06 19:51:12,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:51:12,930 INFO L471 AbstractCegarLoop]: Abstraction has 64189 states and 74197 transitions. [2024-11-06 19:51:12,930 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 75.0) internal successors, (300), 3 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:51:12,930 INFO L276 IsEmpty]: Start isEmpty. Operand 64189 states and 74197 transitions. [2024-11-06 19:51:12,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 356 [2024-11-06 19:51:12,935 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:51:12,935 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, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 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 19:51:12,935 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-06 19:51:12,936 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:51:12,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:51:12,936 INFO L85 PathProgramCache]: Analyzing trace with hash -1586030933, now seen corresponding path program 1 times [2024-11-06 19:51:12,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:51:12,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218023878] [2024-11-06 19:51:12,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:51:12,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:51:12,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:51:13,402 INFO L134 CoverageAnalysis]: Checked inductivity of 431 backedges. 280 proven. 0 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2024-11-06 19:51:13,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:51:13,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218023878] [2024-11-06 19:51:13,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218023878] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:51:13,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:51:13,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 19:51:13,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352311361] [2024-11-06 19:51:13,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:51:13,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:51:13,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:51:13,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:51:13,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:51:13,408 INFO L87 Difference]: Start difference. First operand 64189 states and 74197 transitions. Second operand has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 2 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:51:16,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:51:16,595 INFO L93 Difference]: Finished difference Result 140992 states and 162393 transitions. [2024-11-06 19:51:16,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:51:16,595 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 2 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 355 [2024-11-06 19:51:16,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:51:16,691 INFO L225 Difference]: With dead ends: 140992 [2024-11-06 19:51:16,691 INFO L226 Difference]: Without dead ends: 77592 [2024-11-06 19:51:16,823 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 19:51:16,823 INFO L432 NwaCegarLoop]: 1019 mSDtfsCounter, 730 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 2705 mSolverCounterSat, 180 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 730 SdHoareTripleChecker+Valid, 1199 SdHoareTripleChecker+Invalid, 2885 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 180 IncrementalHoareTripleChecker+Valid, 2705 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-11-06 19:51:16,824 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [730 Valid, 1199 Invalid, 2885 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [180 Valid, 2705 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-11-06 19:51:16,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77592 states. [2024-11-06 19:51:17,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77592 to 76794. [2024-11-06 19:51:17,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76794 states, 76793 states have (on average 1.1395830349120362) internal successors, (87512), 76793 states have internal predecessors, (87512), 0 states have call successors, (0), 0 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 19:51:17,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76794 states to 76794 states and 87512 transitions. [2024-11-06 19:51:17,673 INFO L78 Accepts]: Start accepts. Automaton has 76794 states and 87512 transitions. Word has length 355 [2024-11-06 19:51:17,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:51:17,673 INFO L471 AbstractCegarLoop]: Abstraction has 76794 states and 87512 transitions. [2024-11-06 19:51:17,674 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 2 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:51:17,674 INFO L276 IsEmpty]: Start isEmpty. Operand 76794 states and 87512 transitions. [2024-11-06 19:51:17,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 385 [2024-11-06 19:51:17,681 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:51:17,682 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 19:51:17,682 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-06 19:51:17,682 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:51:17,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:51:17,683 INFO L85 PathProgramCache]: Analyzing trace with hash 1356205505, now seen corresponding path program 1 times [2024-11-06 19:51:17,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:51:17,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864576033] [2024-11-06 19:51:17,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:51:17,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:51:17,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:51:18,986 INFO L134 CoverageAnalysis]: Checked inductivity of 449 backedges. 280 proven. 113 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2024-11-06 19:51:18,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:51:18,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864576033] [2024-11-06 19:51:18,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [864576033] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 19:51:18,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2025676746] [2024-11-06 19:51:18,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:51:18,987 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 19:51:18,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 19:51:18,993 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 19:51:18,994 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 19:51:19,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:51:19,150 INFO L255 TraceCheckSpWp]: Trace formula consists of 522 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-06 19:51:19,160 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 19:51:19,391 INFO L134 CoverageAnalysis]: Checked inductivity of 449 backedges. 280 proven. 0 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2024-11-06 19:51:19,391 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 19:51:19,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2025676746] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:51:19,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-06 19:51:19,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2024-11-06 19:51:19,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283132285] [2024-11-06 19:51:19,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:51:19,395 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:51:19,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:51:19,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:51:19,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-06 19:51:19,396 INFO L87 Difference]: Start difference. First operand 76794 states and 87512 transitions. Second operand has 3 states, 3 states have (on average 72.33333333333333) internal successors, (217), 3 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:51:22,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:51:22,437 INFO L93 Difference]: Finished difference Result 152797 states and 174229 transitions. [2024-11-06 19:51:22,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:51:22,438 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 72.33333333333333) internal successors, (217), 3 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 384 [2024-11-06 19:51:22,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:51:22,519 INFO L225 Difference]: With dead ends: 152797 [2024-11-06 19:51:22,519 INFO L226 Difference]: Without dead ends: 76792 [2024-11-06 19:51:22,552 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 390 GetRequests, 383 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-06 19:51:22,553 INFO L432 NwaCegarLoop]: 1362 mSDtfsCounter, 1122 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 2466 mSolverCounterSat, 450 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1122 SdHoareTripleChecker+Valid, 1443 SdHoareTripleChecker+Invalid, 2916 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 450 IncrementalHoareTripleChecker+Valid, 2466 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-11-06 19:51:22,553 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1122 Valid, 1443 Invalid, 2916 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [450 Valid, 2466 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-11-06 19:51:22,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76792 states. [2024-11-06 19:51:23,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76792 to 76004. [2024-11-06 19:51:23,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76004 states, 76003 states have (on average 1.1082325697669828) internal successors, (84229), 76003 states have internal predecessors, (84229), 0 states have call successors, (0), 0 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 19:51:23,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76004 states to 76004 states and 84229 transitions. [2024-11-06 19:51:23,381 INFO L78 Accepts]: Start accepts. Automaton has 76004 states and 84229 transitions. Word has length 384 [2024-11-06 19:51:23,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:51:23,382 INFO L471 AbstractCegarLoop]: Abstraction has 76004 states and 84229 transitions. [2024-11-06 19:51:23,382 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 72.33333333333333) internal successors, (217), 3 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:51:23,382 INFO L276 IsEmpty]: Start isEmpty. Operand 76004 states and 84229 transitions. [2024-11-06 19:51:23,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 415 [2024-11-06 19:51:23,387 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:51:23,387 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 19:51:23,409 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 19:51:23,588 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 19:51:23,588 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:51:23,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:51:23,589 INFO L85 PathProgramCache]: Analyzing trace with hash 166243839, now seen corresponding path program 1 times [2024-11-06 19:51:23,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:51:23,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962852437] [2024-11-06 19:51:23,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:51:23,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:51:23,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:51:24,001 INFO L134 CoverageAnalysis]: Checked inductivity of 713 backedges. 552 proven. 0 refuted. 0 times theorem prover too weak. 161 trivial. 0 not checked. [2024-11-06 19:51:24,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:51:24,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962852437] [2024-11-06 19:51:24,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [962852437] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:51:24,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:51:24,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:51:24,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198596301] [2024-11-06 19:51:24,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:51:24,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:51:24,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:51:24,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:51:24,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:51:24,003 INFO L87 Difference]: Start difference. First operand 76004 states and 84229 transitions. Second operand has 3 states, 3 states have (on average 85.0) internal successors, (255), 3 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:51:27,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:51:27,670 INFO L93 Difference]: Finished difference Result 170117 states and 190568 transitions. [2024-11-06 19:51:27,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:51:27,670 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 85.0) internal successors, (255), 3 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 414 [2024-11-06 19:51:27,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:51:27,779 INFO L225 Difference]: With dead ends: 170117 [2024-11-06 19:51:27,779 INFO L226 Difference]: Without dead ends: 94902 [2024-11-06 19:51:27,811 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 19:51:27,812 INFO L432 NwaCegarLoop]: 824 mSDtfsCounter, 905 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 2415 mSolverCounterSat, 944 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 905 SdHoareTripleChecker+Valid, 907 SdHoareTripleChecker+Invalid, 3359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 944 IncrementalHoareTripleChecker+Valid, 2415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-11-06 19:51:27,812 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [905 Valid, 907 Invalid, 3359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [944 Valid, 2415 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-11-06 19:51:27,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94902 states. [2024-11-06 19:51:28,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94902 to 94884. [2024-11-06 19:51:28,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94884 states, 94883 states have (on average 1.114235426788782) internal successors, (105722), 94883 states have internal predecessors, (105722), 0 states have call successors, (0), 0 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 19:51:28,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94884 states to 94884 states and 105722 transitions. [2024-11-06 19:51:28,673 INFO L78 Accepts]: Start accepts. Automaton has 94884 states and 105722 transitions. Word has length 414 [2024-11-06 19:51:28,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:51:28,674 INFO L471 AbstractCegarLoop]: Abstraction has 94884 states and 105722 transitions. [2024-11-06 19:51:28,674 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 85.0) internal successors, (255), 3 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:51:28,674 INFO L276 IsEmpty]: Start isEmpty. Operand 94884 states and 105722 transitions. [2024-11-06 19:51:28,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 448 [2024-11-06 19:51:28,680 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:51:28,680 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:51:28,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-06 19:51:28,680 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:51:28,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:51:28,681 INFO L85 PathProgramCache]: Analyzing trace with hash 296355202, now seen corresponding path program 1 times [2024-11-06 19:51:28,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:51:28,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990307156] [2024-11-06 19:51:28,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:51:28,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:51:28,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:51:28,992 INFO L134 CoverageAnalysis]: Checked inductivity of 486 backedges. 167 proven. 0 refuted. 0 times theorem prover too weak. 319 trivial. 0 not checked. [2024-11-06 19:51:28,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:51:28,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990307156] [2024-11-06 19:51:28,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [990307156] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:51:28,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:51:28,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:51:28,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143448953] [2024-11-06 19:51:28,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:51:28,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:51:28,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:51:28,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:51:28,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:51:28,994 INFO L87 Difference]: Start difference. First operand 94884 states and 105722 transitions. Second operand has 3 states, 3 states have (on average 75.66666666666667) internal successors, (227), 3 states have internal predecessors, (227), 0 states have call successors, (0), 0 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 19:51:33,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:51:33,014 INFO L93 Difference]: Finished difference Result 216612 states and 242478 transitions. [2024-11-06 19:51:33,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:51:33,015 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 75.66666666666667) internal successors, (227), 3 states have internal predecessors, (227), 0 states have call successors, (0), 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 447 [2024-11-06 19:51:33,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:51:33,150 INFO L225 Difference]: With dead ends: 216612 [2024-11-06 19:51:33,151 INFO L226 Difference]: Without dead ends: 122517 [2024-11-06 19:51:33,351 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 19:51:33,351 INFO L432 NwaCegarLoop]: 1753 mSDtfsCounter, 832 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 3124 mSolverCounterSat, 492 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 832 SdHoareTripleChecker+Valid, 1888 SdHoareTripleChecker+Invalid, 3616 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 492 IncrementalHoareTripleChecker+Valid, 3124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2024-11-06 19:51:33,352 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [832 Valid, 1888 Invalid, 3616 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [492 Valid, 3124 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2024-11-06 19:51:33,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122517 states. [2024-11-06 19:51:34,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122517 to 120896. [2024-11-06 19:51:34,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120896 states, 120895 states have (on average 1.1087472600190247) internal successors, (134042), 120895 states have internal predecessors, (134042), 0 states have call successors, (0), 0 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 19:51:34,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120896 states to 120896 states and 134042 transitions. [2024-11-06 19:51:34,525 INFO L78 Accepts]: Start accepts. Automaton has 120896 states and 134042 transitions. Word has length 447 [2024-11-06 19:51:34,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:51:34,526 INFO L471 AbstractCegarLoop]: Abstraction has 120896 states and 134042 transitions. [2024-11-06 19:51:34,526 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 75.66666666666667) internal successors, (227), 3 states have internal predecessors, (227), 0 states have call successors, (0), 0 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 19:51:34,526 INFO L276 IsEmpty]: Start isEmpty. Operand 120896 states and 134042 transitions. [2024-11-06 19:51:34,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 453 [2024-11-06 19:51:34,533 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:51:34,535 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, 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, 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] [2024-11-06 19:51:34,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-06 19:51:34,535 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:51:34,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:51:34,535 INFO L85 PathProgramCache]: Analyzing trace with hash -1736972796, now seen corresponding path program 1 times [2024-11-06 19:51:34,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:51:34,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182594676] [2024-11-06 19:51:34,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:51:34,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:51:34,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:51:34,773 INFO L134 CoverageAnalysis]: Checked inductivity of 722 backedges. 450 proven. 0 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2024-11-06 19:51:34,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:51:34,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182594676] [2024-11-06 19:51:34,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182594676] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:51:34,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:51:34,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:51:34,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610038849] [2024-11-06 19:51:34,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:51:34,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:51:34,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:51:34,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:51:34,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:51:34,775 INFO L87 Difference]: Start difference. First operand 120896 states and 134042 transitions. Second operand has 3 states, 3 states have (on average 90.0) internal successors, (270), 3 states have internal predecessors, (270), 0 states have call successors, (0), 0 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 19:51:37,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:51:37,911 INFO L93 Difference]: Finished difference Result 240230 states and 266473 transitions. [2024-11-06 19:51:37,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:51:37,912 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 90.0) internal successors, (270), 3 states have internal predecessors, (270), 0 states have call successors, (0), 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 19:51:37,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:51:38,043 INFO L225 Difference]: With dead ends: 240230 [2024-11-06 19:51:38,043 INFO L226 Difference]: Without dead ends: 120123 [2024-11-06 19:51:38,073 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 19:51:38,074 INFO L432 NwaCegarLoop]: 1717 mSDtfsCounter, 793 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 2505 mSolverCounterSat, 681 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 793 SdHoareTripleChecker+Valid, 1868 SdHoareTripleChecker+Invalid, 3186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 681 IncrementalHoareTripleChecker+Valid, 2505 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-06 19:51:38,074 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [793 Valid, 1868 Invalid, 3186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [681 Valid, 2505 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-11-06 19:51:38,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120123 states. [2024-11-06 19:51:39,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120123 to 118525. [2024-11-06 19:51:39,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118525 states, 118524 states have (on average 1.0782541932435625) internal successors, (127799), 118524 states have internal predecessors, (127799), 0 states have call successors, (0), 0 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 19:51:39,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118525 states to 118525 states and 127799 transitions. [2024-11-06 19:51:39,335 INFO L78 Accepts]: Start accepts. Automaton has 118525 states and 127799 transitions. Word has length 452 [2024-11-06 19:51:39,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:51:39,336 INFO L471 AbstractCegarLoop]: Abstraction has 118525 states and 127799 transitions. [2024-11-06 19:51:39,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 90.0) internal successors, (270), 3 states have internal predecessors, (270), 0 states have call successors, (0), 0 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 19:51:39,337 INFO L276 IsEmpty]: Start isEmpty. Operand 118525 states and 127799 transitions. [2024-11-06 19:51:39,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 463 [2024-11-06 19:51:39,347 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:51:39,347 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-06 19:51:39,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-06 19:51:39,347 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:51:39,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:51:39,348 INFO L85 PathProgramCache]: Analyzing trace with hash 778419174, now seen corresponding path program 1 times [2024-11-06 19:51:39,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:51:39,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479676006] [2024-11-06 19:51:39,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:51:39,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:51:39,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:51:39,865 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2024-11-06 19:51:39,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:51:39,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479676006] [2024-11-06 19:51:39,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479676006] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:51:39,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:51:39,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:51:39,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566133518] [2024-11-06 19:51:39,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:51:39,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-06 19:51:39,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:51:39,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-06 19:51:39,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-06 19:51:39,867 INFO L87 Difference]: Start difference. First operand 118525 states and 127799 transitions. Second operand has 4 states, 4 states have (on average 92.0) 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 19:51:45,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:51:45,141 INFO L93 Difference]: Finished difference Result 297702 states and 324695 transitions. [2024-11-06 19:51:45,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-06 19:51:45,142 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 92.0) 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 462 [2024-11-06 19:51:45,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:51:45,371 INFO L225 Difference]: With dead ends: 297702 [2024-11-06 19:51:45,371 INFO L226 Difference]: Without dead ends: 194928 [2024-11-06 19:51:45,422 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 19:51:45,423 INFO L432 NwaCegarLoop]: 678 mSDtfsCounter, 1479 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 5283 mSolverCounterSat, 834 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1479 SdHoareTripleChecker+Valid, 893 SdHoareTripleChecker+Invalid, 6117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 834 IncrementalHoareTripleChecker+Valid, 5283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2024-11-06 19:51:45,423 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1479 Valid, 893 Invalid, 6117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [834 Valid, 5283 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2024-11-06 19:51:45,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194928 states. [2024-11-06 19:51:47,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194928 to 194903. [2024-11-06 19:51:47,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194903 states, 194902 states have (on average 1.07827523575951) internal successors, (210158), 194902 states have internal predecessors, (210158), 0 states have call successors, (0), 0 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 19:51:47,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194903 states to 194903 states and 210158 transitions. [2024-11-06 19:51:47,865 INFO L78 Accepts]: Start accepts. Automaton has 194903 states and 210158 transitions. Word has length 462 [2024-11-06 19:51:47,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:51:47,866 INFO L471 AbstractCegarLoop]: Abstraction has 194903 states and 210158 transitions. [2024-11-06 19:51:47,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 92.0) 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 19:51:47,866 INFO L276 IsEmpty]: Start isEmpty. Operand 194903 states and 210158 transitions. [2024-11-06 19:51:47,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 475 [2024-11-06 19:51:47,874 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:51:47,874 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:51:47,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-06 19:51:47,875 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:51:47,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:51:47,875 INFO L85 PathProgramCache]: Analyzing trace with hash 1386691199, now seen corresponding path program 1 times [2024-11-06 19:51:47,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:51:47,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85921426] [2024-11-06 19:51:47,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:51:47,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:51:47,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:51:48,772 INFO L134 CoverageAnalysis]: Checked inductivity of 518 backedges. 352 proven. 110 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2024-11-06 19:51:48,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:51:48,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85921426] [2024-11-06 19:51:48,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85921426] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 19:51:48,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1709702722] [2024-11-06 19:51:48,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:51:48,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 19:51:48,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 19:51:48,775 INFO L229 MonitoredProcess]: Starting monitored process 3 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 19:51:48,776 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-06 19:51:48,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:51:48,900 INFO L255 TraceCheckSpWp]: Trace formula consists of 612 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-06 19:51:48,905 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 19:51:48,935 INFO L134 CoverageAnalysis]: Checked inductivity of 518 backedges. 349 proven. 0 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2024-11-06 19:51:48,935 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 19:51:48,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1709702722] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:51:48,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-06 19:51:48,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2024-11-06 19:51:48,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025617104] [2024-11-06 19:51:48,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:51:48,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:51:48,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:51:48,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:51:48,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-06 19:51:48,936 INFO L87 Difference]: Start difference. First operand 194903 states and 210158 transitions. Second operand has 3 states, 3 states have (on average 102.33333333333333) internal successors, (307), 3 states have internal predecessors, (307), 0 states have call successors, (0), 0 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 19:51:52,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:51:52,841 INFO L93 Difference]: Finished difference Result 405521 states and 437882 transitions. [2024-11-06 19:51:52,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:51:52,842 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 102.33333333333333) internal successors, (307), 3 states have internal predecessors, (307), 0 states have call successors, (0), 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 474 [2024-11-06 19:51:52,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:51:53,112 INFO L225 Difference]: With dead ends: 405521 [2024-11-06 19:51:53,112 INFO L226 Difference]: Without dead ends: 224005 [2024-11-06 19:51:53,177 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 479 GetRequests, 473 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-06 19:51:53,177 INFO L432 NwaCegarLoop]: 1635 mSDtfsCounter, 940 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 2655 mSolverCounterSat, 759 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 940 SdHoareTripleChecker+Valid, 1750 SdHoareTripleChecker+Invalid, 3414 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 759 IncrementalHoareTripleChecker+Valid, 2655 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-11-06 19:51:53,177 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [940 Valid, 1750 Invalid, 3414 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [759 Valid, 2655 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-11-06 19:51:53,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224005 states. [2024-11-06 19:51:55,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224005 to 212980. [2024-11-06 19:51:55,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212980 states, 212979 states have (on average 1.0723733325820854) internal successors, (228393), 212979 states have internal predecessors, (228393), 0 states have call successors, (0), 0 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 19:51:56,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212980 states to 212980 states and 228393 transitions. [2024-11-06 19:51:56,284 INFO L78 Accepts]: Start accepts. Automaton has 212980 states and 228393 transitions. Word has length 474 [2024-11-06 19:51:56,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:51:56,284 INFO L471 AbstractCegarLoop]: Abstraction has 212980 states and 228393 transitions. [2024-11-06 19:51:56,284 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 102.33333333333333) internal successors, (307), 3 states have internal predecessors, (307), 0 states have call successors, (0), 0 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 19:51:56,284 INFO L276 IsEmpty]: Start isEmpty. Operand 212980 states and 228393 transitions. [2024-11-06 19:51:56,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 531 [2024-11-06 19:51:56,295 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:51:56,295 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:51:56,307 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-06 19:51:56,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 19:51:56,496 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:51:56,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:51:56,496 INFO L85 PathProgramCache]: Analyzing trace with hash 24078424, now seen corresponding path program 1 times [2024-11-06 19:51:56,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:51:56,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249025389] [2024-11-06 19:51:56,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:51:56,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:51:56,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:51:57,778 INFO L134 CoverageAnalysis]: Checked inductivity of 518 backedges. 349 proven. 113 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2024-11-06 19:51:57,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:51:57,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249025389] [2024-11-06 19:51:57,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [249025389] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 19:51:57,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1355039412] [2024-11-06 19:51:57,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:51:57,779 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 19:51:57,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 19:51:57,783 INFO L229 MonitoredProcess]: Starting monitored process 4 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 19:51:57,785 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-06 19:51:57,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:51:57,968 INFO L255 TraceCheckSpWp]: Trace formula consists of 666 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-06 19:51:57,975 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 19:51:57,993 INFO L134 CoverageAnalysis]: Checked inductivity of 518 backedges. 167 proven. 0 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2024-11-06 19:51:57,993 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 19:51:57,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1355039412] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:51:57,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-06 19:51:57,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2024-11-06 19:51:57,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103942812] [2024-11-06 19:51:57,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:51:57,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:51:57,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:51:57,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:51:57,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-06 19:51:57,995 INFO L87 Difference]: Start difference. First operand 212980 states and 228393 transitions. Second operand has 3 states, 3 states have (on average 98.0) internal successors, (294), 3 states have internal predecessors, (294), 0 states have call successors, (0), 0 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 19:52:01,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:52:01,414 INFO L93 Difference]: Finished difference Result 408632 states and 438960 transitions. [2024-11-06 19:52:01,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:52:01,414 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 98.0) internal successors, (294), 3 states have internal predecessors, (294), 0 states have call successors, (0), 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 530 [2024-11-06 19:52:01,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:52:01,675 INFO L225 Difference]: With dead ends: 408632 [2024-11-06 19:52:01,675 INFO L226 Difference]: Without dead ends: 211402 [2024-11-06 19:52:01,746 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 536 GetRequests, 529 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-06 19:52:01,747 INFO L432 NwaCegarLoop]: 1711 mSDtfsCounter, 915 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 2375 mSolverCounterSat, 299 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 915 SdHoareTripleChecker+Valid, 1838 SdHoareTripleChecker+Invalid, 2674 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 299 IncrementalHoareTripleChecker+Valid, 2375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-06 19:52:01,747 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [915 Valid, 1838 Invalid, 2674 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [299 Valid, 2375 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-06 19:52:01,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211402 states.