./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.04.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.04.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', 'a61ec0d9e8ff01aa8900ac2d4a87b40f68db963fb1a53c6fbb2c11c91e3dd345'] 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.04.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 a61ec0d9e8ff01aa8900ac2d4a87b40f68db963fb1a53c6fbb2c11c91e3dd345 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 01:44:52,817 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 01:44:52,915 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:44:52,921 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 01:44:52,924 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 01:44:52,955 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 01:44:52,957 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 01:44:52,957 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 01:44:52,957 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 01:44:52,958 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 01:44:52,958 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 01:44:52,958 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 01:44:52,959 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 01:44:52,960 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 01:44:52,960 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 01:44:52,960 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 01:44:52,960 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 01:44:52,960 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 01:44:52,960 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 01:44:52,960 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 01:44:52,960 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 01:44:52,960 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 01:44:52,960 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 01:44:52,960 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 01:44:52,960 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 01:44:52,960 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 01:44:52,961 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 01:44:52,961 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 01:44:52,961 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 01:44:52,961 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 01:44:52,961 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 01:44:52,961 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 01:44:52,961 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 01:44:52,961 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 01:44:52,961 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 01:44:52,961 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 01:44:52,961 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 01:44:52,961 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 01:44:52,961 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 01:44:52,961 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 01:44:52,961 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 01:44:52,961 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 01:44:52,961 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 -> a61ec0d9e8ff01aa8900ac2d4a87b40f68db963fb1a53c6fbb2c11c91e3dd345 [2024-11-07 01:44:53,265 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 01:44:53,272 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 01:44:53,274 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 01:44:53,275 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 01:44:53,275 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 01:44:53,277 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.04.cil-2.c [2024-11-07 01:44:54,547 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 01:44:54,790 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 01:44:54,791 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.04.cil-2.c [2024-11-07 01:44:54,806 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ca49b9fd7/e5e22ebec46a45c0b80e2b2529deafd3/FLAG95f50295a [2024-11-07 01:44:54,830 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ca49b9fd7/e5e22ebec46a45c0b80e2b2529deafd3 [2024-11-07 01:44:54,833 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 01:44:54,835 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 01:44:54,838 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 01:44:54,838 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 01:44:54,842 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 01:44:54,843 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:44:54" (1/1) ... [2024-11-07 01:44:54,844 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c449478 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:44:54, skipping insertion in model container [2024-11-07 01:44:54,844 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:44:54" (1/1) ... [2024-11-07 01:44:54,889 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 01:44:55,036 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.04.cil-2.c[914,927] [2024-11-07 01:44:55,114 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.04.cil-2.c[7115,7128] [2024-11-07 01:44:55,192 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 01:44:55,204 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 01:44:55,216 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.04.cil-2.c[914,927] [2024-11-07 01:44:55,245 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.04.cil-2.c[7115,7128] [2024-11-07 01:44:55,293 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 01:44:55,322 INFO L204 MainTranslator]: Completed translation [2024-11-07 01:44:55,323 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:44:55 WrapperNode [2024-11-07 01:44:55,323 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 01:44:55,324 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 01:44:55,325 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 01:44:55,325 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 01:44:55,332 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:44:55" (1/1) ... [2024-11-07 01:44:55,345 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:44:55" (1/1) ... [2024-11-07 01:44:55,397 INFO L138 Inliner]: procedures = 61, calls = 70, calls flagged for inlining = 29, calls inlined = 29, statements flattened = 594 [2024-11-07 01:44:55,397 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 01:44:55,398 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 01:44:55,398 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 01:44:55,398 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 01:44:55,410 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:44:55" (1/1) ... [2024-11-07 01:44:55,411 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:44:55" (1/1) ... [2024-11-07 01:44:55,414 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:44:55" (1/1) ... [2024-11-07 01:44:55,432 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:44:55,432 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:44:55" (1/1) ... [2024-11-07 01:44:55,432 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:44:55" (1/1) ... [2024-11-07 01:44:55,441 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:44:55" (1/1) ... [2024-11-07 01:44:55,449 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:44:55" (1/1) ... [2024-11-07 01:44:55,452 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:44:55" (1/1) ... [2024-11-07 01:44:55,453 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:44:55" (1/1) ... [2024-11-07 01:44:55,458 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 01:44:55,459 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 01:44:55,459 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 01:44:55,459 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 01:44:55,464 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:44:55" (1/1) ... [2024-11-07 01:44:55,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 01:44:55,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 01:44:55,506 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:44:55,512 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:44:55,539 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 01:44:55,539 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-11-07 01:44:55,539 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-11-07 01:44:55,539 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2024-11-07 01:44:55,539 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2024-11-07 01:44:55,540 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2024-11-07 01:44:55,540 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2024-11-07 01:44:55,540 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2024-11-07 01:44:55,540 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2024-11-07 01:44:55,540 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2024-11-07 01:44:55,540 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2024-11-07 01:44:55,540 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2024-11-07 01:44:55,541 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2024-11-07 01:44:55,541 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2024-11-07 01:44:55,541 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2024-11-07 01:44:55,541 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2024-11-07 01:44:55,541 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2024-11-07 01:44:55,541 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2024-11-07 01:44:55,541 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2024-11-07 01:44:55,541 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2024-11-07 01:44:55,541 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2024-11-07 01:44:55,542 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2024-11-07 01:44:55,542 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2024-11-07 01:44:55,542 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 01:44:55,542 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2024-11-07 01:44:55,542 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2024-11-07 01:44:55,542 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2024-11-07 01:44:55,542 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2024-11-07 01:44:55,542 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 01:44:55,543 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 01:44:55,543 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2024-11-07 01:44:55,543 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2024-11-07 01:44:55,543 INFO L130 BoogieDeclarations]: Found specification of procedure error2 [2024-11-07 01:44:55,543 INFO L138 BoogieDeclarations]: Found implementation of procedure error2 [2024-11-07 01:44:55,634 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 01:44:55,636 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 01:44:56,301 INFO L? ?]: Removed 83 outVars from TransFormulas that were not future-live. [2024-11-07 01:44:56,301 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 01:44:56,321 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 01:44:56,322 INFO L316 CfgBuilder]: Removed 11 assume(true) statements. [2024-11-07 01:44:56,322 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:44:56 BoogieIcfgContainer [2024-11-07 01:44:56,322 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 01:44:56,326 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 01:44:56,326 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 01:44:56,331 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 01:44:56,331 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 01:44:54" (1/3) ... [2024-11-07 01:44:56,332 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e85b87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:44:56, skipping insertion in model container [2024-11-07 01:44:56,332 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:44:55" (2/3) ... [2024-11-07 01:44:56,333 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e85b87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:44:56, skipping insertion in model container [2024-11-07 01:44:56,333 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:44:56" (3/3) ... [2024-11-07 01:44:56,335 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-1+token_ring.04.cil-2.c [2024-11-07 01:44:56,350 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 01:44:56,350 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-07 01:44:56,422 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 01:44:56,433 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;@742cb25, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 01:44:56,434 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-07 01:44:56,439 INFO L276 IsEmpty]: Start isEmpty. Operand has 296 states, 244 states have (on average 1.5819672131147542) internal successors, (386), 252 states have internal predecessors, (386), 34 states have call successors, (34), 15 states have call predecessors, (34), 15 states have return successors, (34), 32 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-07 01:44:56,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-07 01:44:56,448 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:44:56,449 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:44:56,450 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:44:56,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:44:56,456 INFO L85 PathProgramCache]: Analyzing trace with hash -644842896, now seen corresponding path program 1 times [2024-11-07 01:44:56,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:44:56,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022658769] [2024-11-07 01:44:56,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:44:56,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:44:56,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:44:57,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:44:57,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:44:57,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-07 01:44:57,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:44:57,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 01:44:57,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:44:57,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 01:44:57,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:44:57,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 01:44:57,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:44:57,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 01:44:57,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:44:57,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 01:44:57,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:44:57,185 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:44:57,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:44:57,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022658769] [2024-11-07 01:44:57,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2022658769] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:44:57,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:44:57,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 01:44:57,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453799047] [2024-11-07 01:44:57,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:44:57,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 01:44:57,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:44:57,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 01:44:57,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-07 01:44:57,216 INFO L87 Difference]: Start difference. First operand has 296 states, 244 states have (on average 1.5819672131147542) internal successors, (386), 252 states have internal predecessors, (386), 34 states have call successors, (34), 15 states have call predecessors, (34), 15 states have return successors, (34), 32 states have call predecessors, (34), 34 states have call successors, (34) 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:44:58,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:44:58,744 INFO L93 Difference]: Finished difference Result 737 states and 1128 transitions. [2024-11-07 01:44:58,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-07 01:44:58,747 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:44:58,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:44:58,758 INFO L225 Difference]: With dead ends: 737 [2024-11-07 01:44:58,760 INFO L226 Difference]: Without dead ends: 451 [2024-11-07 01:44:58,768 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2024-11-07 01:44:58,773 INFO L432 NwaCegarLoop]: 303 mSDtfsCounter, 820 mSDsluCounter, 1292 mSDsCounter, 0 mSdLazyCounter, 1142 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 843 SdHoareTripleChecker+Valid, 1595 SdHoareTripleChecker+Invalid, 1257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 1142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-07 01:44:58,773 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [843 Valid, 1595 Invalid, 1257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 1142 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-07 01:44:58,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2024-11-07 01:44:58,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 385. [2024-11-07 01:44:58,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 385 states, 315 states have (on average 1.4730158730158731) internal successors, (464), 323 states have internal predecessors, (464), 45 states have call successors, (45), 22 states have call predecessors, (45), 23 states have return successors, (52), 42 states have call predecessors, (52), 41 states have call successors, (52) [2024-11-07 01:44:58,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 561 transitions. [2024-11-07 01:44:58,867 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 561 transitions. Word has length 65 [2024-11-07 01:44:58,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:44:58,868 INFO L471 AbstractCegarLoop]: Abstraction has 385 states and 561 transitions. [2024-11-07 01:44:58,868 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:44:58,868 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 561 transitions. [2024-11-07 01:44:58,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-07 01:44:58,872 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:44:58,872 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:44:58,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 01:44:58,873 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:44:58,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:44:58,874 INFO L85 PathProgramCache]: Analyzing trace with hash 1621538290, now seen corresponding path program 1 times [2024-11-07 01:44:58,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:44:58,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154351080] [2024-11-07 01:44:58,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:44:58,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:44:58,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:44:58,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:44:58,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:44:58,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-07 01:44:58,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:44:58,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 01:44:59,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:44:59,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 01:44:59,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:44:59,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 01:44:59,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:44:59,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 01:44:59,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:44:59,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 01:44:59,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:44:59,088 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:44:59,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:44:59,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154351080] [2024-11-07 01:44:59,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1154351080] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:44:59,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:44:59,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-07 01:44:59,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115251635] [2024-11-07 01:44:59,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:44:59,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 01:44:59,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:44:59,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 01:44:59,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-07 01:44:59,091 INFO L87 Difference]: Start difference. First operand 385 states and 561 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:44:59,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:44:59,999 INFO L93 Difference]: Finished difference Result 592 states and 850 transitions. [2024-11-07 01:45:00,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 01:45:00,001 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:00,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:45:00,008 INFO L225 Difference]: With dead ends: 592 [2024-11-07 01:45:00,008 INFO L226 Difference]: Without dead ends: 411 [2024-11-07 01:45:00,010 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:00,010 INFO L432 NwaCegarLoop]: 255 mSDtfsCounter, 487 mSDsluCounter, 1261 mSDsCounter, 0 mSdLazyCounter, 1107 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 488 SdHoareTripleChecker+Valid, 1516 SdHoareTripleChecker+Invalid, 1220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 1107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-07 01:45:00,011 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [488 Valid, 1516 Invalid, 1220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 1107 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-07 01:45:00,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2024-11-07 01:45:00,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 395. [2024-11-07 01:45:00,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 395 states, 323 states have (on average 1.4613003095975232) internal successors, (472), 331 states have internal predecessors, (472), 45 states have call successors, (45), 22 states have call predecessors, (45), 25 states have return successors, (54), 44 states have call predecessors, (54), 41 states have call successors, (54) [2024-11-07 01:45:00,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 571 transitions. [2024-11-07 01:45:00,086 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 571 transitions. Word has length 65 [2024-11-07 01:45:00,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:45:00,087 INFO L471 AbstractCegarLoop]: Abstraction has 395 states and 571 transitions. [2024-11-07 01:45:00,087 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:00,087 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 571 transitions. [2024-11-07 01:45:00,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-07 01:45:00,093 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:45:00,093 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:00,095 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 01:45:00,095 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:45:00,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:45:00,096 INFO L85 PathProgramCache]: Analyzing trace with hash 592178992, now seen corresponding path program 1 times [2024-11-07 01:45:00,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:45:00,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099237810] [2024-11-07 01:45:00,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:45:00,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:45:00,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:00,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:45:00,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:00,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-07 01:45:00,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:00,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 01:45:00,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:00,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 01:45:00,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:00,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 01:45:00,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:00,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 01:45:00,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:00,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 01:45:00,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:00,336 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:00,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:45:00,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099237810] [2024-11-07 01:45:00,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2099237810] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:45:00,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:45:00,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-07 01:45:00,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772827042] [2024-11-07 01:45:00,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:45:00,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 01:45:00,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:45:00,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 01:45:00,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-07 01:45:00,340 INFO L87 Difference]: Start difference. First operand 395 states and 571 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:01,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:45:01,213 INFO L93 Difference]: Finished difference Result 616 states and 878 transitions. [2024-11-07 01:45:01,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-07 01:45:01,214 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:01,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:45:01,217 INFO L225 Difference]: With dead ends: 616 [2024-11-07 01:45:01,217 INFO L226 Difference]: Without dead ends: 425 [2024-11-07 01:45:01,218 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2024-11-07 01:45:01,222 INFO L432 NwaCegarLoop]: 253 mSDtfsCounter, 493 mSDsluCounter, 1261 mSDsCounter, 0 mSdLazyCounter, 1090 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 495 SdHoareTripleChecker+Valid, 1514 SdHoareTripleChecker+Invalid, 1204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 1090 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-07 01:45:01,223 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [495 Valid, 1514 Invalid, 1204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 1090 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-07 01:45:01,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2024-11-07 01:45:01,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 405. [2024-11-07 01:45:01,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 405 states, 331 states have (on average 1.4501510574018126) internal successors, (480), 339 states have internal predecessors, (480), 45 states have call successors, (45), 22 states have call predecessors, (45), 27 states have return successors, (56), 46 states have call predecessors, (56), 41 states have call successors, (56) [2024-11-07 01:45:01,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 581 transitions. [2024-11-07 01:45:01,262 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 581 transitions. Word has length 65 [2024-11-07 01:45:01,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:45:01,262 INFO L471 AbstractCegarLoop]: Abstraction has 405 states and 581 transitions. [2024-11-07 01:45:01,262 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:01,263 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 581 transitions. [2024-11-07 01:45:01,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-07 01:45:01,264 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:45:01,264 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:01,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 01:45:01,265 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:45:01,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:45:01,268 INFO L85 PathProgramCache]: Analyzing trace with hash 1978382386, now seen corresponding path program 1 times [2024-11-07 01:45:01,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:45:01,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655890137] [2024-11-07 01:45:01,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:45:01,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:45:01,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:01,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:45:01,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:01,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-07 01:45:01,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:01,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 01:45:01,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:01,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 01:45:01,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:01,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 01:45:01,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:01,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 01:45:01,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:01,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 01:45:01,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:01,474 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:01,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:45:01,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655890137] [2024-11-07 01:45:01,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655890137] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:45:01,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:45:01,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 01:45:01,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131798807] [2024-11-07 01:45:01,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:45:01,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 01:45:01,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:45:01,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 01:45:01,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-07 01:45:01,476 INFO L87 Difference]: Start difference. First operand 405 states and 581 transitions. 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:02,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:45:02,402 INFO L93 Difference]: Finished difference Result 753 states and 1062 transitions. [2024-11-07 01:45:02,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-07 01:45:02,403 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:02,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:45:02,410 INFO L225 Difference]: With dead ends: 753 [2024-11-07 01:45:02,410 INFO L226 Difference]: Without dead ends: 551 [2024-11-07 01:45:02,413 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2024-11-07 01:45:02,414 INFO L432 NwaCegarLoop]: 246 mSDtfsCounter, 752 mSDsluCounter, 970 mSDsCounter, 0 mSdLazyCounter, 860 mSolverCounterSat, 176 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 756 SdHoareTripleChecker+Valid, 1216 SdHoareTripleChecker+Invalid, 1036 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 176 IncrementalHoareTripleChecker+Valid, 860 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-07 01:45:02,414 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [756 Valid, 1216 Invalid, 1036 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [176 Valid, 860 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-07 01:45:02,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2024-11-07 01:45:02,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 497. [2024-11-07 01:45:02,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 497 states, 404 states have (on average 1.4232673267326732) internal successors, (575), 413 states have internal predecessors, (575), 56 states have call successors, (56), 29 states have call predecessors, (56), 35 states have return successors, (69), 58 states have call predecessors, (69), 52 states have call successors, (69) [2024-11-07 01:45:02,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 497 states to 497 states and 700 transitions. [2024-11-07 01:45:02,461 INFO L78 Accepts]: Start accepts. Automaton has 497 states and 700 transitions. Word has length 65 [2024-11-07 01:45:02,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:45:02,461 INFO L471 AbstractCegarLoop]: Abstraction has 497 states and 700 transitions. [2024-11-07 01:45:02,462 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:02,462 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 700 transitions. [2024-11-07 01:45:02,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-07 01:45:02,464 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:45:02,465 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:02,465 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 01:45:02,465 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:45:02,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:45:02,465 INFO L85 PathProgramCache]: Analyzing trace with hash 2118930996, now seen corresponding path program 1 times [2024-11-07 01:45:02,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:45:02,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281042704] [2024-11-07 01:45:02,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:45:02,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:45:02,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:02,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:45:02,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:02,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-07 01:45:02,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:02,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 01:45:02,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:02,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 01:45:02,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:02,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 01:45:02,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:02,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 01:45:02,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:02,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 01:45:02,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:02,703 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:02,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:45:02,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281042704] [2024-11-07 01:45:02,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [281042704] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:45:02,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:45:02,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 01:45:02,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493137169] [2024-11-07 01:45:02,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:45:02,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 01:45:02,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:45:02,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 01:45:02,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-07 01:45:02,705 INFO L87 Difference]: Start difference. First operand 497 states and 700 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:03,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:45:03,725 INFO L93 Difference]: Finished difference Result 889 states and 1211 transitions. [2024-11-07 01:45:03,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-07 01:45:03,726 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:03,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:45:03,730 INFO L225 Difference]: With dead ends: 889 [2024-11-07 01:45:03,730 INFO L226 Difference]: Without dead ends: 604 [2024-11-07 01:45:03,731 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2024-11-07 01:45:03,732 INFO L432 NwaCegarLoop]: 250 mSDtfsCounter, 817 mSDsluCounter, 1042 mSDsCounter, 0 mSdLazyCounter, 1065 mSolverCounterSat, 122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 840 SdHoareTripleChecker+Valid, 1292 SdHoareTripleChecker+Invalid, 1187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 1065 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-07 01:45:03,732 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [840 Valid, 1292 Invalid, 1187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [122 Valid, 1065 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-07 01:45:03,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2024-11-07 01:45:03,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 509. [2024-11-07 01:45:03,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 509 states, 414 states have (on average 1.4130434782608696) internal successors, (585), 423 states have internal predecessors, (585), 57 states have call successors, (57), 30 states have call predecessors, (57), 36 states have return successors, (68), 59 states have call predecessors, (68), 53 states have call successors, (68) [2024-11-07 01:45:03,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 509 states and 710 transitions. [2024-11-07 01:45:03,771 INFO L78 Accepts]: Start accepts. Automaton has 509 states and 710 transitions. Word has length 65 [2024-11-07 01:45:03,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:45:03,771 INFO L471 AbstractCegarLoop]: Abstraction has 509 states and 710 transitions. [2024-11-07 01:45:03,771 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:03,772 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 710 transitions. [2024-11-07 01:45:03,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-07 01:45:03,773 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:45:03,773 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:03,773 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 01:45:03,774 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:45:03,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:45:03,774 INFO L85 PathProgramCache]: Analyzing trace with hash 1984917490, now seen corresponding path program 1 times [2024-11-07 01:45:03,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:45:03,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161077649] [2024-11-07 01:45:03,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:45:03,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:45:03,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:03,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:45:03,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:03,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-07 01:45:03,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:03,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 01:45:03,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:03,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 01:45:03,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:03,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 01:45:03,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:03,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 01:45:03,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:03,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 01:45:03,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:03,888 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:03,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:45:03,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161077649] [2024-11-07 01:45:03,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1161077649] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:45:03,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:45:03,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:45:03,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921005531] [2024-11-07 01:45:03,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:45:03,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:45:03,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:45:03,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:45:03,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:45:03,890 INFO L87 Difference]: Start difference. First operand 509 states and 710 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:04,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:45:04,576 INFO L93 Difference]: Finished difference Result 1151 states and 1557 transitions. [2024-11-07 01:45:04,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-07 01:45:04,576 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:04,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:45:04,585 INFO L225 Difference]: With dead ends: 1151 [2024-11-07 01:45:04,585 INFO L226 Difference]: Without dead ends: 855 [2024-11-07 01:45:04,587 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:04,589 INFO L432 NwaCegarLoop]: 234 mSDtfsCounter, 986 mSDsluCounter, 614 mSDsCounter, 0 mSdLazyCounter, 431 mSolverCounterSat, 164 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1010 SdHoareTripleChecker+Valid, 848 SdHoareTripleChecker+Invalid, 595 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 164 IncrementalHoareTripleChecker+Valid, 431 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-07 01:45:04,589 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1010 Valid, 848 Invalid, 595 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [164 Valid, 431 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-07 01:45:04,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 855 states. [2024-11-07 01:45:04,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 855 to 799. [2024-11-07 01:45:04,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 799 states, 638 states have (on average 1.3667711598746082) internal successors, (872), 654 states have internal predecessors, (872), 92 states have call successors, (92), 52 states have call predecessors, (92), 67 states have return successors, (125), 99 states have call predecessors, (125), 88 states have call successors, (125) [2024-11-07 01:45:04,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 799 states to 799 states and 1089 transitions. [2024-11-07 01:45:04,681 INFO L78 Accepts]: Start accepts. Automaton has 799 states and 1089 transitions. Word has length 65 [2024-11-07 01:45:04,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:45:04,682 INFO L471 AbstractCegarLoop]: Abstraction has 799 states and 1089 transitions. [2024-11-07 01:45:04,682 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:04,682 INFO L276 IsEmpty]: Start isEmpty. Operand 799 states and 1089 transitions. [2024-11-07 01:45:04,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-07 01:45:04,688 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:45:04,689 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:04,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 01:45:04,689 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:45:04,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:45:04,689 INFO L85 PathProgramCache]: Analyzing trace with hash 2085986588, now seen corresponding path program 1 times [2024-11-07 01:45:04,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:45:04,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349200438] [2024-11-07 01:45:04,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:45:04,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:45:04,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:04,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:45:04,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:04,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-07 01:45:04,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:04,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 01:45:04,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:04,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 01:45:04,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:04,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 01:45:04,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:04,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 01:45:04,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:04,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 01:45:04,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:04,793 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:04,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:45:04,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349200438] [2024-11-07 01:45:04,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349200438] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:45:04,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:45:04,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 01:45:04,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947702486] [2024-11-07 01:45:04,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:45:04,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 01:45:04,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:45:04,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 01:45:04,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-07 01:45:04,794 INFO L87 Difference]: Start difference. First operand 799 states and 1089 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:05,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:45:05,467 INFO L93 Difference]: Finished difference Result 2002 states and 2660 transitions. [2024-11-07 01:45:05,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 01:45:05,467 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:05,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:45:05,475 INFO L225 Difference]: With dead ends: 2002 [2024-11-07 01:45:05,475 INFO L226 Difference]: Without dead ends: 1395 [2024-11-07 01:45:05,477 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:05,478 INFO L432 NwaCegarLoop]: 250 mSDtfsCounter, 726 mSDsluCounter, 563 mSDsCounter, 0 mSdLazyCounter, 467 mSolverCounterSat, 158 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 734 SdHoareTripleChecker+Valid, 813 SdHoareTripleChecker+Invalid, 625 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 158 IncrementalHoareTripleChecker+Valid, 467 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-07 01:45:05,478 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [734 Valid, 813 Invalid, 625 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [158 Valid, 467 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-07 01:45:05,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1395 states. [2024-11-07 01:45:05,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1395 to 1280. [2024-11-07 01:45:05,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1280 states, 1017 states have (on average 1.3303834808259587) internal successors, (1353), 1036 states have internal predecessors, (1353), 137 states have call successors, (137), 96 states have call predecessors, (137), 124 states have return successors, (197), 154 states have call predecessors, (197), 133 states have call successors, (197) [2024-11-07 01:45:05,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1280 states to 1280 states and 1687 transitions. [2024-11-07 01:45:05,588 INFO L78 Accepts]: Start accepts. Automaton has 1280 states and 1687 transitions. Word has length 66 [2024-11-07 01:45:05,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:45:05,589 INFO L471 AbstractCegarLoop]: Abstraction has 1280 states and 1687 transitions. [2024-11-07 01:45:05,589 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:05,589 INFO L276 IsEmpty]: Start isEmpty. Operand 1280 states and 1687 transitions. [2024-11-07 01:45:05,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-07 01:45:05,591 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:45:05,591 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:45:05,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 01:45:05,591 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:45:05,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:45:05,592 INFO L85 PathProgramCache]: Analyzing trace with hash -750741049, now seen corresponding path program 1 times [2024-11-07 01:45:05,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:45:05,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258745657] [2024-11-07 01:45:05,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:45:05,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:45:05,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:05,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:45:05,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:05,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-07 01:45:05,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:05,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 01:45:05,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:05,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 01:45:05,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:05,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 01:45:05,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:05,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 01:45:05,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:05,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 01:45:05,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:05,670 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:05,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:45:05,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258745657] [2024-11-07 01:45:05,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [258745657] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:45:05,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:45:05,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 01:45:05,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937328128] [2024-11-07 01:45:05,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:45:05,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 01:45:05,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:45:05,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 01:45:05,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-07 01:45:05,672 INFO L87 Difference]: Start difference. First operand 1280 states and 1687 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:06,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:45:06,395 INFO L93 Difference]: Finished difference Result 3468 states and 4493 transitions. [2024-11-07 01:45:06,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-07 01:45:06,396 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:06,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:45:06,410 INFO L225 Difference]: With dead ends: 3468 [2024-11-07 01:45:06,411 INFO L226 Difference]: Without dead ends: 2400 [2024-11-07 01:45:06,415 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2024-11-07 01:45:06,415 INFO L432 NwaCegarLoop]: 251 mSDtfsCounter, 791 mSDsluCounter, 603 mSDsCounter, 0 mSdLazyCounter, 387 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 816 SdHoareTripleChecker+Valid, 854 SdHoareTripleChecker+Invalid, 498 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 387 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-07 01:45:06,416 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [816 Valid, 854 Invalid, 498 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 387 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-07 01:45:06,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2400 states. [2024-11-07 01:45:06,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2400 to 2142. [2024-11-07 01:45:06,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2142 states, 1683 states have (on average 1.2953060011883542) internal successors, (2180), 1712 states have internal predecessors, (2180), 235 states have call successors, (235), 180 states have call predecessors, (235), 222 states have return successors, (333), 256 states have call predecessors, (333), 231 states have call successors, (333) [2024-11-07 01:45:06,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2142 states to 2142 states and 2748 transitions. [2024-11-07 01:45:06,630 INFO L78 Accepts]: Start accepts. Automaton has 2142 states and 2748 transitions. Word has length 66 [2024-11-07 01:45:06,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:45:06,630 INFO L471 AbstractCegarLoop]: Abstraction has 2142 states and 2748 transitions. [2024-11-07 01:45:06,631 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:06,631 INFO L276 IsEmpty]: Start isEmpty. Operand 2142 states and 2748 transitions. [2024-11-07 01:45:06,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-07 01:45:06,633 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:45:06,633 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:45:06,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-07 01:45:06,633 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:45:06,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:45:06,634 INFO L85 PathProgramCache]: Analyzing trace with hash 1699431707, now seen corresponding path program 1 times [2024-11-07 01:45:06,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:45:06,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273371998] [2024-11-07 01:45:06,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:45:06,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:45:06,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:06,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:45:06,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:06,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-07 01:45:06,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:06,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 01:45:06,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:06,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 01:45:06,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:06,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 01:45:06,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:06,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 01:45:06,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:06,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 01:45:06,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:06,740 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:06,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:45:06,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273371998] [2024-11-07 01:45:06,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273371998] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:45:06,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:45:06,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 01:45:06,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437272514] [2024-11-07 01:45:06,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:45:06,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 01:45:06,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:45:06,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 01:45:06,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-07 01:45:06,742 INFO L87 Difference]: Start difference. First operand 2142 states and 2748 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 3 states have internal predecessors, (57), 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:07,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:45:07,384 INFO L93 Difference]: Finished difference Result 5052 states and 6398 transitions. [2024-11-07 01:45:07,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 01:45:07,385 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 3 states have internal predecessors, (57), 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 72 [2024-11-07 01:45:07,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:45:07,402 INFO L225 Difference]: With dead ends: 5052 [2024-11-07 01:45:07,402 INFO L226 Difference]: Without dead ends: 3122 [2024-11-07 01:45:07,407 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:07,407 INFO L432 NwaCegarLoop]: 265 mSDtfsCounter, 776 mSDsluCounter, 635 mSDsCounter, 0 mSdLazyCounter, 393 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 801 SdHoareTripleChecker+Valid, 900 SdHoareTripleChecker+Invalid, 495 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 393 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 01:45:07,408 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [801 Valid, 900 Invalid, 495 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 393 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 01:45:07,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3122 states. [2024-11-07 01:45:07,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3122 to 2874. [2024-11-07 01:45:07,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2874 states, 2251 states have (on average 1.281208351843625) internal successors, (2884), 2288 states have internal predecessors, (2884), 315 states have call successors, (315), 250 states have call predecessors, (315), 306 states have return successors, (442), 342 states have call predecessors, (442), 311 states have call successors, (442) [2024-11-07 01:45:07,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2874 states to 2874 states and 3641 transitions. [2024-11-07 01:45:07,659 INFO L78 Accepts]: Start accepts. Automaton has 2874 states and 3641 transitions. Word has length 72 [2024-11-07 01:45:07,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:45:07,659 INFO L471 AbstractCegarLoop]: Abstraction has 2874 states and 3641 transitions. [2024-11-07 01:45:07,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 3 states have internal predecessors, (57), 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:07,660 INFO L276 IsEmpty]: Start isEmpty. Operand 2874 states and 3641 transitions. [2024-11-07 01:45:07,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-07 01:45:07,663 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:45:07,663 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:07,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-07 01:45:07,663 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:45:07,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:45:07,664 INFO L85 PathProgramCache]: Analyzing trace with hash 626400016, now seen corresponding path program 1 times [2024-11-07 01:45:07,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:45:07,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665837007] [2024-11-07 01:45:07,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:45:07,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:45:07,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:07,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:45:07,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:07,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-07 01:45:07,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:07,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 01:45:07,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:07,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 01:45:07,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:07,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 01:45:07,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:07,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 01:45:07,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:07,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 01:45:07,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:07,795 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:07,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:45:07,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665837007] [2024-11-07 01:45:07,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665837007] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:45:07,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:45:07,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:45:07,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031938137] [2024-11-07 01:45:07,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:45:07,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:45:07,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:45:07,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:45:07,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:45:07,796 INFO L87 Difference]: Start difference. First operand 2874 states and 3641 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:08,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:45:08,589 INFO L93 Difference]: Finished difference Result 3648 states and 4572 transitions. [2024-11-07 01:45:08,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-07 01:45:08,590 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:08,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:45:08,610 INFO L225 Difference]: With dead ends: 3648 [2024-11-07 01:45:08,611 INFO L226 Difference]: Without dead ends: 3645 [2024-11-07 01:45:08,613 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:08,615 INFO L432 NwaCegarLoop]: 258 mSDtfsCounter, 1196 mSDsluCounter, 616 mSDsCounter, 0 mSdLazyCounter, 408 mSolverCounterSat, 238 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1206 SdHoareTripleChecker+Valid, 874 SdHoareTripleChecker+Invalid, 646 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 238 IncrementalHoareTripleChecker+Valid, 408 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-07 01:45:08,616 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1206 Valid, 874 Invalid, 646 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [238 Valid, 408 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-07 01:45:08,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3645 states. [2024-11-07 01:45:08,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3645 to 3368. [2024-11-07 01:45:08,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3368 states, 2636 states have (on average 1.2731411229135052) internal successors, (3356), 2678 states have internal predecessors, (3356), 365 states have call successors, (365), 294 states have call predecessors, (365), 365 states have return successors, (521), 402 states have call predecessors, (521), 362 states have call successors, (521) [2024-11-07 01:45:08,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3368 states to 3368 states and 4242 transitions. [2024-11-07 01:45:08,893 INFO L78 Accepts]: Start accepts. Automaton has 3368 states and 4242 transitions. Word has length 73 [2024-11-07 01:45:08,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:45:08,894 INFO L471 AbstractCegarLoop]: Abstraction has 3368 states and 4242 transitions. [2024-11-07 01:45:08,894 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:08,895 INFO L276 IsEmpty]: Start isEmpty. Operand 3368 states and 4242 transitions. [2024-11-07 01:45:08,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-07 01:45:08,896 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:45:08,896 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:08,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-07 01:45:08,897 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:45:08,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:45:08,897 INFO L85 PathProgramCache]: Analyzing trace with hash -2057315323, now seen corresponding path program 1 times [2024-11-07 01:45:08,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:45:08,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950273105] [2024-11-07 01:45:08,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:45:08,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:45:08,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:09,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:45:09,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:09,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-07 01:45:09,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:09,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 01:45:09,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:09,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 01:45:09,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:09,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 01:45:09,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:09,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 01:45:09,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:09,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 01:45:09,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:09,088 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:09,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:45:09,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950273105] [2024-11-07 01:45:09,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [950273105] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 01:45:09,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [917959210] [2024-11-07 01:45:09,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:45:09,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 01:45:09,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 01:45:09,093 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:09,095 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:09,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:09,199 INFO L255 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-07 01:45:09,211 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 01:45:09,510 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:09,510 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 01:45:09,621 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:09,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [917959210] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 01:45:09,621 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 01:45:09,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 4] total 10 [2024-11-07 01:45:09,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308009381] [2024-11-07 01:45:09,622 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 01:45:09,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-07 01:45:09,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:45:09,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-07 01:45:09,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-07 01:45:09,623 INFO L87 Difference]: Start difference. First operand 3368 states and 4242 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:11,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:45:11,578 INFO L93 Difference]: Finished difference Result 7809 states and 9728 transitions. [2024-11-07 01:45:11,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-11-07 01:45:11,579 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:11,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:45:11,613 INFO L225 Difference]: With dead ends: 7809 [2024-11-07 01:45:11,613 INFO L226 Difference]: Without dead ends: 7806 [2024-11-07 01:45:11,618 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:11,618 INFO L432 NwaCegarLoop]: 342 mSDtfsCounter, 1555 mSDsluCounter, 1103 mSDsCounter, 0 mSdLazyCounter, 1358 mSolverCounterSat, 221 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1619 SdHoareTripleChecker+Valid, 1445 SdHoareTripleChecker+Invalid, 1579 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 221 IncrementalHoareTripleChecker+Valid, 1358 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-07 01:45:11,618 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1619 Valid, 1445 Invalid, 1579 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [221 Valid, 1358 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-07 01:45:11,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7806 states. [2024-11-07 01:45:12,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7806 to 5158. [2024-11-07 01:45:12,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5158 states, 4040 states have (on average 1.2702970297029703) internal successors, (5132), 4104 states have internal predecessors, (5132), 549 states have call successors, (549), 452 states have call predecessors, (549), 567 states have return successors, (799), 608 states have call predecessors, (799), 546 states have call successors, (799) [2024-11-07 01:45:12,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5158 states to 5158 states and 6480 transitions. [2024-11-07 01:45:12,122 INFO L78 Accepts]: Start accepts. Automaton has 5158 states and 6480 transitions. Word has length 74 [2024-11-07 01:45:12,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:45:12,123 INFO L471 AbstractCegarLoop]: Abstraction has 5158 states and 6480 transitions. [2024-11-07 01:45:12,123 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:12,123 INFO L276 IsEmpty]: Start isEmpty. Operand 5158 states and 6480 transitions. [2024-11-07 01:45:12,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-07 01:45:12,125 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:45:12,126 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:12,148 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-07 01:45:12,330 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,SelfDestructingSolverStorable10 [2024-11-07 01:45:12,331 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:45:12,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:45:12,332 INFO L85 PathProgramCache]: Analyzing trace with hash -1368954160, now seen corresponding path program 2 times [2024-11-07 01:45:12,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:45:12,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041774556] [2024-11-07 01:45:12,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:45:12,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:45:12,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:12,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:45:12,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:12,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-07 01:45:12,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:12,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 01:45:12,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:12,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 01:45:12,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:12,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 01:45:12,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:12,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 01:45:12,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:12,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 01:45:12,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:12,401 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:12,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:45:12,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041774556] [2024-11-07 01:45:12,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041774556] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:45:12,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:45:12,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 01:45:12,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258256436] [2024-11-07 01:45:12,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:45:12,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 01:45:12,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:45:12,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 01:45:12,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-07 01:45:12,403 INFO L87 Difference]: Start difference. First operand 5158 states and 6480 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:13,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:45:13,170 INFO L93 Difference]: Finished difference Result 7840 states and 9853 transitions. [2024-11-07 01:45:13,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 01:45:13,171 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:13,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:45:13,191 INFO L225 Difference]: With dead ends: 7840 [2024-11-07 01:45:13,191 INFO L226 Difference]: Without dead ends: 3765 [2024-11-07 01:45:13,202 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:13,203 INFO L432 NwaCegarLoop]: 292 mSDtfsCounter, 856 mSDsluCounter, 478 mSDsCounter, 0 mSdLazyCounter, 413 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 884 SdHoareTripleChecker+Valid, 770 SdHoareTripleChecker+Invalid, 536 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 413 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 01:45:13,203 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [884 Valid, 770 Invalid, 536 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 413 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 01:45:13,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3765 states. [2024-11-07 01:45:13,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3765 to 3530. [2024-11-07 01:45:13,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3530 states, 2768 states have (on average 1.254335260115607) internal successors, (3472), 2810 states have internal predecessors, (3472), 381 states have call successors, (381), 308 states have call predecessors, (381), 379 states have return successors, (525), 418 states have call predecessors, (525), 378 states have call successors, (525) [2024-11-07 01:45:13,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3530 states to 3530 states and 4378 transitions. [2024-11-07 01:45:13,544 INFO L78 Accepts]: Start accepts. Automaton has 3530 states and 4378 transitions. Word has length 77 [2024-11-07 01:45:13,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:45:13,544 INFO L471 AbstractCegarLoop]: Abstraction has 3530 states and 4378 transitions. [2024-11-07 01:45:13,545 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:13,545 INFO L276 IsEmpty]: Start isEmpty. Operand 3530 states and 4378 transitions. [2024-11-07 01:45:13,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-07 01:45:13,548 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:45:13,548 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:13,548 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-07 01:45:13,548 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:45:13,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:45:13,549 INFO L85 PathProgramCache]: Analyzing trace with hash 255750743, now seen corresponding path program 1 times [2024-11-07 01:45:13,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:45:13,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355275907] [2024-11-07 01:45:13,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:45:13,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:45:13,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:13,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:45:13,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:13,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-07 01:45:13,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:13,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 01:45:13,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:13,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 01:45:13,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:13,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 01:45:13,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:13,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 01:45:13,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:13,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 01:45:13,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:13,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-07 01:45:13,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:13,675 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:13,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:45:13,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355275907] [2024-11-07 01:45:13,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1355275907] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:45:13,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:45:13,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 01:45:13,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163116824] [2024-11-07 01:45:13,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:45:13,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 01:45:13,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:45:13,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 01:45:13,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-07 01:45:13,678 INFO L87 Difference]: Start difference. First operand 3530 states and 4378 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:15,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:45:15,175 INFO L93 Difference]: Finished difference Result 10402 states and 12795 transitions. [2024-11-07 01:45:15,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-07 01:45:15,175 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:15,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:45:15,204 INFO L225 Difference]: With dead ends: 10402 [2024-11-07 01:45:15,204 INFO L226 Difference]: Without dead ends: 5765 [2024-11-07 01:45:15,221 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:15,222 INFO L432 NwaCegarLoop]: 271 mSDtfsCounter, 969 mSDsluCounter, 1076 mSDsCounter, 0 mSdLazyCounter, 916 mSolverCounterSat, 227 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 986 SdHoareTripleChecker+Valid, 1347 SdHoareTripleChecker+Invalid, 1143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 227 IncrementalHoareTripleChecker+Valid, 916 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-07 01:45:15,222 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [986 Valid, 1347 Invalid, 1143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [227 Valid, 916 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-07 01:45:15,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5765 states. [2024-11-07 01:45:15,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5765 to 5445. [2024-11-07 01:45:15,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5445 states, 4226 states have (on average 1.2292948414576432) internal successors, (5195), 4311 states have internal predecessors, (5195), 585 states have call successors, (585), 482 states have call predecessors, (585), 632 states have return successors, (907), 658 states have call predecessors, (907), 582 states have call successors, (907) [2024-11-07 01:45:15,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5445 states to 5445 states and 6687 transitions. [2024-11-07 01:45:15,733 INFO L78 Accepts]: Start accepts. Automaton has 5445 states and 6687 transitions. Word has length 84 [2024-11-07 01:45:15,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:45:15,734 INFO L471 AbstractCegarLoop]: Abstraction has 5445 states and 6687 transitions. [2024-11-07 01:45:15,734 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:15,734 INFO L276 IsEmpty]: Start isEmpty. Operand 5445 states and 6687 transitions. [2024-11-07 01:45:15,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-07 01:45:15,739 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:45:15,740 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:15,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-07 01:45:15,740 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:45:15,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:45:15,740 INFO L85 PathProgramCache]: Analyzing trace with hash 430266766, now seen corresponding path program 1 times [2024-11-07 01:45:15,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:45:15,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298035928] [2024-11-07 01:45:15,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:45:15,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:45:15,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:15,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:45:15,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:15,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-07 01:45:15,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:15,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 01:45:15,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:15,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 01:45:15,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:15,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 01:45:15,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:15,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 01:45:15,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:15,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 01:45:15,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:15,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-07 01:45:15,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:15,894 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:15,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:45:15,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298035928] [2024-11-07 01:45:15,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [298035928] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:45:15,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:45:15,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-07 01:45:15,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120722011] [2024-11-07 01:45:15,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:45:15,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 01:45:15,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:45:15,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 01:45:15,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-07 01:45:15,896 INFO L87 Difference]: Start difference. First operand 5445 states and 6687 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:17,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:45:17,385 INFO L93 Difference]: Finished difference Result 9448 states and 11527 transitions. [2024-11-07 01:45:17,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-07 01:45:17,385 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:17,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:45:17,414 INFO L225 Difference]: With dead ends: 9448 [2024-11-07 01:45:17,414 INFO L226 Difference]: Without dead ends: 4855 [2024-11-07 01:45:17,425 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:17,426 INFO L432 NwaCegarLoop]: 263 mSDtfsCounter, 1931 mSDsluCounter, 902 mSDsCounter, 0 mSdLazyCounter, 1019 mSolverCounterSat, 443 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1973 SdHoareTripleChecker+Valid, 1165 SdHoareTripleChecker+Invalid, 1462 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 443 IncrementalHoareTripleChecker+Valid, 1019 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-07 01:45:17,427 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1973 Valid, 1165 Invalid, 1462 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [443 Valid, 1019 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-07 01:45:17,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4855 states. [2024-11-07 01:45:17,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4855 to 4521. [2024-11-07 01:45:17,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4521 states, 3515 states have (on average 1.2216216216216216) internal successors, (4294), 3582 states have internal predecessors, (4294), 486 states have call successors, (486), 397 states have call predecessors, (486), 518 states have return successors, (685), 548 states have call predecessors, (685), 483 states have call successors, (685) [2024-11-07 01:45:17,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4521 states to 4521 states and 5465 transitions. [2024-11-07 01:45:17,883 INFO L78 Accepts]: Start accepts. Automaton has 4521 states and 5465 transitions. Word has length 93 [2024-11-07 01:45:17,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:45:17,884 INFO L471 AbstractCegarLoop]: Abstraction has 4521 states and 5465 transitions. [2024-11-07 01:45:17,884 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:45:17,884 INFO L276 IsEmpty]: Start isEmpty. Operand 4521 states and 5465 transitions. [2024-11-07 01:45:17,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-07 01:45:17,887 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:45:17,888 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] [2024-11-07 01:45:17,888 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-07 01:45:17,888 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:45:17,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:45:17,888 INFO L85 PathProgramCache]: Analyzing trace with hash 196053049, now seen corresponding path program 1 times [2024-11-07 01:45:17,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:45:17,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868084691] [2024-11-07 01:45:17,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:45:17,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:45:17,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:17,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:45:17,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:17,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-07 01:45:17,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:17,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 01:45:18,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:18,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 01:45:18,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:18,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 01:45:18,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:18,018 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:18,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:45:18,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868084691] [2024-11-07 01:45:18,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868084691] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:45:18,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:45:18,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 01:45:18,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009709838] [2024-11-07 01:45:18,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:45:18,021 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 01:45:18,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:45:18,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 01:45:18,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 01:45:18,022 INFO L87 Difference]: Start difference. First operand 4521 states and 5465 transitions. Second operand has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 4 states have internal predecessors, (80), 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:45:19,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:45:19,750 INFO L93 Difference]: Finished difference Result 4985 states and 6186 transitions. [2024-11-07 01:45:19,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 01:45:19,751 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 4 states have internal predecessors, (80), 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 91 [2024-11-07 01:45:19,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:45:19,772 INFO L225 Difference]: With dead ends: 4985 [2024-11-07 01:45:19,772 INFO L226 Difference]: Without dead ends: 4808 [2024-11-07 01:45:19,776 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-11-07 01:45:19,777 INFO L432 NwaCegarLoop]: 234 mSDtfsCounter, 885 mSDsluCounter, 659 mSDsCounter, 0 mSdLazyCounter, 1081 mSolverCounterSat, 118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 906 SdHoareTripleChecker+Valid, 893 SdHoareTripleChecker+Invalid, 1199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 1081 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-07 01:45:19,777 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [906 Valid, 893 Invalid, 1199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [118 Valid, 1081 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-07 01:45:19,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4808 states. [2024-11-07 01:45:20,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4808 to 4699. [2024-11-07 01:45:20,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4699 states, 3673 states have (on average 1.2352300571739723) internal successors, (4537), 3741 states have internal predecessors, (4537), 499 states have call successors, (499), 403 states have call predecessors, (499), 525 states have return successors, (701), 561 states have call predecessors, (701), 496 states have call successors, (701) [2024-11-07 01:45:20,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4699 states to 4699 states and 5737 transitions. [2024-11-07 01:45:20,414 INFO L78 Accepts]: Start accepts. Automaton has 4699 states and 5737 transitions. Word has length 91 [2024-11-07 01:45:20,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:45:20,414 INFO L471 AbstractCegarLoop]: Abstraction has 4699 states and 5737 transitions. [2024-11-07 01:45:20,415 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 4 states have internal predecessors, (80), 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:45:20,415 INFO L276 IsEmpty]: Start isEmpty. Operand 4699 states and 5737 transitions. [2024-11-07 01:45:20,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-07 01:45:20,419 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:45:20,419 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] [2024-11-07 01:45:20,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-07 01:45:20,419 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:45:20,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:45:20,420 INFO L85 PathProgramCache]: Analyzing trace with hash -1858651595, now seen corresponding path program 1 times [2024-11-07 01:45:20,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:45:20,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094101014] [2024-11-07 01:45:20,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:45:20,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:45:20,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:20,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:45:20,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:20,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-07 01:45:20,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:20,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 01:45:20,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:20,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 01:45:20,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:20,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 01:45:20,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:20,589 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:20,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:45:20,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094101014] [2024-11-07 01:45:20,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1094101014] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:45:20,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:45:20,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:45:20,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929050432] [2024-11-07 01:45:20,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:45:20,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:45:20,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:45:20,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:45:20,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:45:20,592 INFO L87 Difference]: Start difference. First operand 4699 states and 5737 transitions. Second operand has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 5 states have internal predecessors, (80), 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:45:22,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:45:22,444 INFO L93 Difference]: Finished difference Result 5398 states and 6818 transitions. [2024-11-07 01:45:22,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 01:45:22,444 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 5 states have internal predecessors, (80), 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 91 [2024-11-07 01:45:22,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:45:22,467 INFO L225 Difference]: With dead ends: 5398 [2024-11-07 01:45:22,468 INFO L226 Difference]: Without dead ends: 5043 [2024-11-07 01:45:22,471 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-07 01:45:22,473 INFO L432 NwaCegarLoop]: 266 mSDtfsCounter, 923 mSDsluCounter, 887 mSDsCounter, 0 mSdLazyCounter, 1573 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 944 SdHoareTripleChecker+Valid, 1153 SdHoareTripleChecker+Invalid, 1676 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 1573 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-07 01:45:22,473 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [944 Valid, 1153 Invalid, 1676 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 1573 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-07 01:45:22,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5043 states. [2024-11-07 01:45:23,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5043 to 4866. [2024-11-07 01:45:23,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4866 states, 3820 states have (on average 1.2455497382198952) internal successors, (4758), 3889 states have internal predecessors, (4758), 512 states have call successors, (512), 409 states have call predecessors, (512), 532 states have return successors, (716), 575 states have call predecessors, (716), 509 states have call successors, (716) [2024-11-07 01:45:23,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4866 states to 4866 states and 5986 transitions. [2024-11-07 01:45:23,116 INFO L78 Accepts]: Start accepts. Automaton has 4866 states and 5986 transitions. Word has length 91 [2024-11-07 01:45:23,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:45:23,117 INFO L471 AbstractCegarLoop]: Abstraction has 4866 states and 5986 transitions. [2024-11-07 01:45:23,117 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 5 states have internal predecessors, (80), 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:45:23,117 INFO L276 IsEmpty]: Start isEmpty. Operand 4866 states and 5986 transitions. [2024-11-07 01:45:23,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-07 01:45:23,122 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:45:23,122 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] [2024-11-07 01:45:23,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-07 01:45:23,122 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:45:23,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:45:23,123 INFO L85 PathProgramCache]: Analyzing trace with hash -124547145, now seen corresponding path program 1 times [2024-11-07 01:45:23,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:45:23,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085994499] [2024-11-07 01:45:23,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:45:23,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:45:23,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:23,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:45:23,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:23,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-07 01:45:23,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:23,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 01:45:23,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:23,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 01:45:23,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:23,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 01:45:23,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:23,284 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:23,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:45:23,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085994499] [2024-11-07 01:45:23,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085994499] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:45:23,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:45:23,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:45:23,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697658052] [2024-11-07 01:45:23,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:45:23,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:45:23,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:45:23,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:45:23,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:45:23,287 INFO L87 Difference]: Start difference. First operand 4866 states and 5986 transitions. Second operand has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 5 states have internal predecessors, (80), 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:45:25,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:45:25,369 INFO L93 Difference]: Finished difference Result 6006 states and 7745 transitions. [2024-11-07 01:45:25,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 01:45:25,369 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 5 states have internal predecessors, (80), 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 91 [2024-11-07 01:45:25,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:45:25,395 INFO L225 Difference]: With dead ends: 6006 [2024-11-07 01:45:25,396 INFO L226 Difference]: Without dead ends: 5484 [2024-11-07 01:45:25,400 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-07 01:45:25,401 INFO L432 NwaCegarLoop]: 358 mSDtfsCounter, 890 mSDsluCounter, 1191 mSDsCounter, 0 mSdLazyCounter, 1712 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 911 SdHoareTripleChecker+Valid, 1549 SdHoareTripleChecker+Invalid, 1797 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 1712 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-07 01:45:25,401 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [911 Valid, 1549 Invalid, 1797 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 1712 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-07 01:45:25,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5484 states. [2024-11-07 01:45:25,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5484 to 5201. [2024-11-07 01:45:25,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5201 states, 4115 states have (on average 1.2639125151883353) internal successors, (5201), 4186 states have internal predecessors, (5201), 538 states have call successors, (538), 421 states have call predecessors, (538), 546 states have return successors, (750), 603 states have call predecessors, (750), 535 states have call successors, (750) [2024-11-07 01:45:25,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5201 states to 5201 states and 6489 transitions. [2024-11-07 01:45:26,001 INFO L78 Accepts]: Start accepts. Automaton has 5201 states and 6489 transitions. Word has length 91 [2024-11-07 01:45:26,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:45:26,001 INFO L471 AbstractCegarLoop]: Abstraction has 5201 states and 6489 transitions. [2024-11-07 01:45:26,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 5 states have internal predecessors, (80), 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:45:26,002 INFO L276 IsEmpty]: Start isEmpty. Operand 5201 states and 6489 transitions. [2024-11-07 01:45:26,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-07 01:45:26,005 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:45:26,005 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] [2024-11-07 01:45:26,005 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-07 01:45:26,005 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:45:26,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:45:26,006 INFO L85 PathProgramCache]: Analyzing trace with hash 762675701, now seen corresponding path program 1 times [2024-11-07 01:45:26,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:45:26,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320272445] [2024-11-07 01:45:26,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:45:26,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:45:26,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:26,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:45:26,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:26,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-07 01:45:26,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:26,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 01:45:26,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:26,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 01:45:26,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:26,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 01:45:26,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:26,116 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:26,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:45:26,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320272445] [2024-11-07 01:45:26,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320272445] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:45:26,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:45:26,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:45:26,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687763767] [2024-11-07 01:45:26,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:45:26,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:45:26,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:45:26,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:45:26,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:45:26,118 INFO L87 Difference]: Start difference. First operand 5201 states and 6489 transitions. Second operand has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 5 states have internal predecessors, (80), 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:45:27,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:45:27,586 INFO L93 Difference]: Finished difference Result 6329 states and 8239 transitions. [2024-11-07 01:45:27,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 01:45:27,587 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 5 states have internal predecessors, (80), 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 91 [2024-11-07 01:45:27,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:45:27,604 INFO L225 Difference]: With dead ends: 6329 [2024-11-07 01:45:27,604 INFO L226 Difference]: Without dead ends: 5472 [2024-11-07 01:45:27,608 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-11-07 01:45:27,609 INFO L432 NwaCegarLoop]: 219 mSDtfsCounter, 723 mSDsluCounter, 690 mSDsCounter, 0 mSdLazyCounter, 917 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 745 SdHoareTripleChecker+Valid, 909 SdHoareTripleChecker+Invalid, 1004 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 917 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-07 01:45:27,609 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [745 Valid, 909 Invalid, 1004 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 917 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-07 01:45:27,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5472 states. [2024-11-07 01:45:28,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5472 to 5201. [2024-11-07 01:45:28,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5201 states, 4115 states have (on average 1.2626974483596598) internal successors, (5196), 4186 states have internal predecessors, (5196), 538 states have call successors, (538), 421 states have call predecessors, (538), 546 states have return successors, (750), 603 states have call predecessors, (750), 535 states have call successors, (750) [2024-11-07 01:45:28,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5201 states to 5201 states and 6484 transitions. [2024-11-07 01:45:28,278 INFO L78 Accepts]: Start accepts. Automaton has 5201 states and 6484 transitions. Word has length 91 [2024-11-07 01:45:28,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:45:28,278 INFO L471 AbstractCegarLoop]: Abstraction has 5201 states and 6484 transitions. [2024-11-07 01:45:28,278 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 5 states have internal predecessors, (80), 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:45:28,278 INFO L276 IsEmpty]: Start isEmpty. Operand 5201 states and 6484 transitions. [2024-11-07 01:45:28,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-07 01:45:28,282 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:45:28,282 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] [2024-11-07 01:45:28,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-07 01:45:28,282 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:45:28,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:45:28,283 INFO L85 PathProgramCache]: Analyzing trace with hash -1148366857, now seen corresponding path program 1 times [2024-11-07 01:45:28,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:45:28,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210538441] [2024-11-07 01:45:28,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:45:28,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:45:28,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:28,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:45:28,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:28,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-07 01:45:28,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:28,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 01:45:28,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:28,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 01:45:28,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:28,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 01:45:28,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:28,409 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:28,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:45:28,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210538441] [2024-11-07 01:45:28,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210538441] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:45:28,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:45:28,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:45:28,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450172381] [2024-11-07 01:45:28,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:45:28,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:45:28,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:45:28,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:45:28,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:45:28,411 INFO L87 Difference]: Start difference. First operand 5201 states and 6484 transitions. Second operand has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 5 states have internal predecessors, (80), 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:45:30,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:45:30,237 INFO L93 Difference]: Finished difference Result 7174 states and 9496 transitions. [2024-11-07 01:45:30,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 01:45:30,238 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 5 states have internal predecessors, (80), 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 91 [2024-11-07 01:45:30,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:45:30,261 INFO L225 Difference]: With dead ends: 7174 [2024-11-07 01:45:30,261 INFO L226 Difference]: Without dead ends: 6317 [2024-11-07 01:45:30,266 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-07 01:45:30,267 INFO L432 NwaCegarLoop]: 358 mSDtfsCounter, 880 mSDsluCounter, 1191 mSDsCounter, 0 mSdLazyCounter, 1680 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 901 SdHoareTripleChecker+Valid, 1549 SdHoareTripleChecker+Invalid, 1765 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 1680 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-07 01:45:30,267 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [901 Valid, 1549 Invalid, 1765 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 1680 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-07 01:45:30,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6317 states. [2024-11-07 01:45:31,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6317 to 5876. [2024-11-07 01:45:31,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5876 states, 4710 states have (on average 1.291507430997877) internal successors, (6083), 4785 states have internal predecessors, (6083), 590 states have call successors, (590), 445 states have call predecessors, (590), 574 states have return successors, (824), 659 states have call predecessors, (824), 587 states have call successors, (824) [2024-11-07 01:45:31,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5876 states to 5876 states and 7497 transitions. [2024-11-07 01:45:31,147 INFO L78 Accepts]: Start accepts. Automaton has 5876 states and 7497 transitions. Word has length 91 [2024-11-07 01:45:31,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:45:31,147 INFO L471 AbstractCegarLoop]: Abstraction has 5876 states and 7497 transitions. [2024-11-07 01:45:31,147 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 5 states have internal predecessors, (80), 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:45:31,147 INFO L276 IsEmpty]: Start isEmpty. Operand 5876 states and 7497 transitions. [2024-11-07 01:45:31,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-07 01:45:31,151 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:45:31,152 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] [2024-11-07 01:45:31,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-07 01:45:31,152 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:45:31,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:45:31,153 INFO L85 PathProgramCache]: Analyzing trace with hash -1071466059, now seen corresponding path program 1 times [2024-11-07 01:45:31,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:45:31,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457700110] [2024-11-07 01:45:31,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:45:31,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:45:31,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:31,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:45:31,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:31,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-07 01:45:31,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:31,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 01:45:31,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:31,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 01:45:31,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:31,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 01:45:31,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:31,271 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:31,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:45:31,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457700110] [2024-11-07 01:45:31,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457700110] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:45:31,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:45:31,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:45:31,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967890933] [2024-11-07 01:45:31,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:45:31,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:45:31,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:45:31,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:45:31,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:45:31,273 INFO L87 Difference]: Start difference. First operand 5876 states and 7497 transitions. Second operand has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 5 states have internal predecessors, (80), 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:45:32,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:45:32,643 INFO L93 Difference]: Finished difference Result 7837 states and 10513 transitions. [2024-11-07 01:45:32,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 01:45:32,644 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 5 states have internal predecessors, (80), 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 91 [2024-11-07 01:45:32,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:45:32,669 INFO L225 Difference]: With dead ends: 7837 [2024-11-07 01:45:32,669 INFO L226 Difference]: Without dead ends: 6305 [2024-11-07 01:45:32,676 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-11-07 01:45:32,677 INFO L432 NwaCegarLoop]: 219 mSDtfsCounter, 724 mSDsluCounter, 688 mSDsCounter, 0 mSdLazyCounter, 880 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 746 SdHoareTripleChecker+Valid, 907 SdHoareTripleChecker+Invalid, 969 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 880 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-07 01:45:32,677 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [746 Valid, 907 Invalid, 969 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 880 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-07 01:45:32,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6305 states. [2024-11-07 01:45:33,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6305 to 5876. [2024-11-07 01:45:33,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5876 states, 4710 states have (on average 1.289596602972399) internal successors, (6074), 4785 states have internal predecessors, (6074), 590 states have call successors, (590), 445 states have call predecessors, (590), 574 states have return successors, (824), 659 states have call predecessors, (824), 587 states have call successors, (824) [2024-11-07 01:45:33,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5876 states to 5876 states and 7488 transitions. [2024-11-07 01:45:33,390 INFO L78 Accepts]: Start accepts. Automaton has 5876 states and 7488 transitions. Word has length 91 [2024-11-07 01:45:33,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:45:33,390 INFO L471 AbstractCegarLoop]: Abstraction has 5876 states and 7488 transitions. [2024-11-07 01:45:33,390 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 5 states have internal predecessors, (80), 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:45:33,390 INFO L276 IsEmpty]: Start isEmpty. Operand 5876 states and 7488 transitions. [2024-11-07 01:45:33,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-07 01:45:33,394 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:45:33,394 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] [2024-11-07 01:45:33,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-07 01:45:33,394 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:45:33,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:45:33,395 INFO L85 PathProgramCache]: Analyzing trace with hash 836991731, now seen corresponding path program 1 times [2024-11-07 01:45:33,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:45:33,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730512297] [2024-11-07 01:45:33,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:45:33,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:45:33,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:33,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:45:33,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:33,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-07 01:45:33,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:33,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 01:45:33,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:33,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 01:45:33,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:33,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 01:45:33,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:33,504 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:33,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:45:33,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730512297] [2024-11-07 01:45:33,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730512297] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:45:33,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:45:33,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:45:33,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471426975] [2024-11-07 01:45:33,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:45:33,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:45:33,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:45:33,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:45:33,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:45:33,506 INFO L87 Difference]: Start difference. First operand 5876 states and 7488 transitions. Second operand has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 5 states have internal predecessors, (80), 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:45:34,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:45:34,713 INFO L93 Difference]: Finished difference Result 7827 states and 10466 transitions. [2024-11-07 01:45:34,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 01:45:34,714 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 5 states have internal predecessors, (80), 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 91 [2024-11-07 01:45:34,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:45:34,734 INFO L225 Difference]: With dead ends: 7827 [2024-11-07 01:45:34,734 INFO L226 Difference]: Without dead ends: 6295 [2024-11-07 01:45:34,740 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-11-07 01:45:34,741 INFO L432 NwaCegarLoop]: 219 mSDtfsCounter, 845 mSDsluCounter, 530 mSDsCounter, 0 mSdLazyCounter, 786 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 867 SdHoareTripleChecker+Valid, 749 SdHoareTripleChecker+Invalid, 910 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 786 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-07 01:45:34,741 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [867 Valid, 749 Invalid, 910 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 786 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-07 01:45:34,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6295 states. [2024-11-07 01:45:35,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6295 to 5876. [2024-11-07 01:45:35,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5876 states, 4710 states have (on average 1.2876857749469215) internal successors, (6065), 4785 states have internal predecessors, (6065), 590 states have call successors, (590), 445 states have call predecessors, (590), 574 states have return successors, (824), 659 states have call predecessors, (824), 587 states have call successors, (824) [2024-11-07 01:45:35,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5876 states to 5876 states and 7479 transitions. [2024-11-07 01:45:35,533 INFO L78 Accepts]: Start accepts. Automaton has 5876 states and 7479 transitions. Word has length 91 [2024-11-07 01:45:35,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:45:35,534 INFO L471 AbstractCegarLoop]: Abstraction has 5876 states and 7479 transitions. [2024-11-07 01:45:35,534 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 5 states have internal predecessors, (80), 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:45:35,534 INFO L276 IsEmpty]: Start isEmpty. Operand 5876 states and 7479 transitions. [2024-11-07 01:45:35,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-07 01:45:35,536 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:45:35,536 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] [2024-11-07 01:45:35,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-07 01:45:35,537 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:45:35,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:45:35,537 INFO L85 PathProgramCache]: Analyzing trace with hash 344365557, now seen corresponding path program 1 times [2024-11-07 01:45:35,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:45:35,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340481890] [2024-11-07 01:45:35,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:45:35,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:45:35,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:35,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:45:35,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:35,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-07 01:45:35,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:35,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 01:45:35,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:35,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 01:45:35,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:35,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 01:45:35,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:35,661 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:35,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:45:35,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340481890] [2024-11-07 01:45:35,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [340481890] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:45:35,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:45:35,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:45:35,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299271287] [2024-11-07 01:45:35,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:45:35,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:45:35,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:45:35,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:45:35,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:45:35,665 INFO L87 Difference]: Start difference. First operand 5876 states and 7479 transitions. Second operand has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 5 states have internal predecessors, (80), 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:45:37,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:45:37,840 INFO L93 Difference]: Finished difference Result 9703 states and 13245 transitions. [2024-11-07 01:45:37,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-07 01:45:37,841 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 5 states have internal predecessors, (80), 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 91 [2024-11-07 01:45:37,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:45:37,866 INFO L225 Difference]: With dead ends: 9703 [2024-11-07 01:45:37,866 INFO L226 Difference]: Without dead ends: 8171 [2024-11-07 01:45:37,874 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-11-07 01:45:37,877 INFO L432 NwaCegarLoop]: 356 mSDtfsCounter, 919 mSDsluCounter, 1183 mSDsCounter, 0 mSdLazyCounter, 1595 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 945 SdHoareTripleChecker+Valid, 1539 SdHoareTripleChecker+Invalid, 1683 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 1595 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-07 01:45:37,878 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [945 Valid, 1539 Invalid, 1683 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 1595 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-07 01:45:37,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8171 states. [2024-11-07 01:45:38,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8171 to 7233. [2024-11-07 01:45:38,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7233 states, 5915 states have (on average 1.3269653423499577) internal successors, (7849), 5998 states have internal predecessors, (7849), 686 states have call successors, (686), 493 states have call predecessors, (686), 630 states have return successors, (982), 763 states have call predecessors, (982), 683 states have call successors, (982) [2024-11-07 01:45:38,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7233 states to 7233 states and 9517 transitions. [2024-11-07 01:45:38,660 INFO L78 Accepts]: Start accepts. Automaton has 7233 states and 9517 transitions. Word has length 91 [2024-11-07 01:45:38,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:45:38,661 INFO L471 AbstractCegarLoop]: Abstraction has 7233 states and 9517 transitions. [2024-11-07 01:45:38,661 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 5 states have internal predecessors, (80), 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:45:38,661 INFO L276 IsEmpty]: Start isEmpty. Operand 7233 states and 9517 transitions. [2024-11-07 01:45:38,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-07 01:45:38,665 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:45:38,665 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] [2024-11-07 01:45:38,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-07 01:45:38,665 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:45:38,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:45:38,665 INFO L85 PathProgramCache]: Analyzing trace with hash 1298305715, now seen corresponding path program 1 times [2024-11-07 01:45:38,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:45:38,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504011659] [2024-11-07 01:45:38,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:45:38,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:45:38,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:38,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:45:38,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:38,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-07 01:45:38,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:38,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 01:45:38,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:38,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 01:45:38,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:38,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 01:45:38,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:38,770 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:38,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:45:38,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504011659] [2024-11-07 01:45:38,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504011659] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:45:38,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:45:38,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:45:38,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518451449] [2024-11-07 01:45:38,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:45:38,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:45:38,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:45:38,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:45:38,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:45:38,772 INFO L87 Difference]: Start difference. First operand 7233 states and 9517 transitions. Second operand has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 5 states have internal predecessors, (80), 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:45:40,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:45:40,591 INFO L93 Difference]: Finished difference Result 14316 states and 20225 transitions. [2024-11-07 01:45:40,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-07 01:45:40,592 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 5 states have internal predecessors, (80), 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 91 [2024-11-07 01:45:40,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:45:40,629 INFO L225 Difference]: With dead ends: 14316 [2024-11-07 01:45:40,629 INFO L226 Difference]: Without dead ends: 11427 [2024-11-07 01:45:40,641 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-11-07 01:45:40,642 INFO L432 NwaCegarLoop]: 246 mSDtfsCounter, 923 mSDsluCounter, 861 mSDsCounter, 0 mSdLazyCounter, 1397 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 949 SdHoareTripleChecker+Valid, 1107 SdHoareTripleChecker+Invalid, 1510 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 1397 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-07 01:45:40,642 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [949 Valid, 1107 Invalid, 1510 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 1397 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-07 01:45:40,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11427 states. [2024-11-07 01:45:41,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11427 to 9932. [2024-11-07 01:45:41,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9932 states, 8318 states have (on average 1.3718441933157008) internal successors, (11411), 8417 states have internal predecessors, (11411), 870 states have call successors, (870), 589 states have call predecessors, (870), 742 states have return successors, (1344), 963 states have call predecessors, (1344), 867 states have call successors, (1344) [2024-11-07 01:45:41,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9932 states to 9932 states and 13625 transitions. [2024-11-07 01:45:41,503 INFO L78 Accepts]: Start accepts. Automaton has 9932 states and 13625 transitions. Word has length 91 [2024-11-07 01:45:41,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:45:41,504 INFO L471 AbstractCegarLoop]: Abstraction has 9932 states and 13625 transitions. [2024-11-07 01:45:41,504 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 5 states have internal predecessors, (80), 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:45:41,504 INFO L276 IsEmpty]: Start isEmpty. Operand 9932 states and 13625 transitions. [2024-11-07 01:45:41,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-07 01:45:41,511 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:45:41,511 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] [2024-11-07 01:45:41,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-07 01:45:41,512 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:45:41,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:45:41,512 INFO L85 PathProgramCache]: Analyzing trace with hash 82151989, now seen corresponding path program 1 times [2024-11-07 01:45:41,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:45:41,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236482502] [2024-11-07 01:45:41,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:45:41,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:45:41,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:41,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:45:41,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:41,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-07 01:45:41,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:41,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 01:45:41,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:41,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 01:45:41,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:41,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 01:45:41,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:41,615 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,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:45:41,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236482502] [2024-11-07 01:45:41,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [236482502] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:45:41,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:45:41,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:45:41,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095831111] [2024-11-07 01:45:41,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:45:41,616 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:45:41,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:45:41,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:45:41,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:45:41,616 INFO L87 Difference]: Start difference. First operand 9932 states and 13625 transitions. Second operand has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 5 states have internal predecessors, (80), 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:45:43,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:45:43,215 INFO L93 Difference]: Finished difference Result 16821 states and 24172 transitions. [2024-11-07 01:45:43,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 01:45:43,216 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 5 states have internal predecessors, (80), 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 91 [2024-11-07 01:45:43,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:45:43,246 INFO L225 Difference]: With dead ends: 16821 [2024-11-07 01:45:43,247 INFO L226 Difference]: Without dead ends: 11234 [2024-11-07 01:45:43,264 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-11-07 01:45:43,265 INFO L432 NwaCegarLoop]: 257 mSDtfsCounter, 325 mSDsluCounter, 977 mSDsCounter, 0 mSdLazyCounter, 1197 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 325 SdHoareTripleChecker+Valid, 1234 SdHoareTripleChecker+Invalid, 1267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 1197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-07 01:45:43,265 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [325 Valid, 1234 Invalid, 1267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 1197 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-07 01:45:43,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11234 states. [2024-11-07 01:45:44,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11234 to 10031. [2024-11-07 01:45:44,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10031 states, 8417 states have (on average 1.3674705952239514) internal successors, (11510), 8516 states have internal predecessors, (11510), 870 states have call successors, (870), 589 states have call predecessors, (870), 742 states have return successors, (1344), 963 states have call predecessors, (1344), 867 states have call successors, (1344) [2024-11-07 01:45:44,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10031 states to 10031 states and 13724 transitions. [2024-11-07 01:45:44,359 INFO L78 Accepts]: Start accepts. Automaton has 10031 states and 13724 transitions. Word has length 91 [2024-11-07 01:45:44,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:45:44,359 INFO L471 AbstractCegarLoop]: Abstraction has 10031 states and 13724 transitions. [2024-11-07 01:45:44,359 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 5 states have internal predecessors, (80), 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:45:44,359 INFO L276 IsEmpty]: Start isEmpty. Operand 10031 states and 13724 transitions. [2024-11-07 01:45:44,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-07 01:45:44,364 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:45:44,364 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] [2024-11-07 01:45:44,364 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-07 01:45:44,364 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:45:44,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:45:44,364 INFO L85 PathProgramCache]: Analyzing trace with hash 515881075, now seen corresponding path program 1 times [2024-11-07 01:45:44,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:45:44,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793121863] [2024-11-07 01:45:44,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:45:44,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:45:44,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:44,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:45:44,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:44,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-07 01:45:44,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:44,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 01:45:44,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:44,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 01:45:44,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:44,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 01:45:44,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:44,450 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:44,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:45:44,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793121863] [2024-11-07 01:45:44,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [793121863] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:45:44,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:45:44,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 01:45:44,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926454861] [2024-11-07 01:45:44,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:45:44,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 01:45:44,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:45:44,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 01:45:44,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 01:45:44,453 INFO L87 Difference]: Start difference. First operand 10031 states and 13724 transitions. Second operand has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 4 states have internal predecessors, (80), 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:45:46,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:45:46,563 INFO L93 Difference]: Finished difference Result 23610 states and 34152 transitions. [2024-11-07 01:45:46,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 01:45:46,563 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 4 states have internal predecessors, (80), 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 91 [2024-11-07 01:45:46,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:45:46,622 INFO L225 Difference]: With dead ends: 23610 [2024-11-07 01:45:46,622 INFO L226 Difference]: Without dead ends: 17924 [2024-11-07 01:45:46,644 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2024-11-07 01:45:46,645 INFO L432 NwaCegarLoop]: 402 mSDtfsCounter, 1129 mSDsluCounter, 788 mSDsCounter, 0 mSdLazyCounter, 1298 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1167 SdHoareTripleChecker+Valid, 1190 SdHoareTripleChecker+Invalid, 1414 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 1298 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-07 01:45:46,645 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1167 Valid, 1190 Invalid, 1414 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 1298 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-07 01:45:46,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17924 states. [2024-11-07 01:45:47,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17924 to 15481. [2024-11-07 01:45:47,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15481 states, 13272 states have (on average 1.4034056660638938) internal successors, (18626), 13403 states have internal predecessors, (18626), 1235 states have call successors, (1235), 787 states have call predecessors, (1235), 972 states have return successors, (1953), 1328 states have call predecessors, (1953), 1232 states have call successors, (1953) [2024-11-07 01:45:47,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15481 states to 15481 states and 21814 transitions. [2024-11-07 01:45:47,868 INFO L78 Accepts]: Start accepts. Automaton has 15481 states and 21814 transitions. Word has length 91 [2024-11-07 01:45:47,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:45:47,869 INFO L471 AbstractCegarLoop]: Abstraction has 15481 states and 21814 transitions. [2024-11-07 01:45:47,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 4 states have internal predecessors, (80), 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:45:47,869 INFO L276 IsEmpty]: Start isEmpty. Operand 15481 states and 21814 transitions. [2024-11-07 01:45:47,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-07 01:45:47,873 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:45:47,873 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] [2024-11-07 01:45:47,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-07 01:45:47,874 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:45:47,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:45:47,874 INFO L85 PathProgramCache]: Analyzing trace with hash 523631634, now seen corresponding path program 1 times [2024-11-07 01:45:47,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:45:47,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391660519] [2024-11-07 01:45:47,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:45:47,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:45:47,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:47,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:45:47,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:47,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-07 01:45:47,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:47,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 01:45:47,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:47,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 01:45:47,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:47,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 01:45:47,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:47,970 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:47,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:45:47,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391660519] [2024-11-07 01:45:47,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391660519] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:45:47,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:45:47,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:45:47,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204526980] [2024-11-07 01:45:47,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:45:47,972 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:45:47,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:45:47,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:45:47,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:45:47,973 INFO L87 Difference]: Start difference. First operand 15481 states and 21814 transitions. Second operand has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 5 states have internal predecessors, (80), 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:45:49,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:45:49,959 INFO L93 Difference]: Finished difference Result 29188 states and 42505 transitions. [2024-11-07 01:45:49,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-07 01:45:49,960 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 5 states have internal predecessors, (80), 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 91 [2024-11-07 01:45:49,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:45:50,017 INFO L225 Difference]: With dead ends: 29188 [2024-11-07 01:45:50,017 INFO L226 Difference]: Without dead ends: 18052 [2024-11-07 01:45:50,038 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2024-11-07 01:45:50,039 INFO L432 NwaCegarLoop]: 257 mSDtfsCounter, 338 mSDsluCounter, 977 mSDsCounter, 0 mSdLazyCounter, 1156 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 338 SdHoareTripleChecker+Valid, 1234 SdHoareTripleChecker+Invalid, 1226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 1156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-07 01:45:50,039 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [338 Valid, 1234 Invalid, 1226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 1156 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-07 01:45:50,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18052 states. [2024-11-07 01:45:51,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18052 to 15580. [2024-11-07 01:45:51,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15580 states, 13371 states have (on average 1.3979507890210157) internal successors, (18692), 13502 states have internal predecessors, (18692), 1235 states have call successors, (1235), 787 states have call predecessors, (1235), 972 states have return successors, (1953), 1328 states have call predecessors, (1953), 1232 states have call successors, (1953) [2024-11-07 01:45:51,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15580 states to 15580 states and 21880 transitions. [2024-11-07 01:45:51,349 INFO L78 Accepts]: Start accepts. Automaton has 15580 states and 21880 transitions. Word has length 91 [2024-11-07 01:45:51,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:45:51,350 INFO L471 AbstractCegarLoop]: Abstraction has 15580 states and 21880 transitions. [2024-11-07 01:45:51,350 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 5 states have internal predecessors, (80), 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:45:51,350 INFO L276 IsEmpty]: Start isEmpty. Operand 15580 states and 21880 transitions. [2024-11-07 01:45:51,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-07 01:45:51,354 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:45:51,354 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] [2024-11-07 01:45:51,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-07 01:45:51,355 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:45:51,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:45:51,355 INFO L85 PathProgramCache]: Analyzing trace with hash 2061971664, now seen corresponding path program 1 times [2024-11-07 01:45:51,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:45:51,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661700030] [2024-11-07 01:45:51,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:45:51,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:45:51,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:51,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:45:51,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:51,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-07 01:45:51,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:51,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 01:45:51,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:51,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 01:45:51,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:51,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 01:45:51,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:51,506 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:51,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:45:51,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661700030] [2024-11-07 01:45:51,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1661700030] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:45:51,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:45:51,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:45:51,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054133849] [2024-11-07 01:45:51,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:45:51,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:45:51,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:45:51,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:45:51,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:45:51,507 INFO L87 Difference]: Start difference. First operand 15580 states and 21880 transitions. Second operand has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 5 states have internal predecessors, (80), 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:45:53,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:45:53,439 INFO L93 Difference]: Finished difference Result 29683 states and 42967 transitions. [2024-11-07 01:45:53,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-07 01:45:53,440 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 5 states have internal predecessors, (80), 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 91 [2024-11-07 01:45:53,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:45:53,487 INFO L225 Difference]: With dead ends: 29683 [2024-11-07 01:45:53,487 INFO L226 Difference]: Without dead ends: 18448 [2024-11-07 01:45:53,505 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2024-11-07 01:45:53,505 INFO L432 NwaCegarLoop]: 257 mSDtfsCounter, 348 mSDsluCounter, 977 mSDsCounter, 0 mSdLazyCounter, 1115 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 348 SdHoareTripleChecker+Valid, 1234 SdHoareTripleChecker+Invalid, 1185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 1115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-07 01:45:53,506 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [348 Valid, 1234 Invalid, 1185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 1115 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-07 01:45:53,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18448 states. [2024-11-07 01:45:54,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18448 to 15778. [2024-11-07 01:45:54,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15778 states, 13569 states have (on average 1.3921438573218365) internal successors, (18890), 13700 states have internal predecessors, (18890), 1235 states have call successors, (1235), 787 states have call predecessors, (1235), 972 states have return successors, (1953), 1328 states have call predecessors, (1953), 1232 states have call successors, (1953) [2024-11-07 01:45:54,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15778 states to 15778 states and 22078 transitions. [2024-11-07 01:45:54,559 INFO L78 Accepts]: Start accepts. Automaton has 15778 states and 22078 transitions. Word has length 91 [2024-11-07 01:45:54,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:45:54,560 INFO L471 AbstractCegarLoop]: Abstraction has 15778 states and 22078 transitions. [2024-11-07 01:45:54,560 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 5 states have internal predecessors, (80), 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:45:54,560 INFO L276 IsEmpty]: Start isEmpty. Operand 15778 states and 22078 transitions. [2024-11-07 01:45:54,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-07 01:45:54,565 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:45:54,565 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] [2024-11-07 01:45:54,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-07 01:45:54,565 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:45:54,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:45:54,565 INFO L85 PathProgramCache]: Analyzing trace with hash -304722930, now seen corresponding path program 1 times [2024-11-07 01:45:54,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:45:54,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177152407] [2024-11-07 01:45:54,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:45:54,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:45:54,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:54,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:45:54,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:54,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-07 01:45:54,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:54,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 01:45:54,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:54,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 01:45:54,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:54,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 01:45:54,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:54,720 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:54,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:45:54,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177152407] [2024-11-07 01:45:54,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177152407] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:45:54,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:45:54,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 01:45:54,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156206711] [2024-11-07 01:45:54,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:45:54,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 01:45:54,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:45:54,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 01:45:54,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 01:45:54,723 INFO L87 Difference]: Start difference. First operand 15778 states and 22078 transitions. Second operand has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 4 states have internal predecessors, (80), 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:45:57,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:45:57,689 INFO L93 Difference]: Finished difference Result 43683 states and 63050 transitions. [2024-11-07 01:45:57,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 01:45:57,689 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 4 states have internal predecessors, (80), 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 91 [2024-11-07 01:45:57,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:45:57,769 INFO L225 Difference]: With dead ends: 43683 [2024-11-07 01:45:57,769 INFO L226 Difference]: Without dead ends: 32250 [2024-11-07 01:45:57,795 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2024-11-07 01:45:57,795 INFO L432 NwaCegarLoop]: 402 mSDtfsCounter, 1221 mSDsluCounter, 788 mSDsCounter, 0 mSdLazyCounter, 1214 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1259 SdHoareTripleChecker+Valid, 1190 SdHoareTripleChecker+Invalid, 1330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 1214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-07 01:45:57,795 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1259 Valid, 1190 Invalid, 1330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 1214 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-07 01:45:57,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32250 states. [2024-11-07 01:45:59,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32250 to 26840. [2024-11-07 01:45:59,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26840 states, 23442 states have (on average 1.4128487330432558) internal successors, (33120), 23637 states have internal predecessors, (33120), 1964 states have call successors, (1964), 1183 states have call predecessors, (1964), 1432 states have return successors, (3170), 2057 states have call predecessors, (3170), 1961 states have call successors, (3170) [2024-11-07 01:45:59,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26840 states to 26840 states and 38254 transitions. [2024-11-07 01:45:59,514 INFO L78 Accepts]: Start accepts. Automaton has 26840 states and 38254 transitions. Word has length 91 [2024-11-07 01:45:59,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:45:59,514 INFO L471 AbstractCegarLoop]: Abstraction has 26840 states and 38254 transitions. [2024-11-07 01:45:59,514 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 4 states have internal predecessors, (80), 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:45:59,514 INFO L276 IsEmpty]: Start isEmpty. Operand 26840 states and 38254 transitions. [2024-11-07 01:45:59,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-07 01:45:59,519 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:45:59,519 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] [2024-11-07 01:45:59,519 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-07 01:45:59,519 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:45:59,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:45:59,519 INFO L85 PathProgramCache]: Analyzing trace with hash -1579825619, now seen corresponding path program 1 times [2024-11-07 01:45:59,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:45:59,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767563658] [2024-11-07 01:45:59,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:45:59,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:45:59,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:59,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:45:59,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:59,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-07 01:45:59,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:59,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 01:45:59,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:59,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 01:45:59,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:59,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 01:45:59,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:59,612 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:59,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:45:59,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767563658] [2024-11-07 01:45:59,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1767563658] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:45:59,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:45:59,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:45:59,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287662717] [2024-11-07 01:45:59,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:45:59,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:45:59,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:45:59,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:45:59,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:45:59,614 INFO L87 Difference]: Start difference. First operand 26840 states and 38254 transitions. Second operand has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 5 states have internal predecessors, (80), 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:02,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:46:02,263 INFO L93 Difference]: Finished difference Result 55005 states and 79722 transitions. [2024-11-07 01:46:02,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-07 01:46:02,264 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 5 states have internal predecessors, (80), 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 91 [2024-11-07 01:46:02,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:46:02,356 INFO L225 Difference]: With dead ends: 55005 [2024-11-07 01:46:02,356 INFO L226 Difference]: Without dead ends: 32510 [2024-11-07 01:46:02,387 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2024-11-07 01:46:02,388 INFO L432 NwaCegarLoop]: 257 mSDtfsCounter, 358 mSDsluCounter, 977 mSDsCounter, 0 mSdLazyCounter, 1074 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 358 SdHoareTripleChecker+Valid, 1234 SdHoareTripleChecker+Invalid, 1144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 1074 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-07 01:46:02,388 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [358 Valid, 1234 Invalid, 1144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 1074 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-07 01:46:02,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32510 states. [2024-11-07 01:46:04,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32510 to 27038. [2024-11-07 01:46:04,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27038 states, 23640 states have (on average 1.4065989847715736) internal successors, (33252), 23835 states have internal predecessors, (33252), 1964 states have call successors, (1964), 1183 states have call predecessors, (1964), 1432 states have return successors, (3170), 2057 states have call predecessors, (3170), 1961 states have call successors, (3170) [2024-11-07 01:46:04,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27038 states to 27038 states and 38386 transitions. [2024-11-07 01:46:04,543 INFO L78 Accepts]: Start accepts. Automaton has 27038 states and 38386 transitions. Word has length 91 [2024-11-07 01:46:04,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:46:04,544 INFO L471 AbstractCegarLoop]: Abstraction has 27038 states and 38386 transitions. [2024-11-07 01:46:04,544 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 5 states have internal predecessors, (80), 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:04,544 INFO L276 IsEmpty]: Start isEmpty. Operand 27038 states and 38386 transitions. [2024-11-07 01:46:04,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-07 01:46:04,549 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:46:04,549 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] [2024-11-07 01:46:04,549 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-07 01:46:04,549 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:46:04,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:46:04,549 INFO L85 PathProgramCache]: Analyzing trace with hash 1343334379, now seen corresponding path program 1 times [2024-11-07 01:46:04,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:46:04,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819818642] [2024-11-07 01:46:04,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:46:04,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:46:04,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:04,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:46:04,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:04,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-07 01:46:04,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:04,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 01:46:04,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:04,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 01:46:04,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:04,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 01:46:04,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:04,628 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,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:46:04,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819818642] [2024-11-07 01:46:04,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [819818642] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:46:04,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:46:04,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 01:46:04,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918573099] [2024-11-07 01:46:04,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:46:04,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 01:46:04,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:46:04,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 01:46:04,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 01:46:04,630 INFO L87 Difference]: Start difference. First operand 27038 states and 38386 transitions. Second operand has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 4 states have internal predecessors, (80), 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)