./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.08.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4f9af400 extending candidate: java ['java'] extending candidate: /usr/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/oracle-jdk-bin-*/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/openjdk-*/bin/java ['java', '/usr/bin/java'] extending candidate: /usr/lib/jvm/java-*-openjdk-amd64/bin/java ['java', '/usr/bin/java', '/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java', '/usr/lib/jvm/java-17-openjdk-amd64/bin/java', '/usr/lib/jvm/java-11-openjdk-amd64/bin/java', '/usr/lib/jvm/java-1.17.0-openjdk-amd64/bin/java'] ['/root/.sdkman/candidates/java/21.0.5-tem/bin/java', '-Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config', '-Xmx15G', '-Xms4m', '-jar', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar', '-data', '@noDefault', '-ultimatedata', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data', '-tc', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml', '-i', '../sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.08.cil-2.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', 'dfe43dac9acec5d21450031b4b25696c02a17019cbc94a74a969e06371e0741b'] Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.08.cil-2.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 dfe43dac9acec5d21450031b4b25696c02a17019cbc94a74a969e06371e0741b --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 01:45:28,267 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 01:45:28,359 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-07 01:45:28,364 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 01:45:28,364 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 01:45:28,395 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 01:45:28,396 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 01:45:28,396 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 01:45:28,397 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 01:45:28,398 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 01:45:28,399 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 01:45:28,399 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 01:45:28,399 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 01:45:28,399 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 01:45:28,399 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 01:45:28,399 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 01:45:28,399 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 01:45:28,399 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 01:45:28,399 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 01:45:28,399 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 01:45:28,399 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 01:45:28,400 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 01:45:28,400 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 01:45:28,400 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 01:45:28,400 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 01:45:28,400 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 01:45:28,400 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 01:45:28,400 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 01:45:28,400 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 01:45:28,400 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 01:45:28,400 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 01:45:28,400 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 01:45:28,400 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 01:45:28,400 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 01:45:28,400 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 01:45:28,400 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 01:45:28,401 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 01:45:28,401 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 01:45:28,401 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 01:45:28,401 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 01:45:28,401 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 01:45:28,401 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 01:45:28,401 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 -> dfe43dac9acec5d21450031b4b25696c02a17019cbc94a74a969e06371e0741b [2024-11-07 01:45:28,694 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 01:45:28,704 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 01:45:28,707 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 01:45:28,709 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 01:45:28,709 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 01:45:28,711 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.08.cil-2.c [2024-11-07 01:45:29,998 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 01:45:30,237 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 01:45:30,238 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.08.cil-2.c [2024-11-07 01:45:30,254 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/50f25badc/31a20372e1c04cbcb274c1bfac5b75ec/FLAG1309a3be4 [2024-11-07 01:45:30,274 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/50f25badc/31a20372e1c04cbcb274c1bfac5b75ec [2024-11-07 01:45:30,276 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 01:45:30,278 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 01:45:30,281 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 01:45:30,281 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 01:45:30,285 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 01:45:30,285 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:45:30" (1/1) ... [2024-11-07 01:45:30,286 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3459617d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:45:30, skipping insertion in model container [2024-11-07 01:45:30,288 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:45:30" (1/1) ... [2024-11-07 01:45:30,330 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 01:45:30,462 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.08.cil-2.c[914,927] [2024-11-07 01:45:30,518 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.08.cil-2.c[7115,7128] [2024-11-07 01:45:30,606 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 01:45:30,621 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 01:45:30,631 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.08.cil-2.c[914,927] [2024-11-07 01:45:30,651 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.08.cil-2.c[7115,7128] [2024-11-07 01:45:30,691 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 01:45:30,717 INFO L204 MainTranslator]: Completed translation [2024-11-07 01:45:30,718 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:45:30 WrapperNode [2024-11-07 01:45:30,718 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 01:45:30,719 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 01:45:30,719 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 01:45:30,720 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 01:45:30,725 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:45:30" (1/1) ... [2024-11-07 01:45:30,737 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:45:30" (1/1) ... [2024-11-07 01:45:30,785 INFO L138 Inliner]: procedures = 69, calls = 82, calls flagged for inlining = 37, calls inlined = 37, statements flattened = 834 [2024-11-07 01:45:30,786 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 01:45:30,787 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 01:45:30,787 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 01:45:30,787 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 01:45:30,795 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:45:30" (1/1) ... [2024-11-07 01:45:30,795 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:45:30" (1/1) ... [2024-11-07 01:45:30,799 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:45:30" (1/1) ... [2024-11-07 01:45:30,816 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-07 01:45:30,816 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:45:30" (1/1) ... [2024-11-07 01:45:30,816 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:45:30" (1/1) ... [2024-11-07 01:45:30,826 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:45:30" (1/1) ... [2024-11-07 01:45:30,845 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:45:30" (1/1) ... [2024-11-07 01:45:30,849 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:45:30" (1/1) ... [2024-11-07 01:45:30,856 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:45:30" (1/1) ... [2024-11-07 01:45:30,862 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 01:45:30,864 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 01:45:30,864 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 01:45:30,864 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 01:45:30,865 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:45:30" (1/1) ... [2024-11-07 01:45:30,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 01:45:30,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 01:45:30,895 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-07 01:45:30,899 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-07 01:45:30,921 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 01:45:30,922 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-11-07 01:45:30,922 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-11-07 01:45:30,922 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2024-11-07 01:45:30,922 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2024-11-07 01:45:30,922 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2024-11-07 01:45:30,922 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2024-11-07 01:45:30,922 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2024-11-07 01:45:30,923 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2024-11-07 01:45:30,923 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2024-11-07 01:45:30,923 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2024-11-07 01:45:30,923 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2024-11-07 01:45:30,923 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2024-11-07 01:45:30,923 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2024-11-07 01:45:30,923 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2024-11-07 01:45:30,923 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2024-11-07 01:45:30,923 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2024-11-07 01:45:30,924 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2024-11-07 01:45:30,924 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2024-11-07 01:45:30,924 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2024-11-07 01:45:30,924 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2024-11-07 01:45:30,925 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2024-11-07 01:45:30,925 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2024-11-07 01:45:30,925 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 01:45:30,925 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2024-11-07 01:45:30,925 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2024-11-07 01:45:30,925 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2024-11-07 01:45:30,926 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2024-11-07 01:45:30,926 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 01:45:30,926 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 01:45:30,926 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2024-11-07 01:45:30,926 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2024-11-07 01:45:30,926 INFO L130 BoogieDeclarations]: Found specification of procedure error2 [2024-11-07 01:45:30,926 INFO L138 BoogieDeclarations]: Found implementation of procedure error2 [2024-11-07 01:45:31,071 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 01:45:31,073 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 01:45:31,984 INFO L? ?]: Removed 107 outVars from TransFormulas that were not future-live. [2024-11-07 01:45:31,985 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 01:45:32,007 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 01:45:32,007 INFO L316 CfgBuilder]: Removed 15 assume(true) statements. [2024-11-07 01:45:32,007 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:45:32 BoogieIcfgContainer [2024-11-07 01:45:32,007 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 01:45:32,014 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 01:45:32,014 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 01:45:32,019 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 01:45:32,019 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 01:45:30" (1/3) ... [2024-11-07 01:45:32,019 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5bc6c53e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:45:32, skipping insertion in model container [2024-11-07 01:45:32,019 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:45:30" (2/3) ... [2024-11-07 01:45:32,020 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5bc6c53e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:45:32, skipping insertion in model container [2024-11-07 01:45:32,020 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:45:32" (3/3) ... [2024-11-07 01:45:32,022 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-1+token_ring.08.cil-2.c [2024-11-07 01:45:32,034 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 01:45:32,035 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-07 01:45:32,116 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 01:45:32,129 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;@1319f4d8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 01:45:32,130 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-07 01:45:32,137 INFO L276 IsEmpty]: Start isEmpty. Operand has 400 states, 344 states have (on average 1.6104651162790697) internal successors, (554), 352 states have internal predecessors, (554), 38 states have call successors, (38), 15 states have call predecessors, (38), 15 states have return successors, (38), 36 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-07 01:45:32,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-07 01:45:32,147 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:45:32,148 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] [2024-11-07 01:45:32,149 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:45:32,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:45:32,154 INFO L85 PathProgramCache]: Analyzing trace with hash 1419049077, now seen corresponding path program 1 times [2024-11-07 01:45:32,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:45:32,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056534420] [2024-11-07 01:45:32,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:45:32,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:45:32,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:32,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:45:32,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:32,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-07 01:45:32,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:32,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 01:45:32,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:32,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 01:45:32,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:32,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 01:45:32,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:32,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 01:45:32,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:32,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 01:45:32,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:32,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:45:32,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:45:32,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056534420] [2024-11-07 01:45:32,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1056534420] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:45:32,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:45:32,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 01:45:32,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755315462] [2024-11-07 01:45:32,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:45:32,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 01:45:32,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:45:32,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 01:45:32,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-07 01:45:32,788 INFO L87 Difference]: Start difference. First operand has 400 states, 344 states have (on average 1.6104651162790697) internal successors, (554), 352 states have internal predecessors, (554), 38 states have call successors, (38), 15 states have call predecessors, (38), 15 states have return successors, (38), 36 states have call predecessors, (38), 38 states have call successors, (38) Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-07 01:45:34,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:45:34,213 INFO L93 Difference]: Finished difference Result 910 states and 1426 transitions. [2024-11-07 01:45:34,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 01:45:34,216 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2024-11-07 01:45:34,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:45:34,234 INFO L225 Difference]: With dead ends: 910 [2024-11-07 01:45:34,234 INFO L226 Difference]: Without dead ends: 524 [2024-11-07 01:45:34,243 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2024-11-07 01:45:34,247 INFO L432 NwaCegarLoop]: 350 mSDtfsCounter, 708 mSDsluCounter, 1695 mSDsCounter, 0 mSdLazyCounter, 1190 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 713 SdHoareTripleChecker+Valid, 2045 SdHoareTripleChecker+Invalid, 1310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 1190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-07 01:45:34,248 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [713 Valid, 2045 Invalid, 1310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 1190 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-07 01:45:34,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2024-11-07 01:45:34,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 485. [2024-11-07 01:45:34,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 485 states, 412 states have (on average 1.4975728155339805) internal successors, (617), 419 states have internal predecessors, (617), 49 states have call successors, (49), 22 states have call predecessors, (49), 22 states have return successors, (50), 46 states have call predecessors, (50), 45 states have call successors, (50) [2024-11-07 01:45:34,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 485 states and 716 transitions. [2024-11-07 01:45:34,357 INFO L78 Accepts]: Start accepts. Automaton has 485 states and 716 transitions. Word has length 65 [2024-11-07 01:45:34,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:45:34,358 INFO L471 AbstractCegarLoop]: Abstraction has 485 states and 716 transitions. [2024-11-07 01:45:34,358 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-07 01:45:34,358 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 716 transitions. [2024-11-07 01:45:34,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-07 01:45:34,363 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:45:34,363 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] [2024-11-07 01:45:34,363 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 01:45:34,363 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:45:34,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:45:34,365 INFO L85 PathProgramCache]: Analyzing trace with hash -1197029579, now seen corresponding path program 1 times [2024-11-07 01:45:34,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:45:34,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49875348] [2024-11-07 01:45:34,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:45:34,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:45:34,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:34,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:45:34,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:34,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-07 01:45:34,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:34,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 01:45:34,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:34,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 01:45:34,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:34,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 01:45:34,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:34,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 01:45:34,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:34,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 01:45:34,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:34,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:45:34,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:45:34,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49875348] [2024-11-07 01:45:34,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49875348] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:45:34,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:45:34,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 01:45:34,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550283818] [2024-11-07 01:45:34,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:45:34,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 01:45:34,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:45:34,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 01:45:34,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-07 01:45:34,633 INFO L87 Difference]: Start difference. First operand 485 states and 716 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-07 01:45:35,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:45:35,910 INFO L93 Difference]: Finished difference Result 832 states and 1193 transitions. [2024-11-07 01:45:35,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-07 01:45:35,911 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2024-11-07 01:45:35,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:45:35,916 INFO L225 Difference]: With dead ends: 832 [2024-11-07 01:45:35,916 INFO L226 Difference]: Without dead ends: 655 [2024-11-07 01:45:35,917 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2024-11-07 01:45:35,918 INFO L432 NwaCegarLoop]: 377 mSDtfsCounter, 1391 mSDsluCounter, 1310 mSDsCounter, 0 mSdLazyCounter, 1331 mSolverCounterSat, 164 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1419 SdHoareTripleChecker+Valid, 1687 SdHoareTripleChecker+Invalid, 1495 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 164 IncrementalHoareTripleChecker+Valid, 1331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-07 01:45:35,918 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1419 Valid, 1687 Invalid, 1495 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [164 Valid, 1331 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-07 01:45:35,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2024-11-07 01:45:35,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 581. [2024-11-07 01:45:35,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 581 states, 488 states have (on average 1.4774590163934427) internal successors, (721), 497 states have internal predecessors, (721), 60 states have call successors, (60), 29 states have call predecessors, (60), 31 states have return successors, (69), 58 states have call predecessors, (69), 56 states have call successors, (69) [2024-11-07 01:45:35,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 581 states to 581 states and 850 transitions. [2024-11-07 01:45:35,991 INFO L78 Accepts]: Start accepts. Automaton has 581 states and 850 transitions. Word has length 65 [2024-11-07 01:45:35,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:45:35,991 INFO L471 AbstractCegarLoop]: Abstraction has 581 states and 850 transitions. [2024-11-07 01:45:35,992 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-07 01:45:35,992 INFO L276 IsEmpty]: Start isEmpty. Operand 581 states and 850 transitions. [2024-11-07 01:45:35,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-07 01:45:35,998 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:45:35,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:45:35,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 01:45:35,998 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:45:35,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:45:35,999 INFO L85 PathProgramCache]: Analyzing trace with hash 1069351607, now seen corresponding path program 1 times [2024-11-07 01:45:35,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:45:35,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193203685] [2024-11-07 01:45:35,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:45:35,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:45:36,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:36,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:45:36,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:36,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-07 01:45:36,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:36,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 01:45:36,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:36,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 01:45:36,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:36,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 01:45:36,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:36,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 01:45:36,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:36,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 01:45:36,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:36,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:45:36,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:45:36,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193203685] [2024-11-07 01:45:36,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193203685] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:45:36,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:45:36,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-07 01:45:36,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345841116] [2024-11-07 01:45:36,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:45:36,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 01:45:36,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:45:36,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 01:45:36,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-07 01:45:36,189 INFO L87 Difference]: Start difference. First operand 581 states and 850 transitions. Second operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-07 01:45:37,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:45:37,301 INFO L93 Difference]: Finished difference Result 880 states and 1261 transitions. [2024-11-07 01:45:37,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 01:45:37,302 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 65 [2024-11-07 01:45:37,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:45:37,307 INFO L225 Difference]: With dead ends: 880 [2024-11-07 01:45:37,307 INFO L226 Difference]: Without dead ends: 613 [2024-11-07 01:45:37,308 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2024-11-07 01:45:37,309 INFO L432 NwaCegarLoop]: 343 mSDtfsCounter, 490 mSDsluCounter, 2025 mSDsCounter, 0 mSdLazyCounter, 1576 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 491 SdHoareTripleChecker+Valid, 2368 SdHoareTripleChecker+Invalid, 1659 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 1576 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-07 01:45:37,309 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [491 Valid, 2368 Invalid, 1659 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 1576 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-07 01:45:37,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2024-11-07 01:45:37,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 586. [2024-11-07 01:45:37,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 586 states, 492 states have (on average 1.4695121951219512) internal successors, (723), 501 states have internal predecessors, (723), 60 states have call successors, (60), 29 states have call predecessors, (60), 32 states have return successors, (70), 59 states have call predecessors, (70), 56 states have call successors, (70) [2024-11-07 01:45:37,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 586 states to 586 states and 853 transitions. [2024-11-07 01:45:37,352 INFO L78 Accepts]: Start accepts. Automaton has 586 states and 853 transitions. Word has length 65 [2024-11-07 01:45:37,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:45:37,353 INFO L471 AbstractCegarLoop]: Abstraction has 586 states and 853 transitions. [2024-11-07 01:45:37,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-07 01:45:37,353 INFO L276 IsEmpty]: Start isEmpty. Operand 586 states and 853 transitions. [2024-11-07 01:45:37,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-07 01:45:37,369 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:45:37,369 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] [2024-11-07 01:45:37,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 01:45:37,370 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:45:37,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:45:37,370 INFO L85 PathProgramCache]: Analyzing trace with hash 39992309, now seen corresponding path program 1 times [2024-11-07 01:45:37,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:45:37,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138734770] [2024-11-07 01:45:37,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:45:37,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:45:37,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:37,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:45:37,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:37,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-07 01:45:37,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:37,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 01:45:37,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:37,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 01:45:37,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:37,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 01:45:37,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:37,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 01:45:37,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:37,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 01:45:37,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:37,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:45:37,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:45:37,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138734770] [2024-11-07 01:45:37,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138734770] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:45:37,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:45:37,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-07 01:45:37,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046275440] [2024-11-07 01:45:37,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:45:37,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 01:45:37,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:45:37,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 01:45:37,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-07 01:45:37,627 INFO L87 Difference]: Start difference. First operand 586 states and 853 transitions. Second operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 6 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2024-11-07 01:45:39,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:45:39,526 INFO L93 Difference]: Finished difference Result 2248 states and 3125 transitions. [2024-11-07 01:45:39,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-11-07 01:45:39,526 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 6 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 65 [2024-11-07 01:45:39,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:45:39,537 INFO L225 Difference]: With dead ends: 2248 [2024-11-07 01:45:39,537 INFO L226 Difference]: Without dead ends: 1976 [2024-11-07 01:45:39,539 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 296 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=235, Invalid=887, Unknown=0, NotChecked=0, Total=1122 [2024-11-07 01:45:39,540 INFO L432 NwaCegarLoop]: 467 mSDtfsCounter, 2239 mSDsluCounter, 1734 mSDsCounter, 0 mSdLazyCounter, 1731 mSolverCounterSat, 405 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2253 SdHoareTripleChecker+Valid, 2201 SdHoareTripleChecker+Invalid, 2136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 405 IncrementalHoareTripleChecker+Valid, 1731 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-07 01:45:39,540 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2253 Valid, 2201 Invalid, 2136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [405 Valid, 1731 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-07 01:45:39,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1976 states. [2024-11-07 01:45:39,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1976 to 1726. [2024-11-07 01:45:39,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1726 states, 1392 states have (on average 1.367816091954023) internal successors, (1904), 1421 states have internal predecessors, (1904), 177 states have call successors, (177), 131 states have call predecessors, (177), 155 states have return successors, (256), 177 states have call predecessors, (256), 173 states have call successors, (256) [2024-11-07 01:45:39,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1726 states to 1726 states and 2337 transitions. [2024-11-07 01:45:39,670 INFO L78 Accepts]: Start accepts. Automaton has 1726 states and 2337 transitions. Word has length 65 [2024-11-07 01:45:39,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:45:39,670 INFO L471 AbstractCegarLoop]: Abstraction has 1726 states and 2337 transitions. [2024-11-07 01:45:39,671 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 6 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2024-11-07 01:45:39,671 INFO L276 IsEmpty]: Start isEmpty. Operand 1726 states and 2337 transitions. [2024-11-07 01:45:39,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-07 01:45:39,672 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:45:39,672 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] [2024-11-07 01:45:39,673 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 01:45:39,673 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:45:39,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:45:39,673 INFO L85 PathProgramCache]: Analyzing trace with hash 1091441398, now seen corresponding path program 1 times [2024-11-07 01:45:39,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:45:39,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700871381] [2024-11-07 01:45:39,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:45:39,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:45:39,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:39,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:45:39,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:39,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-07 01:45:39,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:39,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 01:45:39,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:39,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 01:45:39,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:39,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 01:45:39,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:39,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 01:45:39,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:39,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 01:45:39,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:39,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:45:39,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:45:39,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700871381] [2024-11-07 01:45:39,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [700871381] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:45:39,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:45:39,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-07 01:45:39,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127848043] [2024-11-07 01:45:39,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:45:39,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 01:45:39,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:45:39,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 01:45:39,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-07 01:45:39,866 INFO L87 Difference]: Start difference. First operand 1726 states and 2337 transitions. Second operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-07 01:45:40,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:45:40,994 INFO L93 Difference]: Finished difference Result 3323 states and 4456 transitions. [2024-11-07 01:45:40,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-07 01:45:40,995 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 65 [2024-11-07 01:45:40,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:45:41,005 INFO L225 Difference]: With dead ends: 3323 [2024-11-07 01:45:41,005 INFO L226 Difference]: Without dead ends: 1911 [2024-11-07 01:45:41,009 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2024-11-07 01:45:41,010 INFO L432 NwaCegarLoop]: 342 mSDtfsCounter, 491 mSDsluCounter, 2025 mSDsCounter, 0 mSdLazyCounter, 1567 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 492 SdHoareTripleChecker+Valid, 2367 SdHoareTripleChecker+Invalid, 1650 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 1567 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-07 01:45:41,010 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [492 Valid, 2367 Invalid, 1650 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 1567 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-07 01:45:41,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1911 states. [2024-11-07 01:45:41,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1911 to 1771. [2024-11-07 01:45:41,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1771 states, 1428 states have (on average 1.3522408963585435) internal successors, (1931), 1457 states have internal predecessors, (1931), 177 states have call successors, (177), 131 states have call predecessors, (177), 164 states have return successors, (268), 186 states have call predecessors, (268), 173 states have call successors, (268) [2024-11-07 01:45:41,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1771 states to 1771 states and 2376 transitions. [2024-11-07 01:45:41,154 INFO L78 Accepts]: Start accepts. Automaton has 1771 states and 2376 transitions. Word has length 65 [2024-11-07 01:45:41,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:45:41,154 INFO L471 AbstractCegarLoop]: Abstraction has 1771 states and 2376 transitions. [2024-11-07 01:45:41,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-07 01:45:41,155 INFO L276 IsEmpty]: Start isEmpty. Operand 1771 states and 2376 transitions. [2024-11-07 01:45:41,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-07 01:45:41,156 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:45:41,157 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] [2024-11-07 01:45:41,157 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 01:45:41,158 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:45:41,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:45:41,158 INFO L85 PathProgramCache]: Analyzing trace with hash -1817322504, now seen corresponding path program 1 times [2024-11-07 01:45:41,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:45:41,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805818044] [2024-11-07 01:45:41,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:45:41,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:45:41,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:41,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:45:41,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:41,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-07 01:45:41,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:41,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 01:45:41,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:41,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 01:45:41,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:41,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 01:45:41,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:41,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 01:45:41,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:41,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 01:45:41,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:41,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:45:41,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:45:41,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805818044] [2024-11-07 01:45:41,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1805818044] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:45:41,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:45:41,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 01:45:41,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667923997] [2024-11-07 01:45:41,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:45:41,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 01:45:41,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:45:41,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 01:45:41,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-07 01:45:41,354 INFO L87 Difference]: Start difference. First operand 1771 states and 2376 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-07 01:45:42,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:45:42,510 INFO L93 Difference]: Finished difference Result 3206 states and 4215 transitions. [2024-11-07 01:45:42,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-07 01:45:42,510 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2024-11-07 01:45:42,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:45:42,522 INFO L225 Difference]: With dead ends: 3206 [2024-11-07 01:45:42,522 INFO L226 Difference]: Without dead ends: 1969 [2024-11-07 01:45:42,526 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2024-11-07 01:45:42,526 INFO L432 NwaCegarLoop]: 316 mSDtfsCounter, 1145 mSDsluCounter, 1407 mSDsCounter, 0 mSdLazyCounter, 1290 mSolverCounterSat, 136 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1170 SdHoareTripleChecker+Valid, 1723 SdHoareTripleChecker+Invalid, 1426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 136 IncrementalHoareTripleChecker+Valid, 1290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-07 01:45:42,527 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1170 Valid, 1723 Invalid, 1426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [136 Valid, 1290 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-07 01:45:42,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1969 states. [2024-11-07 01:45:42,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1969 to 1749. [2024-11-07 01:45:42,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1749 states, 1414 states have (on average 1.3486562942008486) internal successors, (1907), 1437 states have internal predecessors, (1907), 177 states have call successors, (177), 131 states have call predecessors, (177), 156 states have return successors, (252), 184 states have call predecessors, (252), 173 states have call successors, (252) [2024-11-07 01:45:42,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1749 states to 1749 states and 2336 transitions. [2024-11-07 01:45:42,680 INFO L78 Accepts]: Start accepts. Automaton has 1749 states and 2336 transitions. Word has length 65 [2024-11-07 01:45:42,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:45:42,681 INFO L471 AbstractCegarLoop]: Abstraction has 1749 states and 2336 transitions. [2024-11-07 01:45:42,681 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-07 01:45:42,681 INFO L276 IsEmpty]: Start isEmpty. Operand 1749 states and 2336 transitions. [2024-11-07 01:45:42,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-07 01:45:42,682 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:45:42,683 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] [2024-11-07 01:45:42,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 01:45:42,683 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:45:42,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:45:42,684 INFO L85 PathProgramCache]: Analyzing trace with hash -1951336010, now seen corresponding path program 1 times [2024-11-07 01:45:42,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:45:42,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938914653] [2024-11-07 01:45:42,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:45:42,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:45:42,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:42,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:45:42,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:42,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-07 01:45:42,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:42,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 01:45:42,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:42,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 01:45:42,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:42,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 01:45:42,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:42,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 01:45:42,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:42,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 01:45:42,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:42,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 01:45:42,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:45:42,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938914653] [2024-11-07 01:45:42,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [938914653] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:45:42,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:45:42,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:45:42,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808962534] [2024-11-07 01:45:42,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:45:42,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:45:42,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:45:42,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:45:42,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:45:42,808 INFO L87 Difference]: Start difference. First operand 1749 states and 2336 transitions. Second operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-07 01:45:43,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:45:43,571 INFO L93 Difference]: Finished difference Result 4824 states and 6315 transitions. [2024-11-07 01:45:43,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-07 01:45:43,572 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2024-11-07 01:45:43,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:45:43,589 INFO L225 Difference]: With dead ends: 4824 [2024-11-07 01:45:43,589 INFO L226 Difference]: Without dead ends: 3392 [2024-11-07 01:45:43,594 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2024-11-07 01:45:43,595 INFO L432 NwaCegarLoop]: 312 mSDtfsCounter, 1387 mSDsluCounter, 857 mSDsCounter, 0 mSdLazyCounter, 515 mSolverCounterSat, 183 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1418 SdHoareTripleChecker+Valid, 1169 SdHoareTripleChecker+Invalid, 698 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 183 IncrementalHoareTripleChecker+Valid, 515 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-07 01:45:43,595 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1418 Valid, 1169 Invalid, 698 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [183 Valid, 515 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-07 01:45:43,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3392 states. [2024-11-07 01:45:43,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3392 to 3120. [2024-11-07 01:45:43,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3120 states, 2480 states have (on average 1.3) internal successors, (3224), 2524 states have internal predecessors, (3224), 329 states have call successors, (329), 254 states have call predecessors, (329), 309 states have return successors, (524), 348 states have call predecessors, (524), 325 states have call successors, (524) [2024-11-07 01:45:43,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3120 states to 3120 states and 4077 transitions. [2024-11-07 01:45:43,836 INFO L78 Accepts]: Start accepts. Automaton has 3120 states and 4077 transitions. Word has length 65 [2024-11-07 01:45:43,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:45:43,836 INFO L471 AbstractCegarLoop]: Abstraction has 3120 states and 4077 transitions. [2024-11-07 01:45:43,836 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-07 01:45:43,837 INFO L276 IsEmpty]: Start isEmpty. Operand 3120 states and 4077 transitions. [2024-11-07 01:45:43,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-07 01:45:43,838 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:45:43,838 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] [2024-11-07 01:45:43,838 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 01:45:43,839 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:45:43,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:45:43,839 INFO L85 PathProgramCache]: Analyzing trace with hash 320915036, now seen corresponding path program 1 times [2024-11-07 01:45:43,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:45:43,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391515243] [2024-11-07 01:45:43,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:45:43,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:45:43,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:43,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:45:43,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:43,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-07 01:45:43,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:43,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 01:45:43,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:43,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 01:45:43,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:43,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 01:45:43,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:43,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 01:45:43,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:43,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 01:45:43,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:43,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:45:43,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:45:43,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391515243] [2024-11-07 01:45:43,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391515243] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:45:43,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:45:43,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 01:45:43,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344173634] [2024-11-07 01:45:43,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:45:43,920 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 01:45:43,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:45:43,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 01:45:43,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-07 01:45:43,921 INFO L87 Difference]: Start difference. First operand 3120 states and 4077 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-07 01:45:44,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:45:44,840 INFO L93 Difference]: Finished difference Result 8138 states and 10591 transitions. [2024-11-07 01:45:44,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 01:45:44,840 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 66 [2024-11-07 01:45:44,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:45:44,867 INFO L225 Difference]: With dead ends: 8138 [2024-11-07 01:45:44,867 INFO L226 Difference]: Without dead ends: 5314 [2024-11-07 01:45:44,875 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2024-11-07 01:45:44,876 INFO L432 NwaCegarLoop]: 349 mSDtfsCounter, 672 mSDsluCounter, 1102 mSDsCounter, 0 mSdLazyCounter, 710 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 680 SdHoareTripleChecker+Valid, 1451 SdHoareTripleChecker+Invalid, 824 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 710 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-07 01:45:44,876 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [680 Valid, 1451 Invalid, 824 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 710 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-07 01:45:44,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5314 states. [2024-11-07 01:45:45,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5314 to 4798. [2024-11-07 01:45:45,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4798 states, 3765 states have (on average 1.2812749003984063) internal successors, (4824), 3816 states have internal predecessors, (4824), 523 states have call successors, (523), 428 states have call predecessors, (523), 508 states have return successors, (845), 560 states have call predecessors, (845), 519 states have call successors, (845) [2024-11-07 01:45:45,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4798 states to 4798 states and 6192 transitions. [2024-11-07 01:45:45,253 INFO L78 Accepts]: Start accepts. Automaton has 4798 states and 6192 transitions. Word has length 66 [2024-11-07 01:45:45,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:45:45,253 INFO L471 AbstractCegarLoop]: Abstraction has 4798 states and 6192 transitions. [2024-11-07 01:45:45,253 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-07 01:45:45,253 INFO L276 IsEmpty]: Start isEmpty. Operand 4798 states and 6192 transitions. [2024-11-07 01:45:45,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-07 01:45:45,258 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:45:45,258 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:45:45,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-07 01:45:45,260 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:45:45,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:45:45,261 INFO L85 PathProgramCache]: Analyzing trace with hash 380773076, now seen corresponding path program 1 times [2024-11-07 01:45:45,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:45:45,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628595308] [2024-11-07 01:45:45,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:45:45,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:45:45,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:45,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:45:45,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:45,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-07 01:45:45,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:45,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 01:45:45,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:45,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 01:45:45,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:45,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 01:45:45,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:45,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 01:45:45,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:45,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 01:45:45,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:45,391 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:45:45,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:45:45,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628595308] [2024-11-07 01:45:45,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [628595308] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:45:45,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:45:45,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:45:45,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334484416] [2024-11-07 01:45:45,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:45:45,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:45:45,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:45:45,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:45:45,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:45:45,393 INFO L87 Difference]: Start difference. First operand 4798 states and 6192 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-07 01:45:46,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:45:46,534 INFO L93 Difference]: Finished difference Result 6428 states and 8194 transitions. [2024-11-07 01:45:46,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-07 01:45:46,535 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 73 [2024-11-07 01:45:46,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:45:46,564 INFO L225 Difference]: With dead ends: 6428 [2024-11-07 01:45:46,565 INFO L226 Difference]: Without dead ends: 6425 [2024-11-07 01:45:46,567 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2024-11-07 01:45:46,568 INFO L432 NwaCegarLoop]: 346 mSDtfsCounter, 1944 mSDsluCounter, 581 mSDsCounter, 0 mSdLazyCounter, 449 mSolverCounterSat, 311 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1953 SdHoareTripleChecker+Valid, 927 SdHoareTripleChecker+Invalid, 760 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 311 IncrementalHoareTripleChecker+Valid, 449 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-07 01:45:46,568 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1953 Valid, 927 Invalid, 760 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [311 Valid, 449 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-07 01:45:46,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6425 states. [2024-11-07 01:45:47,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6425 to 5852. [2024-11-07 01:45:47,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5852 states, 4568 states have (on average 1.2683887915936953) internal successors, (5794), 4628 states have internal predecessors, (5794), 649 states have call successors, (649), 542 states have call predecessors, (649), 633 states have return successors, (1038), 688 states have call predecessors, (1038), 646 states have call successors, (1038) [2024-11-07 01:45:47,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5852 states to 5852 states and 7481 transitions. [2024-11-07 01:45:47,087 INFO L78 Accepts]: Start accepts. Automaton has 5852 states and 7481 transitions. Word has length 73 [2024-11-07 01:45:47,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:45:47,088 INFO L471 AbstractCegarLoop]: Abstraction has 5852 states and 7481 transitions. [2024-11-07 01:45:47,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-07 01:45:47,089 INFO L276 IsEmpty]: Start isEmpty. Operand 5852 states and 7481 transitions. [2024-11-07 01:45:47,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-07 01:45:47,092 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:45:47,093 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:45:47,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-07 01:45:47,093 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:45:47,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:45:47,093 INFO L85 PathProgramCache]: Analyzing trace with hash -1082113211, now seen corresponding path program 1 times [2024-11-07 01:45:47,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:45:47,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037321445] [2024-11-07 01:45:47,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:45:47,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:45:47,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:47,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:45:47,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:47,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-07 01:45:47,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:47,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 01:45:47,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:47,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 01:45:47,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:47,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 01:45:47,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:47,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 01:45:47,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:47,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 01:45:47,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:47,253 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:45:47,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:45:47,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037321445] [2024-11-07 01:45:47,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1037321445] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 01:45:47,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [695153224] [2024-11-07 01:45:47,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:45:47,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 01:45:47,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 01:45:47,257 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 01:45:47,258 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 01:45:47,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:47,375 INFO L255 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-07 01:45:47,384 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 01:45:47,623 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:45:47,623 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 01:45:47,721 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:45:47,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [695153224] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 01:45:47,722 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 01:45:47,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 4] total 10 [2024-11-07 01:45:47,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105310663] [2024-11-07 01:45:47,722 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 01:45:47,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-07 01:45:47,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:45:47,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-07 01:45:47,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-07 01:45:47,724 INFO L87 Difference]: Start difference. First operand 5852 states and 7481 transitions. Second operand has 10 states, 10 states have (on average 12.0) internal successors, (120), 7 states have internal predecessors, (120), 4 states have call successors, (20), 6 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2024-11-07 01:45:50,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:45:50,044 INFO L93 Difference]: Finished difference Result 13498 states and 17009 transitions. [2024-11-07 01:45:50,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-11-07 01:45:50,045 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 12.0) internal successors, (120), 7 states have internal predecessors, (120), 4 states have call successors, (20), 6 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) Word has length 74 [2024-11-07 01:45:50,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:45:50,107 INFO L225 Difference]: With dead ends: 13498 [2024-11-07 01:45:50,107 INFO L226 Difference]: Without dead ends: 13495 [2024-11-07 01:45:50,112 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=170, Invalid=642, Unknown=0, NotChecked=0, Total=812 [2024-11-07 01:45:50,113 INFO L432 NwaCegarLoop]: 432 mSDtfsCounter, 1527 mSDsluCounter, 2059 mSDsCounter, 0 mSdLazyCounter, 2126 mSolverCounterSat, 150 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1592 SdHoareTripleChecker+Valid, 2491 SdHoareTripleChecker+Invalid, 2276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 150 IncrementalHoareTripleChecker+Valid, 2126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-07 01:45:50,113 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1592 Valid, 2491 Invalid, 2276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [150 Valid, 2126 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-07 01:45:50,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13495 states. [2024-11-07 01:45:50,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13495 to 11110. [2024-11-07 01:45:51,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11110 states, 8660 states have (on average 1.2590069284064664) internal successors, (10903), 8772 states have internal predecessors, (10903), 1215 states have call successors, (1215), 1032 states have call predecessors, (1215), 1233 states have return successors, (1977), 1312 states have call predecessors, (1977), 1212 states have call successors, (1977) [2024-11-07 01:45:51,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11110 states to 11110 states and 14095 transitions. [2024-11-07 01:45:51,046 INFO L78 Accepts]: Start accepts. Automaton has 11110 states and 14095 transitions. Word has length 74 [2024-11-07 01:45:51,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:45:51,046 INFO L471 AbstractCegarLoop]: Abstraction has 11110 states and 14095 transitions. [2024-11-07 01:45:51,047 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.0) internal successors, (120), 7 states have internal predecessors, (120), 4 states have call successors, (20), 6 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2024-11-07 01:45:51,047 INFO L276 IsEmpty]: Start isEmpty. Operand 11110 states and 14095 transitions. [2024-11-07 01:45:51,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-07 01:45:51,049 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:45:51,049 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:45:51,063 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-07 01:45:51,250 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,SelfDestructingSolverStorable9 [2024-11-07 01:45:51,250 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:45:51,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:45:51,251 INFO L85 PathProgramCache]: Analyzing trace with hash -576884332, now seen corresponding path program 2 times [2024-11-07 01:45:51,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:45:51,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278230661] [2024-11-07 01:45:51,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:45:51,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:45:51,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:51,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:45:51,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:51,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-07 01:45:51,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:51,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 01:45:51,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:51,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 01:45:51,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:51,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 01:45:51,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:51,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 01:45:51,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:51,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 01:45:51,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:51,328 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:45:51,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:45:51,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278230661] [2024-11-07 01:45:51,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [278230661] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:45:51,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:45:51,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 01:45:51,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077633502] [2024-11-07 01:45:51,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:45:51,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 01:45:51,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:45:51,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 01:45:51,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-07 01:45:51,330 INFO L87 Difference]: Start difference. First operand 11110 states and 14095 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 3 states have internal predecessors, (62), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-07 01:45:52,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:45:52,536 INFO L93 Difference]: Finished difference Result 17653 states and 22437 transitions. [2024-11-07 01:45:52,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 01:45:52,537 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 3 states have internal predecessors, (62), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 77 [2024-11-07 01:45:52,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:45:52,573 INFO L225 Difference]: With dead ends: 17653 [2024-11-07 01:45:52,574 INFO L226 Difference]: Without dead ends: 7715 [2024-11-07 01:45:52,608 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-11-07 01:45:52,609 INFO L432 NwaCegarLoop]: 374 mSDtfsCounter, 1018 mSDsluCounter, 916 mSDsCounter, 0 mSdLazyCounter, 578 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1049 SdHoareTripleChecker+Valid, 1290 SdHoareTripleChecker+Invalid, 672 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 578 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-07 01:45:52,609 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1049 Valid, 1290 Invalid, 672 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 578 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-07 01:45:52,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7715 states. [2024-11-07 01:45:53,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7715 to 7163. [2024-11-07 01:45:53,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7163 states, 5607 states have (on average 1.2382735865881933) internal successors, (6943), 5675 states have internal predecessors, (6943), 782 states have call successors, (782), 656 states have call predecessors, (782), 772 states have return successors, (1196), 838 states have call predecessors, (1196), 779 states have call successors, (1196) [2024-11-07 01:45:53,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7163 states to 7163 states and 8921 transitions. [2024-11-07 01:45:53,408 INFO L78 Accepts]: Start accepts. Automaton has 7163 states and 8921 transitions. Word has length 77 [2024-11-07 01:45:53,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:45:53,409 INFO L471 AbstractCegarLoop]: Abstraction has 7163 states and 8921 transitions. [2024-11-07 01:45:53,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 3 states have internal predecessors, (62), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-07 01:45:53,409 INFO L276 IsEmpty]: Start isEmpty. Operand 7163 states and 8921 transitions. [2024-11-07 01:45:53,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-07 01:45:53,412 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:45:53,413 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:45:53,413 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-07 01:45:53,413 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:45:53,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:45:53,413 INFO L85 PathProgramCache]: Analyzing trace with hash -2004737513, now seen corresponding path program 1 times [2024-11-07 01:45:53,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:45:53,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348598598] [2024-11-07 01:45:53,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:45:53,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:45:53,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:53,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:45:53,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:53,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-07 01:45:53,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:53,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 01:45:53,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:53,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 01:45:53,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:53,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 01:45:53,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:53,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 01:45:53,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:53,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 01:45:53,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:53,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-07 01:45:53,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:53,580 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-07 01:45:53,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:45:53,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348598598] [2024-11-07 01:45:53,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [348598598] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:45:53,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:45:53,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 01:45:53,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985060621] [2024-11-07 01:45:53,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:45:53,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 01:45:53,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:45:53,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 01:45:53,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-07 01:45:53,582 INFO L87 Difference]: Start difference. First operand 7163 states and 8921 transitions. Second operand has 8 states, 8 states have (on average 7.875) internal successors, (63), 5 states have internal predecessors, (63), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-11-07 01:45:55,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:45:55,690 INFO L93 Difference]: Finished difference Result 21037 states and 26138 transitions. [2024-11-07 01:45:55,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-07 01:45:55,691 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 5 states have internal predecessors, (63), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 84 [2024-11-07 01:45:55,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:45:55,760 INFO L225 Difference]: With dead ends: 21037 [2024-11-07 01:45:55,761 INFO L226 Difference]: Without dead ends: 14194 [2024-11-07 01:45:55,784 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=131, Invalid=331, Unknown=0, NotChecked=0, Total=462 [2024-11-07 01:45:55,785 INFO L432 NwaCegarLoop]: 361 mSDtfsCounter, 908 mSDsluCounter, 1788 mSDsCounter, 0 mSdLazyCounter, 1284 mSolverCounterSat, 177 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 924 SdHoareTripleChecker+Valid, 2149 SdHoareTripleChecker+Invalid, 1461 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 177 IncrementalHoareTripleChecker+Valid, 1284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-07 01:45:55,785 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [924 Valid, 2149 Invalid, 1461 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [177 Valid, 1284 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-07 01:45:55,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14194 states. [2024-11-07 01:45:56,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14194 to 13335. [2024-11-07 01:45:56,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13335 states, 10283 states have (on average 1.2087912087912087) internal successors, (12430), 10457 states have internal predecessors, (12430), 1498 states have call successors, (1498), 1260 states have call predecessors, (1498), 1552 states have return successors, (2599), 1630 states have call predecessors, (2599), 1495 states have call successors, (2599) [2024-11-07 01:45:56,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13335 states to 13335 states and 16527 transitions. [2024-11-07 01:45:56,822 INFO L78 Accepts]: Start accepts. Automaton has 13335 states and 16527 transitions. Word has length 84 [2024-11-07 01:45:56,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:45:56,823 INFO L471 AbstractCegarLoop]: Abstraction has 13335 states and 16527 transitions. [2024-11-07 01:45:56,823 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 5 states have internal predecessors, (63), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-11-07 01:45:56,823 INFO L276 IsEmpty]: Start isEmpty. Operand 13335 states and 16527 transitions. [2024-11-07 01:45:56,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-07 01:45:56,830 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:45:56,830 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:45:56,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-07 01:45:56,830 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:45:56,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:45:56,831 INFO L85 PathProgramCache]: Analyzing trace with hash -1738382766, now seen corresponding path program 1 times [2024-11-07 01:45:56,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:45:56,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814867155] [2024-11-07 01:45:56,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:45:56,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:45:56,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:56,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:45:56,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:56,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-07 01:45:56,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:56,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 01:45:56,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:56,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 01:45:56,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:56,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 01:45:56,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:56,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 01:45:56,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:56,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 01:45:56,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:56,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-07 01:45:56,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:56,979 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-07 01:45:56,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:45:56,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814867155] [2024-11-07 01:45:56,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814867155] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:45:56,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:45:56,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-07 01:45:56,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120493663] [2024-11-07 01:45:56,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:45:56,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 01:45:56,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:45:56,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 01:45:56,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-07 01:45:56,982 INFO L87 Difference]: Start difference. First operand 13335 states and 16527 transitions. Second operand has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 6 states have internal predecessors, (74), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-11-07 01:45:59,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:45:59,370 INFO L93 Difference]: Finished difference Result 24209 states and 29846 transitions. [2024-11-07 01:45:59,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-07 01:45:59,371 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 6 states have internal predecessors, (74), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 93 [2024-11-07 01:45:59,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:45:59,434 INFO L225 Difference]: With dead ends: 24209 [2024-11-07 01:45:59,435 INFO L226 Difference]: Without dead ends: 11810 [2024-11-07 01:45:59,474 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=162, Invalid=540, Unknown=0, NotChecked=0, Total=702 [2024-11-07 01:45:59,475 INFO L432 NwaCegarLoop]: 349 mSDtfsCounter, 2409 mSDsluCounter, 1232 mSDsCounter, 0 mSdLazyCounter, 1301 mSolverCounterSat, 457 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2451 SdHoareTripleChecker+Valid, 1581 SdHoareTripleChecker+Invalid, 1758 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 457 IncrementalHoareTripleChecker+Valid, 1301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-07 01:45:59,475 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2451 Valid, 1581 Invalid, 1758 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [457 Valid, 1301 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-07 01:45:59,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11810 states. [2024-11-07 01:46:00,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11810 to 10910. [2024-11-07 01:46:00,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10910 states, 8449 states have (on average 1.2002603858444787) internal successors, (10141), 8590 states have internal predecessors, (10141), 1199 states have call successors, (1199), 1009 states have call predecessors, (1199), 1260 states have return successors, (1931), 1320 states have call predecessors, (1931), 1196 states have call successors, (1931) [2024-11-07 01:46:00,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10910 states to 10910 states and 13271 transitions. [2024-11-07 01:46:00,365 INFO L78 Accepts]: Start accepts. Automaton has 10910 states and 13271 transitions. Word has length 93 [2024-11-07 01:46:00,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:46:00,366 INFO L471 AbstractCegarLoop]: Abstraction has 10910 states and 13271 transitions. [2024-11-07 01:46:00,366 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 6 states have internal predecessors, (74), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-11-07 01:46:00,366 INFO L276 IsEmpty]: Start isEmpty. Operand 10910 states and 13271 transitions. [2024-11-07 01:46:00,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-07 01:46:00,379 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:46:00,379 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:46:00,380 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-07 01:46:00,380 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:46:00,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:46:00,380 INFO L85 PathProgramCache]: Analyzing trace with hash 304907077, now seen corresponding path program 1 times [2024-11-07 01:46:00,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:46:00,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232293120] [2024-11-07 01:46:00,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:46:00,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:46:00,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:00,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:46:00,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:00,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-07 01:46:00,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:00,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 01:46:00,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:00,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 01:46:00,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:00,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 01:46:00,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:00,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 01:46:00,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:00,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 01:46:00,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:00,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-07 01:46:00,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:00,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-07 01:46:00,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:00,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-07 01:46:00,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:00,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 01:46:00,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:00,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 01:46:00,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:00,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 01:46:00,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:00,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 01:46:00,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:00,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-07 01:46:00,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:00,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-07 01:46:00,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:00,557 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 20 proven. 6 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2024-11-07 01:46:00,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:46:00,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232293120] [2024-11-07 01:46:00,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [232293120] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 01:46:00,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [572263874] [2024-11-07 01:46:00,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:46:00,558 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 01:46:00,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 01:46:00,561 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 01:46:00,562 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 01:46:00,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:00,702 INFO L255 TraceCheckSpWp]: Trace formula consists of 531 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-07 01:46:00,707 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 01:46:00,749 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-07 01:46:00,751 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 01:46:00,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [572263874] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:46:00,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 01:46:00,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 12 [2024-11-07 01:46:00,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897086092] [2024-11-07 01:46:00,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:46:00,753 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 01:46:00,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:46:00,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 01:46:00,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-11-07 01:46:00,754 INFO L87 Difference]: Start difference. First operand 10910 states and 13271 transitions. Second operand has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 5 states have internal predecessors, (106), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-07 01:46:01,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:46:01,274 INFO L93 Difference]: Finished difference Result 15770 states and 19088 transitions. [2024-11-07 01:46:01,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 01:46:01,275 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 5 states have internal predecessors, (106), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) Word has length 145 [2024-11-07 01:46:01,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:46:01,305 INFO L225 Difference]: With dead ends: 15770 [2024-11-07 01:46:01,305 INFO L226 Difference]: Without dead ends: 5188 [2024-11-07 01:46:01,326 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-11-07 01:46:01,327 INFO L432 NwaCegarLoop]: 579 mSDtfsCounter, 0 mSDsluCounter, 2307 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2886 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 01:46:01,327 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2886 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 01:46:01,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5188 states. [2024-11-07 01:46:01,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5188 to 5034. [2024-11-07 01:46:01,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5034 states, 4014 states have (on average 1.1975585450921773) internal successors, (4807), 4053 states have internal predecessors, (4807), 501 states have call successors, (501), 403 states have call predecessors, (501), 517 states have return successors, (771), 578 states have call predecessors, (771), 498 states have call successors, (771) [2024-11-07 01:46:01,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5034 states to 5034 states and 6079 transitions. [2024-11-07 01:46:01,739 INFO L78 Accepts]: Start accepts. Automaton has 5034 states and 6079 transitions. Word has length 145 [2024-11-07 01:46:01,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:46:01,739 INFO L471 AbstractCegarLoop]: Abstraction has 5034 states and 6079 transitions. [2024-11-07 01:46:01,739 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 5 states have internal predecessors, (106), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-07 01:46:01,739 INFO L276 IsEmpty]: Start isEmpty. Operand 5034 states and 6079 transitions. [2024-11-07 01:46:01,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-07 01:46:01,747 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:46:01,747 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:46:01,767 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-07 01:46:01,947 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 01:46:01,948 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:46:01,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:46:01,948 INFO L85 PathProgramCache]: Analyzing trace with hash 1147951573, now seen corresponding path program 1 times [2024-11-07 01:46:01,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:46:01,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421496833] [2024-11-07 01:46:01,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:46:01,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:46:01,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:01,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:46:02,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:02,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-07 01:46:02,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:02,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 01:46:02,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:02,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-07 01:46:02,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:02,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-07 01:46:02,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:02,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:46:02,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:46:02,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421496833] [2024-11-07 01:46:02,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421496833] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:46:02,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:46:02,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 01:46:02,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951483720] [2024-11-07 01:46:02,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:46:02,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 01:46:02,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:46:02,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 01:46:02,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 01:46:02,115 INFO L87 Difference]: Start difference. First operand 5034 states and 6079 transitions. Second operand has 5 states, 5 states have (on average 24.8) internal successors, (124), 3 states have internal predecessors, (124), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:46:04,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:46:04,054 INFO L93 Difference]: Finished difference Result 5414 states and 6682 transitions. [2024-11-07 01:46:04,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 01:46:04,054 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.8) internal successors, (124), 3 states have internal predecessors, (124), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 135 [2024-11-07 01:46:04,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:46:04,075 INFO L225 Difference]: With dead ends: 5414 [2024-11-07 01:46:04,075 INFO L226 Difference]: Without dead ends: 5132 [2024-11-07 01:46:04,078 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-11-07 01:46:04,078 INFO L432 NwaCegarLoop]: 350 mSDtfsCounter, 854 mSDsluCounter, 494 mSDsCounter, 0 mSdLazyCounter, 869 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 874 SdHoareTripleChecker+Valid, 844 SdHoareTripleChecker+Invalid, 951 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 869 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-07 01:46:04,078 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [874 Valid, 844 Invalid, 951 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 869 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-07 01:46:04,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5132 states. [2024-11-07 01:46:04,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5132 to 5034. [2024-11-07 01:46:04,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5034 states, 4014 states have (on average 1.1973094170403586) internal successors, (4806), 4053 states have internal predecessors, (4806), 501 states have call successors, (501), 403 states have call predecessors, (501), 517 states have return successors, (771), 578 states have call predecessors, (771), 498 states have call successors, (771) [2024-11-07 01:46:04,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5034 states to 5034 states and 6078 transitions. [2024-11-07 01:46:04,785 INFO L78 Accepts]: Start accepts. Automaton has 5034 states and 6078 transitions. Word has length 135 [2024-11-07 01:46:04,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:46:04,786 INFO L471 AbstractCegarLoop]: Abstraction has 5034 states and 6078 transitions. [2024-11-07 01:46:04,786 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.8) internal successors, (124), 3 states have internal predecessors, (124), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:46:04,786 INFO L276 IsEmpty]: Start isEmpty. Operand 5034 states and 6078 transitions. [2024-11-07 01:46:04,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-07 01:46:04,793 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:46:04,793 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:46:04,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-07 01:46:04,793 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:46:04,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:46:04,794 INFO L85 PathProgramCache]: Analyzing trace with hash -1096606825, now seen corresponding path program 1 times [2024-11-07 01:46:04,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:46:04,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030010568] [2024-11-07 01:46:04,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:46:04,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:46:04,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:04,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:46:04,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:04,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-07 01:46:04,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:04,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 01:46:04,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:04,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-07 01:46:04,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:04,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-07 01:46:04,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:04,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:46:04,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:46:04,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030010568] [2024-11-07 01:46:04,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2030010568] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:46:04,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:46:04,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 01:46:04,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993470153] [2024-11-07 01:46:04,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:46:04,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 01:46:04,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:46:04,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 01:46:04,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 01:46:04,993 INFO L87 Difference]: Start difference. First operand 5034 states and 6078 transitions. Second operand has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 4 states have internal predecessors, (124), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:46:07,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:46:07,187 INFO L93 Difference]: Finished difference Result 5794 states and 7287 transitions. [2024-11-07 01:46:07,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 01:46:07,188 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 4 states have internal predecessors, (124), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 135 [2024-11-07 01:46:07,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:46:07,211 INFO L225 Difference]: With dead ends: 5794 [2024-11-07 01:46:07,211 INFO L226 Difference]: Without dead ends: 5517 [2024-11-07 01:46:07,216 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-11-07 01:46:07,217 INFO L432 NwaCegarLoop]: 318 mSDtfsCounter, 1343 mSDsluCounter, 928 mSDsCounter, 0 mSdLazyCounter, 1759 mSolverCounterSat, 134 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1368 SdHoareTripleChecker+Valid, 1246 SdHoareTripleChecker+Invalid, 1893 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 134 IncrementalHoareTripleChecker+Valid, 1759 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-07 01:46:07,217 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1368 Valid, 1246 Invalid, 1893 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [134 Valid, 1759 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-07 01:46:07,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5517 states. [2024-11-07 01:46:08,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5517 to 5320. [2024-11-07 01:46:08,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5320 states, 4276 states have (on average 1.220065481758653) internal successors, (5217), 4316 states have internal predecessors, (5217), 518 states have call successors, (518), 409 states have call predecessors, (518), 524 states have return successors, (791), 595 states have call predecessors, (791), 515 states have call successors, (791) [2024-11-07 01:46:08,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5320 states to 5320 states and 6526 transitions. [2024-11-07 01:46:08,363 INFO L78 Accepts]: Start accepts. Automaton has 5320 states and 6526 transitions. Word has length 135 [2024-11-07 01:46:08,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:46:08,363 INFO L471 AbstractCegarLoop]: Abstraction has 5320 states and 6526 transitions. [2024-11-07 01:46:08,363 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 4 states have internal predecessors, (124), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:46:08,363 INFO L276 IsEmpty]: Start isEmpty. Operand 5320 states and 6526 transitions. [2024-11-07 01:46:08,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-07 01:46:08,370 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:46:08,370 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:46:08,370 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-07 01:46:08,370 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:46:08,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:46:08,370 INFO L85 PathProgramCache]: Analyzing trace with hash 1836358035, now seen corresponding path program 1 times [2024-11-07 01:46:08,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:46:08,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700143534] [2024-11-07 01:46:08,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:46:08,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:46:08,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:08,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:46:08,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:08,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-07 01:46:08,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:08,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 01:46:08,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:08,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-07 01:46:08,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:08,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-07 01:46:08,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:08,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:46:08,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:46:08,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700143534] [2024-11-07 01:46:08,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700143534] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:46:08,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:46:08,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:46:08,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089235437] [2024-11-07 01:46:08,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:46:08,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:46:08,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:46:08,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:46:08,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:46:08,566 INFO L87 Difference]: Start difference. First operand 5320 states and 6526 transitions. Second operand has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:46:11,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:46:11,281 INFO L93 Difference]: Finished difference Result 6475 states and 8363 transitions. [2024-11-07 01:46:11,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 01:46:11,281 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 135 [2024-11-07 01:46:11,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:46:11,301 INFO L225 Difference]: With dead ends: 6475 [2024-11-07 01:46:11,301 INFO L226 Difference]: Without dead ends: 5912 [2024-11-07 01:46:11,305 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-07 01:46:11,306 INFO L432 NwaCegarLoop]: 512 mSDtfsCounter, 1358 mSDsluCounter, 1740 mSDsCounter, 0 mSdLazyCounter, 2790 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1383 SdHoareTripleChecker+Valid, 2252 SdHoareTripleChecker+Invalid, 2881 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 2790 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-07 01:46:11,306 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1383 Valid, 2252 Invalid, 2881 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 2790 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-07 01:46:11,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5912 states. [2024-11-07 01:46:11,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5912 to 5587. [2024-11-07 01:46:11,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5587 states, 4519 states have (on average 1.2369993361363134) internal successors, (5590), 4560 states have internal predecessors, (5590), 535 states have call successors, (535), 415 states have call predecessors, (535), 531 states have return successors, (810), 613 states have call predecessors, (810), 532 states have call successors, (810) [2024-11-07 01:46:11,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5587 states to 5587 states and 6935 transitions. [2024-11-07 01:46:11,968 INFO L78 Accepts]: Start accepts. Automaton has 5587 states and 6935 transitions. Word has length 135 [2024-11-07 01:46:11,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:46:11,968 INFO L471 AbstractCegarLoop]: Abstraction has 5587 states and 6935 transitions. [2024-11-07 01:46:11,968 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:46:11,968 INFO L276 IsEmpty]: Start isEmpty. Operand 5587 states and 6935 transitions. [2024-11-07 01:46:11,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-07 01:46:11,976 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:46:11,976 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:46:11,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-07 01:46:11,976 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:46:11,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:46:11,977 INFO L85 PathProgramCache]: Analyzing trace with hash -529677035, now seen corresponding path program 1 times [2024-11-07 01:46:11,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:46:11,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689407758] [2024-11-07 01:46:11,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:46:11,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:46:11,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:12,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:46:12,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:12,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-07 01:46:12,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:12,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 01:46:12,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:12,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-07 01:46:12,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:12,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-07 01:46:12,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:12,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:46:12,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:46:12,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689407758] [2024-11-07 01:46:12,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689407758] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:46:12,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:46:12,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:46:12,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473686165] [2024-11-07 01:46:12,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:46:12,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:46:12,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:46:12,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:46:12,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:46:12,165 INFO L87 Difference]: Start difference. First operand 5587 states and 6935 transitions. Second operand has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:46:15,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:46:15,070 INFO L93 Difference]: Finished difference Result 7479 states and 9938 transitions. [2024-11-07 01:46:15,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 01:46:15,071 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 135 [2024-11-07 01:46:15,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:46:15,099 INFO L225 Difference]: With dead ends: 7479 [2024-11-07 01:46:15,099 INFO L226 Difference]: Without dead ends: 6649 [2024-11-07 01:46:15,105 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-07 01:46:15,105 INFO L432 NwaCegarLoop]: 510 mSDtfsCounter, 1362 mSDsluCounter, 1740 mSDsCounter, 0 mSdLazyCounter, 2781 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1387 SdHoareTripleChecker+Valid, 2250 SdHoareTripleChecker+Invalid, 2874 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 2781 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-07 01:46:15,106 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1387 Valid, 2250 Invalid, 2874 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 2781 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-07 01:46:15,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6649 states. [2024-11-07 01:46:15,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6649 to 6122. [2024-11-07 01:46:15,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6122 states, 5006 states have (on average 1.2658809428685578) internal successors, (6337), 5049 states have internal predecessors, (6337), 569 states have call successors, (569), 427 states have call predecessors, (569), 545 states have return successors, (852), 649 states have call predecessors, (852), 566 states have call successors, (852) [2024-11-07 01:46:15,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6122 states to 6122 states and 7758 transitions. [2024-11-07 01:46:15,969 INFO L78 Accepts]: Start accepts. Automaton has 6122 states and 7758 transitions. Word has length 135 [2024-11-07 01:46:15,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:46:15,969 INFO L471 AbstractCegarLoop]: Abstraction has 6122 states and 7758 transitions. [2024-11-07 01:46:15,970 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:46:15,970 INFO L276 IsEmpty]: Start isEmpty. Operand 6122 states and 7758 transitions. [2024-11-07 01:46:15,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-07 01:46:15,977 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:46:15,977 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:46:15,977 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-07 01:46:15,977 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:46:15,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:46:15,978 INFO L85 PathProgramCache]: Analyzing trace with hash 1472209235, now seen corresponding path program 1 times [2024-11-07 01:46:15,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:46:15,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761836293] [2024-11-07 01:46:15,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:46:15,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:46:15,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:16,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:46:16,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:16,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-07 01:46:16,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:16,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 01:46:16,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:16,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-07 01:46:16,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:16,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-07 01:46:16,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:16,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:46:16,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:46:16,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761836293] [2024-11-07 01:46:16,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [761836293] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:46:16,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:46:16,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:46:16,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491412202] [2024-11-07 01:46:16,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:46:16,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:46:16,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:46:16,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:46:16,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:46:16,169 INFO L87 Difference]: Start difference. First operand 6122 states and 7758 transitions. Second operand has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:46:19,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:46:19,090 INFO L93 Difference]: Finished difference Result 9411 states and 12953 transitions. [2024-11-07 01:46:19,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 01:46:19,090 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 135 [2024-11-07 01:46:19,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:46:19,119 INFO L225 Difference]: With dead ends: 9411 [2024-11-07 01:46:19,119 INFO L226 Difference]: Without dead ends: 8046 [2024-11-07 01:46:19,126 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-07 01:46:19,127 INFO L432 NwaCegarLoop]: 510 mSDtfsCounter, 1358 mSDsluCounter, 1740 mSDsCounter, 0 mSdLazyCounter, 2753 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1383 SdHoareTripleChecker+Valid, 2250 SdHoareTripleChecker+Invalid, 2846 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 2753 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-07 01:46:19,127 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1383 Valid, 2250 Invalid, 2846 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 2753 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-07 01:46:19,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8046 states. [2024-11-07 01:46:19,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8046 to 7198. [2024-11-07 01:46:19,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7198 states, 5986 states have (on average 1.3098897427330438) internal successors, (7841), 6033 states have internal predecessors, (7841), 637 states have call successors, (637), 451 states have call predecessors, (637), 573 states have return successors, (942), 721 states have call predecessors, (942), 634 states have call successors, (942) [2024-11-07 01:46:19,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7198 states to 7198 states and 9420 transitions. [2024-11-07 01:46:19,914 INFO L78 Accepts]: Start accepts. Automaton has 7198 states and 9420 transitions. Word has length 135 [2024-11-07 01:46:19,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:46:19,915 INFO L471 AbstractCegarLoop]: Abstraction has 7198 states and 9420 transitions. [2024-11-07 01:46:19,915 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:46:19,915 INFO L276 IsEmpty]: Start isEmpty. Operand 7198 states and 9420 transitions. [2024-11-07 01:46:19,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-07 01:46:19,921 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:46:19,921 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:46:19,921 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-07 01:46:19,921 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:46:19,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:46:19,922 INFO L85 PathProgramCache]: Analyzing trace with hash 1943565585, now seen corresponding path program 1 times [2024-11-07 01:46:19,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:46:19,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254683802] [2024-11-07 01:46:19,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:46:19,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:46:19,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:19,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:46:19,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:20,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-07 01:46:20,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:20,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 01:46:20,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:20,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-07 01:46:20,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:20,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-07 01:46:20,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:20,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:46:20,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:46:20,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254683802] [2024-11-07 01:46:20,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254683802] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:46:20,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:46:20,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:46:20,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918152212] [2024-11-07 01:46:20,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:46:20,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:46:20,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:46:20,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:46:20,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:46:20,083 INFO L87 Difference]: Start difference. First operand 7198 states and 9420 transitions. Second operand has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:46:21,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:46:21,892 INFO L93 Difference]: Finished difference Result 10500 states and 14666 transitions. [2024-11-07 01:46:21,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 01:46:21,892 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 135 [2024-11-07 01:46:21,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:46:21,924 INFO L225 Difference]: With dead ends: 10500 [2024-11-07 01:46:21,925 INFO L226 Difference]: Without dead ends: 8059 [2024-11-07 01:46:21,934 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-11-07 01:46:21,935 INFO L432 NwaCegarLoop]: 303 mSDtfsCounter, 1052 mSDsluCounter, 963 mSDsCounter, 0 mSdLazyCounter, 1453 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1078 SdHoareTripleChecker+Valid, 1266 SdHoareTripleChecker+Invalid, 1548 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 1453 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-07 01:46:21,935 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1078 Valid, 1266 Invalid, 1548 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 1453 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-07 01:46:21,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8059 states. [2024-11-07 01:46:22,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8059 to 7198. [2024-11-07 01:46:22,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7198 states, 5986 states have (on average 1.308386234547277) internal successors, (7832), 6033 states have internal predecessors, (7832), 637 states have call successors, (637), 451 states have call predecessors, (637), 573 states have return successors, (942), 721 states have call predecessors, (942), 634 states have call successors, (942) [2024-11-07 01:46:22,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7198 states to 7198 states and 9411 transitions. [2024-11-07 01:46:22,653 INFO L78 Accepts]: Start accepts. Automaton has 7198 states and 9411 transitions. Word has length 135 [2024-11-07 01:46:22,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:46:22,654 INFO L471 AbstractCegarLoop]: Abstraction has 7198 states and 9411 transitions. [2024-11-07 01:46:22,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:46:22,654 INFO L276 IsEmpty]: Start isEmpty. Operand 7198 states and 9411 transitions. [2024-11-07 01:46:22,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-07 01:46:22,662 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:46:22,662 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:46:22,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-07 01:46:22,662 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:46:22,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:46:22,662 INFO L85 PathProgramCache]: Analyzing trace with hash 296202643, now seen corresponding path program 1 times [2024-11-07 01:46:22,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:46:22,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444295796] [2024-11-07 01:46:22,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:46:22,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:46:22,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:22,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:46:22,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:22,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-07 01:46:22,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:22,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 01:46:22,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:22,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-07 01:46:22,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:22,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-07 01:46:22,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:22,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:46:22,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:46:22,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444295796] [2024-11-07 01:46:22,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444295796] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:46:22,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:46:22,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:46:22,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580600817] [2024-11-07 01:46:22,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:46:22,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:46:22,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:46:22,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:46:22,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:46:22,830 INFO L87 Difference]: Start difference. First operand 7198 states and 9411 transitions. Second operand has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:46:24,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:46:24,526 INFO L93 Difference]: Finished difference Result 10490 states and 14619 transitions. [2024-11-07 01:46:24,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 01:46:24,527 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 135 [2024-11-07 01:46:24,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:46:24,553 INFO L225 Difference]: With dead ends: 10490 [2024-11-07 01:46:24,553 INFO L226 Difference]: Without dead ends: 8049 [2024-11-07 01:46:24,559 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-11-07 01:46:24,560 INFO L432 NwaCegarLoop]: 303 mSDtfsCounter, 1220 mSDsluCounter, 749 mSDsCounter, 0 mSdLazyCounter, 1309 mSolverCounterSat, 134 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1246 SdHoareTripleChecker+Valid, 1052 SdHoareTripleChecker+Invalid, 1443 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 134 IncrementalHoareTripleChecker+Valid, 1309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-07 01:46:24,560 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1246 Valid, 1052 Invalid, 1443 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [134 Valid, 1309 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-07 01:46:24,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8049 states. [2024-11-07 01:46:25,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8049 to 7198. [2024-11-07 01:46:25,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7198 states, 5986 states have (on average 1.3068827263615101) internal successors, (7823), 6033 states have internal predecessors, (7823), 637 states have call successors, (637), 451 states have call predecessors, (637), 573 states have return successors, (942), 721 states have call predecessors, (942), 634 states have call successors, (942) [2024-11-07 01:46:25,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7198 states to 7198 states and 9402 transitions. [2024-11-07 01:46:25,259 INFO L78 Accepts]: Start accepts. Automaton has 7198 states and 9402 transitions. Word has length 135 [2024-11-07 01:46:25,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:46:25,259 INFO L471 AbstractCegarLoop]: Abstraction has 7198 states and 9402 transitions. [2024-11-07 01:46:25,259 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:46:25,259 INFO L276 IsEmpty]: Start isEmpty. Operand 7198 states and 9402 transitions. [2024-11-07 01:46:25,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-07 01:46:25,266 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:46:25,266 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:46:25,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-07 01:46:25,266 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:46:25,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:46:25,266 INFO L85 PathProgramCache]: Analyzing trace with hash -1835148079, now seen corresponding path program 1 times [2024-11-07 01:46:25,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:46:25,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171657792] [2024-11-07 01:46:25,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:46:25,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:46:25,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:25,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:46:25,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:25,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-07 01:46:25,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:25,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 01:46:25,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:25,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-07 01:46:25,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:25,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-07 01:46:25,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:25,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:46:25,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:46:25,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171657792] [2024-11-07 01:46:25,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171657792] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:46:25,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:46:25,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:46:25,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498144380] [2024-11-07 01:46:25,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:46:25,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:46:25,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:46:25,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:46:25,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:46:25,427 INFO L87 Difference]: Start difference. First operand 7198 states and 9402 transitions. Second operand has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:46:27,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:46:27,214 INFO L93 Difference]: Finished difference Result 10480 states and 14572 transitions. [2024-11-07 01:46:27,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 01:46:27,215 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 135 [2024-11-07 01:46:27,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:46:27,239 INFO L225 Difference]: With dead ends: 10480 [2024-11-07 01:46:27,239 INFO L226 Difference]: Without dead ends: 8039 [2024-11-07 01:46:27,246 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-11-07 01:46:27,247 INFO L432 NwaCegarLoop]: 303 mSDtfsCounter, 1048 mSDsluCounter, 963 mSDsCounter, 0 mSdLazyCounter, 1421 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1074 SdHoareTripleChecker+Valid, 1266 SdHoareTripleChecker+Invalid, 1516 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 1421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-07 01:46:27,247 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1074 Valid, 1266 Invalid, 1516 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 1421 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-07 01:46:27,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8039 states. [2024-11-07 01:46:27,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8039 to 7198. [2024-11-07 01:46:27,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7198 states, 5986 states have (on average 1.3053792181757433) internal successors, (7814), 6033 states have internal predecessors, (7814), 637 states have call successors, (637), 451 states have call predecessors, (637), 573 states have return successors, (942), 721 states have call predecessors, (942), 634 states have call successors, (942) [2024-11-07 01:46:27,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7198 states to 7198 states and 9393 transitions. [2024-11-07 01:46:27,954 INFO L78 Accepts]: Start accepts. Automaton has 7198 states and 9393 transitions. Word has length 135 [2024-11-07 01:46:27,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:46:27,954 INFO L471 AbstractCegarLoop]: Abstraction has 7198 states and 9393 transitions. [2024-11-07 01:46:27,954 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:46:27,954 INFO L276 IsEmpty]: Start isEmpty. Operand 7198 states and 9393 transitions. [2024-11-07 01:46:27,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-07 01:46:27,960 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:46:27,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:46:27,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-07 01:46:27,960 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:46:27,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:46:27,960 INFO L85 PathProgramCache]: Analyzing trace with hash 1421234643, now seen corresponding path program 1 times [2024-11-07 01:46:27,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:46:27,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816585097] [2024-11-07 01:46:27,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:46:27,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:46:27,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:28,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:46:28,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:28,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-07 01:46:28,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:28,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 01:46:28,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:28,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-07 01:46:28,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:28,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-07 01:46:28,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:28,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:46:28,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:46:28,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816585097] [2024-11-07 01:46:28,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [816585097] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:46:28,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:46:28,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:46:28,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061223680] [2024-11-07 01:46:28,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:46:28,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:46:28,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:46:28,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:46:28,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:46:28,136 INFO L87 Difference]: Start difference. First operand 7198 states and 9393 transitions. Second operand has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:46:31,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:46:31,013 INFO L93 Difference]: Finished difference Result 13255 states and 18825 transitions. [2024-11-07 01:46:31,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 01:46:31,014 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 135 [2024-11-07 01:46:31,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:46:31,053 INFO L225 Difference]: With dead ends: 13255 [2024-11-07 01:46:31,053 INFO L226 Difference]: Without dead ends: 10814 [2024-11-07 01:46:31,065 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-07 01:46:31,066 INFO L432 NwaCegarLoop]: 510 mSDtfsCounter, 1336 mSDsluCounter, 1740 mSDsCounter, 0 mSdLazyCounter, 2665 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1361 SdHoareTripleChecker+Valid, 2250 SdHoareTripleChecker+Invalid, 2758 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 2665 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-07 01:46:31,066 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1361 Valid, 2250 Invalid, 2758 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 2665 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-07 01:46:31,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10814 states. [2024-11-07 01:46:31,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10814 to 9382. [2024-11-07 01:46:32,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9382 states, 7978 states have (on average 1.357984457257458) internal successors, (10834), 8033 states have internal predecessors, (10834), 773 states have call successors, (773), 499 states have call predecessors, (773), 629 states have return successors, (1140), 865 states have call predecessors, (1140), 770 states have call successors, (1140) [2024-11-07 01:46:32,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9382 states to 9382 states and 12747 transitions. [2024-11-07 01:46:32,029 INFO L78 Accepts]: Start accepts. Automaton has 9382 states and 12747 transitions. Word has length 135 [2024-11-07 01:46:32,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:46:32,029 INFO L471 AbstractCegarLoop]: Abstraction has 9382 states and 12747 transitions. [2024-11-07 01:46:32,029 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:46:32,029 INFO L276 IsEmpty]: Start isEmpty. Operand 9382 states and 12747 transitions. [2024-11-07 01:46:32,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-07 01:46:32,036 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:46:32,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:46:32,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-07 01:46:32,036 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:46:32,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:46:32,036 INFO L85 PathProgramCache]: Analyzing trace with hash -551930735, now seen corresponding path program 1 times [2024-11-07 01:46:32,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:46:32,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246093909] [2024-11-07 01:46:32,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:46:32,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:46:32,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:32,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:46:32,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:32,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-07 01:46:32,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:32,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 01:46:32,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:32,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-07 01:46:32,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:32,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-07 01:46:32,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:32,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:46:32,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:46:32,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246093909] [2024-11-07 01:46:32,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246093909] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:46:32,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:46:32,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:46:32,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386437578] [2024-11-07 01:46:32,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:46:32,211 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:46:32,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:46:32,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:46:32,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:46:32,212 INFO L87 Difference]: Start difference. First operand 9382 states and 12747 transitions. Second operand has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:46:36,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:46:36,034 INFO L93 Difference]: Finished difference Result 22941 states and 33819 transitions. [2024-11-07 01:46:36,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-07 01:46:36,035 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 135 [2024-11-07 01:46:36,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:46:36,080 INFO L225 Difference]: With dead ends: 22941 [2024-11-07 01:46:36,080 INFO L226 Difference]: Without dead ends: 18316 [2024-11-07 01:46:36,093 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-11-07 01:46:36,093 INFO L432 NwaCegarLoop]: 508 mSDtfsCounter, 1418 mSDsluCounter, 1732 mSDsCounter, 0 mSdLazyCounter, 3177 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1442 SdHoareTripleChecker+Valid, 2240 SdHoareTripleChecker+Invalid, 3272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 3177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-07 01:46:36,094 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1442 Valid, 2240 Invalid, 3272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 3177 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-07 01:46:36,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18316 states. [2024-11-07 01:46:37,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18316 to 13711. [2024-11-07 01:46:37,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13711 states, 11939 states have (on average 1.4115085015495434) internal successors, (16852), 12010 states have internal predecessors, (16852), 1029 states have call successors, (1029), 595 states have call predecessors, (1029), 741 states have return successors, (1574), 1137 states have call predecessors, (1574), 1026 states have call successors, (1574) [2024-11-07 01:46:37,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13711 states to 13711 states and 19455 transitions. [2024-11-07 01:46:37,209 INFO L78 Accepts]: Start accepts. Automaton has 13711 states and 19455 transitions. Word has length 135 [2024-11-07 01:46:37,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:46:37,209 INFO L471 AbstractCegarLoop]: Abstraction has 13711 states and 19455 transitions. [2024-11-07 01:46:37,210 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:46:37,210 INFO L276 IsEmpty]: Start isEmpty. Operand 13711 states and 19455 transitions. [2024-11-07 01:46:37,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-07 01:46:37,217 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:46:37,217 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:46:37,217 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-07 01:46:37,217 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:46:37,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:46:37,218 INFO L85 PathProgramCache]: Analyzing trace with hash 1601176083, now seen corresponding path program 1 times [2024-11-07 01:46:37,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:46:37,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051711339] [2024-11-07 01:46:37,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:46:37,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:46:37,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:37,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:46:37,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:37,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-07 01:46:37,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:37,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 01:46:37,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:37,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-07 01:46:37,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:37,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-07 01:46:37,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:37,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:46:37,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:46:37,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051711339] [2024-11-07 01:46:37,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2051711339] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:46:37,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:46:37,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:46:37,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330368320] [2024-11-07 01:46:37,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:46:37,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:46:37,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:46:37,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:46:37,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:46:37,386 INFO L87 Difference]: Start difference. First operand 13711 states and 19455 transitions. Second operand has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:46:41,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:46:41,464 INFO L93 Difference]: Finished difference Result 39844 states and 60241 transitions. [2024-11-07 01:46:41,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-07 01:46:41,464 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 135 [2024-11-07 01:46:41,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:46:41,542 INFO L225 Difference]: With dead ends: 39844 [2024-11-07 01:46:41,543 INFO L226 Difference]: Without dead ends: 30890 [2024-11-07 01:46:41,566 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-11-07 01:46:41,567 INFO L432 NwaCegarLoop]: 507 mSDtfsCounter, 1630 mSDsluCounter, 1729 mSDsCounter, 0 mSdLazyCounter, 2626 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1664 SdHoareTripleChecker+Valid, 2236 SdHoareTripleChecker+Invalid, 2722 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 2626 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-07 01:46:41,567 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1664 Valid, 2236 Invalid, 2722 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 2626 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-07 01:46:41,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30890 states. [2024-11-07 01:46:43,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30890 to 22032. [2024-11-07 01:46:43,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22032 states, 19540 states have (on average 1.4496417604913) internal successors, (28326), 19643 states have internal predecessors, (28326), 1525 states have call successors, (1525), 787 states have call predecessors, (1525), 965 states have return successors, (2588), 1665 states have call predecessors, (2588), 1522 states have call successors, (2588) [2024-11-07 01:46:43,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22032 states to 22032 states and 32439 transitions. [2024-11-07 01:46:43,210 INFO L78 Accepts]: Start accepts. Automaton has 22032 states and 32439 transitions. Word has length 135 [2024-11-07 01:46:43,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:46:43,210 INFO L471 AbstractCegarLoop]: Abstraction has 22032 states and 32439 transitions. [2024-11-07 01:46:43,210 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:46:43,210 INFO L276 IsEmpty]: Start isEmpty. Operand 22032 states and 32439 transitions. [2024-11-07 01:46:43,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-07 01:46:43,221 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:46:43,221 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:46:43,221 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-07 01:46:43,221 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:46:43,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:46:43,222 INFO L85 PathProgramCache]: Analyzing trace with hash 977894481, now seen corresponding path program 1 times [2024-11-07 01:46:43,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:46:43,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080842723] [2024-11-07 01:46:43,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:46:43,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:46:43,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:43,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:46:43,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:43,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-07 01:46:43,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:43,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 01:46:43,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:43,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-07 01:46:43,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:43,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-07 01:46:43,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:43,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:46:43,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:46:43,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080842723] [2024-11-07 01:46:43,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080842723] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:46:43,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:46:43,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:46:43,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792249224] [2024-11-07 01:46:43,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:46:43,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:46:43,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:46:43,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:46:43,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:46:43,394 INFO L87 Difference]: Start difference. First operand 22032 states and 32439 transitions. Second operand has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 5 states have internal predecessors, (124), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5)