./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.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/seq-mthreaded-reduced/pals_lcr.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.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', 'a6a02224ad3116421a031fb474928d71f99a366daf138bf7c752aaea303a81f9'] 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/seq-mthreaded-reduced/pals_lcr.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.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 a6a02224ad3116421a031fb474928d71f99a366daf138bf7c752aaea303a81f9 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 00:29:33,818 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 00:29:33,914 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-07 00:29:33,920 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 00:29:33,920 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 00:29:33,936 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 00:29:33,937 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 00:29:33,937 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 00:29:33,938 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 00:29:33,938 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 00:29:33,938 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 00:29:33,938 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 00:29:33,938 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 00:29:33,938 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 00:29:33,938 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 00:29:33,939 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 00:29:33,939 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 00:29:33,939 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 00:29:33,939 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 00:29:33,939 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 00:29:33,939 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 00:29:33,939 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 00:29:33,939 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 00:29:33,939 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 00:29:33,940 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 00:29:33,940 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 00:29:33,940 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 00:29:33,940 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 00:29:33,940 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 00:29:33,940 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 00:29:33,940 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 00:29:33,940 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 00:29:33,940 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 00:29:33,940 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 00:29:33,941 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 00:29:33,941 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 00:29:33,941 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 00:29:33,941 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 00:29:33,941 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 00:29:33,941 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 00:29:33,941 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 00:29:33,941 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 00:29:33,941 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 -> a6a02224ad3116421a031fb474928d71f99a366daf138bf7c752aaea303a81f9 [2024-11-07 00:29:34,177 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 00:29:34,190 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 00:29:34,192 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 00:29:34,193 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 00:29:34,193 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 00:29:34,195 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2024-11-07 00:29:35,638 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 00:29:35,960 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 00:29:35,963 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2024-11-07 00:29:35,978 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3d5faaba3/429e85c77a8e48d6ab550f07f2920fa6/FLAG38039b179 [2024-11-07 00:29:36,000 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3d5faaba3/429e85c77a8e48d6ab550f07f2920fa6 [2024-11-07 00:29:36,002 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 00:29:36,004 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 00:29:36,007 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 00:29:36,007 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 00:29:36,011 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 00:29:36,012 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:29:36" (1/1) ... [2024-11-07 00:29:36,013 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6448de18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:29:36, skipping insertion in model container [2024-11-07 00:29:36,013 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:29:36" (1/1) ... [2024-11-07 00:29:36,060 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 00:29:36,284 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/seq-mthreaded-reduced/pals_lcr.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[7117,7130] [2024-11-07 00:29:36,306 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/seq-mthreaded-reduced/pals_lcr.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[9784,9797] [2024-11-07 00:29:36,314 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/seq-mthreaded-reduced/pals_lcr.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[10875,10888] [2024-11-07 00:29:36,320 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/seq-mthreaded-reduced/pals_lcr.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[11481,11494] [2024-11-07 00:29:36,335 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/seq-mthreaded-reduced/pals_lcr.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[12900,12913] [2024-11-07 00:29:36,338 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/seq-mthreaded-reduced/pals_lcr.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[13506,13519] [2024-11-07 00:29:36,344 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/seq-mthreaded-reduced/pals_lcr.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[14435,14448] [2024-11-07 00:29:36,375 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 00:29:36,389 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 00:29:36,423 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/seq-mthreaded-reduced/pals_lcr.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[7117,7130] [2024-11-07 00:29:36,443 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/seq-mthreaded-reduced/pals_lcr.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[9784,9797] [2024-11-07 00:29:36,446 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/seq-mthreaded-reduced/pals_lcr.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[10875,10888] [2024-11-07 00:29:36,453 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/seq-mthreaded-reduced/pals_lcr.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[11481,11494] [2024-11-07 00:29:36,459 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/seq-mthreaded-reduced/pals_lcr.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[12900,12913] [2024-11-07 00:29:36,464 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/seq-mthreaded-reduced/pals_lcr.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[13506,13519] [2024-11-07 00:29:36,467 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/seq-mthreaded-reduced/pals_lcr.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[14435,14448] [2024-11-07 00:29:36,497 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 00:29:36,512 INFO L204 MainTranslator]: Completed translation [2024-11-07 00:29:36,513 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:29:36 WrapperNode [2024-11-07 00:29:36,513 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 00:29:36,514 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 00:29:36,515 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 00:29:36,516 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 00:29:36,521 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:29:36" (1/1) ... [2024-11-07 00:29:36,543 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:29:36" (1/1) ... [2024-11-07 00:29:36,593 INFO L138 Inliner]: procedures = 23, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1047 [2024-11-07 00:29:36,593 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 00:29:36,594 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 00:29:36,594 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 00:29:36,594 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 00:29:36,605 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:29:36" (1/1) ... [2024-11-07 00:29:36,605 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:29:36" (1/1) ... [2024-11-07 00:29:36,609 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:29:36" (1/1) ... [2024-11-07 00:29:36,636 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 00:29:36,636 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:29:36" (1/1) ... [2024-11-07 00:29:36,636 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:29:36" (1/1) ... [2024-11-07 00:29:36,648 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:29:36" (1/1) ... [2024-11-07 00:29:36,656 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:29:36" (1/1) ... [2024-11-07 00:29:36,663 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:29:36" (1/1) ... [2024-11-07 00:29:36,670 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:29:36" (1/1) ... [2024-11-07 00:29:36,678 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 00:29:36,679 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 00:29:36,679 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 00:29:36,679 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 00:29:36,680 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:29:36" (1/1) ... [2024-11-07 00:29:36,688 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 00:29:36,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 00:29:36,720 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 00:29:36,725 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 00:29:36,747 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 00:29:36,748 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 00:29:36,748 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 00:29:36,748 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 00:29:36,865 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 00:29:36,867 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 00:29:37,803 INFO L? ?]: Removed 161 outVars from TransFormulas that were not future-live. [2024-11-07 00:29:37,803 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 00:29:37,871 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 00:29:37,872 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-07 00:29:37,872 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:29:37 BoogieIcfgContainer [2024-11-07 00:29:37,872 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 00:29:37,875 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 00:29:37,876 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 00:29:37,881 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 00:29:37,881 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 12:29:36" (1/3) ... [2024-11-07 00:29:37,882 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e9d60e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:29:37, skipping insertion in model container [2024-11-07 00:29:37,883 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:29:36" (2/3) ... [2024-11-07 00:29:37,883 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e9d60e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:29:37, skipping insertion in model container [2024-11-07 00:29:37,883 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:29:37" (3/3) ... [2024-11-07 00:29:37,884 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2024-11-07 00:29:37,901 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 00:29:37,902 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2024-11-07 00:29:37,967 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 00:29:37,979 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;@4db20c34, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 00:29:37,980 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-11-07 00:29:37,988 INFO L276 IsEmpty]: Start isEmpty. Operand has 206 states, 198 states have (on average 1.8232323232323233) internal successors, (361), 205 states have internal predecessors, (361), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:29:37,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-07 00:29:37,997 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:29:37,998 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] [2024-11-07 00:29:37,999 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-11-07 00:29:38,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:29:38,004 INFO L85 PathProgramCache]: Analyzing trace with hash 1899747950, now seen corresponding path program 1 times [2024-11-07 00:29:38,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:29:38,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69897012] [2024-11-07 00:29:38,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:29:38,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:29:38,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:29:38,444 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 00:29:38,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:29:38,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69897012] [2024-11-07 00:29:38,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [69897012] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:29:38,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:29:38,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 00:29:38,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937274667] [2024-11-07 00:29:38,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:29:38,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 00:29:38,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:29:38,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 00:29:38,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 00:29:38,478 INFO L87 Difference]: Start difference. First operand has 206 states, 198 states have (on average 1.8232323232323233) internal successors, (361), 205 states have internal predecessors, (361), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 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 00:29:38,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:29:38,694 INFO L93 Difference]: Finished difference Result 338 states and 568 transitions. [2024-11-07 00:29:38,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 00:29:38,697 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 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 46 [2024-11-07 00:29:38,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:29:38,704 INFO L225 Difference]: With dead ends: 338 [2024-11-07 00:29:38,704 INFO L226 Difference]: Without dead ends: 174 [2024-11-07 00:29:38,707 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-07 00:29:38,709 INFO L432 NwaCegarLoop]: 209 mSDtfsCounter, 846 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 846 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 00:29:38,709 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [846 Valid, 223 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 00:29:38,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2024-11-07 00:29:38,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 174. [2024-11-07 00:29:38,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 167 states have (on average 1.2934131736526946) internal successors, (216), 173 states have internal predecessors, (216), 0 states have call successors, (0), 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 00:29:38,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 216 transitions. [2024-11-07 00:29:38,756 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 216 transitions. Word has length 46 [2024-11-07 00:29:38,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:29:38,756 INFO L471 AbstractCegarLoop]: Abstraction has 174 states and 216 transitions. [2024-11-07 00:29:38,756 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 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 00:29:38,757 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 216 transitions. [2024-11-07 00:29:38,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-07 00:29:38,758 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:29:38,758 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] [2024-11-07 00:29:38,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 00:29:38,758 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-11-07 00:29:38,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:29:38,759 INFO L85 PathProgramCache]: Analyzing trace with hash -121525429, now seen corresponding path program 1 times [2024-11-07 00:29:38,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:29:38,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142613994] [2024-11-07 00:29:38,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:29:38,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:29:38,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:29:38,996 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 00:29:38,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:29:38,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142613994] [2024-11-07 00:29:38,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142613994] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:29:38,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:29:38,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 00:29:38,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676222344] [2024-11-07 00:29:38,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:29:39,000 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 00:29:39,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:29:39,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 00:29:39,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 00:29:39,001 INFO L87 Difference]: Start difference. First operand 174 states and 216 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 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 00:29:39,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:29:39,157 INFO L93 Difference]: Finished difference Result 297 states and 378 transitions. [2024-11-07 00:29:39,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 00:29:39,157 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 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 47 [2024-11-07 00:29:39,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:29:39,159 INFO L225 Difference]: With dead ends: 297 [2024-11-07 00:29:39,159 INFO L226 Difference]: Without dead ends: 161 [2024-11-07 00:29:39,159 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-07 00:29:39,160 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 558 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 558 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 00:29:39,160 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [558 Valid, 132 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 00:29:39,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2024-11-07 00:29:39,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 161. [2024-11-07 00:29:39,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 154 states have (on average 1.2987012987012987) internal successors, (200), 160 states have internal predecessors, (200), 0 states have call successors, (0), 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 00:29:39,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 200 transitions. [2024-11-07 00:29:39,168 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 200 transitions. Word has length 47 [2024-11-07 00:29:39,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:29:39,168 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 200 transitions. [2024-11-07 00:29:39,168 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 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 00:29:39,169 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 200 transitions. [2024-11-07 00:29:39,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-07 00:29:39,169 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:29:39,170 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] [2024-11-07 00:29:39,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 00:29:39,170 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-11-07 00:29:39,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:29:39,171 INFO L85 PathProgramCache]: Analyzing trace with hash 414043727, now seen corresponding path program 1 times [2024-11-07 00:29:39,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:29:39,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18113705] [2024-11-07 00:29:39,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:29:39,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:29:39,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:29:39,397 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 00:29:39,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:29:39,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18113705] [2024-11-07 00:29:39,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18113705] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:29:39,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:29:39,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 00:29:39,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180006496] [2024-11-07 00:29:39,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:29:39,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 00:29:39,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:29:39,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 00:29:39,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 00:29:39,401 INFO L87 Difference]: Start difference. First operand 161 states and 200 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 0 states have call successors, (0), 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 00:29:39,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:29:39,548 INFO L93 Difference]: Finished difference Result 284 states and 361 transitions. [2024-11-07 00:29:39,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 00:29:39,549 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 0 states have call successors, (0), 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 48 [2024-11-07 00:29:39,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:29:39,550 INFO L225 Difference]: With dead ends: 284 [2024-11-07 00:29:39,552 INFO L226 Difference]: Without dead ends: 156 [2024-11-07 00:29:39,552 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-07 00:29:39,556 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 524 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 524 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 00:29:39,556 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [524 Valid, 129 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 00:29:39,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2024-11-07 00:29:39,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 156. [2024-11-07 00:29:39,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 149 states have (on average 1.2953020134228188) internal successors, (193), 155 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:29:39,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 193 transitions. [2024-11-07 00:29:39,570 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 193 transitions. Word has length 48 [2024-11-07 00:29:39,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:29:39,570 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 193 transitions. [2024-11-07 00:29:39,570 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 0 states have call successors, (0), 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 00:29:39,570 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 193 transitions. [2024-11-07 00:29:39,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-07 00:29:39,573 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:29:39,574 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] [2024-11-07 00:29:39,574 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 00:29:39,574 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-11-07 00:29:39,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:29:39,575 INFO L85 PathProgramCache]: Analyzing trace with hash -453133940, now seen corresponding path program 1 times [2024-11-07 00:29:39,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:29:39,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41108311] [2024-11-07 00:29:39,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:29:39,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:29:39,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:29:40,002 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 00:29:40,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:29:40,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41108311] [2024-11-07 00:29:40,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [41108311] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:29:40,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:29:40,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 00:29:40,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715079615] [2024-11-07 00:29:40,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:29:40,004 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 00:29:40,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:29:40,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 00:29:40,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-07 00:29:40,005 INFO L87 Difference]: Start difference. First operand 156 states and 193 transitions. Second operand has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 8 states have internal predecessors, (49), 0 states have call successors, (0), 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 00:29:40,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:29:40,437 INFO L93 Difference]: Finished difference Result 243 states and 304 transitions. [2024-11-07 00:29:40,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-07 00:29:40,437 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 8 states have internal predecessors, (49), 0 states have call successors, (0), 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 49 [2024-11-07 00:29:40,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:29:40,439 INFO L225 Difference]: With dead ends: 243 [2024-11-07 00:29:40,442 INFO L226 Difference]: Without dead ends: 238 [2024-11-07 00:29:40,443 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2024-11-07 00:29:40,444 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 1092 mSDsluCounter, 370 mSDsCounter, 0 mSdLazyCounter, 338 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1092 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 345 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 00:29:40,445 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1092 Valid, 483 Invalid, 345 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 338 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 00:29:40,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2024-11-07 00:29:40,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 156. [2024-11-07 00:29:40,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 149 states have (on average 1.2885906040268456) internal successors, (192), 155 states have internal predecessors, (192), 0 states have call successors, (0), 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 00:29:40,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 192 transitions. [2024-11-07 00:29:40,459 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 192 transitions. Word has length 49 [2024-11-07 00:29:40,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:29:40,459 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 192 transitions. [2024-11-07 00:29:40,459 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 8 states have internal predecessors, (49), 0 states have call successors, (0), 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 00:29:40,459 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 192 transitions. [2024-11-07 00:29:40,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-07 00:29:40,460 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:29:40,460 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] [2024-11-07 00:29:40,460 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 00:29:40,460 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-11-07 00:29:40,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:29:40,461 INFO L85 PathProgramCache]: Analyzing trace with hash 1459063162, now seen corresponding path program 1 times [2024-11-07 00:29:40,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:29:40,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870445822] [2024-11-07 00:29:40,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:29:40,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:29:40,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:29:40,805 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 00:29:40,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:29:40,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870445822] [2024-11-07 00:29:40,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870445822] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:29:40,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:29:40,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 00:29:40,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563188936] [2024-11-07 00:29:40,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:29:40,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 00:29:40,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:29:40,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 00:29:40,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-07 00:29:40,808 INFO L87 Difference]: Start difference. First operand 156 states and 192 transitions. Second operand has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 8 states have internal predecessors, (49), 0 states have call successors, (0), 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 00:29:41,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:29:41,198 INFO L93 Difference]: Finished difference Result 302 states and 388 transitions. [2024-11-07 00:29:41,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-07 00:29:41,199 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 8 states have internal predecessors, (49), 0 states have call successors, (0), 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 49 [2024-11-07 00:29:41,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:29:41,200 INFO L225 Difference]: With dead ends: 302 [2024-11-07 00:29:41,201 INFO L226 Difference]: Without dead ends: 242 [2024-11-07 00:29:41,201 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2024-11-07 00:29:41,202 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 882 mSDsluCounter, 516 mSDsCounter, 0 mSdLazyCounter, 421 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 882 SdHoareTripleChecker+Valid, 631 SdHoareTripleChecker+Invalid, 428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 00:29:41,202 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [882 Valid, 631 Invalid, 428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 421 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 00:29:41,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2024-11-07 00:29:41,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 156. [2024-11-07 00:29:41,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 149 states have (on average 1.2818791946308725) internal successors, (191), 155 states have internal predecessors, (191), 0 states have call successors, (0), 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 00:29:41,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 191 transitions. [2024-11-07 00:29:41,213 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 191 transitions. Word has length 49 [2024-11-07 00:29:41,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:29:41,214 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 191 transitions. [2024-11-07 00:29:41,214 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 8 states have internal predecessors, (49), 0 states have call successors, (0), 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 00:29:41,214 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 191 transitions. [2024-11-07 00:29:41,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-07 00:29:41,215 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:29:41,215 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] [2024-11-07 00:29:41,215 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 00:29:41,216 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-11-07 00:29:41,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:29:41,216 INFO L85 PathProgramCache]: Analyzing trace with hash 8857914, now seen corresponding path program 1 times [2024-11-07 00:29:41,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:29:41,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039279183] [2024-11-07 00:29:41,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:29:41,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:29:41,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:29:41,486 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 00:29:41,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:29:41,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039279183] [2024-11-07 00:29:41,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039279183] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:29:41,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:29:41,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 00:29:41,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482517016] [2024-11-07 00:29:41,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:29:41,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 00:29:41,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:29:41,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 00:29:41,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-07 00:29:41,488 INFO L87 Difference]: Start difference. First operand 156 states and 191 transitions. Second operand has 8 states, 8 states have (on average 6.125) internal successors, (49), 7 states have internal predecessors, (49), 0 states have call successors, (0), 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 00:29:41,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:29:41,765 INFO L93 Difference]: Finished difference Result 311 states and 391 transitions. [2024-11-07 00:29:41,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 00:29:41,765 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 7 states have internal predecessors, (49), 0 states have call successors, (0), 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 49 [2024-11-07 00:29:41,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:29:41,766 INFO L225 Difference]: With dead ends: 311 [2024-11-07 00:29:41,766 INFO L226 Difference]: Without dead ends: 228 [2024-11-07 00:29:41,767 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2024-11-07 00:29:41,767 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 968 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 288 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 968 SdHoareTripleChecker+Valid, 393 SdHoareTripleChecker+Invalid, 292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 00:29:41,767 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [968 Valid, 393 Invalid, 292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 288 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 00:29:41,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2024-11-07 00:29:41,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 156. [2024-11-07 00:29:41,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 149 states have (on average 1.2751677852348993) internal successors, (190), 155 states have internal predecessors, (190), 0 states have call successors, (0), 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 00:29:41,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 190 transitions. [2024-11-07 00:29:41,772 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 190 transitions. Word has length 49 [2024-11-07 00:29:41,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:29:41,773 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 190 transitions. [2024-11-07 00:29:41,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 7 states have internal predecessors, (49), 0 states have call successors, (0), 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 00:29:41,773 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 190 transitions. [2024-11-07 00:29:41,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-07 00:29:41,774 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:29:41,774 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] [2024-11-07 00:29:41,774 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 00:29:41,774 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-11-07 00:29:41,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:29:41,775 INFO L85 PathProgramCache]: Analyzing trace with hash -1308237609, now seen corresponding path program 1 times [2024-11-07 00:29:41,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:29:41,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351593074] [2024-11-07 00:29:41,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:29:41,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:29:41,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:29:42,822 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 00:29:42,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:29:42,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351593074] [2024-11-07 00:29:42,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351593074] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:29:42,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:29:42,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2024-11-07 00:29:42,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402064755] [2024-11-07 00:29:42,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:29:42,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-07 00:29:42,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:29:42,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-07 00:29:42,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=296, Unknown=0, NotChecked=0, Total=342 [2024-11-07 00:29:42,824 INFO L87 Difference]: Start difference. First operand 156 states and 190 transitions. Second operand has 19 states, 19 states have (on average 2.6842105263157894) internal successors, (51), 19 states have internal predecessors, (51), 0 states have call successors, (0), 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 00:29:44,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:29:44,104 INFO L93 Difference]: Finished difference Result 392 states and 496 transitions. [2024-11-07 00:29:44,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-07 00:29:44,105 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.6842105263157894) internal successors, (51), 19 states have internal predecessors, (51), 0 states have call successors, (0), 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 51 [2024-11-07 00:29:44,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:29:44,107 INFO L225 Difference]: With dead ends: 392 [2024-11-07 00:29:44,107 INFO L226 Difference]: Without dead ends: 388 [2024-11-07 00:29:44,109 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=237, Invalid=1023, Unknown=0, NotChecked=0, Total=1260 [2024-11-07 00:29:44,109 INFO L432 NwaCegarLoop]: 225 mSDtfsCounter, 1623 mSDsluCounter, 1871 mSDsCounter, 0 mSdLazyCounter, 1092 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1623 SdHoareTripleChecker+Valid, 2096 SdHoareTripleChecker+Invalid, 1102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1092 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-07 00:29:44,111 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1623 Valid, 2096 Invalid, 1102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1092 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-07 00:29:44,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2024-11-07 00:29:44,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 166. [2024-11-07 00:29:44,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 159 states have (on average 1.2893081761006289) internal successors, (205), 165 states have internal predecessors, (205), 0 states have call successors, (0), 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 00:29:44,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 205 transitions. [2024-11-07 00:29:44,122 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 205 transitions. Word has length 51 [2024-11-07 00:29:44,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:29:44,122 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 205 transitions. [2024-11-07 00:29:44,122 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.6842105263157894) internal successors, (51), 19 states have internal predecessors, (51), 0 states have call successors, (0), 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 00:29:44,122 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 205 transitions. [2024-11-07 00:29:44,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-07 00:29:44,123 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:29:44,123 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] [2024-11-07 00:29:44,123 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 00:29:44,123 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-11-07 00:29:44,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:29:44,124 INFO L85 PathProgramCache]: Analyzing trace with hash 766441193, now seen corresponding path program 1 times [2024-11-07 00:29:44,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:29:44,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248042483] [2024-11-07 00:29:44,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:29:44,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:29:44,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:29:44,657 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 00:29:44,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:29:44,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248042483] [2024-11-07 00:29:44,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248042483] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:29:44,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:29:44,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-07 00:29:44,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080092826] [2024-11-07 00:29:44,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:29:44,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-07 00:29:44,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:29:44,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-07 00:29:44,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-11-07 00:29:44,661 INFO L87 Difference]: Start difference. First operand 166 states and 205 transitions. Second operand has 12 states, 12 states have (on average 4.25) internal successors, (51), 12 states have internal predecessors, (51), 0 states have call successors, (0), 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 00:29:45,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:29:45,213 INFO L93 Difference]: Finished difference Result 285 states and 370 transitions. [2024-11-07 00:29:45,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 00:29:45,213 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.25) internal successors, (51), 12 states have internal predecessors, (51), 0 states have call successors, (0), 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 51 [2024-11-07 00:29:45,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:29:45,214 INFO L225 Difference]: With dead ends: 285 [2024-11-07 00:29:45,215 INFO L226 Difference]: Without dead ends: 238 [2024-11-07 00:29:45,215 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=128, Invalid=378, Unknown=0, NotChecked=0, Total=506 [2024-11-07 00:29:45,216 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 1029 mSDsluCounter, 672 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1029 SdHoareTripleChecker+Valid, 818 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 00:29:45,216 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1029 Valid, 818 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 345 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 00:29:45,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2024-11-07 00:29:45,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 162. [2024-11-07 00:29:45,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 156 states have (on average 1.2820512820512822) internal successors, (200), 161 states have internal predecessors, (200), 0 states have call successors, (0), 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 00:29:45,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 200 transitions. [2024-11-07 00:29:45,220 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 200 transitions. Word has length 51 [2024-11-07 00:29:45,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:29:45,221 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 200 transitions. [2024-11-07 00:29:45,221 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.25) internal successors, (51), 12 states have internal predecessors, (51), 0 states have call successors, (0), 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 00:29:45,221 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 200 transitions. [2024-11-07 00:29:45,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-07 00:29:45,221 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:29:45,222 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] [2024-11-07 00:29:45,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-07 00:29:45,222 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-11-07 00:29:45,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:29:45,222 INFO L85 PathProgramCache]: Analyzing trace with hash -1014075955, now seen corresponding path program 1 times [2024-11-07 00:29:45,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:29:45,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908232702] [2024-11-07 00:29:45,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:29:45,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:29:45,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:29:45,631 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 00:29:45,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:29:45,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908232702] [2024-11-07 00:29:45,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1908232702] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:29:45,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:29:45,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-07 00:29:45,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955772848] [2024-11-07 00:29:45,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:29:45,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-07 00:29:45,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:29:45,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-07 00:29:45,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-11-07 00:29:45,633 INFO L87 Difference]: Start difference. First operand 162 states and 200 transitions. Second operand has 11 states, 11 states have (on average 4.636363636363637) internal successors, (51), 11 states have internal predecessors, (51), 0 states have call successors, (0), 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 00:29:46,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:29:46,027 INFO L93 Difference]: Finished difference Result 391 states and 512 transitions. [2024-11-07 00:29:46,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-07 00:29:46,028 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.636363636363637) internal successors, (51), 11 states have internal predecessors, (51), 0 states have call successors, (0), 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 51 [2024-11-07 00:29:46,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:29:46,029 INFO L225 Difference]: With dead ends: 391 [2024-11-07 00:29:46,030 INFO L226 Difference]: Without dead ends: 319 [2024-11-07 00:29:46,030 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=118, Invalid=262, Unknown=0, NotChecked=0, Total=380 [2024-11-07 00:29:46,030 INFO L432 NwaCegarLoop]: 210 mSDtfsCounter, 758 mSDsluCounter, 731 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 758 SdHoareTripleChecker+Valid, 941 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 00:29:46,031 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [758 Valid, 941 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 00:29:46,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2024-11-07 00:29:46,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 133. [2024-11-07 00:29:46,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 129 states have (on average 1.2868217054263567) internal successors, (166), 132 states have internal predecessors, (166), 0 states have call successors, (0), 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 00:29:46,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 166 transitions. [2024-11-07 00:29:46,035 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 166 transitions. Word has length 51 [2024-11-07 00:29:46,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:29:46,035 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 166 transitions. [2024-11-07 00:29:46,036 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.636363636363637) internal successors, (51), 11 states have internal predecessors, (51), 0 states have call successors, (0), 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 00:29:46,036 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 166 transitions. [2024-11-07 00:29:46,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-07 00:29:46,036 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:29:46,036 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] [2024-11-07 00:29:46,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-07 00:29:46,037 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-11-07 00:29:46,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:29:46,037 INFO L85 PathProgramCache]: Analyzing trace with hash -1185149594, now seen corresponding path program 1 times [2024-11-07 00:29:46,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:29:46,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202654488] [2024-11-07 00:29:46,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:29:46,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:29:46,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:29:46,258 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 00:29:46,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:29:46,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202654488] [2024-11-07 00:29:46,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202654488] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:29:46,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:29:46,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 00:29:46,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848261482] [2024-11-07 00:29:46,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:29:46,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 00:29:46,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:29:46,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 00:29:46,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-07 00:29:46,260 INFO L87 Difference]: Start difference. First operand 133 states and 166 transitions. Second operand has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 8 states have internal predecessors, (52), 0 states have call successors, (0), 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 00:29:46,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:29:46,492 INFO L93 Difference]: Finished difference Result 204 states and 259 transitions. [2024-11-07 00:29:46,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-07 00:29:46,493 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 8 states have internal predecessors, (52), 0 states have call successors, (0), 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 52 [2024-11-07 00:29:46,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:29:46,494 INFO L225 Difference]: With dead ends: 204 [2024-11-07 00:29:46,494 INFO L226 Difference]: Without dead ends: 197 [2024-11-07 00:29:46,494 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2024-11-07 00:29:46,495 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 666 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 666 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 00:29:46,495 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [666 Valid, 385 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 255 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 00:29:46,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2024-11-07 00:29:46,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 133. [2024-11-07 00:29:46,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 129 states have (on average 1.2713178294573644) internal successors, (164), 132 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:29:46,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 164 transitions. [2024-11-07 00:29:46,499 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 164 transitions. Word has length 52 [2024-11-07 00:29:46,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:29:46,499 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 164 transitions. [2024-11-07 00:29:46,499 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 8 states have internal predecessors, (52), 0 states have call successors, (0), 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 00:29:46,499 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 164 transitions. [2024-11-07 00:29:46,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-07 00:29:46,499 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:29:46,500 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] [2024-11-07 00:29:46,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-07 00:29:46,500 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-11-07 00:29:46,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:29:46,500 INFO L85 PathProgramCache]: Analyzing trace with hash -1721906586, now seen corresponding path program 1 times [2024-11-07 00:29:46,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:29:46,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424188270] [2024-11-07 00:29:46,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:29:46,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:29:46,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:29:46,660 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 00:29:46,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:29:46,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424188270] [2024-11-07 00:29:46,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424188270] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:29:46,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:29:46,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 00:29:46,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830556256] [2024-11-07 00:29:46,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:29:46,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 00:29:46,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:29:46,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 00:29:46,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-07 00:29:46,662 INFO L87 Difference]: Start difference. First operand 133 states and 164 transitions. Second operand has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 8 states have internal predecessors, (52), 0 states have call successors, (0), 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 00:29:47,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:29:47,012 INFO L93 Difference]: Finished difference Result 266 states and 342 transitions. [2024-11-07 00:29:47,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-07 00:29:47,013 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 8 states have internal predecessors, (52), 0 states have call successors, (0), 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 52 [2024-11-07 00:29:47,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:29:47,014 INFO L225 Difference]: With dead ends: 266 [2024-11-07 00:29:47,014 INFO L226 Difference]: Without dead ends: 205 [2024-11-07 00:29:47,015 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2024-11-07 00:29:47,016 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 309 mSDsluCounter, 478 mSDsCounter, 0 mSdLazyCounter, 439 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 309 SdHoareTripleChecker+Valid, 630 SdHoareTripleChecker+Invalid, 444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 439 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 00:29:47,016 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [309 Valid, 630 Invalid, 444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 439 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 00:29:47,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2024-11-07 00:29:47,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 133. [2024-11-07 00:29:47,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 129 states have (on average 1.255813953488372) internal successors, (162), 132 states have internal predecessors, (162), 0 states have call successors, (0), 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 00:29:47,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 162 transitions. [2024-11-07 00:29:47,023 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 162 transitions. Word has length 52 [2024-11-07 00:29:47,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:29:47,023 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 162 transitions. [2024-11-07 00:29:47,023 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 8 states have internal predecessors, (52), 0 states have call successors, (0), 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 00:29:47,024 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 162 transitions. [2024-11-07 00:29:47,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-07 00:29:47,024 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:29:47,024 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] [2024-11-07 00:29:47,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-07 00:29:47,024 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-11-07 00:29:47,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:29:47,024 INFO L85 PathProgramCache]: Analyzing trace with hash -314743810, now seen corresponding path program 1 times [2024-11-07 00:29:47,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:29:47,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818723927] [2024-11-07 00:29:47,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:29:47,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:29:47,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:29:47,567 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 00:29:47,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:29:47,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818723927] [2024-11-07 00:29:47,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818723927] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:29:47,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:29:47,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-07 00:29:47,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157914628] [2024-11-07 00:29:47,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:29:47,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-07 00:29:47,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:29:47,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-07 00:29:47,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-11-07 00:29:47,569 INFO L87 Difference]: Start difference. First operand 133 states and 162 transitions. Second operand has 13 states, 13 states have (on average 4.0) internal successors, (52), 13 states have internal predecessors, (52), 0 states have call successors, (0), 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 00:29:47,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:29:47,967 INFO L93 Difference]: Finished difference Result 203 states and 254 transitions. [2024-11-07 00:29:47,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-07 00:29:47,968 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.0) internal successors, (52), 13 states have internal predecessors, (52), 0 states have call successors, (0), 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 52 [2024-11-07 00:29:47,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:29:47,969 INFO L225 Difference]: With dead ends: 203 [2024-11-07 00:29:47,969 INFO L226 Difference]: Without dead ends: 187 [2024-11-07 00:29:47,969 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=87, Invalid=293, Unknown=0, NotChecked=0, Total=380 [2024-11-07 00:29:47,970 INFO L432 NwaCegarLoop]: 207 mSDtfsCounter, 113 mSDsluCounter, 1194 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 1401 SdHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 00:29:47,970 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 1401 Invalid, 346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 345 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 00:29:47,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2024-11-07 00:29:47,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 125. [2024-11-07 00:29:47,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 122 states have (on average 1.2459016393442623) internal successors, (152), 124 states have internal predecessors, (152), 0 states have call successors, (0), 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 00:29:47,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 152 transitions. [2024-11-07 00:29:47,974 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 152 transitions. Word has length 52 [2024-11-07 00:29:47,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:29:47,974 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 152 transitions. [2024-11-07 00:29:47,975 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.0) internal successors, (52), 13 states have internal predecessors, (52), 0 states have call successors, (0), 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 00:29:47,975 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 152 transitions. [2024-11-07 00:29:47,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-07 00:29:47,975 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:29:47,975 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] [2024-11-07 00:29:47,975 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-07 00:29:47,976 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-11-07 00:29:47,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:29:47,976 INFO L85 PathProgramCache]: Analyzing trace with hash 653628022, now seen corresponding path program 1 times [2024-11-07 00:29:47,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:29:47,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956605104] [2024-11-07 00:29:47,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:29:47,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:29:48,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:29:48,472 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 00:29:48,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:29:48,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956605104] [2024-11-07 00:29:48,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956605104] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:29:48,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:29:48,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-07 00:29:48,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196850042] [2024-11-07 00:29:48,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:29:48,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-07 00:29:48,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:29:48,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-07 00:29:48,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2024-11-07 00:29:48,474 INFO L87 Difference]: Start difference. First operand 125 states and 152 transitions. Second operand has 16 states, 16 states have (on average 3.375) internal successors, (54), 16 states have internal predecessors, (54), 0 states have call successors, (0), 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 00:29:49,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:29:49,369 INFO L93 Difference]: Finished difference Result 310 states and 403 transitions. [2024-11-07 00:29:49,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-07 00:29:49,370 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.375) internal successors, (54), 16 states have internal predecessors, (54), 0 states have call successors, (0), 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 54 [2024-11-07 00:29:49,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:29:49,372 INFO L225 Difference]: With dead ends: 310 [2024-11-07 00:29:49,372 INFO L226 Difference]: Without dead ends: 302 [2024-11-07 00:29:49,372 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=150, Invalid=606, Unknown=0, NotChecked=0, Total=756 [2024-11-07 00:29:49,373 INFO L432 NwaCegarLoop]: 255 mSDtfsCounter, 688 mSDsluCounter, 2062 mSDsCounter, 0 mSdLazyCounter, 1011 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 688 SdHoareTripleChecker+Valid, 2317 SdHoareTripleChecker+Invalid, 1023 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1011 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-07 00:29:49,373 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [688 Valid, 2317 Invalid, 1023 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1011 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-07 00:29:49,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2024-11-07 00:29:49,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 125. [2024-11-07 00:29:49,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 122 states have (on average 1.2377049180327868) internal successors, (151), 124 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:29:49,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 151 transitions. [2024-11-07 00:29:49,382 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 151 transitions. Word has length 54 [2024-11-07 00:29:49,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:29:49,382 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 151 transitions. [2024-11-07 00:29:49,382 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.375) internal successors, (54), 16 states have internal predecessors, (54), 0 states have call successors, (0), 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 00:29:49,383 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 151 transitions. [2024-11-07 00:29:49,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-07 00:29:49,383 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:29:49,383 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] [2024-11-07 00:29:49,383 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-07 00:29:49,383 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-11-07 00:29:49,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:29:49,384 INFO L85 PathProgramCache]: Analyzing trace with hash -1899159370, now seen corresponding path program 1 times [2024-11-07 00:29:49,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:29:49,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228505319] [2024-11-07 00:29:49,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:29:49,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:29:49,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:29:50,045 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 00:29:50,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:29:50,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228505319] [2024-11-07 00:29:50,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228505319] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:29:50,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:29:50,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2024-11-07 00:29:50,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738687641] [2024-11-07 00:29:50,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:29:50,047 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-07 00:29:50,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:29:50,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-07 00:29:50,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2024-11-07 00:29:50,048 INFO L87 Difference]: Start difference. First operand 125 states and 151 transitions. Second operand has 18 states, 18 states have (on average 3.0) internal successors, (54), 18 states have internal predecessors, (54), 0 states have call successors, (0), 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 00:29:51,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:29:51,058 INFO L93 Difference]: Finished difference Result 311 states and 406 transitions. [2024-11-07 00:29:51,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-07 00:29:51,059 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.0) internal successors, (54), 18 states have internal predecessors, (54), 0 states have call successors, (0), 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 54 [2024-11-07 00:29:51,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:29:51,060 INFO L225 Difference]: With dead ends: 311 [2024-11-07 00:29:51,060 INFO L226 Difference]: Without dead ends: 305 [2024-11-07 00:29:51,061 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=192, Invalid=800, Unknown=0, NotChecked=0, Total=992 [2024-11-07 00:29:51,062 INFO L432 NwaCegarLoop]: 237 mSDtfsCounter, 985 mSDsluCounter, 1955 mSDsCounter, 0 mSdLazyCounter, 1050 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 985 SdHoareTripleChecker+Valid, 2192 SdHoareTripleChecker+Invalid, 1061 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1050 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-07 00:29:51,062 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [985 Valid, 2192 Invalid, 1061 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1050 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-07 00:29:51,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2024-11-07 00:29:51,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 131. [2024-11-07 00:29:51,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 128 states have (on average 1.2421875) internal successors, (159), 130 states have internal predecessors, (159), 0 states have call successors, (0), 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 00:29:51,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 159 transitions. [2024-11-07 00:29:51,069 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 159 transitions. Word has length 54 [2024-11-07 00:29:51,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:29:51,069 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 159 transitions. [2024-11-07 00:29:51,069 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.0) internal successors, (54), 18 states have internal predecessors, (54), 0 states have call successors, (0), 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 00:29:51,069 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 159 transitions. [2024-11-07 00:29:51,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-07 00:29:51,069 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:29:51,070 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] [2024-11-07 00:29:51,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-07 00:29:51,070 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-11-07 00:29:51,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:29:51,070 INFO L85 PathProgramCache]: Analyzing trace with hash 2098262835, now seen corresponding path program 1 times [2024-11-07 00:29:51,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:29:51,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139952376] [2024-11-07 00:29:51,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:29:51,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:29:51,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:29:51,498 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 00:29:51,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:29:51,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139952376] [2024-11-07 00:29:51,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139952376] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:29:51,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:29:51,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-07 00:29:51,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848046543] [2024-11-07 00:29:51,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:29:51,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-07 00:29:51,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:29:51,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-07 00:29:51,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-11-07 00:29:51,499 INFO L87 Difference]: Start difference. First operand 131 states and 159 transitions. Second operand has 12 states, 12 states have (on average 4.583333333333333) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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 00:29:51,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:29:51,876 INFO L93 Difference]: Finished difference Result 187 states and 239 transitions. [2024-11-07 00:29:51,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 00:29:51,877 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.583333333333333) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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 55 [2024-11-07 00:29:51,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:29:51,878 INFO L225 Difference]: With dead ends: 187 [2024-11-07 00:29:51,878 INFO L226 Difference]: Without dead ends: 181 [2024-11-07 00:29:51,880 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=110, Invalid=310, Unknown=0, NotChecked=0, Total=420 [2024-11-07 00:29:51,880 INFO L432 NwaCegarLoop]: 170 mSDtfsCounter, 211 mSDsluCounter, 608 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 778 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 00:29:51,880 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 778 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 255 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 00:29:51,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2024-11-07 00:29:51,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 119. [2024-11-07 00:29:51,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 117 states have (on average 1.2393162393162394) internal successors, (145), 118 states have internal predecessors, (145), 0 states have call successors, (0), 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 00:29:51,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 145 transitions. [2024-11-07 00:29:51,885 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 145 transitions. Word has length 55 [2024-11-07 00:29:51,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:29:51,885 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 145 transitions. [2024-11-07 00:29:51,885 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.583333333333333) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 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 00:29:51,885 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 145 transitions. [2024-11-07 00:29:51,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-07 00:29:51,886 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:29:51,886 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] [2024-11-07 00:29:51,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-07 00:29:51,887 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-11-07 00:29:51,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:29:51,887 INFO L85 PathProgramCache]: Analyzing trace with hash -220748721, now seen corresponding path program 1 times [2024-11-07 00:29:51,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:29:51,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150053478] [2024-11-07 00:29:51,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:29:51,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:29:51,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:29:52,620 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 00:29:52,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:29:52,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150053478] [2024-11-07 00:29:52,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1150053478] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:29:52,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:29:52,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-11-07 00:29:52,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778344783] [2024-11-07 00:29:52,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:29:52,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-07 00:29:52,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:29:52,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-07 00:29:52,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2024-11-07 00:29:52,622 INFO L87 Difference]: Start difference. First operand 119 states and 145 transitions. Second operand has 17 states, 17 states have (on average 3.235294117647059) internal successors, (55), 17 states have internal predecessors, (55), 0 states have call successors, (0), 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 00:29:53,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:29:53,584 INFO L93 Difference]: Finished difference Result 231 states and 303 transitions. [2024-11-07 00:29:53,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-07 00:29:53,584 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.235294117647059) internal successors, (55), 17 states have internal predecessors, (55), 0 states have call successors, (0), 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 55 [2024-11-07 00:29:53,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:29:53,585 INFO L225 Difference]: With dead ends: 231 [2024-11-07 00:29:53,585 INFO L226 Difference]: Without dead ends: 219 [2024-11-07 00:29:53,586 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=179, Invalid=751, Unknown=0, NotChecked=0, Total=930 [2024-11-07 00:29:53,586 INFO L432 NwaCegarLoop]: 214 mSDtfsCounter, 704 mSDsluCounter, 1606 mSDsCounter, 0 mSdLazyCounter, 877 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 704 SdHoareTripleChecker+Valid, 1820 SdHoareTripleChecker+Invalid, 884 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 877 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-07 00:29:53,587 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [704 Valid, 1820 Invalid, 884 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 877 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-07 00:29:53,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2024-11-07 00:29:53,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 101. [2024-11-07 00:29:53,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 100 states have (on average 1.26) internal successors, (126), 100 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:29:53,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 126 transitions. [2024-11-07 00:29:53,590 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 126 transitions. Word has length 55 [2024-11-07 00:29:53,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:29:53,591 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 126 transitions. [2024-11-07 00:29:53,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.235294117647059) internal successors, (55), 17 states have internal predecessors, (55), 0 states have call successors, (0), 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 00:29:53,591 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 126 transitions. [2024-11-07 00:29:53,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-07 00:29:53,591 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:29:53,591 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] [2024-11-07 00:29:53,592 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-07 00:29:53,592 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-11-07 00:29:53,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:29:53,592 INFO L85 PathProgramCache]: Analyzing trace with hash 1406506919, now seen corresponding path program 1 times [2024-11-07 00:29:53,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:29:53,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524353266] [2024-11-07 00:29:53,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:29:53,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:29:53,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:29:53,666 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 00:29:53,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:29:53,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524353266] [2024-11-07 00:29:53,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524353266] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:29:53,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:29:53,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 00:29:53,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557778019] [2024-11-07 00:29:53,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:29:53,667 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 00:29:53,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:29:53,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 00:29:53,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 00:29:53,669 INFO L87 Difference]: Start difference. First operand 101 states and 126 transitions. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 0 states have call successors, (0), 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 00:29:53,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:29:53,732 INFO L93 Difference]: Finished difference Result 359 states and 510 transitions. [2024-11-07 00:29:53,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 00:29:53,732 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 0 states have call successors, (0), 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 72 [2024-11-07 00:29:53,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:29:53,735 INFO L225 Difference]: With dead ends: 359 [2024-11-07 00:29:53,735 INFO L226 Difference]: Without dead ends: 316 [2024-11-07 00:29:53,735 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-07 00:29:53,736 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 530 mSDsluCounter, 338 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 530 SdHoareTripleChecker+Valid, 459 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:29:53,736 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [530 Valid, 459 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:29:53,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2024-11-07 00:29:53,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 142. [2024-11-07 00:29:53,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 141 states have (on average 1.326241134751773) internal successors, (187), 141 states have internal predecessors, (187), 0 states have call successors, (0), 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 00:29:53,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 187 transitions. [2024-11-07 00:29:53,749 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 187 transitions. Word has length 72 [2024-11-07 00:29:53,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:29:53,750 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 187 transitions. [2024-11-07 00:29:53,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 0 states have call successors, (0), 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 00:29:53,750 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 187 transitions. [2024-11-07 00:29:53,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-07 00:29:53,751 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:29:53,751 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] [2024-11-07 00:29:53,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-07 00:29:53,751 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-11-07 00:29:53,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:29:53,751 INFO L85 PathProgramCache]: Analyzing trace with hash -1673936966, now seen corresponding path program 1 times [2024-11-07 00:29:53,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:29:53,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862191965] [2024-11-07 00:29:53,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:29:53,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:29:53,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:29:53,826 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 00:29:53,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:29:53,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862191965] [2024-11-07 00:29:53,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [862191965] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:29:53,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:29:53,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 00:29:53,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683426413] [2024-11-07 00:29:53,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:29:53,828 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 00:29:53,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:29:53,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 00:29:53,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-07 00:29:53,828 INFO L87 Difference]: Start difference. First operand 142 states and 187 transitions. Second operand has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 0 states have call successors, (0), 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 00:29:53,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:29:53,885 INFO L93 Difference]: Finished difference Result 437 states and 624 transitions. [2024-11-07 00:29:53,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 00:29:53,886 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 0 states have call successors, (0), 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 74 [2024-11-07 00:29:53,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:29:53,888 INFO L225 Difference]: With dead ends: 437 [2024-11-07 00:29:53,888 INFO L226 Difference]: Without dead ends: 353 [2024-11-07 00:29:53,889 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-07 00:29:53,890 INFO L432 NwaCegarLoop]: 174 mSDtfsCounter, 292 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 292 SdHoareTripleChecker+Valid, 416 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:29:53,890 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [292 Valid, 416 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:29:53,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2024-11-07 00:29:53,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 224. [2024-11-07 00:29:53,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 223 states have (on average 1.390134529147982) internal successors, (310), 223 states have internal predecessors, (310), 0 states have call successors, (0), 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 00:29:53,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 310 transitions. [2024-11-07 00:29:53,900 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 310 transitions. Word has length 74 [2024-11-07 00:29:53,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:29:53,901 INFO L471 AbstractCegarLoop]: Abstraction has 224 states and 310 transitions. [2024-11-07 00:29:53,901 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 0 states have call successors, (0), 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 00:29:53,901 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 310 transitions. [2024-11-07 00:29:53,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-07 00:29:53,902 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:29:53,902 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] [2024-11-07 00:29:53,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-07 00:29:53,902 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-11-07 00:29:53,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:29:53,903 INFO L85 PathProgramCache]: Analyzing trace with hash -1695280855, now seen corresponding path program 1 times [2024-11-07 00:29:53,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:29:53,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279427663] [2024-11-07 00:29:53,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:29:53,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:29:53,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:29:53,945 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 00:29:53,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:29:53,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279427663] [2024-11-07 00:29:53,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1279427663] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:29:53,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:29:53,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 00:29:53,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955274441] [2024-11-07 00:29:53,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:29:53,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 00:29:53,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:29:53,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 00:29:53,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:29:53,948 INFO L87 Difference]: Start difference. First operand 224 states and 310 transitions. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 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 00:29:53,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:29:53,970 INFO L93 Difference]: Finished difference Result 392 states and 559 transitions. [2024-11-07 00:29:53,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 00:29:53,970 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 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 74 [2024-11-07 00:29:53,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:29:53,971 INFO L225 Difference]: With dead ends: 392 [2024-11-07 00:29:53,971 INFO L226 Difference]: Without dead ends: 226 [2024-11-07 00:29:53,971 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 00:29:53,972 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 51 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:29:53,972 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 200 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:29:53,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2024-11-07 00:29:53,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 224. [2024-11-07 00:29:53,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 223 states have (on average 1.3811659192825112) internal successors, (308), 223 states have internal predecessors, (308), 0 states have call successors, (0), 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 00:29:53,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 308 transitions. [2024-11-07 00:29:53,982 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 308 transitions. Word has length 74 [2024-11-07 00:29:53,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:29:53,983 INFO L471 AbstractCegarLoop]: Abstraction has 224 states and 308 transitions. [2024-11-07 00:29:53,983 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 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 00:29:53,983 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 308 transitions. [2024-11-07 00:29:53,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-07 00:29:53,984 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:29:53,984 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] [2024-11-07 00:29:53,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-07 00:29:53,984 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-11-07 00:29:53,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:29:53,986 INFO L85 PathProgramCache]: Analyzing trace with hash 1859946120, now seen corresponding path program 1 times [2024-11-07 00:29:53,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:29:53,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87510698] [2024-11-07 00:29:53,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:29:53,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:29:54,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:29:54,036 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 00:29:54,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:29:54,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87510698] [2024-11-07 00:29:54,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87510698] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:29:54,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:29:54,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 00:29:54,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856101590] [2024-11-07 00:29:54,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:29:54,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 00:29:54,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:29:54,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 00:29:54,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:29:54,039 INFO L87 Difference]: Start difference. First operand 224 states and 308 transitions. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 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 00:29:54,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:29:54,062 INFO L93 Difference]: Finished difference Result 530 states and 756 transitions. [2024-11-07 00:29:54,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 00:29:54,063 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 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 74 [2024-11-07 00:29:54,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:29:54,065 INFO L225 Difference]: With dead ends: 530 [2024-11-07 00:29:54,065 INFO L226 Difference]: Without dead ends: 364 [2024-11-07 00:29:54,065 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 00:29:54,066 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 68 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:29:54,068 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 195 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:29:54,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2024-11-07 00:29:54,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 358. [2024-11-07 00:29:54,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 358 states, 357 states have (on average 1.3865546218487395) internal successors, (495), 357 states have internal predecessors, (495), 0 states have call successors, (0), 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 00:29:54,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 495 transitions. [2024-11-07 00:29:54,078 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 495 transitions. Word has length 74 [2024-11-07 00:29:54,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:29:54,078 INFO L471 AbstractCegarLoop]: Abstraction has 358 states and 495 transitions. [2024-11-07 00:29:54,079 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 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 00:29:54,079 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 495 transitions. [2024-11-07 00:29:54,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-07 00:29:54,079 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:29:54,079 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] [2024-11-07 00:29:54,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-07 00:29:54,080 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-11-07 00:29:54,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:29:54,080 INFO L85 PathProgramCache]: Analyzing trace with hash 1889765056, now seen corresponding path program 1 times [2024-11-07 00:29:54,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:29:54,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611105469] [2024-11-07 00:29:54,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:29:54,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:29:54,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:29:54,161 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 00:29:54,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:29:54,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611105469] [2024-11-07 00:29:54,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [611105469] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:29:54,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:29:54,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 00:29:54,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58719330] [2024-11-07 00:29:54,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:29:54,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 00:29:54,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:29:54,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 00:29:54,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-07 00:29:54,163 INFO L87 Difference]: Start difference. First operand 358 states and 495 transitions. Second operand has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 0 states have call successors, (0), 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 00:29:54,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:29:54,238 INFO L93 Difference]: Finished difference Result 888 states and 1257 transitions. [2024-11-07 00:29:54,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 00:29:54,239 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 0 states have call successors, (0), 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 74 [2024-11-07 00:29:54,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:29:54,242 INFO L225 Difference]: With dead ends: 888 [2024-11-07 00:29:54,242 INFO L226 Difference]: Without dead ends: 737 [2024-11-07 00:29:54,242 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-07 00:29:54,243 INFO L432 NwaCegarLoop]: 177 mSDtfsCounter, 285 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 285 SdHoareTripleChecker+Valid, 462 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:29:54,243 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [285 Valid, 462 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:29:54,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 737 states. [2024-11-07 00:29:54,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 737 to 582. [2024-11-07 00:29:54,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 582 states, 581 states have (on average 1.4061962134251291) internal successors, (817), 581 states have internal predecessors, (817), 0 states have call successors, (0), 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 00:29:54,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582 states to 582 states and 817 transitions. [2024-11-07 00:29:54,259 INFO L78 Accepts]: Start accepts. Automaton has 582 states and 817 transitions. Word has length 74 [2024-11-07 00:29:54,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:29:54,259 INFO L471 AbstractCegarLoop]: Abstraction has 582 states and 817 transitions. [2024-11-07 00:29:54,259 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 0 states have call successors, (0), 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 00:29:54,260 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 817 transitions. [2024-11-07 00:29:54,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-07 00:29:54,262 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:29:54,262 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] [2024-11-07 00:29:54,263 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-07 00:29:54,263 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-11-07 00:29:54,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:29:54,263 INFO L85 PathProgramCache]: Analyzing trace with hash -1073266559, now seen corresponding path program 1 times [2024-11-07 00:29:54,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:29:54,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753781240] [2024-11-07 00:29:54,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:29:54,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:29:54,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:29:54,335 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 00:29:54,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:29:54,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753781240] [2024-11-07 00:29:54,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753781240] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:29:54,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:29:54,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 00:29:54,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960198444] [2024-11-07 00:29:54,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:29:54,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 00:29:54,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:29:54,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 00:29:54,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:29:54,337 INFO L87 Difference]: Start difference. First operand 582 states and 817 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 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 00:29:54,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:29:54,358 INFO L93 Difference]: Finished difference Result 1574 states and 2229 transitions. [2024-11-07 00:29:54,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 00:29:54,359 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 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 75 [2024-11-07 00:29:54,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:29:54,362 INFO L225 Difference]: With dead ends: 1574 [2024-11-07 00:29:54,363 INFO L226 Difference]: Without dead ends: 1050 [2024-11-07 00:29:54,364 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 00:29:54,365 INFO L432 NwaCegarLoop]: 157 mSDtfsCounter, 54 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 258 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 00:29:54,365 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 258 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:29:54,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1050 states. [2024-11-07 00:29:54,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1050 to 992. [2024-11-07 00:29:54,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 992 states, 991 states have (on average 1.401614530776993) internal successors, (1389), 991 states have internal predecessors, (1389), 0 states have call successors, (0), 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 00:29:54,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 992 states to 992 states and 1389 transitions. [2024-11-07 00:29:54,386 INFO L78 Accepts]: Start accepts. Automaton has 992 states and 1389 transitions. Word has length 75 [2024-11-07 00:29:54,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:29:54,386 INFO L471 AbstractCegarLoop]: Abstraction has 992 states and 1389 transitions. [2024-11-07 00:29:54,386 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 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 00:29:54,386 INFO L276 IsEmpty]: Start isEmpty. Operand 992 states and 1389 transitions. [2024-11-07 00:29:54,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-07 00:29:54,387 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:29:54,387 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] [2024-11-07 00:29:54,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-07 00:29:54,387 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-11-07 00:29:54,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:29:54,388 INFO L85 PathProgramCache]: Analyzing trace with hash -391890934, now seen corresponding path program 1 times [2024-11-07 00:29:54,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:29:54,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249886468] [2024-11-07 00:29:54,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:29:54,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:29:54,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:29:54,454 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 00:29:54,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:29:54,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249886468] [2024-11-07 00:29:54,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [249886468] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:29:54,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:29:54,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 00:29:54,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963969757] [2024-11-07 00:29:54,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:29:54,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 00:29:54,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:29:54,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 00:29:54,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:29:54,456 INFO L87 Difference]: Start difference. First operand 992 states and 1389 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 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 00:29:54,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:29:54,479 INFO L93 Difference]: Finished difference Result 2748 states and 3847 transitions. [2024-11-07 00:29:54,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 00:29:54,480 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 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 76 [2024-11-07 00:29:54,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:29:54,486 INFO L225 Difference]: With dead ends: 2748 [2024-11-07 00:29:54,486 INFO L226 Difference]: Without dead ends: 1814 [2024-11-07 00:29:54,488 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 00:29:54,488 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 44 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:29:54,488 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 258 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:29:54,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1814 states. [2024-11-07 00:29:54,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1814 to 1700. [2024-11-07 00:29:54,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1700 states, 1699 states have (on average 1.3837551500882872) internal successors, (2351), 1699 states have internal predecessors, (2351), 0 states have call successors, (0), 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 00:29:54,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1700 states to 1700 states and 2351 transitions. [2024-11-07 00:29:54,526 INFO L78 Accepts]: Start accepts. Automaton has 1700 states and 2351 transitions. Word has length 76 [2024-11-07 00:29:54,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:29:54,526 INFO L471 AbstractCegarLoop]: Abstraction has 1700 states and 2351 transitions. [2024-11-07 00:29:54,526 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 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 00:29:54,526 INFO L276 IsEmpty]: Start isEmpty. Operand 1700 states and 2351 transitions. [2024-11-07 00:29:54,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-07 00:29:54,527 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:29:54,527 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 00:29:54,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-07 00:29:54,527 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-11-07 00:29:54,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:29:54,528 INFO L85 PathProgramCache]: Analyzing trace with hash 1183434290, now seen corresponding path program 1 times [2024-11-07 00:29:54,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:29:54,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606490303] [2024-11-07 00:29:54,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:29:54,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:29:54,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:29:54,687 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 00:29:54,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:29:54,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606490303] [2024-11-07 00:29:54,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606490303] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:29:54,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:29:54,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 00:29:54,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503258803] [2024-11-07 00:29:54,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:29:54,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 00:29:54,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:29:54,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 00:29:54,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 00:29:54,689 INFO L87 Difference]: Start difference. First operand 1700 states and 2351 transitions. Second operand has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 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 00:29:54,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:29:54,716 INFO L93 Difference]: Finished difference Result 1774 states and 2448 transitions. [2024-11-07 00:29:54,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 00:29:54,716 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 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 00:29:54,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:29:54,722 INFO L225 Difference]: With dead ends: 1774 [2024-11-07 00:29:54,723 INFO L226 Difference]: Without dead ends: 1772 [2024-11-07 00:29:54,724 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 00:29:54,724 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 0 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 599 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:29:54,724 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 599 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:29:54,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1772 states. [2024-11-07 00:29:54,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1772 to 1772. [2024-11-07 00:29:54,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1772 states, 1771 states have (on average 1.3591191417278374) internal successors, (2407), 1771 states have internal predecessors, (2407), 0 states have call successors, (0), 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 00:29:54,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1772 states to 1772 states and 2407 transitions. [2024-11-07 00:29:54,761 INFO L78 Accepts]: Start accepts. Automaton has 1772 states and 2407 transitions. Word has length 77 [2024-11-07 00:29:54,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:29:54,761 INFO L471 AbstractCegarLoop]: Abstraction has 1772 states and 2407 transitions. [2024-11-07 00:29:54,761 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 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 00:29:54,761 INFO L276 IsEmpty]: Start isEmpty. Operand 1772 states and 2407 transitions. [2024-11-07 00:29:54,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-07 00:29:54,762 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:29:54,762 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 00:29:54,762 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-07 00:29:54,762 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-11-07 00:29:54,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:29:54,763 INFO L85 PathProgramCache]: Analyzing trace with hash -696816699, now seen corresponding path program 1 times [2024-11-07 00:29:54,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:29:54,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486079713] [2024-11-07 00:29:54,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:29:54,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:29:54,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:29:54,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 00:29:54,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:29:54,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486079713] [2024-11-07 00:29:54,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [486079713] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:29:54,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:29:54,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 00:29:54,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914813856] [2024-11-07 00:29:54,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:29:54,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 00:29:54,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:29:54,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 00:29:54,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-07 00:29:54,836 INFO L87 Difference]: Start difference. First operand 1772 states and 2407 transitions. Second operand has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 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 00:29:54,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:29:54,894 INFO L93 Difference]: Finished difference Result 3256 states and 4451 transitions. [2024-11-07 00:29:54,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 00:29:54,895 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 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 00:29:54,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:29:54,904 INFO L225 Difference]: With dead ends: 3256 [2024-11-07 00:29:54,905 INFO L226 Difference]: Without dead ends: 2762 [2024-11-07 00:29:54,906 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-07 00:29:54,907 INFO L432 NwaCegarLoop]: 175 mSDtfsCounter, 286 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 286 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:29:54,907 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [286 Valid, 417 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:29:54,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2762 states. [2024-11-07 00:29:54,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2762 to 2264. [2024-11-07 00:29:54,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2264 states, 2263 states have (on average 1.3605832965090587) internal successors, (3079), 2263 states have internal predecessors, (3079), 0 states have call successors, (0), 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 00:29:54,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2264 states to 2264 states and 3079 transitions. [2024-11-07 00:29:54,958 INFO L78 Accepts]: Start accepts. Automaton has 2264 states and 3079 transitions. Word has length 77 [2024-11-07 00:29:54,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:29:54,959 INFO L471 AbstractCegarLoop]: Abstraction has 2264 states and 3079 transitions. [2024-11-07 00:29:54,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 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 00:29:54,959 INFO L276 IsEmpty]: Start isEmpty. Operand 2264 states and 3079 transitions. [2024-11-07 00:29:54,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-07 00:29:54,960 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:29:54,960 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] [2024-11-07 00:29:54,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-07 00:29:54,960 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-11-07 00:29:54,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:29:54,961 INFO L85 PathProgramCache]: Analyzing trace with hash -1657778714, now seen corresponding path program 1 times [2024-11-07 00:29:54,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:29:54,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024835245] [2024-11-07 00:29:54,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:29:54,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:29:54,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:29:55,027 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 00:29:55,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:29:55,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024835245] [2024-11-07 00:29:55,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024835245] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:29:55,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:29:55,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 00:29:55,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075437201] [2024-11-07 00:29:55,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:29:55,027 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 00:29:55,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:29:55,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 00:29:55,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:29:55,032 INFO L87 Difference]: Start difference. First operand 2264 states and 3079 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 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 00:29:55,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:29:55,066 INFO L93 Difference]: Finished difference Result 5884 states and 7993 transitions. [2024-11-07 00:29:55,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 00:29:55,066 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 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 78 [2024-11-07 00:29:55,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:29:55,080 INFO L225 Difference]: With dead ends: 5884 [2024-11-07 00:29:55,080 INFO L226 Difference]: Without dead ends: 3678 [2024-11-07 00:29:55,084 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 00:29:55,085 INFO L432 NwaCegarLoop]: 167 mSDtfsCounter, 58 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 261 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 00:29:55,086 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 261 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:29:55,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3678 states. [2024-11-07 00:29:55,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3678 to 3388. [2024-11-07 00:29:55,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3388 states, 3387 states have (on average 1.3413049896663714) internal successors, (4543), 3387 states have internal predecessors, (4543), 0 states have call successors, (0), 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 00:29:55,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3388 states to 3388 states and 4543 transitions. [2024-11-07 00:29:55,171 INFO L78 Accepts]: Start accepts. Automaton has 3388 states and 4543 transitions. Word has length 78 [2024-11-07 00:29:55,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:29:55,172 INFO L471 AbstractCegarLoop]: Abstraction has 3388 states and 4543 transitions. [2024-11-07 00:29:55,172 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 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 00:29:55,172 INFO L276 IsEmpty]: Start isEmpty. Operand 3388 states and 4543 transitions. [2024-11-07 00:29:55,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-07 00:29:55,174 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:29:55,174 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:29:55,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-07 00:29:55,174 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-11-07 00:29:55,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:29:55,175 INFO L85 PathProgramCache]: Analyzing trace with hash 910821393, now seen corresponding path program 1 times [2024-11-07 00:29:55,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:29:55,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831885663] [2024-11-07 00:29:55,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:29:55,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:29:55,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:29:55,278 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:29:55,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:29:55,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831885663] [2024-11-07 00:29:55,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831885663] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:29:55,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:29:55,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 00:29:55,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414261148] [2024-11-07 00:29:55,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:29:55,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 00:29:55,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:29:55,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 00:29:55,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:29:55,280 INFO L87 Difference]: Start difference. First operand 3388 states and 4543 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 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 00:29:55,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:29:55,321 INFO L93 Difference]: Finished difference Result 6720 states and 9025 transitions. [2024-11-07 00:29:55,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 00:29:55,322 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 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 99 [2024-11-07 00:29:55,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:29:55,335 INFO L225 Difference]: With dead ends: 6720 [2024-11-07 00:29:55,335 INFO L226 Difference]: Without dead ends: 3390 [2024-11-07 00:29:55,340 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 00:29:55,341 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 56 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:29:55,341 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 238 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:29:55,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3390 states. [2024-11-07 00:29:55,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3390 to 3388. [2024-11-07 00:29:55,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3388 states, 3387 states have (on average 1.3200472394449365) internal successors, (4471), 3387 states have internal predecessors, (4471), 0 states have call successors, (0), 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 00:29:55,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3388 states to 3388 states and 4471 transitions. [2024-11-07 00:29:55,420 INFO L78 Accepts]: Start accepts. Automaton has 3388 states and 4471 transitions. Word has length 99 [2024-11-07 00:29:55,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:29:55,420 INFO L471 AbstractCegarLoop]: Abstraction has 3388 states and 4471 transitions. [2024-11-07 00:29:55,421 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 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 00:29:55,421 INFO L276 IsEmpty]: Start isEmpty. Operand 3388 states and 4471 transitions. [2024-11-07 00:29:55,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-07 00:29:55,422 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:29:55,422 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:29:55,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-07 00:29:55,422 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-11-07 00:29:55,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:29:55,423 INFO L85 PathProgramCache]: Analyzing trace with hash 412335050, now seen corresponding path program 1 times [2024-11-07 00:29:55,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:29:55,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880620457] [2024-11-07 00:29:55,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:29:55,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:29:55,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:29:55,820 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:29:55,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:29:55,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880620457] [2024-11-07 00:29:55,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880620457] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 00:29:55,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [260419968] [2024-11-07 00:29:55,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:29:55,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 00:29:55,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 00:29:55,824 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 00:29:55,826 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-07 00:29:56,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:29:56,009 INFO L255 TraceCheckSpWp]: Trace formula consists of 460 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-07 00:29:56,016 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 00:29:56,709 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:29:56,709 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 00:29:57,814 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:29:57,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [260419968] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 00:29:57,815 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 00:29:57,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 26 [2024-11-07 00:29:57,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131053447] [2024-11-07 00:29:57,816 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 00:29:57,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-11-07 00:29:57,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:29:57,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-11-07 00:29:57,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=615, Unknown=0, NotChecked=0, Total=702 [2024-11-07 00:29:57,818 INFO L87 Difference]: Start difference. First operand 3388 states and 4471 transitions. Second operand has 27 states, 27 states have (on average 8.814814814814815) internal successors, (238), 26 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:30:01,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:30:01,520 INFO L93 Difference]: Finished difference Result 27492 states and 36125 transitions. [2024-11-07 00:30:01,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2024-11-07 00:30:01,520 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 8.814814814814815) internal successors, (238), 26 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2024-11-07 00:30:01,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:30:01,588 INFO L225 Difference]: With dead ends: 27492 [2024-11-07 00:30:01,588 INFO L226 Difference]: Without dead ends: 24162 [2024-11-07 00:30:01,607 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 302 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4607 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=2127, Invalid=12879, Unknown=0, NotChecked=0, Total=15006 [2024-11-07 00:30:01,608 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 2561 mSDsluCounter, 1850 mSDsCounter, 0 mSdLazyCounter, 2005 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2561 SdHoareTripleChecker+Valid, 1984 SdHoareTripleChecker+Invalid, 2055 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 2005 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-07 00:30:01,608 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2561 Valid, 1984 Invalid, 2055 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 2005 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-07 00:30:01,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24162 states. [2024-11-07 00:30:01,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24162 to 17169. [2024-11-07 00:30:02,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17169 states, 17168 states have (on average 1.3102283317800558) internal successors, (22494), 17168 states have internal predecessors, (22494), 0 states have call successors, (0), 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 00:30:02,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17169 states to 17169 states and 22494 transitions. [2024-11-07 00:30:02,060 INFO L78 Accepts]: Start accepts. Automaton has 17169 states and 22494 transitions. Word has length 99 [2024-11-07 00:30:02,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:30:02,061 INFO L471 AbstractCegarLoop]: Abstraction has 17169 states and 22494 transitions. [2024-11-07 00:30:02,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 8.814814814814815) internal successors, (238), 26 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:30:02,061 INFO L276 IsEmpty]: Start isEmpty. Operand 17169 states and 22494 transitions. [2024-11-07 00:30:02,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-07 00:30:02,065 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:30:02,065 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:30:02,086 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-07 00:30:02,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2024-11-07 00:30:02,266 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-11-07 00:30:02,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:30:02,267 INFO L85 PathProgramCache]: Analyzing trace with hash -1279457798, now seen corresponding path program 1 times [2024-11-07 00:30:02,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:30:02,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924768201] [2024-11-07 00:30:02,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:30:02,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:30:02,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:30:02,698 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:30:02,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:30:02,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924768201] [2024-11-07 00:30:02,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924768201] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 00:30:02,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1635986474] [2024-11-07 00:30:02,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:30:02,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 00:30:02,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 00:30:02,702 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 00:30:02,706 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-07 00:30:02,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:30:02,877 INFO L255 TraceCheckSpWp]: Trace formula consists of 465 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-07 00:30:02,882 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 00:30:03,335 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:30:03,335 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 00:30:04,031 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:30:04,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1635986474] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 00:30:04,032 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 00:30:04,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 28 [2024-11-07 00:30:04,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802674649] [2024-11-07 00:30:04,032 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 00:30:04,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-07 00:30:04,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:30:04,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-07 00:30:04,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=683, Unknown=0, NotChecked=0, Total=756 [2024-11-07 00:30:04,033 INFO L87 Difference]: Start difference. First operand 17169 states and 22494 transitions. Second operand has 28 states, 28 states have (on average 9.75) internal successors, (273), 28 states have internal predecessors, (273), 0 states have call successors, (0), 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 00:30:13,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:30:13,908 INFO L93 Difference]: Finished difference Result 83715 states and 108526 transitions. [2024-11-07 00:30:13,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 196 states. [2024-11-07 00:30:13,909 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 9.75) internal successors, (273), 28 states have internal predecessors, (273), 0 states have call successors, (0), 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 100 [2024-11-07 00:30:13,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:30:14,058 INFO L225 Difference]: With dead ends: 83715 [2024-11-07 00:30:14,058 INFO L226 Difference]: Without dead ends: 66630 [2024-11-07 00:30:14,096 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 404 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 220 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19429 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=7084, Invalid=41978, Unknown=0, NotChecked=0, Total=49062 [2024-11-07 00:30:14,097 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 3819 mSDsluCounter, 1934 mSDsCounter, 0 mSdLazyCounter, 2954 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3819 SdHoareTripleChecker+Valid, 2057 SdHoareTripleChecker+Invalid, 3074 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 2954 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-07 00:30:14,097 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3819 Valid, 2057 Invalid, 3074 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 2954 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-07 00:30:14,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66630 states. [2024-11-07 00:30:14,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66630 to 40835. [2024-11-07 00:30:14,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40835 states, 40834 states have (on average 1.303986873683695) internal successors, (53247), 40834 states have internal predecessors, (53247), 0 states have call successors, (0), 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 00:30:14,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40835 states to 40835 states and 53247 transitions. [2024-11-07 00:30:14,996 INFO L78 Accepts]: Start accepts. Automaton has 40835 states and 53247 transitions. Word has length 100 [2024-11-07 00:30:14,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:30:14,997 INFO L471 AbstractCegarLoop]: Abstraction has 40835 states and 53247 transitions. [2024-11-07 00:30:14,997 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 9.75) internal successors, (273), 28 states have internal predecessors, (273), 0 states have call successors, (0), 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 00:30:14,998 INFO L276 IsEmpty]: Start isEmpty. Operand 40835 states and 53247 transitions. [2024-11-07 00:30:15,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-07 00:30:15,005 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:30:15,005 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:30:15,024 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-07 00:30:15,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2024-11-07 00:30:15,210 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-11-07 00:30:15,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:30:15,211 INFO L85 PathProgramCache]: Analyzing trace with hash 1677989637, now seen corresponding path program 1 times [2024-11-07 00:30:15,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:30:15,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134464182] [2024-11-07 00:30:15,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:30:15,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:30:15,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:30:15,259 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-07 00:30:15,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:30:15,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134464182] [2024-11-07 00:30:15,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134464182] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:30:15,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:30:15,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 00:30:15,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34087443] [2024-11-07 00:30:15,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:30:15,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 00:30:15,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:30:15,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 00:30:15,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:30:15,261 INFO L87 Difference]: Start difference. First operand 40835 states and 53247 transitions. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 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 00:30:15,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:30:15,581 INFO L93 Difference]: Finished difference Result 71562 states and 93581 transitions. [2024-11-07 00:30:15,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 00:30:15,582 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 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 101 [2024-11-07 00:30:15,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:30:15,645 INFO L225 Difference]: With dead ends: 71562 [2024-11-07 00:30:15,646 INFO L226 Difference]: Without dead ends: 30844 [2024-11-07 00:30:15,680 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 00:30:15,681 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 83 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:30:15,682 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 104 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:30:15,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30844 states. [2024-11-07 00:30:16,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30844 to 30704. [2024-11-07 00:30:16,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30704 states, 30703 states have (on average 1.294531479008566) internal successors, (39746), 30703 states have internal predecessors, (39746), 0 states have call successors, (0), 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 00:30:16,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30704 states to 30704 states and 39746 transitions. [2024-11-07 00:30:16,182 INFO L78 Accepts]: Start accepts. Automaton has 30704 states and 39746 transitions. Word has length 101 [2024-11-07 00:30:16,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:30:16,182 INFO L471 AbstractCegarLoop]: Abstraction has 30704 states and 39746 transitions. [2024-11-07 00:30:16,183 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 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 00:30:16,183 INFO L276 IsEmpty]: Start isEmpty. Operand 30704 states and 39746 transitions. [2024-11-07 00:30:16,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-07 00:30:16,188 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:30:16,188 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:30:16,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-07 00:30:16,189 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-11-07 00:30:16,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:30:16,192 INFO L85 PathProgramCache]: Analyzing trace with hash 2008738644, now seen corresponding path program 1 times [2024-11-07 00:30:16,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:30:16,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115549718] [2024-11-07 00:30:16,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:30:16,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:30:16,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:30:16,472 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-07 00:30:16,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:30:16,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115549718] [2024-11-07 00:30:16,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [115549718] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:30:16,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:30:16,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 00:30:16,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460275488] [2024-11-07 00:30:16,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:30:16,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 00:30:16,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:30:16,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 00:30:16,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-07 00:30:16,475 INFO L87 Difference]: Start difference. First operand 30704 states and 39746 transitions. Second operand has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 8 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) [2024-11-07 00:30:16,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:30:16,983 INFO L93 Difference]: Finished difference Result 74256 states and 96049 transitions. [2024-11-07 00:30:16,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-07 00:30:16,984 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 8 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) Word has length 101 [2024-11-07 00:30:16,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:30:17,072 INFO L225 Difference]: With dead ends: 74256 [2024-11-07 00:30:17,073 INFO L226 Difference]: Without dead ends: 43645 [2024-11-07 00:30:17,106 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2024-11-07 00:30:17,106 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 370 mSDsluCounter, 347 mSDsCounter, 0 mSdLazyCounter, 356 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 370 SdHoareTripleChecker+Valid, 460 SdHoareTripleChecker+Invalid, 362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 00:30:17,106 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [370 Valid, 460 Invalid, 362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 356 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 00:30:17,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43645 states. [2024-11-07 00:30:17,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43645 to 30704. [2024-11-07 00:30:17,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30704 states, 30703 states have (on average 1.2944011985799433) internal successors, (39742), 30703 states have internal predecessors, (39742), 0 states have call successors, (0), 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 00:30:18,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30704 states to 30704 states and 39742 transitions. [2024-11-07 00:30:18,024 INFO L78 Accepts]: Start accepts. Automaton has 30704 states and 39742 transitions. Word has length 101 [2024-11-07 00:30:18,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:30:18,025 INFO L471 AbstractCegarLoop]: Abstraction has 30704 states and 39742 transitions. [2024-11-07 00:30:18,025 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 8 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) [2024-11-07 00:30:18,025 INFO L276 IsEmpty]: Start isEmpty. Operand 30704 states and 39742 transitions. [2024-11-07 00:30:18,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-07 00:30:18,030 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:30:18,031 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:30:18,031 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-07 00:30:18,031 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-11-07 00:30:18,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:30:18,032 INFO L85 PathProgramCache]: Analyzing trace with hash -290965972, now seen corresponding path program 1 times [2024-11-07 00:30:18,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:30:18,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766191582] [2024-11-07 00:30:18,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:30:18,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:30:18,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:30:18,711 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-07 00:30:18,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:30:18,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766191582] [2024-11-07 00:30:18,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766191582] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:30:18,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:30:18,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-07 00:30:18,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146524242] [2024-11-07 00:30:18,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:30:18,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-07 00:30:18,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:30:18,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-07 00:30:18,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2024-11-07 00:30:18,713 INFO L87 Difference]: Start difference. First operand 30704 states and 39742 transitions. Second operand has 16 states, 16 states have (on average 6.0) internal successors, (96), 16 states have internal predecessors, (96), 0 states have call successors, (0), 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 00:30:19,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:30:19,527 INFO L93 Difference]: Finished difference Result 64169 states and 83317 transitions. [2024-11-07 00:30:19,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-07 00:30:19,528 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 6.0) internal successors, (96), 16 states have internal predecessors, (96), 0 states have call successors, (0), 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 102 [2024-11-07 00:30:19,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:30:19,601 INFO L225 Difference]: With dead ends: 64169 [2024-11-07 00:30:19,601 INFO L226 Difference]: Without dead ends: 45178 [2024-11-07 00:30:19,631 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=140, Invalid=616, Unknown=0, NotChecked=0, Total=756 [2024-11-07 00:30:19,632 INFO L432 NwaCegarLoop]: 256 mSDtfsCounter, 642 mSDsluCounter, 2096 mSDsCounter, 0 mSdLazyCounter, 1135 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 642 SdHoareTripleChecker+Valid, 2352 SdHoareTripleChecker+Invalid, 1143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 00:30:19,632 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [642 Valid, 2352 Invalid, 1143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1135 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 00:30:19,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45178 states. [2024-11-07 00:30:20,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45178 to 30697. [2024-11-07 00:30:20,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30697 states, 30696 states have (on average 1.2944357571019025) internal successors, (39734), 30696 states have internal predecessors, (39734), 0 states have call successors, (0), 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 00:30:20,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30697 states to 30697 states and 39734 transitions. [2024-11-07 00:30:20,169 INFO L78 Accepts]: Start accepts. Automaton has 30697 states and 39734 transitions. Word has length 102 [2024-11-07 00:30:20,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:30:20,169 INFO L471 AbstractCegarLoop]: Abstraction has 30697 states and 39734 transitions. [2024-11-07 00:30:20,169 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 6.0) internal successors, (96), 16 states have internal predecessors, (96), 0 states have call successors, (0), 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 00:30:20,169 INFO L276 IsEmpty]: Start isEmpty. Operand 30697 states and 39734 transitions. [2024-11-07 00:30:20,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-07 00:30:20,173 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:30:20,173 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:30:20,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-11-07 00:30:20,174 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-11-07 00:30:20,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:30:20,174 INFO L85 PathProgramCache]: Analyzing trace with hash -112040011, now seen corresponding path program 1 times [2024-11-07 00:30:20,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:30:20,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541538228] [2024-11-07 00:30:20,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:30:20,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:30:20,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:30:20,587 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:30:20,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:30:20,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541538228] [2024-11-07 00:30:20,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541538228] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 00:30:20,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1260924361] [2024-11-07 00:30:20,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:30:20,588 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 00:30:20,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 00:30:20,591 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 00:30:20,593 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-07 00:30:20,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:30:20,755 INFO L255 TraceCheckSpWp]: Trace formula consists of 466 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-07 00:30:20,761 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 00:30:21,644 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:30:21,644 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 00:30:23,157 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:30:23,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1260924361] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 00:30:23,158 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 00:30:23,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 16, 15] total 37 [2024-11-07 00:30:23,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057344931] [2024-11-07 00:30:23,158 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 00:30:23,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2024-11-07 00:30:23,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:30:23,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2024-11-07 00:30:23,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=1210, Unknown=0, NotChecked=0, Total=1332 [2024-11-07 00:30:23,159 INFO L87 Difference]: Start difference. First operand 30697 states and 39734 transitions. Second operand has 37 states, 37 states have (on average 7.621621621621622) internal successors, (282), 37 states have internal predecessors, (282), 0 states have call successors, (0), 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 00:30:49,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:30:49,405 INFO L93 Difference]: Finished difference Result 130981 states and 167456 transitions. [2024-11-07 00:30:49,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 345 states. [2024-11-07 00:30:49,405 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 7.621621621621622) internal successors, (282), 37 states have internal predecessors, (282), 0 states have call successors, (0), 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 103 [2024-11-07 00:30:49,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:30:49,591 INFO L225 Difference]: With dead ends: 130981 [2024-11-07 00:30:49,591 INFO L226 Difference]: Without dead ends: 118510 [2024-11-07 00:30:49,643 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 556 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 378 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63648 ImplicationChecksByTransitivity, 22.4s TimeCoverageRelationStatistics Valid=20162, Invalid=123858, Unknown=0, NotChecked=0, Total=144020 [2024-11-07 00:30:49,644 INFO L432 NwaCegarLoop]: 235 mSDtfsCounter, 3599 mSDsluCounter, 4783 mSDsCounter, 0 mSdLazyCounter, 6612 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3599 SdHoareTripleChecker+Valid, 5018 SdHoareTripleChecker+Invalid, 6713 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 6612 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2024-11-07 00:30:49,644 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3599 Valid, 5018 Invalid, 6713 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 6612 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2024-11-07 00:30:49,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118510 states. [2024-11-07 00:30:50,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118510 to 36849. [2024-11-07 00:30:50,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36849 states, 36848 states have (on average 1.2936115935735997) internal successors, (47667), 36848 states have internal predecessors, (47667), 0 states have call successors, (0), 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 00:30:50,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36849 states to 36849 states and 47667 transitions. [2024-11-07 00:30:50,563 INFO L78 Accepts]: Start accepts. Automaton has 36849 states and 47667 transitions. Word has length 103 [2024-11-07 00:30:50,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:30:50,564 INFO L471 AbstractCegarLoop]: Abstraction has 36849 states and 47667 transitions. [2024-11-07 00:30:50,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 7.621621621621622) internal successors, (282), 37 states have internal predecessors, (282), 0 states have call successors, (0), 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 00:30:50,564 INFO L276 IsEmpty]: Start isEmpty. Operand 36849 states and 47667 transitions. [2024-11-07 00:30:50,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-07 00:30:50,567 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:30:50,567 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:30:50,585 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-07 00:30:50,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 00:30:50,772 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-11-07 00:30:50,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:30:50,772 INFO L85 PathProgramCache]: Analyzing trace with hash 612875691, now seen corresponding path program 1 times [2024-11-07 00:30:50,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:30:50,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75748338] [2024-11-07 00:30:50,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:30:50,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:30:50,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:30:51,045 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:30:51,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:30:51,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75748338] [2024-11-07 00:30:51,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [75748338] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 00:30:51,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [107463947] [2024-11-07 00:30:51,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:30:51,046 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 00:30:51,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 00:30:51,048 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 00:30:51,050 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-07 00:30:51,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:30:51,215 INFO L255 TraceCheckSpWp]: Trace formula consists of 466 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-07 00:30:51,219 INFO L278 TraceCheckSpWp]: Computing forward predicates...