./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pals_lcr.7.1.ufo.BOUNDED-14.pals+Problem12_label05.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/combinations/pals_lcr.7.1.ufo.BOUNDED-14.pals+Problem12_label05.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', '616bab40818b87d728a052729e2d9dd8669a50a14a8b23186662b937cbcc108d'] 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/combinations/pals_lcr.7.1.ufo.BOUNDED-14.pals+Problem12_label05.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 616bab40818b87d728a052729e2d9dd8669a50a14a8b23186662b937cbcc108d --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 01:37:04,968 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 01:37:05,055 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-07 01:37:05,062 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 01:37:05,063 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 01:37:05,085 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 01:37:05,086 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 01:37:05,086 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 01:37:05,087 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 01:37:05,087 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 01:37:05,087 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 01:37:05,087 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 01:37:05,088 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 01:37:05,088 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 01:37:05,088 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 01:37:05,088 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 01:37:05,088 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 01:37:05,089 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 01:37:05,089 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 01:37:05,089 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 01:37:05,089 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 01:37:05,089 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 01:37:05,089 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 01:37:05,089 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 01:37:05,089 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 01:37:05,090 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 01:37:05,090 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 01:37:05,090 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 01:37:05,090 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 01:37:05,090 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 01:37:05,090 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 01:37:05,090 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 01:37:05,090 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 01:37:05,090 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 01:37:05,091 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 01:37:05,091 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 01:37:05,091 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 01:37:05,091 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 01:37:05,091 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 01:37:05,091 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 01:37:05,091 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 01:37:05,091 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 01:37:05,092 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 -> 616bab40818b87d728a052729e2d9dd8669a50a14a8b23186662b937cbcc108d [2024-11-07 01:37:05,318 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 01:37:05,323 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 01:37:05,327 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 01:37:05,327 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 01:37:05,328 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 01:37:05,328 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pals_lcr.7.1.ufo.BOUNDED-14.pals+Problem12_label05.c [2024-11-07 01:37:06,539 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 01:37:06,887 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 01:37:06,889 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.7.1.ufo.BOUNDED-14.pals+Problem12_label05.c [2024-11-07 01:37:06,917 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1b2109b1b/abbd8a06413b40e49b59792fbd9359fa/FLAG5d1bb8278 [2024-11-07 01:37:06,932 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1b2109b1b/abbd8a06413b40e49b59792fbd9359fa [2024-11-07 01:37:06,934 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 01:37:06,935 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 01:37:06,937 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 01:37:06,937 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 01:37:06,939 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 01:37:06,940 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:37:06" (1/1) ... [2024-11-07 01:37:06,940 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33f7182d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:37:06, skipping insertion in model container [2024-11-07 01:37:06,941 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:37:06" (1/1) ... [2024-11-07 01:37:07,017 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 01:37:07,302 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/combinations/pals_lcr.7.1.ufo.BOUNDED-14.pals+Problem12_label05.c[20463,20476] [2024-11-07 01:37:07,353 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/combinations/pals_lcr.7.1.ufo.BOUNDED-14.pals+Problem12_label05.c[27399,27412] [2024-11-07 01:37:07,742 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 01:37:07,754 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 01:37:07,779 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/combinations/pals_lcr.7.1.ufo.BOUNDED-14.pals+Problem12_label05.c[20463,20476] [2024-11-07 01:37:07,787 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/combinations/pals_lcr.7.1.ufo.BOUNDED-14.pals+Problem12_label05.c[27399,27412] [2024-11-07 01:37:08,012 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 01:37:08,036 INFO L204 MainTranslator]: Completed translation [2024-11-07 01:37:08,037 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:37:08 WrapperNode [2024-11-07 01:37:08,038 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 01:37:08,038 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 01:37:08,038 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 01:37:08,038 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 01:37:08,042 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:37:08" (1/1) ... [2024-11-07 01:37:08,087 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:37:08" (1/1) ... [2024-11-07 01:37:08,382 INFO L138 Inliner]: procedures = 38, calls = 24, calls flagged for inlining = 19, calls inlined = 19, statements flattened = 5222 [2024-11-07 01:37:08,382 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 01:37:08,383 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 01:37:08,383 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 01:37:08,384 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 01:37:08,390 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:37:08" (1/1) ... [2024-11-07 01:37:08,391 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:37:08" (1/1) ... [2024-11-07 01:37:08,424 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:37:08" (1/1) ... [2024-11-07 01:37:08,605 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-07 01:37:08,607 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:37:08" (1/1) ... [2024-11-07 01:37:08,608 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:37:08" (1/1) ... [2024-11-07 01:37:08,705 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:37:08" (1/1) ... [2024-11-07 01:37:08,770 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:37:08" (1/1) ... [2024-11-07 01:37:08,802 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:37:08" (1/1) ... [2024-11-07 01:37:08,814 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:37:08" (1/1) ... [2024-11-07 01:37:08,860 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 01:37:08,862 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 01:37:08,863 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 01:37:08,863 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 01:37:08,864 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:37:08" (1/1) ... [2024-11-07 01:37:08,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 01:37:08,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 01:37:08,891 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-07 01:37:08,895 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-07 01:37:08,910 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 01:37:08,910 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 01:37:08,911 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 01:37:08,911 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 01:37:09,016 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 01:37:09,017 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 01:37:12,375 INFO L? ?]: Removed 754 outVars from TransFormulas that were not future-live. [2024-11-07 01:37:12,376 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 01:37:12,409 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 01:37:12,410 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-07 01:37:12,410 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:37:12 BoogieIcfgContainer [2024-11-07 01:37:12,410 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 01:37:12,412 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 01:37:12,412 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 01:37:12,416 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 01:37:12,416 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 01:37:06" (1/3) ... [2024-11-07 01:37:12,416 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2712b69f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:37:12, skipping insertion in model container [2024-11-07 01:37:12,416 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:37:08" (2/3) ... [2024-11-07 01:37:12,416 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2712b69f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:37:12, skipping insertion in model container [2024-11-07 01:37:12,417 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:37:12" (3/3) ... [2024-11-07 01:37:12,417 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.7.1.ufo.BOUNDED-14.pals+Problem12_label05.c [2024-11-07 01:37:12,427 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 01:37:12,428 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-07 01:37:12,550 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 01:37:12,560 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;@14f55c3c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 01:37:12,561 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-07 01:37:12,569 INFO L276 IsEmpty]: Start isEmpty. Operand has 930 states, 927 states have (on average 1.9039913700107876) internal successors, (1765), 929 states have internal predecessors, (1765), 0 states have call successors, (0), 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-07 01:37:12,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-07 01:37:12,578 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:37:12,579 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] [2024-11-07 01:37:12,580 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:37:12,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:37:12,584 INFO L85 PathProgramCache]: Analyzing trace with hash 495960789, now seen corresponding path program 1 times [2024-11-07 01:37:12,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:37:12,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086465297] [2024-11-07 01:37:12,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:37:12,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:37:12,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:37:12,806 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-07 01:37:12,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:37:12,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086465297] [2024-11-07 01:37:12,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1086465297] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:37:12,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:37:12,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 01:37:12,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052791645] [2024-11-07 01:37:12,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:37:12,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 01:37:12,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:37:12,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 01:37:12,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 01:37:12,830 INFO L87 Difference]: Start difference. First operand has 930 states, 927 states have (on average 1.9039913700107876) internal successors, (1765), 929 states have internal predecessors, (1765), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 0 states have call successors, (0), 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-07 01:37:12,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:37:12,893 INFO L93 Difference]: Finished difference Result 1804 states and 3422 transitions. [2024-11-07 01:37:12,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 01:37:12,895 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 0 states have call successors, (0), 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 28 [2024-11-07 01:37:12,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:37:12,912 INFO L225 Difference]: With dead ends: 1804 [2024-11-07 01:37:12,913 INFO L226 Difference]: Without dead ends: 864 [2024-11-07 01:37:12,918 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 01:37:12,921 INFO L432 NwaCegarLoop]: 1699 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1699 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 01:37:12,922 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1699 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 01:37:12,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 864 states. [2024-11-07 01:37:12,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 864 to 864. [2024-11-07 01:37:12,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 864 states, 862 states have (on average 1.8932714617169373) internal successors, (1632), 863 states have internal predecessors, (1632), 0 states have call successors, (0), 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-07 01:37:12,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 864 states to 864 states and 1632 transitions. [2024-11-07 01:37:12,991 INFO L78 Accepts]: Start accepts. Automaton has 864 states and 1632 transitions. Word has length 28 [2024-11-07 01:37:12,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:37:12,991 INFO L471 AbstractCegarLoop]: Abstraction has 864 states and 1632 transitions. [2024-11-07 01:37:12,991 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 0 states have call successors, (0), 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-07 01:37:12,992 INFO L276 IsEmpty]: Start isEmpty. Operand 864 states and 1632 transitions. [2024-11-07 01:37:12,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-07 01:37:12,993 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:37:12,993 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] [2024-11-07 01:37:12,993 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 01:37:12,993 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:37:12,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:37:12,994 INFO L85 PathProgramCache]: Analyzing trace with hash 714815507, now seen corresponding path program 1 times [2024-11-07 01:37:12,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:37:12,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137913694] [2024-11-07 01:37:12,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:37:12,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:37:13,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:37:13,215 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-07 01:37:13,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:37:13,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137913694] [2024-11-07 01:37:13,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137913694] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:37:13,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:37:13,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 01:37:13,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366649540] [2024-11-07 01:37:13,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:37:13,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 01:37:13,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:37:13,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 01:37:13,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 01:37:13,218 INFO L87 Difference]: Start difference. First operand 864 states and 1632 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 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-07 01:37:13,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:37:13,312 INFO L93 Difference]: Finished difference Result 922 states and 1723 transitions. [2024-11-07 01:37:13,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 01:37:13,313 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 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 28 [2024-11-07 01:37:13,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:37:13,316 INFO L225 Difference]: With dead ends: 922 [2024-11-07 01:37:13,316 INFO L226 Difference]: Without dead ends: 864 [2024-11-07 01:37:13,317 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 01:37:13,317 INFO L432 NwaCegarLoop]: 1630 mSDtfsCounter, 0 mSDsluCounter, 4835 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6465 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 01:37:13,318 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6465 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 01:37:13,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 864 states. [2024-11-07 01:37:13,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 864 to 864. [2024-11-07 01:37:13,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 864 states, 862 states have (on average 1.8352668213457077) internal successors, (1582), 863 states have internal predecessors, (1582), 0 states have call successors, (0), 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-07 01:37:13,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 864 states to 864 states and 1582 transitions. [2024-11-07 01:37:13,336 INFO L78 Accepts]: Start accepts. Automaton has 864 states and 1582 transitions. Word has length 28 [2024-11-07 01:37:13,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:37:13,336 INFO L471 AbstractCegarLoop]: Abstraction has 864 states and 1582 transitions. [2024-11-07 01:37:13,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 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-07 01:37:13,337 INFO L276 IsEmpty]: Start isEmpty. Operand 864 states and 1582 transitions. [2024-11-07 01:37:13,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-07 01:37:13,338 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:37:13,338 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:37:13,338 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 01:37:13,338 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:37:13,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:37:13,339 INFO L85 PathProgramCache]: Analyzing trace with hash 1438669637, now seen corresponding path program 1 times [2024-11-07 01:37:13,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:37:13,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086739939] [2024-11-07 01:37:13,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:37:13,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:37:13,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:37:13,544 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-07 01:37:13,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:37:13,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086739939] [2024-11-07 01:37:13,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086739939] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:37:13,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:37:13,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 01:37:13,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943050484] [2024-11-07 01:37:13,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:37:13,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 01:37:13,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:37:13,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 01:37:13,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 01:37:13,548 INFO L87 Difference]: Start difference. First operand 864 states and 1582 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:37:18,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:37:18,550 INFO L93 Difference]: Finished difference Result 3119 states and 5891 transitions. [2024-11-07 01:37:18,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 01:37:18,551 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2024-11-07 01:37:18,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:37:18,561 INFO L225 Difference]: With dead ends: 3119 [2024-11-07 01:37:18,562 INFO L226 Difference]: Without dead ends: 2366 [2024-11-07 01:37:18,564 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-07 01:37:18,567 INFO L432 NwaCegarLoop]: 836 mSDtfsCounter, 2467 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 5518 mSolverCounterSat, 1100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2467 SdHoareTripleChecker+Valid, 854 SdHoareTripleChecker+Invalid, 6618 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1100 IncrementalHoareTripleChecker+Valid, 5518 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2024-11-07 01:37:18,567 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2467 Valid, 854 Invalid, 6618 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1100 Valid, 5518 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2024-11-07 01:37:18,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2366 states. [2024-11-07 01:37:18,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2366 to 2366. [2024-11-07 01:37:18,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2366 states, 2364 states have (on average 1.5685279187817258) internal successors, (3708), 2365 states have internal predecessors, (3708), 0 states have call successors, (0), 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-07 01:37:18,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2366 states to 2366 states and 3708 transitions. [2024-11-07 01:37:18,621 INFO L78 Accepts]: Start accepts. Automaton has 2366 states and 3708 transitions. Word has length 60 [2024-11-07 01:37:18,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:37:18,621 INFO L471 AbstractCegarLoop]: Abstraction has 2366 states and 3708 transitions. [2024-11-07 01:37:18,621 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:37:18,621 INFO L276 IsEmpty]: Start isEmpty. Operand 2366 states and 3708 transitions. [2024-11-07 01:37:18,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-07 01:37:18,625 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:37:18,625 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:37:18,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 01:37:18,625 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:37:18,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:37:18,626 INFO L85 PathProgramCache]: Analyzing trace with hash -585081934, now seen corresponding path program 1 times [2024-11-07 01:37:18,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:37:18,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013619139] [2024-11-07 01:37:18,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:37:18,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:37:18,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:37:18,856 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-07 01:37:18,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:37:18,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013619139] [2024-11-07 01:37:18,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1013619139] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:37:18,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:37:18,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-07 01:37:18,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055439066] [2024-11-07 01:37:18,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:37:18,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 01:37:18,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:37:18,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 01:37:18,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-07 01:37:18,858 INFO L87 Difference]: Start difference. First operand 2366 states and 3708 transitions. Second operand has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 0 states have call successors, (0), 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-07 01:37:19,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:37:19,185 INFO L93 Difference]: Finished difference Result 3122 states and 4926 transitions. [2024-11-07 01:37:19,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-07 01:37:19,186 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 0 states have call successors, (0), 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 77 [2024-11-07 01:37:19,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:37:19,196 INFO L225 Difference]: With dead ends: 3122 [2024-11-07 01:37:19,196 INFO L226 Difference]: Without dead ends: 3068 [2024-11-07 01:37:19,197 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=124, Invalid=256, Unknown=0, NotChecked=0, Total=380 [2024-11-07 01:37:19,198 INFO L432 NwaCegarLoop]: 1578 mSDtfsCounter, 11503 mSDsluCounter, 3556 mSDsCounter, 0 mSdLazyCounter, 300 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11503 SdHoareTripleChecker+Valid, 5134 SdHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 01:37:19,198 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11503 Valid, 5134 Invalid, 310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 300 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 01:37:19,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3068 states. [2024-11-07 01:37:19,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3068 to 2418. [2024-11-07 01:37:19,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2418 states, 2416 states have (on average 1.5695364238410596) internal successors, (3792), 2417 states have internal predecessors, (3792), 0 states have call successors, (0), 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-07 01:37:19,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2418 states to 2418 states and 3792 transitions. [2024-11-07 01:37:19,238 INFO L78 Accepts]: Start accepts. Automaton has 2418 states and 3792 transitions. Word has length 77 [2024-11-07 01:37:19,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:37:19,239 INFO L471 AbstractCegarLoop]: Abstraction has 2418 states and 3792 transitions. [2024-11-07 01:37:19,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 0 states have call successors, (0), 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-07 01:37:19,239 INFO L276 IsEmpty]: Start isEmpty. Operand 2418 states and 3792 transitions. [2024-11-07 01:37:19,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-07 01:37:19,240 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:37:19,240 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:37:19,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 01:37:19,240 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:37:19,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:37:19,240 INFO L85 PathProgramCache]: Analyzing trace with hash -1038714270, now seen corresponding path program 1 times [2024-11-07 01:37:19,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:37:19,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439954902] [2024-11-07 01:37:19,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:37:19,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:37:19,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:37:19,338 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-07 01:37:19,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:37:19,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439954902] [2024-11-07 01:37:19,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1439954902] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:37:19,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:37:19,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 01:37:19,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785955209] [2024-11-07 01:37:19,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:37:19,339 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 01:37:19,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:37:19,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 01:37:19,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 01:37:19,340 INFO L87 Difference]: Start difference. First operand 2418 states and 3792 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 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-07 01:37:19,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:37:19,366 INFO L93 Difference]: Finished difference Result 2619 states and 4115 transitions. [2024-11-07 01:37:19,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 01:37:19,367 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 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 79 [2024-11-07 01:37:19,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:37:19,375 INFO L225 Difference]: With dead ends: 2619 [2024-11-07 01:37:19,375 INFO L226 Difference]: Without dead ends: 2513 [2024-11-07 01:37:19,376 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-07 01:37:19,377 INFO L432 NwaCegarLoop]: 1580 mSDtfsCounter, 1498 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1498 SdHoareTripleChecker+Valid, 1662 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 01:37:19,377 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1498 Valid, 1662 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 01:37:19,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2513 states. [2024-11-07 01:37:19,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2513 to 2511. [2024-11-07 01:37:19,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2511 states, 2509 states have (on average 1.570346751693902) internal successors, (3940), 2510 states have internal predecessors, (3940), 0 states have call successors, (0), 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-07 01:37:19,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2511 states to 2511 states and 3940 transitions. [2024-11-07 01:37:19,417 INFO L78 Accepts]: Start accepts. Automaton has 2511 states and 3940 transitions. Word has length 79 [2024-11-07 01:37:19,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:37:19,417 INFO L471 AbstractCegarLoop]: Abstraction has 2511 states and 3940 transitions. [2024-11-07 01:37:19,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 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-07 01:37:19,418 INFO L276 IsEmpty]: Start isEmpty. Operand 2511 states and 3940 transitions. [2024-11-07 01:37:19,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-07 01:37:19,418 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:37:19,418 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:37:19,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 01:37:19,419 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:37:19,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:37:19,419 INFO L85 PathProgramCache]: Analyzing trace with hash -972220758, now seen corresponding path program 1 times [2024-11-07 01:37:19,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:37:19,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179057743] [2024-11-07 01:37:19,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:37:19,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:37:19,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:37:19,762 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-07 01:37:19,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:37:19,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179057743] [2024-11-07 01:37:19,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [179057743] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:37:19,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:37:19,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-07 01:37:19,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124922721] [2024-11-07 01:37:19,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:37:19,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 01:37:19,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:37:19,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 01:37:19,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-07 01:37:19,764 INFO L87 Difference]: Start difference. First operand 2511 states and 3940 transitions. Second operand has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 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-07 01:37:20,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:37:20,028 INFO L93 Difference]: Finished difference Result 2712 states and 4260 transitions. [2024-11-07 01:37:20,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 01:37:20,029 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 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 79 [2024-11-07 01:37:20,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:37:20,037 INFO L225 Difference]: With dead ends: 2712 [2024-11-07 01:37:20,037 INFO L226 Difference]: Without dead ends: 2513 [2024-11-07 01:37:20,039 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2024-11-07 01:37:20,039 INFO L432 NwaCegarLoop]: 1573 mSDtfsCounter, 10553 mSDsluCounter, 504 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10553 SdHoareTripleChecker+Valid, 2077 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 01:37:20,039 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10553 Valid, 2077 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 01:37:20,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2513 states. [2024-11-07 01:37:20,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2513 to 2511. [2024-11-07 01:37:20,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2511 states, 2509 states have (on average 1.5695496213630928) internal successors, (3938), 2510 states have internal predecessors, (3938), 0 states have call successors, (0), 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-07 01:37:20,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2511 states to 2511 states and 3938 transitions. [2024-11-07 01:37:20,079 INFO L78 Accepts]: Start accepts. Automaton has 2511 states and 3938 transitions. Word has length 79 [2024-11-07 01:37:20,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:37:20,079 INFO L471 AbstractCegarLoop]: Abstraction has 2511 states and 3938 transitions. [2024-11-07 01:37:20,079 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 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-07 01:37:20,080 INFO L276 IsEmpty]: Start isEmpty. Operand 2511 states and 3938 transitions. [2024-11-07 01:37:20,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-07 01:37:20,080 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:37:20,080 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:37:20,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 01:37:20,081 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:37:20,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:37:20,081 INFO L85 PathProgramCache]: Analyzing trace with hash -488795339, now seen corresponding path program 1 times [2024-11-07 01:37:20,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:37:20,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717487417] [2024-11-07 01:37:20,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:37:20,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:37:20,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:37:20,440 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-07 01:37:20,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:37:20,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717487417] [2024-11-07 01:37:20,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [717487417] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:37:20,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:37:20,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 01:37:20,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285643454] [2024-11-07 01:37:20,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:37:20,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 01:37:20,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:37:20,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 01:37:20,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-07 01:37:20,442 INFO L87 Difference]: Start difference. First operand 2511 states and 3938 transitions. Second operand has 8 states, 8 states have (on average 10.0) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 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-07 01:37:20,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:37:20,572 INFO L93 Difference]: Finished difference Result 2519 states and 3947 transitions. [2024-11-07 01:37:20,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 01:37:20,573 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.0) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 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 80 [2024-11-07 01:37:20,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:37:20,586 INFO L225 Difference]: With dead ends: 2519 [2024-11-07 01:37:20,586 INFO L226 Difference]: Without dead ends: 2517 [2024-11-07 01:37:20,588 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-07 01:37:20,588 INFO L432 NwaCegarLoop]: 1576 mSDtfsCounter, 0 mSDsluCounter, 9443 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 11019 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 01:37:20,588 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 11019 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 01:37:20,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2517 states. [2024-11-07 01:37:20,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2517 to 2517. [2024-11-07 01:37:20,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2517 states, 2515 states have (on average 1.5677932405566601) internal successors, (3943), 2516 states have internal predecessors, (3943), 0 states have call successors, (0), 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-07 01:37:20,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2517 states to 2517 states and 3943 transitions. [2024-11-07 01:37:20,637 INFO L78 Accepts]: Start accepts. Automaton has 2517 states and 3943 transitions. Word has length 80 [2024-11-07 01:37:20,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:37:20,637 INFO L471 AbstractCegarLoop]: Abstraction has 2517 states and 3943 transitions. [2024-11-07 01:37:20,637 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.0) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 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-07 01:37:20,637 INFO L276 IsEmpty]: Start isEmpty. Operand 2517 states and 3943 transitions. [2024-11-07 01:37:20,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-07 01:37:20,639 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:37:20,640 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:37:20,640 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 01:37:20,640 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:37:20,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:37:20,640 INFO L85 PathProgramCache]: Analyzing trace with hash 295676394, now seen corresponding path program 1 times [2024-11-07 01:37:20,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:37:20,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457224231] [2024-11-07 01:37:20,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:37:20,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:37:20,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:37:20,719 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-07 01:37:20,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:37:20,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457224231] [2024-11-07 01:37:20,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457224231] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:37:20,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:37:20,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 01:37:20,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260242212] [2024-11-07 01:37:20,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:37:20,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 01:37:20,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:37:20,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 01:37:20,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 01:37:20,721 INFO L87 Difference]: Start difference. First operand 2517 states and 3943 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 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-07 01:37:20,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:37:20,746 INFO L93 Difference]: Finished difference Result 2735 states and 4284 transitions. [2024-11-07 01:37:20,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 01:37:20,747 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 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 81 [2024-11-07 01:37:20,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:37:20,753 INFO L225 Difference]: With dead ends: 2735 [2024-11-07 01:37:20,753 INFO L226 Difference]: Without dead ends: 2623 [2024-11-07 01:37:20,753 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-07 01:37:20,754 INFO L432 NwaCegarLoop]: 1654 mSDtfsCounter, 1516 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1516 SdHoareTripleChecker+Valid, 1742 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 01:37:20,754 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1516 Valid, 1742 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 01:37:20,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2623 states. [2024-11-07 01:37:20,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2623 to 2621. [2024-11-07 01:37:20,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2621 states, 2619 states have (on average 1.5670103092783505) internal successors, (4104), 2620 states have internal predecessors, (4104), 0 states have call successors, (0), 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-07 01:37:20,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2621 states to 2621 states and 4104 transitions. [2024-11-07 01:37:20,789 INFO L78 Accepts]: Start accepts. Automaton has 2621 states and 4104 transitions. Word has length 81 [2024-11-07 01:37:20,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:37:20,789 INFO L471 AbstractCegarLoop]: Abstraction has 2621 states and 4104 transitions. [2024-11-07 01:37:20,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 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-07 01:37:20,789 INFO L276 IsEmpty]: Start isEmpty. Operand 2621 states and 4104 transitions. [2024-11-07 01:37:20,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-07 01:37:20,790 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:37:20,790 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:37:20,790 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-07 01:37:20,790 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:37:20,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:37:20,791 INFO L85 PathProgramCache]: Analyzing trace with hash -2057221398, now seen corresponding path program 1 times [2024-11-07 01:37:20,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:37:20,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361087918] [2024-11-07 01:37:20,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:37:20,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:37:20,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:37:20,834 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-07 01:37:20,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:37:20,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361087918] [2024-11-07 01:37:20,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361087918] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:37:20,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:37:20,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 01:37:20,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179691832] [2024-11-07 01:37:20,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:37:20,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 01:37:20,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:37:20,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 01:37:20,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 01:37:20,835 INFO L87 Difference]: Start difference. First operand 2621 states and 4104 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 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-07 01:37:20,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:37:20,865 INFO L93 Difference]: Finished difference Result 3211 states and 5024 transitions. [2024-11-07 01:37:20,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 01:37:20,866 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 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 81 [2024-11-07 01:37:20,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:37:20,873 INFO L225 Difference]: With dead ends: 3211 [2024-11-07 01:37:20,873 INFO L226 Difference]: Without dead ends: 2904 [2024-11-07 01:37:20,874 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-07 01:37:20,874 INFO L432 NwaCegarLoop]: 1656 mSDtfsCounter, 1514 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1514 SdHoareTripleChecker+Valid, 1748 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 01:37:20,875 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1514 Valid, 1748 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 01:37:20,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2904 states. [2024-11-07 01:37:20,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2904 to 2902. [2024-11-07 01:37:20,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2902 states, 2900 states have (on average 1.5641379310344827) internal successors, (4536), 2901 states have internal predecessors, (4536), 0 states have call successors, (0), 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-07 01:37:20,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2902 states to 2902 states and 4536 transitions. [2024-11-07 01:37:20,923 INFO L78 Accepts]: Start accepts. Automaton has 2902 states and 4536 transitions. Word has length 81 [2024-11-07 01:37:20,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:37:20,923 INFO L471 AbstractCegarLoop]: Abstraction has 2902 states and 4536 transitions. [2024-11-07 01:37:20,923 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 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-07 01:37:20,924 INFO L276 IsEmpty]: Start isEmpty. Operand 2902 states and 4536 transitions. [2024-11-07 01:37:20,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-07 01:37:20,924 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:37:20,924 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:37:20,925 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-07 01:37:20,925 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:37:20,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:37:20,925 INFO L85 PathProgramCache]: Analyzing trace with hash -1894306838, now seen corresponding path program 1 times [2024-11-07 01:37:20,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:37:20,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432560207] [2024-11-07 01:37:20,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:37:20,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:37:20,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:37:20,971 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-07 01:37:20,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:37:20,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432560207] [2024-11-07 01:37:20,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432560207] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:37:20,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:37:20,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 01:37:20,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122361470] [2024-11-07 01:37:20,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:37:20,972 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 01:37:20,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:37:20,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 01:37:20,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 01:37:20,973 INFO L87 Difference]: Start difference. First operand 2902 states and 4536 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 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-07 01:37:21,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:37:21,006 INFO L93 Difference]: Finished difference Result 4030 states and 6278 transitions. [2024-11-07 01:37:21,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 01:37:21,007 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 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 81 [2024-11-07 01:37:21,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:37:21,015 INFO L225 Difference]: With dead ends: 4030 [2024-11-07 01:37:21,015 INFO L226 Difference]: Without dead ends: 3442 [2024-11-07 01:37:21,017 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-07 01:37:21,017 INFO L432 NwaCegarLoop]: 1654 mSDtfsCounter, 1512 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1512 SdHoareTripleChecker+Valid, 1750 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 01:37:21,017 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1512 Valid, 1750 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 01:37:21,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3442 states. [2024-11-07 01:37:21,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3442 to 3440. [2024-11-07 01:37:21,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3440 states, 3438 states have (on average 1.556719022687609) internal successors, (5352), 3439 states have internal predecessors, (5352), 0 states have call successors, (0), 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-07 01:37:21,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3440 states to 3440 states and 5352 transitions. [2024-11-07 01:37:21,105 INFO L78 Accepts]: Start accepts. Automaton has 3440 states and 5352 transitions. Word has length 81 [2024-11-07 01:37:21,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:37:21,105 INFO L471 AbstractCegarLoop]: Abstraction has 3440 states and 5352 transitions. [2024-11-07 01:37:21,105 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 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-07 01:37:21,105 INFO L276 IsEmpty]: Start isEmpty. Operand 3440 states and 5352 transitions. [2024-11-07 01:37:21,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-07 01:37:21,106 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:37:21,106 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:37:21,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-07 01:37:21,106 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:37:21,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:37:21,107 INFO L85 PathProgramCache]: Analyzing trace with hash -1630450454, now seen corresponding path program 1 times [2024-11-07 01:37:21,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:37:21,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714337519] [2024-11-07 01:37:21,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:37:21,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:37:21,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:37:21,160 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-07 01:37:21,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:37:21,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714337519] [2024-11-07 01:37:21,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1714337519] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:37:21,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:37:21,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 01:37:21,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233045735] [2024-11-07 01:37:21,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:37:21,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 01:37:21,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:37:21,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 01:37:21,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 01:37:21,161 INFO L87 Difference]: Start difference. First operand 3440 states and 5352 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 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-07 01:37:21,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:37:21,203 INFO L93 Difference]: Finished difference Result 5596 states and 8642 transitions. [2024-11-07 01:37:21,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 01:37:21,203 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 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 81 [2024-11-07 01:37:21,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:37:21,211 INFO L225 Difference]: With dead ends: 5596 [2024-11-07 01:37:21,212 INFO L226 Difference]: Without dead ends: 4470 [2024-11-07 01:37:21,215 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-07 01:37:21,215 INFO L432 NwaCegarLoop]: 1652 mSDtfsCounter, 1510 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1510 SdHoareTripleChecker+Valid, 1752 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 01:37:21,216 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1510 Valid, 1752 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 01:37:21,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4470 states. [2024-11-07 01:37:21,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4470 to 4468. [2024-11-07 01:37:21,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4468 states, 4466 states have (on average 1.542319749216301) internal successors, (6888), 4467 states have internal predecessors, (6888), 0 states have call successors, (0), 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-07 01:37:21,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4468 states to 4468 states and 6888 transitions. [2024-11-07 01:37:21,299 INFO L78 Accepts]: Start accepts. Automaton has 4468 states and 6888 transitions. Word has length 81 [2024-11-07 01:37:21,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:37:21,299 INFO L471 AbstractCegarLoop]: Abstraction has 4468 states and 6888 transitions. [2024-11-07 01:37:21,299 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 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-07 01:37:21,299 INFO L276 IsEmpty]: Start isEmpty. Operand 4468 states and 6888 transitions. [2024-11-07 01:37:21,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-07 01:37:21,300 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:37:21,300 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:37:21,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-07 01:37:21,300 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:37:21,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:37:21,301 INFO L85 PathProgramCache]: Analyzing trace with hash 1687310058, now seen corresponding path program 1 times [2024-11-07 01:37:21,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:37:21,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691143454] [2024-11-07 01:37:21,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:37:21,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:37:21,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:37:21,351 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-07 01:37:21,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:37:21,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691143454] [2024-11-07 01:37:21,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691143454] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:37:21,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:37:21,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 01:37:21,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167673144] [2024-11-07 01:37:21,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:37:21,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 01:37:21,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:37:21,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 01:37:21,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 01:37:21,353 INFO L87 Difference]: Start difference. First operand 4468 states and 6888 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 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-07 01:37:21,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:37:21,422 INFO L93 Difference]: Finished difference Result 8584 states and 13082 transitions. [2024-11-07 01:37:21,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 01:37:21,426 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 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 81 [2024-11-07 01:37:21,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:37:21,444 INFO L225 Difference]: With dead ends: 8584 [2024-11-07 01:37:21,445 INFO L226 Difference]: Without dead ends: 6430 [2024-11-07 01:37:21,449 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-07 01:37:21,450 INFO L432 NwaCegarLoop]: 1640 mSDtfsCounter, 1506 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1506 SdHoareTripleChecker+Valid, 1748 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 01:37:21,450 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1506 Valid, 1748 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 01:37:21,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6430 states. [2024-11-07 01:37:21,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6430 to 6428. [2024-11-07 01:37:21,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6428 states, 6426 states have (on average 1.5200746965452847) internal successors, (9768), 6427 states have internal predecessors, (9768), 0 states have call successors, (0), 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-07 01:37:21,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6428 states to 6428 states and 9768 transitions. [2024-11-07 01:37:21,602 INFO L78 Accepts]: Start accepts. Automaton has 6428 states and 9768 transitions. Word has length 81 [2024-11-07 01:37:21,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:37:21,602 INFO L471 AbstractCegarLoop]: Abstraction has 6428 states and 9768 transitions. [2024-11-07 01:37:21,602 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 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-07 01:37:21,602 INFO L276 IsEmpty]: Start isEmpty. Operand 6428 states and 9768 transitions. [2024-11-07 01:37:21,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-07 01:37:21,603 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:37:21,603 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:37:21,603 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-07 01:37:21,603 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:37:21,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:37:21,603 INFO L85 PathProgramCache]: Analyzing trace with hash -826724374, now seen corresponding path program 1 times [2024-11-07 01:37:21,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:37:21,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097744716] [2024-11-07 01:37:21,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:37:21,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:37:21,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:37:21,654 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-07 01:37:21,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:37:21,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097744716] [2024-11-07 01:37:21,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2097744716] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:37:21,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:37:21,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 01:37:21,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624424237] [2024-11-07 01:37:21,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:37:21,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 01:37:21,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:37:21,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 01:37:21,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 01:37:21,655 INFO L87 Difference]: Start difference. First operand 6428 states and 9768 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 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-07 01:37:21,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:37:21,744 INFO L93 Difference]: Finished difference Result 14272 states and 21386 transitions. [2024-11-07 01:37:21,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 01:37:21,744 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 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 81 [2024-11-07 01:37:21,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:37:21,761 INFO L225 Difference]: With dead ends: 14272 [2024-11-07 01:37:21,761 INFO L226 Difference]: Without dead ends: 10158 [2024-11-07 01:37:21,769 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-07 01:37:21,771 INFO L432 NwaCegarLoop]: 1638 mSDtfsCounter, 1504 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1504 SdHoareTripleChecker+Valid, 1750 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 01:37:21,771 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1504 Valid, 1750 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 01:37:21,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10158 states. [2024-11-07 01:37:22,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10158 to 10156. [2024-11-07 01:37:22,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10156 states, 10154 states have (on average 1.4914319480007878) internal successors, (15144), 10155 states have internal predecessors, (15144), 0 states have call successors, (0), 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-07 01:37:22,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10156 states to 10156 states and 15144 transitions. [2024-11-07 01:37:22,065 INFO L78 Accepts]: Start accepts. Automaton has 10156 states and 15144 transitions. Word has length 81 [2024-11-07 01:37:22,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:37:22,065 INFO L471 AbstractCegarLoop]: Abstraction has 10156 states and 15144 transitions. [2024-11-07 01:37:22,065 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 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-07 01:37:22,066 INFO L276 IsEmpty]: Start isEmpty. Operand 10156 states and 15144 transitions. [2024-11-07 01:37:22,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-07 01:37:22,067 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:37:22,067 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:37:22,067 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-07 01:37:22,068 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:37:22,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:37:22,068 INFO L85 PathProgramCache]: Analyzing trace with hash -392188438, now seen corresponding path program 1 times [2024-11-07 01:37:22,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:37:22,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380103662] [2024-11-07 01:37:22,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:37:22,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:37:22,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:37:22,158 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-07 01:37:22,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:37:22,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380103662] [2024-11-07 01:37:22,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [380103662] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:37:22,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:37:22,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 01:37:22,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816305285] [2024-11-07 01:37:22,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:37:22,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 01:37:22,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:37:22,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 01:37:22,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 01:37:22,163 INFO L87 Difference]: Start difference. First operand 10156 states and 15144 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 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-07 01:37:22,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:37:22,450 INFO L93 Difference]: Finished difference Result 25072 states and 36842 transitions. [2024-11-07 01:37:22,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 01:37:22,459 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 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 81 [2024-11-07 01:37:22,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:37:22,489 INFO L225 Difference]: With dead ends: 25072 [2024-11-07 01:37:22,489 INFO L226 Difference]: Without dead ends: 17230 [2024-11-07 01:37:22,499 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-07 01:37:22,500 INFO L432 NwaCegarLoop]: 1650 mSDtfsCounter, 1508 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1508 SdHoareTripleChecker+Valid, 1754 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 01:37:22,500 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1508 Valid, 1754 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 01:37:22,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17230 states. [2024-11-07 01:37:22,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17230 to 17228. [2024-11-07 01:37:22,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17228 states, 17226 states have (on average 1.4587251828631138) internal successors, (25128), 17227 states have internal predecessors, (25128), 0 states have call successors, (0), 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-07 01:37:22,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17228 states to 17228 states and 25128 transitions. [2024-11-07 01:37:22,968 INFO L78 Accepts]: Start accepts. Automaton has 17228 states and 25128 transitions. Word has length 81 [2024-11-07 01:37:22,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:37:22,968 INFO L471 AbstractCegarLoop]: Abstraction has 17228 states and 25128 transitions. [2024-11-07 01:37:22,968 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 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-07 01:37:22,968 INFO L276 IsEmpty]: Start isEmpty. Operand 17228 states and 25128 transitions. [2024-11-07 01:37:22,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-07 01:37:22,974 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:37:22,974 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-07 01:37:22,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-07 01:37:22,974 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:37:22,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:37:22,975 INFO L85 PathProgramCache]: Analyzing trace with hash -730351122, now seen corresponding path program 1 times [2024-11-07 01:37:22,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:37:22,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659024504] [2024-11-07 01:37:22,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:37:22,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:37:23,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:37:23,197 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-07 01:37:23,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:37:23,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659024504] [2024-11-07 01:37:23,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1659024504] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:37:23,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:37:23,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-07 01:37:23,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974743772] [2024-11-07 01:37:23,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:37:23,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 01:37:23,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:37:23,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 01:37:23,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-07 01:37:23,199 INFO L87 Difference]: Start difference. First operand 17228 states and 25128 transitions. Second operand has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 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-07 01:37:24,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:37:24,737 INFO L93 Difference]: Finished difference Result 120284 states and 173616 transitions. [2024-11-07 01:37:24,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 01:37:24,738 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 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 104 [2024-11-07 01:37:24,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:37:24,964 INFO L225 Difference]: With dead ends: 120284 [2024-11-07 01:37:24,964 INFO L226 Difference]: Without dead ends: 109786 [2024-11-07 01:37:24,996 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2024-11-07 01:37:24,996 INFO L432 NwaCegarLoop]: 1668 mSDtfsCounter, 9868 mSDsluCounter, 2988 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9868 SdHoareTripleChecker+Valid, 4656 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 01:37:24,997 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9868 Valid, 4656 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 01:37:25,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109786 states. [2024-11-07 01:37:25,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109786 to 29964. [2024-11-07 01:37:25,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29964 states, 29962 states have (on average 1.4452973766771244) internal successors, (43304), 29963 states have internal predecessors, (43304), 0 states have call successors, (0), 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-07 01:37:26,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29964 states to 29964 states and 43304 transitions. [2024-11-07 01:37:26,022 INFO L78 Accepts]: Start accepts. Automaton has 29964 states and 43304 transitions. Word has length 104 [2024-11-07 01:37:26,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:37:26,022 INFO L471 AbstractCegarLoop]: Abstraction has 29964 states and 43304 transitions. [2024-11-07 01:37:26,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 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-07 01:37:26,022 INFO L276 IsEmpty]: Start isEmpty. Operand 29964 states and 43304 transitions. [2024-11-07 01:37:26,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-07 01:37:26,027 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:37:26,028 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-07 01:37:26,028 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-07 01:37:26,028 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:37:26,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:37:26,028 INFO L85 PathProgramCache]: Analyzing trace with hash 1211718382, now seen corresponding path program 1 times [2024-11-07 01:37:26,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:37:26,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793143215] [2024-11-07 01:37:26,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:37:26,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:37:26,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:37:26,340 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-07 01:37:26,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:37:26,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793143215] [2024-11-07 01:37:26,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793143215] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:37:26,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:37:26,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-07 01:37:26,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865840898] [2024-11-07 01:37:26,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:37:26,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 01:37:26,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:37:26,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 01:37:26,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-07 01:37:26,342 INFO L87 Difference]: Start difference. First operand 29964 states and 43304 transitions. Second operand has 9 states, 9 states have (on average 11.222222222222221) internal successors, (101), 9 states have internal predecessors, (101), 0 states have call successors, (0), 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-07 01:37:28,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:37:28,549 INFO L93 Difference]: Finished difference Result 135196 states and 194992 transitions. [2024-11-07 01:37:28,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 01:37:28,550 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.222222222222221) internal successors, (101), 9 states have internal predecessors, (101), 0 states have call successors, (0), 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 104 [2024-11-07 01:37:28,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:37:28,717 INFO L225 Difference]: With dead ends: 135196 [2024-11-07 01:37:28,718 INFO L226 Difference]: Without dead ends: 120282 [2024-11-07 01:37:28,752 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2024-11-07 01:37:28,753 INFO L432 NwaCegarLoop]: 1667 mSDtfsCounter, 9870 mSDsluCounter, 2944 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9870 SdHoareTripleChecker+Valid, 4611 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 01:37:28,753 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9870 Valid, 4611 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 01:37:28,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120282 states. [2024-11-07 01:37:30,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120282 to 50124. [2024-11-07 01:37:30,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50124 states, 50122 states have (on average 1.437293005067635) internal successors, (72040), 50123 states have internal predecessors, (72040), 0 states have call successors, (0), 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-07 01:37:30,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50124 states to 50124 states and 72040 transitions. [2024-11-07 01:37:30,296 INFO L78 Accepts]: Start accepts. Automaton has 50124 states and 72040 transitions. Word has length 104 [2024-11-07 01:37:30,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:37:30,296 INFO L471 AbstractCegarLoop]: Abstraction has 50124 states and 72040 transitions. [2024-11-07 01:37:30,296 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.222222222222221) internal successors, (101), 9 states have internal predecessors, (101), 0 states have call successors, (0), 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-07 01:37:30,296 INFO L276 IsEmpty]: Start isEmpty. Operand 50124 states and 72040 transitions. [2024-11-07 01:37:30,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-07 01:37:30,303 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:37:30,303 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-07 01:37:30,303 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-07 01:37:30,303 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:37:30,304 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:37:30,304 INFO L85 PathProgramCache]: Analyzing trace with hash 1374632942, now seen corresponding path program 1 times [2024-11-07 01:37:30,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:37:30,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536057321] [2024-11-07 01:37:30,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:37:30,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:37:30,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:37:30,476 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-07 01:37:30,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:37:30,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536057321] [2024-11-07 01:37:30,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [536057321] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:37:30,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:37:30,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-07 01:37:30,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321604050] [2024-11-07 01:37:30,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:37:30,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 01:37:30,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:37:30,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 01:37:30,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-07 01:37:30,479 INFO L87 Difference]: Start difference. First operand 50124 states and 72040 transitions. Second operand has 9 states, 9 states have (on average 11.0) internal successors, (99), 9 states have internal predecessors, (99), 0 states have call successors, (0), 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-07 01:37:33,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:37:33,144 INFO L93 Difference]: Finished difference Result 150108 states and 216304 transitions. [2024-11-07 01:37:33,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 01:37:33,144 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.0) internal successors, (99), 9 states have internal predecessors, (99), 0 states have call successors, (0), 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 104 [2024-11-07 01:37:33,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:37:33,327 INFO L225 Difference]: With dead ends: 150108 [2024-11-07 01:37:33,327 INFO L226 Difference]: Without dead ends: 135194 [2024-11-07 01:37:33,365 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2024-11-07 01:37:33,365 INFO L432 NwaCegarLoop]: 1665 mSDtfsCounter, 9892 mSDsluCounter, 2880 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9892 SdHoareTripleChecker+Valid, 4545 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 01:37:33,365 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9892 Valid, 4545 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 01:37:33,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135194 states. [2024-11-07 01:37:35,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135194 to 65036. [2024-11-07 01:37:35,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65036 states, 65034 states have (on average 1.4354337731032998) internal successors, (93352), 65035 states have internal predecessors, (93352), 0 states have call successors, (0), 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-07 01:37:35,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65036 states to 65036 states and 93352 transitions. [2024-11-07 01:37:35,898 INFO L78 Accepts]: Start accepts. Automaton has 65036 states and 93352 transitions. Word has length 104 [2024-11-07 01:37:35,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:37:35,898 INFO L471 AbstractCegarLoop]: Abstraction has 65036 states and 93352 transitions. [2024-11-07 01:37:35,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.0) internal successors, (99), 9 states have internal predecessors, (99), 0 states have call successors, (0), 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-07 01:37:35,898 INFO L276 IsEmpty]: Start isEmpty. Operand 65036 states and 93352 transitions. [2024-11-07 01:37:35,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-07 01:37:35,904 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:37:35,905 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-07 01:37:35,905 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-07 01:37:35,905 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:37:35,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:37:35,905 INFO L85 PathProgramCache]: Analyzing trace with hash 1638489326, now seen corresponding path program 1 times [2024-11-07 01:37:35,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:37:35,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888606732] [2024-11-07 01:37:35,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:37:35,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:37:35,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:37:36,078 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-07 01:37:36,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:37:36,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888606732] [2024-11-07 01:37:36,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888606732] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:37:36,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:37:36,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-07 01:37:36,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724837427] [2024-11-07 01:37:36,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:37:36,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 01:37:36,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:37:36,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 01:37:36,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-07 01:37:36,081 INFO L87 Difference]: Start difference. First operand 65036 states and 93352 transitions. Second operand has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 9 states have internal predecessors, (97), 0 states have call successors, (0), 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-07 01:37:38,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:37:38,788 INFO L93 Difference]: Finished difference Result 165020 states and 237616 transitions. [2024-11-07 01:37:38,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 01:37:38,788 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 9 states have internal predecessors, (97), 0 states have call successors, (0), 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 104 [2024-11-07 01:37:38,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:37:38,982 INFO L225 Difference]: With dead ends: 165020 [2024-11-07 01:37:38,983 INFO L226 Difference]: Without dead ends: 150106 [2024-11-07 01:37:39,016 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2024-11-07 01:37:39,016 INFO L432 NwaCegarLoop]: 1663 mSDtfsCounter, 9980 mSDsluCounter, 2847 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9980 SdHoareTripleChecker+Valid, 4510 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 01:37:39,016 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9980 Valid, 4510 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 01:37:39,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150106 states. [2024-11-07 01:37:41,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150106 to 79948. [2024-11-07 01:37:41,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79948 states, 79946 states have (on average 1.434268130988417) internal successors, (114664), 79947 states have internal predecessors, (114664), 0 states have call successors, (0), 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-07 01:37:42,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79948 states to 79948 states and 114664 transitions. [2024-11-07 01:37:42,113 INFO L78 Accepts]: Start accepts. Automaton has 79948 states and 114664 transitions. Word has length 104 [2024-11-07 01:37:42,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:37:42,113 INFO L471 AbstractCegarLoop]: Abstraction has 79948 states and 114664 transitions. [2024-11-07 01:37:42,113 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 9 states have internal predecessors, (97), 0 states have call successors, (0), 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-07 01:37:42,114 INFO L276 IsEmpty]: Start isEmpty. Operand 79948 states and 114664 transitions. [2024-11-07 01:37:42,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-07 01:37:42,120 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:37:42,120 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-07 01:37:42,120 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-07 01:37:42,120 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:37:42,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:37:42,120 INFO L85 PathProgramCache]: Analyzing trace with hash 661282542, now seen corresponding path program 1 times [2024-11-07 01:37:42,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:37:42,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810226192] [2024-11-07 01:37:42,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:37:42,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:37:42,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:37:42,261 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-07 01:37:42,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:37:42,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810226192] [2024-11-07 01:37:42,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1810226192] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:37:42,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:37:42,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-07 01:37:42,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895494559] [2024-11-07 01:37:42,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:37:42,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 01:37:42,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:37:42,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 01:37:42,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-07 01:37:42,263 INFO L87 Difference]: Start difference. First operand 79948 states and 114664 transitions. Second operand has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 0 states have call successors, (0), 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-07 01:37:46,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:37:46,252 INFO L93 Difference]: Finished difference Result 179932 states and 258928 transitions. [2024-11-07 01:37:46,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 01:37:46,253 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 0 states have call successors, (0), 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 104 [2024-11-07 01:37:46,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:37:46,465 INFO L225 Difference]: With dead ends: 179932 [2024-11-07 01:37:46,465 INFO L226 Difference]: Without dead ends: 165018 [2024-11-07 01:37:46,511 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2024-11-07 01:37:46,511 INFO L432 NwaCegarLoop]: 1661 mSDtfsCounter, 10065 mSDsluCounter, 2887 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10065 SdHoareTripleChecker+Valid, 4548 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 01:37:46,512 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10065 Valid, 4548 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 01:37:46,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165018 states. [2024-11-07 01:37:49,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165018 to 94860. [2024-11-07 01:37:49,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94860 states, 94858 states have (on average 1.4334689746779397) internal successors, (135976), 94859 states have internal predecessors, (135976), 0 states have call successors, (0), 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-07 01:37:49,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94860 states to 94860 states and 135976 transitions. [2024-11-07 01:37:49,672 INFO L78 Accepts]: Start accepts. Automaton has 94860 states and 135976 transitions. Word has length 104 [2024-11-07 01:37:49,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:37:49,673 INFO L471 AbstractCegarLoop]: Abstraction has 94860 states and 135976 transitions. [2024-11-07 01:37:49,673 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 0 states have call successors, (0), 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-07 01:37:49,673 INFO L276 IsEmpty]: Start isEmpty. Operand 94860 states and 135976 transitions. [2024-11-07 01:37:49,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-07 01:37:49,678 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:37:49,679 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-07 01:37:49,679 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-07 01:37:49,679 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:37:49,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:37:49,679 INFO L85 PathProgramCache]: Analyzing trace with hash -1852751890, now seen corresponding path program 1 times [2024-11-07 01:37:49,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:37:49,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584714488] [2024-11-07 01:37:49,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:37:49,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:37:49,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:37:49,810 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-07 01:37:49,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:37:49,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584714488] [2024-11-07 01:37:49,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [584714488] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:37:49,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:37:49,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-07 01:37:49,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33224218] [2024-11-07 01:37:49,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:37:49,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 01:37:49,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:37:49,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 01:37:49,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-07 01:37:49,811 INFO L87 Difference]: Start difference. First operand 94860 states and 135976 transitions. Second operand has 9 states, 9 states have (on average 10.11111111111111) internal successors, (91), 9 states have internal predecessors, (91), 0 states have call successors, (0), 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-07 01:37:53,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:37:53,115 INFO L93 Difference]: Finished difference Result 194844 states and 280240 transitions. [2024-11-07 01:37:53,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 01:37:53,115 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.11111111111111) internal successors, (91), 9 states have internal predecessors, (91), 0 states have call successors, (0), 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 104 [2024-11-07 01:37:53,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:37:53,323 INFO L225 Difference]: With dead ends: 194844 [2024-11-07 01:37:53,324 INFO L226 Difference]: Without dead ends: 179930 [2024-11-07 01:37:53,369 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2024-11-07 01:37:53,370 INFO L432 NwaCegarLoop]: 1661 mSDtfsCounter, 9932 mSDsluCounter, 2917 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9932 SdHoareTripleChecker+Valid, 4578 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 01:37:53,371 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9932 Valid, 4578 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 01:37:53,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179930 states. [2024-11-07 01:37:56,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179930 to 109772. [2024-11-07 01:37:56,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109772 states, 109770 states have (on average 1.4328869454313564) internal successors, (157288), 109771 states have internal predecessors, (157288), 0 states have call successors, (0), 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-07 01:37:56,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109772 states to 109772 states and 157288 transitions. [2024-11-07 01:37:56,671 INFO L78 Accepts]: Start accepts. Automaton has 109772 states and 157288 transitions. Word has length 104 [2024-11-07 01:37:56,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:37:56,671 INFO L471 AbstractCegarLoop]: Abstraction has 109772 states and 157288 transitions. [2024-11-07 01:37:56,671 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.11111111111111) internal successors, (91), 9 states have internal predecessors, (91), 0 states have call successors, (0), 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-07 01:37:56,671 INFO L276 IsEmpty]: Start isEmpty. Operand 109772 states and 157288 transitions. [2024-11-07 01:37:56,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-07 01:37:56,676 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:37:56,676 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-07 01:37:56,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-07 01:37:56,676 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:37:56,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:37:56,677 INFO L85 PathProgramCache]: Analyzing trace with hash -1418215954, now seen corresponding path program 1 times [2024-11-07 01:37:56,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:37:56,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482013738] [2024-11-07 01:37:56,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:37:56,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:37:56,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:37:56,811 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-07 01:37:56,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:37:56,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482013738] [2024-11-07 01:37:56,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1482013738] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:37:56,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:37:56,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-07 01:37:56,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041171591] [2024-11-07 01:37:56,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:37:56,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 01:37:56,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:37:56,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 01:37:56,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-07 01:37:56,814 INFO L87 Difference]: Start difference. First operand 109772 states and 157288 transitions. Second operand has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)