./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.07.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.07.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', 'd7b83251f9a608d2befdac3ab06beaba9889f30d8ab1cb865fc88ebdabcb52dd'] 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.07.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 d7b83251f9a608d2befdac3ab06beaba9889f30d8ab1cb865fc88ebdabcb52dd --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 01:45:09,506 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 01:45:09,616 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-07 01:45:09,621 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 01:45:09,622 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 01:45:09,645 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 01:45:09,646 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 01:45:09,646 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 01:45:09,647 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 01:45:09,647 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 01:45:09,647 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 01:45:09,647 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 01:45:09,648 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 01:45:09,648 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 01:45:09,649 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 01:45:09,649 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 01:45:09,649 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 01:45:09,649 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 01:45:09,650 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 01:45:09,650 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 01:45:09,650 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 01:45:09,650 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 01:45:09,650 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 01:45:09,650 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 01:45:09,650 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 01:45:09,651 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 01:45:09,651 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 01:45:09,651 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 01:45:09,651 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 01:45:09,651 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 01:45:09,651 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 01:45:09,652 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 01:45:09,652 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 01:45:09,652 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 01:45:09,652 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 01:45:09,653 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 01:45:09,653 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 01:45:09,653 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 01:45:09,653 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 01:45:09,653 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 01:45:09,653 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 01:45:09,653 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 01:45:09,653 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 -> d7b83251f9a608d2befdac3ab06beaba9889f30d8ab1cb865fc88ebdabcb52dd [2024-11-07 01:45:09,934 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 01:45:09,940 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 01:45:09,942 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 01:45:09,943 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 01:45:09,943 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 01:45:09,944 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.07.cil-2.c [2024-11-07 01:45:11,211 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 01:45:11,467 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 01:45:11,468 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.07.cil-2.c [2024-11-07 01:45:11,485 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0223407b1/e1db342c7f64423683a0de69f78b5472/FLAGc237a5f0b [2024-11-07 01:45:11,788 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0223407b1/e1db342c7f64423683a0de69f78b5472 [2024-11-07 01:45:11,790 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 01:45:11,792 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 01:45:11,794 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 01:45:11,795 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 01:45:11,799 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 01:45:11,799 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:45:11" (1/1) ... [2024-11-07 01:45:11,800 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6944e891 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:45:11, skipping insertion in model container [2024-11-07 01:45:11,802 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:45:11" (1/1) ... [2024-11-07 01:45:11,840 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 01:45:11,977 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.07.cil-2.c[914,927] [2024-11-07 01:45:12,045 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.07.cil-2.c[7115,7128] [2024-11-07 01:45:12,152 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 01:45:12,167 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 01:45:12,178 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.07.cil-2.c[914,927] [2024-11-07 01:45:12,206 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.07.cil-2.c[7115,7128] [2024-11-07 01:45:12,268 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 01:45:12,299 INFO L204 MainTranslator]: Completed translation [2024-11-07 01:45:12,300 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:45:12 WrapperNode [2024-11-07 01:45:12,300 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 01:45:12,302 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 01:45:12,302 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 01:45:12,302 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 01:45:12,307 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:45:12" (1/1) ... [2024-11-07 01:45:12,323 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:45:12" (1/1) ... [2024-11-07 01:45:12,370 INFO L138 Inliner]: procedures = 67, calls = 79, calls flagged for inlining = 35, calls inlined = 35, statements flattened = 774 [2024-11-07 01:45:12,371 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 01:45:12,371 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 01:45:12,371 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 01:45:12,372 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 01:45:12,384 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:45:12" (1/1) ... [2024-11-07 01:45:12,384 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:45:12" (1/1) ... [2024-11-07 01:45:12,388 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:45:12" (1/1) ... [2024-11-07 01:45:12,401 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-07 01:45:12,401 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:45:12" (1/1) ... [2024-11-07 01:45:12,401 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:45:12" (1/1) ... [2024-11-07 01:45:12,414 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:45:12" (1/1) ... [2024-11-07 01:45:12,429 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:45:12" (1/1) ... [2024-11-07 01:45:12,431 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:45:12" (1/1) ... [2024-11-07 01:45:12,433 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:45:12" (1/1) ... [2024-11-07 01:45:12,439 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 01:45:12,440 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 01:45:12,440 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 01:45:12,440 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 01:45:12,443 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:45:12" (1/1) ... [2024-11-07 01:45:12,448 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 01:45:12,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 01:45:12,473 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-07 01:45:12,476 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-07 01:45:12,500 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 01:45:12,500 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-11-07 01:45:12,500 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-11-07 01:45:12,500 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2024-11-07 01:45:12,500 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2024-11-07 01:45:12,500 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2024-11-07 01:45:12,500 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2024-11-07 01:45:12,501 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2024-11-07 01:45:12,501 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2024-11-07 01:45:12,501 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2024-11-07 01:45:12,501 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2024-11-07 01:45:12,501 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2024-11-07 01:45:12,501 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2024-11-07 01:45:12,502 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2024-11-07 01:45:12,502 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2024-11-07 01:45:12,502 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2024-11-07 01:45:12,502 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2024-11-07 01:45:12,502 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2024-11-07 01:45:12,502 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2024-11-07 01:45:12,502 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2024-11-07 01:45:12,502 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2024-11-07 01:45:12,503 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2024-11-07 01:45:12,503 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2024-11-07 01:45:12,503 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 01:45:12,503 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2024-11-07 01:45:12,504 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2024-11-07 01:45:12,504 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2024-11-07 01:45:12,504 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2024-11-07 01:45:12,504 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 01:45:12,504 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 01:45:12,504 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2024-11-07 01:45:12,504 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2024-11-07 01:45:12,504 INFO L130 BoogieDeclarations]: Found specification of procedure error2 [2024-11-07 01:45:12,504 INFO L138 BoogieDeclarations]: Found implementation of procedure error2 [2024-11-07 01:45:12,648 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 01:45:12,650 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 01:45:13,539 INFO L? ?]: Removed 101 outVars from TransFormulas that were not future-live. [2024-11-07 01:45:13,540 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 01:45:13,556 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 01:45:13,556 INFO L316 CfgBuilder]: Removed 14 assume(true) statements. [2024-11-07 01:45:13,557 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:45:13 BoogieIcfgContainer [2024-11-07 01:45:13,557 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 01:45:13,559 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 01:45:13,559 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 01:45:13,563 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 01:45:13,563 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 01:45:11" (1/3) ... [2024-11-07 01:45:13,564 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e90422d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:45:13, skipping insertion in model container [2024-11-07 01:45:13,564 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:45:12" (2/3) ... [2024-11-07 01:45:13,564 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e90422d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:45:13, skipping insertion in model container [2024-11-07 01:45:13,564 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:45:13" (3/3) ... [2024-11-07 01:45:13,565 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-1+token_ring.07.cil-2.c [2024-11-07 01:45:13,578 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 01:45:13,578 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-07 01:45:13,651 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 01:45:13,664 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;@3f417535, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 01:45:13,664 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-07 01:45:13,671 INFO L276 IsEmpty]: Start isEmpty. Operand has 374 states, 319 states have (on average 1.6050156739811912) internal successors, (512), 327 states have internal predecessors, (512), 37 states have call successors, (37), 15 states have call predecessors, (37), 15 states have return successors, (37), 35 states have call predecessors, (37), 37 states have call successors, (37) [2024-11-07 01:45:13,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-07 01:45:13,680 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:45:13,681 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:13,681 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:45:13,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:45:13,688 INFO L85 PathProgramCache]: Analyzing trace with hash -1154220689, now seen corresponding path program 1 times [2024-11-07 01:45:13,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:45:13,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941790611] [2024-11-07 01:45:13,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:45:13,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:45:13,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:13,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:45:13,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:13,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-07 01:45:13,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:14,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 01:45:14,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:14,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 01:45:14,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:14,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 01:45:14,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:14,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 01:45:14,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:14,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 01:45:14,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:14,070 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:14,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:45:14,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941790611] [2024-11-07 01:45:14,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1941790611] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:45:14,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:45:14,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 01:45:14,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406782047] [2024-11-07 01:45:14,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:45:14,081 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 01:45:14,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:45:14,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 01:45:14,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-07 01:45:14,106 INFO L87 Difference]: Start difference. First operand has 374 states, 319 states have (on average 1.6050156739811912) internal successors, (512), 327 states have internal predecessors, (512), 37 states have call successors, (37), 15 states have call predecessors, (37), 15 states have return successors, (37), 35 states have call predecessors, (37), 37 states have call successors, (37) Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-07 01:45:15,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:45:15,052 INFO L93 Difference]: Finished difference Result 743 states and 1163 transitions. [2024-11-07 01:45:15,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 01:45:15,055 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 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:15,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:45:15,069 INFO L225 Difference]: With dead ends: 743 [2024-11-07 01:45:15,070 INFO L226 Difference]: Without dead ends: 381 [2024-11-07 01:45:15,075 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-11-07 01:45:15,079 INFO L432 NwaCegarLoop]: 328 mSDtfsCounter, 765 mSDsluCounter, 727 mSDsCounter, 0 mSdLazyCounter, 549 mSolverCounterSat, 122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 775 SdHoareTripleChecker+Valid, 1055 SdHoareTripleChecker+Invalid, 671 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 549 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-07 01:45:15,080 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [775 Valid, 1055 Invalid, 671 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [122 Valid, 549 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-07 01:45:15,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2024-11-07 01:45:15,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 363. [2024-11-07 01:45:15,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 363 states, 311 states have (on average 1.5144694533762058) internal successors, (471), 316 states have internal predecessors, (471), 37 states have call successors, (37), 15 states have call predecessors, (37), 13 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2024-11-07 01:45:15,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 541 transitions. [2024-11-07 01:45:15,165 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 541 transitions. Word has length 65 [2024-11-07 01:45:15,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:45:15,166 INFO L471 AbstractCegarLoop]: Abstraction has 363 states and 541 transitions. [2024-11-07 01:45:15,166 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-07 01:45:15,166 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 541 transitions. [2024-11-07 01:45:15,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-07 01:45:15,171 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:45:15,172 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:15,172 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 01:45:15,172 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:45:15,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:45:15,174 INFO L85 PathProgramCache]: Analyzing trace with hash -1194895439, now seen corresponding path program 1 times [2024-11-07 01:45:15,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:45:15,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730987439] [2024-11-07 01:45:15,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:45:15,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:45:15,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:15,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:45:15,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:15,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-07 01:45:15,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:15,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 01:45:15,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:15,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 01:45:15,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:15,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 01:45:15,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:15,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 01:45:15,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:15,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 01:45:15,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:15,479 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:15,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:45:15,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730987439] [2024-11-07 01:45:15,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730987439] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:45:15,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:45:15,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 01:45:15,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538341239] [2024-11-07 01:45:15,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:45:15,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 01:45:15,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:45:15,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 01:45:15,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-07 01:45:15,485 INFO L87 Difference]: Start difference. First operand 363 states and 541 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:16,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:45:16,547 INFO L93 Difference]: Finished difference Result 586 states and 855 transitions. [2024-11-07 01:45:16,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 01:45:16,548 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:16,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:45:16,555 INFO L225 Difference]: With dead ends: 586 [2024-11-07 01:45:16,557 INFO L226 Difference]: Without dead ends: 498 [2024-11-07 01:45:16,558 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2024-11-07 01:45:16,559 INFO L432 NwaCegarLoop]: 319 mSDtfsCounter, 908 mSDsluCounter, 1023 mSDsCounter, 0 mSdLazyCounter, 1005 mSolverCounterSat, 168 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 913 SdHoareTripleChecker+Valid, 1342 SdHoareTripleChecker+Invalid, 1173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 168 IncrementalHoareTripleChecker+Valid, 1005 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-07 01:45:16,560 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [913 Valid, 1342 Invalid, 1173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [168 Valid, 1005 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-07 01:45:16,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2024-11-07 01:45:16,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 459. [2024-11-07 01:45:16,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 459 states, 387 states have (on average 1.4857881136950903) internal successors, (575), 394 states have internal predecessors, (575), 48 states have call successors, (48), 22 states have call predecessors, (48), 22 states have return successors, (49), 45 states have call predecessors, (49), 44 states have call successors, (49) [2024-11-07 01:45:16,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 672 transitions. [2024-11-07 01:45:16,628 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 672 transitions. Word has length 65 [2024-11-07 01:45:16,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:45:16,628 INFO L471 AbstractCegarLoop]: Abstraction has 459 states and 672 transitions. [2024-11-07 01:45:16,628 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:16,628 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 672 transitions. [2024-11-07 01:45:16,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-07 01:45:16,631 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:45:16,631 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:16,631 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 01:45:16,631 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:45:16,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:45:16,632 INFO L85 PathProgramCache]: Analyzing trace with hash 483993201, now seen corresponding path program 1 times [2024-11-07 01:45:16,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:45:16,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701442715] [2024-11-07 01:45:16,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:45:16,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:45:16,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:16,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:45:16,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:16,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-07 01:45:16,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:16,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 01:45:16,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:16,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 01:45:16,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:16,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 01:45:16,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:16,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 01:45:16,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:16,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 01:45:16,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:16,905 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:16,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:45:16,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701442715] [2024-11-07 01:45:16,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1701442715] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:45:16,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:45:16,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 01:45:16,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854473581] [2024-11-07 01:45:16,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:45:16,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 01:45:16,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:45:16,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 01:45:16,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-07 01:45:16,912 INFO L87 Difference]: Start difference. First operand 459 states and 672 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:18,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:45:18,156 INFO L93 Difference]: Finished difference Result 806 states and 1148 transitions. [2024-11-07 01:45:18,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-07 01:45:18,157 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:18,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:45:18,161 INFO L225 Difference]: With dead ends: 806 [2024-11-07 01:45:18,161 INFO L226 Difference]: Without dead ends: 629 [2024-11-07 01:45:18,162 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2024-11-07 01:45:18,163 INFO L432 NwaCegarLoop]: 355 mSDtfsCounter, 1065 mSDsluCounter, 1517 mSDsCounter, 0 mSdLazyCounter, 1314 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1094 SdHoareTripleChecker+Valid, 1872 SdHoareTripleChecker+Invalid, 1435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 1314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-07 01:45:18,164 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1094 Valid, 1872 Invalid, 1435 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 1314 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-07 01:45:18,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2024-11-07 01:45:18,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 555. [2024-11-07 01:45:18,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 555 states, 463 states have (on average 1.4643628509719222) internal successors, (678), 472 states have internal predecessors, (678), 59 states have call successors, (59), 29 states have call predecessors, (59), 31 states have return successors, (68), 57 states have call predecessors, (68), 55 states have call successors, (68) [2024-11-07 01:45:18,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 805 transitions. [2024-11-07 01:45:18,240 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 805 transitions. Word has length 65 [2024-11-07 01:45:18,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:45:18,240 INFO L471 AbstractCegarLoop]: Abstraction has 555 states and 805 transitions. [2024-11-07 01:45:18,240 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:18,241 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 805 transitions. [2024-11-07 01:45:18,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-07 01:45:18,242 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:45:18,243 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:18,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 01:45:18,243 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:45:18,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:45:18,247 INFO L85 PathProgramCache]: Analyzing trace with hash -1544592909, now seen corresponding path program 1 times [2024-11-07 01:45:18,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:45:18,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652297189] [2024-11-07 01:45:18,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:45:18,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:45:18,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:18,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:45:18,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:18,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-07 01:45:18,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:18,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 01:45:18,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:18,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 01:45:18,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:18,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 01:45:18,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:18,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 01:45:18,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:18,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 01:45:18,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:18,434 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,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:45:18,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652297189] [2024-11-07 01:45:18,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [652297189] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:45:18,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:45:18,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-07 01:45:18,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296360934] [2024-11-07 01:45:18,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:45:18,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 01:45:18,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:45:18,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 01:45:18,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-07 01:45:18,437 INFO L87 Difference]: Start difference. First operand 555 states and 805 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:19,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:45:19,581 INFO L93 Difference]: Finished difference Result 876 states and 1250 transitions. [2024-11-07 01:45:19,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-07 01:45:19,582 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:19,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:45:19,586 INFO L225 Difference]: With dead ends: 876 [2024-11-07 01:45:19,586 INFO L226 Difference]: Without dead ends: 609 [2024-11-07 01:45:19,587 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2024-11-07 01:45:19,588 INFO L432 NwaCegarLoop]: 320 mSDtfsCounter, 446 mSDsluCounter, 1875 mSDsCounter, 0 mSdLazyCounter, 1494 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 448 SdHoareTripleChecker+Valid, 2195 SdHoareTripleChecker+Invalid, 1571 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 1494 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-07 01:45:19,588 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [448 Valid, 2195 Invalid, 1571 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 1494 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-07 01:45:19,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609 states. [2024-11-07 01:45:19,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609 to 570. [2024-11-07 01:45:19,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 570 states, 475 states have (on average 1.4526315789473685) internal successors, (690), 484 states have internal predecessors, (690), 59 states have call successors, (59), 29 states have call predecessors, (59), 34 states have return successors, (71), 60 states have call predecessors, (71), 55 states have call successors, (71) [2024-11-07 01:45:19,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 820 transitions. [2024-11-07 01:45:19,630 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 820 transitions. Word has length 65 [2024-11-07 01:45:19,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:45:19,631 INFO L471 AbstractCegarLoop]: Abstraction has 570 states and 820 transitions. [2024-11-07 01:45:19,631 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:19,631 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 820 transitions. [2024-11-07 01:45:19,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-07 01:45:19,632 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:45:19,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] [2024-11-07 01:45:19,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 01:45:19,633 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:45:19,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:45:19,637 INFO L85 PathProgramCache]: Analyzing trace with hash 1364170993, now seen corresponding path program 1 times [2024-11-07 01:45:19,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:45:19,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662128911] [2024-11-07 01:45:19,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:45:19,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:45:19,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:19,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:45:19,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:19,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-07 01:45:19,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:19,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 01:45:19,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:19,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 01:45:19,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:19,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 01:45:19,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:19,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 01:45:19,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:19,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 01:45:19,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:19,815 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:19,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:45:19,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662128911] [2024-11-07 01:45:19,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1662128911] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:45:19,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:45:19,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-07 01:45:19,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593056845] [2024-11-07 01:45:19,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:45:19,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 01:45:19,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:45:19,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 01:45:19,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-07 01:45:19,817 INFO L87 Difference]: Start difference. First operand 570 states and 820 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:20,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:45:20,821 INFO L93 Difference]: Finished difference Result 886 states and 1249 transitions. [2024-11-07 01:45:20,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 01:45:20,822 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:20,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:45:20,826 INFO L225 Difference]: With dead ends: 886 [2024-11-07 01:45:20,826 INFO L226 Difference]: Without dead ends: 604 [2024-11-07 01:45:20,827 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:20,827 INFO L432 NwaCegarLoop]: 320 mSDtfsCounter, 669 mSDsluCounter, 1628 mSDsCounter, 0 mSdLazyCounter, 1413 mSolverCounterSat, 122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 670 SdHoareTripleChecker+Valid, 1948 SdHoareTripleChecker+Invalid, 1535 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 1413 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-07 01:45:20,828 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [670 Valid, 1948 Invalid, 1535 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [122 Valid, 1413 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-07 01:45:20,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2024-11-07 01:45:20,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 575. [2024-11-07 01:45:20,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 575 states, 479 states have (on average 1.4446764091858038) internal successors, (692), 488 states have internal predecessors, (692), 59 states have call successors, (59), 29 states have call predecessors, (59), 35 states have return successors, (72), 61 states have call predecessors, (72), 55 states have call successors, (72) [2024-11-07 01:45:20,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 575 states to 575 states and 823 transitions. [2024-11-07 01:45:20,881 INFO L78 Accepts]: Start accepts. Automaton has 575 states and 823 transitions. Word has length 65 [2024-11-07 01:45:20,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:45:20,881 INFO L471 AbstractCegarLoop]: Abstraction has 575 states and 823 transitions. [2024-11-07 01:45:20,882 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:20,882 INFO L276 IsEmpty]: Start isEmpty. Operand 575 states and 823 transitions. [2024-11-07 01:45:20,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-07 01:45:20,884 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:45:20,884 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:20,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 01:45:20,886 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:45:20,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:45:20,886 INFO L85 PathProgramCache]: Analyzing trace with hash 334811695, now seen corresponding path program 1 times [2024-11-07 01:45:20,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:45:20,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440400077] [2024-11-07 01:45:20,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:45:20,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:45:20,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:20,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:45:20,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:20,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-07 01:45:20,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:21,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 01:45:21,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:21,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 01:45:21,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:21,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 01:45:21,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:21,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 01:45:21,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:21,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 01:45:21,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:21,092 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:21,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:45:21,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440400077] [2024-11-07 01:45:21,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [440400077] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:45:21,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:45:21,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-07 01:45:21,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195509671] [2024-11-07 01:45:21,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:45:21,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 01:45:21,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:45:21,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 01:45:21,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-07 01:45:21,094 INFO L87 Difference]: Start difference. First operand 575 states and 823 transitions. Second operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 6 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2024-11-07 01:45:22,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:45:22,938 INFO L93 Difference]: Finished difference Result 2286 states and 3152 transitions. [2024-11-07 01:45:22,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-11-07 01:45:22,942 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 6 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 65 [2024-11-07 01:45:22,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:45:22,959 INFO L225 Difference]: With dead ends: 2286 [2024-11-07 01:45:22,959 INFO L226 Difference]: Without dead ends: 1999 [2024-11-07 01:45:22,963 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 296 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=235, Invalid=887, Unknown=0, NotChecked=0, Total=1122 [2024-11-07 01:45:22,965 INFO L432 NwaCegarLoop]: 443 mSDtfsCounter, 2117 mSDsluCounter, 1616 mSDsCounter, 0 mSdLazyCounter, 1658 mSolverCounterSat, 404 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2131 SdHoareTripleChecker+Valid, 2059 SdHoareTripleChecker+Invalid, 2062 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 404 IncrementalHoareTripleChecker+Valid, 1658 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-07 01:45:22,965 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2131 Valid, 2059 Invalid, 2062 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [404 Valid, 1658 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-07 01:45:22,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1999 states. [2024-11-07 01:45:23,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1999 to 1745. [2024-11-07 01:45:23,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1745 states, 1403 states have (on average 1.3521026372059872) internal successors, (1897), 1432 states have internal predecessors, (1897), 176 states have call successors, (176), 131 states have call predecessors, (176), 164 states have return successors, (267), 185 states have call predecessors, (267), 172 states have call successors, (267) [2024-11-07 01:45:23,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1745 states to 1745 states and 2340 transitions. [2024-11-07 01:45:23,157 INFO L78 Accepts]: Start accepts. Automaton has 1745 states and 2340 transitions. Word has length 65 [2024-11-07 01:45:23,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:45:23,157 INFO L471 AbstractCegarLoop]: Abstraction has 1745 states and 2340 transitions. [2024-11-07 01:45:23,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 6 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2024-11-07 01:45:23,159 INFO L276 IsEmpty]: Start isEmpty. Operand 1745 states and 2340 transitions. [2024-11-07 01:45:23,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-07 01:45:23,162 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:45:23,162 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:23,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 01:45:23,163 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:45:23,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:45:23,163 INFO L85 PathProgramCache]: Analyzing trace with hash 1314224519, now seen corresponding path program 1 times [2024-11-07 01:45:23,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:45:23,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414708940] [2024-11-07 01:45:23,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:45:23,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:45:23,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:23,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:45:23,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:23,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-07 01:45:23,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:23,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 01:45:23,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:23,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 01:45:23,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:23,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 01:45:23,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:23,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 01:45:23,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:23,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 01:45:23,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:23,367 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,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:45:23,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414708940] [2024-11-07 01:45:23,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1414708940] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:45:23,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:45:23,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 01:45:23,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731547858] [2024-11-07 01:45:23,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:45:23,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 01:45:23,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:45:23,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 01:45:23,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-07 01:45:23,370 INFO L87 Difference]: Start difference. First operand 1745 states and 2340 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:24,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:45:24,390 INFO L93 Difference]: Finished difference Result 3202 states and 4217 transitions. [2024-11-07 01:45:24,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-07 01:45:24,390 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:24,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:45:24,400 INFO L225 Difference]: With dead ends: 3202 [2024-11-07 01:45:24,400 INFO L226 Difference]: Without dead ends: 1965 [2024-11-07 01:45:24,403 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=113, Invalid=307, Unknown=0, NotChecked=0, Total=420 [2024-11-07 01:45:24,404 INFO L432 NwaCegarLoop]: 293 mSDtfsCounter, 1065 mSDsluCounter, 1302 mSDsCounter, 0 mSdLazyCounter, 1218 mSolverCounterSat, 134 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1089 SdHoareTripleChecker+Valid, 1595 SdHoareTripleChecker+Invalid, 1352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 134 IncrementalHoareTripleChecker+Valid, 1218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-07 01:45:24,404 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1089 Valid, 1595 Invalid, 1352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [134 Valid, 1218 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-07 01:45:24,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1965 states. [2024-11-07 01:45:24,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1965 to 1723. [2024-11-07 01:45:24,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1723 states, 1389 states have (on average 1.349892008639309) internal successors, (1875), 1412 states have internal predecessors, (1875), 176 states have call successors, (176), 131 states have call predecessors, (176), 156 states have return successors, (251), 183 states have call predecessors, (251), 172 states have call successors, (251) [2024-11-07 01:45:24,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1723 states to 1723 states and 2302 transitions. [2024-11-07 01:45:24,551 INFO L78 Accepts]: Start accepts. Automaton has 1723 states and 2302 transitions. Word has length 65 [2024-11-07 01:45:24,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:45:24,551 INFO L471 AbstractCegarLoop]: Abstraction has 1723 states and 2302 transitions. [2024-11-07 01:45:24,551 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:24,552 INFO L276 IsEmpty]: Start isEmpty. Operand 1723 states and 2302 transitions. [2024-11-07 01:45:24,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-07 01:45:24,556 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:45:24,556 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:24,556 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 01:45:24,556 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:45:24,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:45:24,558 INFO L85 PathProgramCache]: Analyzing trace with hash 1180211013, now seen corresponding path program 1 times [2024-11-07 01:45:24,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:45:24,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281334076] [2024-11-07 01:45:24,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:45:24,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:45:24,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:24,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:45:24,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:24,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-07 01:45:24,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:24,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 01:45:24,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:24,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 01:45:24,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:24,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 01:45:24,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:24,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 01:45:24,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:24,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 01:45:24,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:24,683 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:24,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:45:24,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281334076] [2024-11-07 01:45:24,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [281334076] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:45:24,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:45:24,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:45:24,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079663581] [2024-11-07 01:45:24,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:45:24,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:45:24,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:45:24,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:45:24,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:45:24,685 INFO L87 Difference]: Start difference. First operand 1723 states and 2302 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:25,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:45:25,453 INFO L93 Difference]: Finished difference Result 4591 states and 6033 transitions. [2024-11-07 01:45:25,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-07 01:45:25,454 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:25,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:45:25,470 INFO L225 Difference]: With dead ends: 4591 [2024-11-07 01:45:25,470 INFO L226 Difference]: Without dead ends: 3159 [2024-11-07 01:45:25,474 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2024-11-07 01:45:25,474 INFO L432 NwaCegarLoop]: 286 mSDtfsCounter, 1029 mSDsluCounter, 1035 mSDsCounter, 0 mSdLazyCounter, 531 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1059 SdHoareTripleChecker+Valid, 1321 SdHoareTripleChecker+Invalid, 654 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 531 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-07 01:45:25,475 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1059 Valid, 1321 Invalid, 654 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 531 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-07 01:45:25,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3159 states. [2024-11-07 01:45:25,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3159 to 2869. [2024-11-07 01:45:25,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2869 states, 2287 states have (on average 1.3069523393091387) internal successors, (2989), 2325 states have internal predecessors, (2989), 295 states have call successors, (295), 233 states have call predecessors, (295), 285 states have return successors, (477), 314 states have call predecessors, (477), 291 states have call successors, (477) [2024-11-07 01:45:25,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2869 states to 2869 states and 3761 transitions. [2024-11-07 01:45:25,695 INFO L78 Accepts]: Start accepts. Automaton has 2869 states and 3761 transitions. Word has length 65 [2024-11-07 01:45:25,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:45:25,696 INFO L471 AbstractCegarLoop]: Abstraction has 2869 states and 3761 transitions. [2024-11-07 01:45:25,696 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:25,696 INFO L276 IsEmpty]: Start isEmpty. Operand 2869 states and 3761 transitions. [2024-11-07 01:45:25,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-07 01:45:25,698 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:45:25,698 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:25,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-07 01:45:25,698 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:45:25,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:45:25,699 INFO L85 PathProgramCache]: Analyzing trace with hash -1385300724, now seen corresponding path program 1 times [2024-11-07 01:45:25,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:45:25,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262356187] [2024-11-07 01:45:25,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:45:25,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:45:25,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:25,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:45:25,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:25,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-07 01:45:25,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:25,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 01:45:25,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:25,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 01:45:25,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:25,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 01:45:25,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:25,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 01:45:25,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:25,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 01:45:25,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:25,773 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:25,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:45:25,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262356187] [2024-11-07 01:45:25,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [262356187] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:45:25,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:45:25,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 01:45:25,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986705122] [2024-11-07 01:45:25,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:45:25,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 01:45:25,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:45:25,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 01:45:25,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-07 01:45:25,775 INFO L87 Difference]: Start difference. First operand 2869 states and 3761 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:26,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:45:26,684 INFO L93 Difference]: Finished difference Result 7723 states and 10087 transitions. [2024-11-07 01:45:26,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 01:45:26,685 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:26,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:45:26,710 INFO L225 Difference]: With dead ends: 7723 [2024-11-07 01:45:26,710 INFO L226 Difference]: Without dead ends: 5124 [2024-11-07 01:45:26,717 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:26,717 INFO L432 NwaCegarLoop]: 327 mSDtfsCounter, 875 mSDsluCounter, 766 mSDsCounter, 0 mSdLazyCounter, 613 mSolverCounterSat, 161 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 883 SdHoareTripleChecker+Valid, 1093 SdHoareTripleChecker+Invalid, 774 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 161 IncrementalHoareTripleChecker+Valid, 613 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-07 01:45:26,717 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [883 Valid, 1093 Invalid, 774 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [161 Valid, 613 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-07 01:45:26,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5124 states. [2024-11-07 01:45:27,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5124 to 4567. [2024-11-07 01:45:27,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4567 states, 3588 states have (on average 1.2890189520624302) internal successors, (4625), 3635 states have internal predecessors, (4625), 492 states have call successors, (492), 407 states have call predecessors, (492), 485 states have return successors, (803), 528 states have call predecessors, (803), 488 states have call successors, (803) [2024-11-07 01:45:27,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4567 states to 4567 states and 5920 transitions. [2024-11-07 01:45:27,113 INFO L78 Accepts]: Start accepts. Automaton has 4567 states and 5920 transitions. Word has length 66 [2024-11-07 01:45:27,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:45:27,113 INFO L471 AbstractCegarLoop]: Abstraction has 4567 states and 5920 transitions. [2024-11-07 01:45:27,113 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:27,113 INFO L276 IsEmpty]: Start isEmpty. Operand 4567 states and 5920 transitions. [2024-11-07 01:45:27,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-07 01:45:27,115 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:45:27,115 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:27,115 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-07 01:45:27,115 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:45:27,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:45:27,116 INFO L85 PathProgramCache]: Analyzing trace with hash 1900419470, now seen corresponding path program 1 times [2024-11-07 01:45:27,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:45:27,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150805016] [2024-11-07 01:45:27,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:45:27,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:45:27,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:27,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:45:27,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:27,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-07 01:45:27,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:27,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 01:45:27,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:27,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 01:45:27,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:27,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 01:45:27,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:27,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 01:45:27,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:27,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 01:45:27,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:27,186 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-07 01:45:27,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:45:27,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150805016] [2024-11-07 01:45:27,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [150805016] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:45:27,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:45:27,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 01:45:27,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842111927] [2024-11-07 01:45:27,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:45:27,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 01:45:27,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:45:27,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 01:45:27,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-07 01:45:27,187 INFO L87 Difference]: Start difference. First operand 4567 states and 5920 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:27,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:45:27,925 INFO L93 Difference]: Finished difference Result 6642 states and 8502 transitions. [2024-11-07 01:45:27,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-07 01:45:27,926 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 73 [2024-11-07 01:45:27,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:45:27,951 INFO L225 Difference]: With dead ends: 6642 [2024-11-07 01:45:27,951 INFO L226 Difference]: Without dead ends: 3967 [2024-11-07 01:45:27,961 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:27,962 INFO L432 NwaCegarLoop]: 315 mSDtfsCounter, 1284 mSDsluCounter, 532 mSDsCounter, 0 mSdLazyCounter, 405 mSolverCounterSat, 169 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1312 SdHoareTripleChecker+Valid, 847 SdHoareTripleChecker+Invalid, 574 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 169 IncrementalHoareTripleChecker+Valid, 405 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-07 01:45:27,962 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1312 Valid, 847 Invalid, 574 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [169 Valid, 405 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-07 01:45:27,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3967 states. [2024-11-07 01:45:28,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3967 to 3592. [2024-11-07 01:45:28,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3592 states, 2827 states have (on average 1.2741422002122391) internal successors, (3602), 2866 states have internal predecessors, (3602), 394 states have call successors, (394), 325 states have call predecessors, (394), 369 states have return successors, (570), 404 states have call predecessors, (570), 390 states have call successors, (570) [2024-11-07 01:45:28,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3592 states to 3592 states and 4566 transitions. [2024-11-07 01:45:28,414 INFO L78 Accepts]: Start accepts. Automaton has 3592 states and 4566 transitions. Word has length 73 [2024-11-07 01:45:28,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:45:28,414 INFO L471 AbstractCegarLoop]: Abstraction has 3592 states and 4566 transitions. [2024-11-07 01:45:28,414 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:28,415 INFO L276 IsEmpty]: Start isEmpty. Operand 3592 states and 4566 transitions. [2024-11-07 01:45:28,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-07 01:45:28,416 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:45:28,416 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:28,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-07 01:45:28,417 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:45:28,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:45:28,417 INFO L85 PathProgramCache]: Analyzing trace with hash 442179811, now seen corresponding path program 1 times [2024-11-07 01:45:28,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:45:28,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175727201] [2024-11-07 01:45:28,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:45:28,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:45:28,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:28,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:45:28,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:28,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-07 01:45:28,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:28,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 01:45:28,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:28,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 01:45:28,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:28,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 01:45:28,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:28,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 01:45:28,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:28,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 01:45:28,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:28,516 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:28,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:45:28,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175727201] [2024-11-07 01:45:28,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1175727201] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:45:28,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:45:28,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:45:28,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450336934] [2024-11-07 01:45:28,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:45:28,517 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:45:28,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:45:28,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:45:28,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:45:28,518 INFO L87 Difference]: Start difference. First operand 3592 states and 4566 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:29,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:45:29,386 INFO L93 Difference]: Finished difference Result 5145 states and 6464 transitions. [2024-11-07 01:45:29,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-07 01:45:29,386 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:29,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:45:29,408 INFO L225 Difference]: With dead ends: 5145 [2024-11-07 01:45:29,409 INFO L226 Difference]: Without dead ends: 5142 [2024-11-07 01:45:29,411 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2024-11-07 01:45:29,411 INFO L432 NwaCegarLoop]: 321 mSDtfsCounter, 1791 mSDsluCounter, 534 mSDsCounter, 0 mSdLazyCounter, 428 mSolverCounterSat, 306 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1801 SdHoareTripleChecker+Valid, 855 SdHoareTripleChecker+Invalid, 734 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 306 IncrementalHoareTripleChecker+Valid, 428 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-07 01:45:29,412 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1801 Valid, 855 Invalid, 734 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [306 Valid, 428 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-07 01:45:29,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5142 states. [2024-11-07 01:45:29,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5142 to 4648. [2024-11-07 01:45:29,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4648 states, 3632 states have (on average 1.2599118942731278) internal successors, (4576), 3680 states have internal predecessors, (4576), 520 states have call successors, (520), 439 states have call predecessors, (520), 494 states have return successors, (763), 532 states have call predecessors, (763), 517 states have call successors, (763) [2024-11-07 01:45:29,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4648 states to 4648 states and 5859 transitions. [2024-11-07 01:45:29,804 INFO L78 Accepts]: Start accepts. Automaton has 4648 states and 5859 transitions. Word has length 73 [2024-11-07 01:45:29,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:45:29,805 INFO L471 AbstractCegarLoop]: Abstraction has 4648 states and 5859 transitions. [2024-11-07 01:45:29,805 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:29,805 INFO L276 IsEmpty]: Start isEmpty. Operand 4648 states and 5859 transitions. [2024-11-07 01:45:29,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-07 01:45:29,808 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:45:29,808 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:29,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-07 01:45:29,809 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:45:29,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:45:29,809 INFO L85 PathProgramCache]: Analyzing trace with hash 821569909, now seen corresponding path program 1 times [2024-11-07 01:45:29,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:45:29,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854327254] [2024-11-07 01:45:29,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:45:29,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:45:29,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:29,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:45:29,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:29,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-07 01:45:29,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:29,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 01:45:29,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:29,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 01:45:29,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:29,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 01:45:29,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:29,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 01:45:29,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:29,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 01:45:29,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:29,994 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:29,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:45:29,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854327254] [2024-11-07 01:45:29,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854327254] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 01:45:29,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1858225968] [2024-11-07 01:45:29,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:45:29,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 01:45:29,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 01:45:29,997 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:29,999 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:30,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:30,134 INFO L255 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-07 01:45:30,162 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 01:45:30,417 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:30,418 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 01:45:30,501 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:30,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1858225968] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 01:45:30,502 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 01:45:30,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 4] total 10 [2024-11-07 01:45:30,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591010501] [2024-11-07 01:45:30,502 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 01:45:30,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-07 01:45:30,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:45:30,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-07 01:45:30,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-07 01:45:30,504 INFO L87 Difference]: Start difference. First operand 4648 states and 5859 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:32,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:45:32,837 INFO L93 Difference]: Finished difference Result 10930 states and 13573 transitions. [2024-11-07 01:45:32,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-11-07 01:45:32,838 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:32,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:45:32,893 INFO L225 Difference]: With dead ends: 10930 [2024-11-07 01:45:32,893 INFO L226 Difference]: Without dead ends: 10927 [2024-11-07 01:45:32,898 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:32,898 INFO L432 NwaCegarLoop]: 405 mSDtfsCounter, 2131 mSDsluCounter, 1569 mSDsCounter, 0 mSdLazyCounter, 1851 mSolverCounterSat, 264 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2196 SdHoareTripleChecker+Valid, 1974 SdHoareTripleChecker+Invalid, 2115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 264 IncrementalHoareTripleChecker+Valid, 1851 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-07 01:45:32,899 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2196 Valid, 1974 Invalid, 2115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [264 Valid, 1851 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-07 01:45:32,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10927 states. [2024-11-07 01:45:33,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10927 to 8720. [2024-11-07 01:45:33,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8720 states, 6802 states have (on average 1.2491914142899148) internal successors, (8497), 6892 states have internal predecessors, (8497), 964 states have call successors, (964), 826 states have call predecessors, (964), 952 states have return successors, (1432), 1005 states have call predecessors, (1432), 961 states have call successors, (1432) [2024-11-07 01:45:33,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8720 states to 8720 states and 10893 transitions. [2024-11-07 01:45:33,790 INFO L78 Accepts]: Start accepts. Automaton has 8720 states and 10893 transitions. Word has length 74 [2024-11-07 01:45:33,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:45:33,790 INFO L471 AbstractCegarLoop]: Abstraction has 8720 states and 10893 transitions. [2024-11-07 01:45:33,791 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:33,791 INFO L276 IsEmpty]: Start isEmpty. Operand 8720 states and 10893 transitions. [2024-11-07 01:45:33,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-07 01:45:33,793 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:45:33,793 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:33,812 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-07 01:45:33,997 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,SelfDestructingSolverStorable11 [2024-11-07 01:45:33,998 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:45:33,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:45:33,999 INFO L85 PathProgramCache]: Analyzing trace with hash 1372581859, now seen corresponding path program 2 times [2024-11-07 01:45:33,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:45:33,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102001858] [2024-11-07 01:45:33,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:45:33,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:45:34,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:34,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:45:34,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:34,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-07 01:45:34,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:34,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 01:45:34,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:34,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 01:45:34,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:34,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 01:45:34,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:34,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 01:45:34,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:34,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 01:45:34,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:34,077 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:34,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:45:34,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102001858] [2024-11-07 01:45:34,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102001858] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:45:34,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:45:34,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 01:45:34,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269289028] [2024-11-07 01:45:34,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:45:34,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 01:45:34,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:45:34,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 01:45:34,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-07 01:45:34,081 INFO L87 Difference]: Start difference. First operand 8720 states and 10893 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:35,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:45:35,170 INFO L93 Difference]: Finished difference Result 13460 states and 16801 transitions. [2024-11-07 01:45:35,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 01:45:35,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:35,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:45:35,195 INFO L225 Difference]: With dead ends: 13460 [2024-11-07 01:45:35,195 INFO L226 Difference]: Without dead ends: 5471 [2024-11-07 01:45:35,216 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:35,217 INFO L432 NwaCegarLoop]: 349 mSDtfsCounter, 943 mSDsluCounter, 850 mSDsCounter, 0 mSdLazyCounter, 546 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 974 SdHoareTripleChecker+Valid, 1199 SdHoareTripleChecker+Invalid, 638 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 546 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-07 01:45:35,217 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [974 Valid, 1199 Invalid, 638 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 546 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-07 01:45:35,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5471 states. [2024-11-07 01:45:35,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5471 to 4598. [2024-11-07 01:45:35,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4598 states, 3622 states have (on average 1.2313638873550525) internal successors, (4460), 3666 states have internal predecessors, (4460), 498 states have call successors, (498), 416 states have call predecessors, (498), 476 states have return successors, (692), 519 states have call predecessors, (692), 495 states have call successors, (692) [2024-11-07 01:45:35,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4598 states to 4598 states and 5650 transitions. [2024-11-07 01:45:35,804 INFO L78 Accepts]: Start accepts. Automaton has 4598 states and 5650 transitions. Word has length 77 [2024-11-07 01:45:35,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:45:35,805 INFO L471 AbstractCegarLoop]: Abstraction has 4598 states and 5650 transitions. [2024-11-07 01:45:35,805 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:35,805 INFO L276 IsEmpty]: Start isEmpty. Operand 4598 states and 5650 transitions. [2024-11-07 01:45:35,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-07 01:45:35,807 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:45:35,807 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:35,807 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-07 01:45:35,807 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:45:35,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:45:35,807 INFO L85 PathProgramCache]: Analyzing trace with hash -365873625, now seen corresponding path program 1 times [2024-11-07 01:45:35,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:45:35,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217184801] [2024-11-07 01:45:35,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:45:35,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:45:35,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:35,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:45:35,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:35,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-07 01:45:35,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:35,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 01:45:35,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:35,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 01:45:35,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:35,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 01:45:35,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:35,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 01:45:35,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:35,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 01:45:35,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:35,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-07 01:45:35,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:35,949 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:35,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:45:35,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217184801] [2024-11-07 01:45:35,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1217184801] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:45:35,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:45:35,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 01:45:35,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364369673] [2024-11-07 01:45:35,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:45:35,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 01:45:35,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:45:35,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 01:45:35,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-07 01:45:35,953 INFO L87 Difference]: Start difference. First operand 4598 states and 5650 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:37,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:45:37,582 INFO L93 Difference]: Finished difference Result 13292 states and 16249 transitions. [2024-11-07 01:45:37,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-07 01:45:37,583 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:37,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:45:37,628 INFO L225 Difference]: With dead ends: 13292 [2024-11-07 01:45:37,628 INFO L226 Difference]: Without dead ends: 8978 [2024-11-07 01:45:37,643 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:37,643 INFO L432 NwaCegarLoop]: 336 mSDtfsCounter, 1143 mSDsluCounter, 1109 mSDsCounter, 0 mSdLazyCounter, 1083 mSolverCounterSat, 230 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1160 SdHoareTripleChecker+Valid, 1445 SdHoareTripleChecker+Invalid, 1313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 230 IncrementalHoareTripleChecker+Valid, 1083 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-07 01:45:37,644 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1160 Valid, 1445 Invalid, 1313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [230 Valid, 1083 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-07 01:45:37,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8978 states. [2024-11-07 01:45:38,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8978 to 8404. [2024-11-07 01:45:38,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8404 states, 6476 states have (on average 1.2053736874613958) internal successors, (7806), 6638 states have internal predecessors, (7806), 946 states have call successors, (946), 794 states have call predecessors, (946), 980 states have return successors, (1517), 978 states have call predecessors, (1517), 943 states have call successors, (1517) [2024-11-07 01:45:38,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8404 states to 8404 states and 10269 transitions. [2024-11-07 01:45:38,254 INFO L78 Accepts]: Start accepts. Automaton has 8404 states and 10269 transitions. Word has length 84 [2024-11-07 01:45:38,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:45:38,255 INFO L471 AbstractCegarLoop]: Abstraction has 8404 states and 10269 transitions. [2024-11-07 01:45:38,255 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:38,255 INFO L276 IsEmpty]: Start isEmpty. Operand 8404 states and 10269 transitions. [2024-11-07 01:45:38,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-07 01:45:38,260 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:45:38,260 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:38,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-07 01:45:38,260 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:45:38,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:45:38,261 INFO L85 PathProgramCache]: Analyzing trace with hash -122478559, now seen corresponding path program 1 times [2024-11-07 01:45:38,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:45:38,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645923332] [2024-11-07 01:45:38,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:45:38,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:45:38,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:38,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:45:38,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:38,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-07 01:45:38,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:38,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 01:45:38,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:38,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 01:45:38,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:38,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 01:45:38,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:38,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 01:45:38,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:38,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 01:45:38,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:38,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-07 01:45:38,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:38,393 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:38,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:45:38,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645923332] [2024-11-07 01:45:38,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645923332] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:45:38,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:45:38,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-07 01:45:38,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071779986] [2024-11-07 01:45:38,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:45:38,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 01:45:38,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:45:38,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 01:45:38,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-07 01:45:38,397 INFO L87 Difference]: Start difference. First operand 8404 states and 10269 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:40,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:45:40,043 INFO L93 Difference]: Finished difference Result 14837 states and 18055 transitions. [2024-11-07 01:45:40,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-07 01:45:40,043 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:40,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:45:40,080 INFO L225 Difference]: With dead ends: 14837 [2024-11-07 01:45:40,080 INFO L226 Difference]: Without dead ends: 7559 [2024-11-07 01:45:40,099 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=162, Invalid=540, Unknown=0, NotChecked=0, Total=702 [2024-11-07 01:45:40,099 INFO L432 NwaCegarLoop]: 319 mSDtfsCounter, 1645 mSDsluCounter, 1677 mSDsCounter, 0 mSdLazyCounter, 1328 mSolverCounterSat, 284 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1683 SdHoareTripleChecker+Valid, 1996 SdHoareTripleChecker+Invalid, 1612 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 284 IncrementalHoareTripleChecker+Valid, 1328 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-07 01:45:40,100 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1683 Valid, 1996 Invalid, 1612 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [284 Valid, 1328 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-07 01:45:40,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7559 states. [2024-11-07 01:45:40,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7559 to 7003. [2024-11-07 01:45:40,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7003 states, 5416 states have (on average 1.1992245199409157) internal successors, (6495), 5550 states have internal predecessors, (6495), 776 states have call successors, (776), 649 states have call predecessors, (776), 809 states have return successors, (1158), 810 states have call predecessors, (1158), 773 states have call successors, (1158) [2024-11-07 01:45:40,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7003 states to 7003 states and 8429 transitions. [2024-11-07 01:45:40,969 INFO L78 Accepts]: Start accepts. Automaton has 7003 states and 8429 transitions. Word has length 93 [2024-11-07 01:45:40,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:45:40,970 INFO L471 AbstractCegarLoop]: Abstraction has 7003 states and 8429 transitions. [2024-11-07 01:45:40,970 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:40,970 INFO L276 IsEmpty]: Start isEmpty. Operand 7003 states and 8429 transitions. [2024-11-07 01:45:40,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-07 01:45:40,978 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:45:40,978 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:45:40,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-07 01:45:40,978 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:45:40,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:45:40,979 INFO L85 PathProgramCache]: Analyzing trace with hash 1286752545, now seen corresponding path program 1 times [2024-11-07 01:45:40,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:45:40,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791902674] [2024-11-07 01:45:40,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:45:40,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:45:40,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:41,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:45:41,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:41,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 01:45:41,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:41,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-07 01:45:41,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:41,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 01:45:41,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:41,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-07 01:45:41,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:41,106 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,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:45:41,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791902674] [2024-11-07 01:45:41,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791902674] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:45:41,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:45:41,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 01:45:41,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180814216] [2024-11-07 01:45:41,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:45:41,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 01:45:41,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:45:41,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 01:45:41,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 01:45:41,109 INFO L87 Difference]: Start difference. First operand 7003 states and 8429 transitions. Second operand has 5 states, 5 states have (on average 22.6) internal successors, (113), 3 states have internal predecessors, (113), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:45:43,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:45:43,595 INFO L93 Difference]: Finished difference Result 7348 states and 8975 transitions. [2024-11-07 01:45:43,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 01:45:43,595 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.6) internal successors, (113), 3 states have internal predecessors, (113), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 124 [2024-11-07 01:45:43,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:45:43,627 INFO L225 Difference]: With dead ends: 7348 [2024-11-07 01:45:43,627 INFO L226 Difference]: Without dead ends: 7090 [2024-11-07 01:45:43,634 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-11-07 01:45:43,635 INFO L432 NwaCegarLoop]: 325 mSDtfsCounter, 780 mSDsluCounter, 460 mSDsCounter, 0 mSdLazyCounter, 792 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 799 SdHoareTripleChecker+Valid, 785 SdHoareTripleChecker+Invalid, 872 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 792 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-07 01:45:43,636 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [799 Valid, 785 Invalid, 872 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 792 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-07 01:45:43,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7090 states. [2024-11-07 01:45:44,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7090 to 7003. [2024-11-07 01:45:44,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7003 states, 5416 states have (on average 1.1990398818316101) internal successors, (6494), 5550 states have internal predecessors, (6494), 776 states have call successors, (776), 649 states have call predecessors, (776), 809 states have return successors, (1158), 810 states have call predecessors, (1158), 773 states have call successors, (1158) [2024-11-07 01:45:44,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7003 states to 7003 states and 8428 transitions. [2024-11-07 01:45:44,836 INFO L78 Accepts]: Start accepts. Automaton has 7003 states and 8428 transitions. Word has length 124 [2024-11-07 01:45:44,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:45:44,837 INFO L471 AbstractCegarLoop]: Abstraction has 7003 states and 8428 transitions. [2024-11-07 01:45:44,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.6) internal successors, (113), 3 states have internal predecessors, (113), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:45:44,837 INFO L276 IsEmpty]: Start isEmpty. Operand 7003 states and 8428 transitions. [2024-11-07 01:45:44,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-07 01:45:44,844 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:45:44,844 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:45:44,844 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-07 01:45:44,844 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:45:44,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:45:44,845 INFO L85 PathProgramCache]: Analyzing trace with hash -440392417, now seen corresponding path program 1 times [2024-11-07 01:45:44,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:45:44,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166098243] [2024-11-07 01:45:44,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:45:44,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:45:44,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:44,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:45:44,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:44,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 01:45:44,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:44,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-07 01:45:44,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:44,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 01:45:44,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:44,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-07 01:45:44,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:44,998 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,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:45:44,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166098243] [2024-11-07 01:45:44,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166098243] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:45:44,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:45:44,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 01:45:44,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769622925] [2024-11-07 01:45:44,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:45:44,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 01:45:44,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:45:44,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 01:45:44,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 01:45:44,999 INFO L87 Difference]: Start difference. First operand 7003 states and 8428 transitions. Second operand has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 4 states have internal predecessors, (113), 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,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:45:47,928 INFO L93 Difference]: Finished difference Result 7689 states and 9515 transitions. [2024-11-07 01:45:47,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 01:45:47,929 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 4 states have internal predecessors, (113), 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 124 [2024-11-07 01:45:47,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:45:47,962 INFO L225 Difference]: With dead ends: 7689 [2024-11-07 01:45:47,963 INFO L226 Difference]: Without dead ends: 7437 [2024-11-07 01:45:47,968 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-11-07 01:45:47,969 INFO L432 NwaCegarLoop]: 326 mSDtfsCounter, 1231 mSDsluCounter, 918 mSDsCounter, 0 mSdLazyCounter, 1614 mSolverCounterSat, 130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1255 SdHoareTripleChecker+Valid, 1244 SdHoareTripleChecker+Invalid, 1744 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 1614 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-07 01:45:47,969 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1255 Valid, 1244 Invalid, 1744 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [130 Valid, 1614 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-07 01:45:47,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7437 states. [2024-11-07 01:45:48,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7437 to 7262. [2024-11-07 01:45:48,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7262 states, 5652 states have (on average 1.2142604387827318) internal successors, (6863), 5787 states have internal predecessors, (6863), 792 states have call successors, (792), 655 states have call predecessors, (792), 816 states have return successors, (1177), 826 states have call predecessors, (1177), 789 states have call successors, (1177) [2024-11-07 01:45:48,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7262 states to 7262 states and 8832 transitions. [2024-11-07 01:45:48,982 INFO L78 Accepts]: Start accepts. Automaton has 7262 states and 8832 transitions. Word has length 124 [2024-11-07 01:45:48,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:45:48,982 INFO L471 AbstractCegarLoop]: Abstraction has 7262 states and 8832 transitions. [2024-11-07 01:45:48,982 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 4 states have internal predecessors, (113), 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:48,982 INFO L276 IsEmpty]: Start isEmpty. Operand 7262 states and 8832 transitions. [2024-11-07 01:45:48,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-07 01:45:48,990 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:45:48,990 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:45:48,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-07 01:45:48,990 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:45:48,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:45:48,990 INFO L85 PathProgramCache]: Analyzing trace with hash -1458040805, now seen corresponding path program 1 times [2024-11-07 01:45:48,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:45:48,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052715417] [2024-11-07 01:45:48,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:45:48,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:45:49,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:49,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:45:49,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:49,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 01:45:49,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:49,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-07 01:45:49,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:49,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 01:45:49,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:49,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-07 01:45:49,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:49,172 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:49,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:45:49,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052715417] [2024-11-07 01:45:49,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2052715417] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:45:49,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:45:49,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:45:49,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670357759] [2024-11-07 01:45:49,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:45:49,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:45:49,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:45:49,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:45:49,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:45:49,175 INFO L87 Difference]: Start difference. First operand 7262 states and 8832 transitions. Second operand has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 5 states have internal predecessors, (113), 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,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:45:51,942 INFO L93 Difference]: Finished difference Result 8303 states and 10480 transitions. [2024-11-07 01:45:51,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 01:45:51,942 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 5 states have internal predecessors, (113), 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 124 [2024-11-07 01:45:51,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:45:51,970 INFO L225 Difference]: With dead ends: 8303 [2024-11-07 01:45:51,970 INFO L226 Difference]: Without dead ends: 7792 [2024-11-07 01:45:51,973 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-07 01:45:51,974 INFO L432 NwaCegarLoop]: 336 mSDtfsCounter, 1305 mSDsluCounter, 1150 mSDsCounter, 0 mSdLazyCounter, 2274 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1329 SdHoareTripleChecker+Valid, 1486 SdHoareTripleChecker+Invalid, 2389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 2274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-07 01:45:51,974 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1329 Valid, 1486 Invalid, 2389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 2274 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-07 01:45:51,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7792 states. [2024-11-07 01:45:52,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7792 to 7504. [2024-11-07 01:45:52,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7504 states, 5871 states have (on average 1.2260262306251064) internal successors, (7198), 6007 states have internal predecessors, (7198), 808 states have call successors, (808), 661 states have call predecessors, (808), 823 states have return successors, (1195), 843 states have call predecessors, (1195), 805 states have call successors, (1195) [2024-11-07 01:45:52,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7504 states to 7504 states and 9201 transitions. [2024-11-07 01:45:52,981 INFO L78 Accepts]: Start accepts. Automaton has 7504 states and 9201 transitions. Word has length 124 [2024-11-07 01:45:52,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:45:52,981 INFO L471 AbstractCegarLoop]: Abstraction has 7504 states and 9201 transitions. [2024-11-07 01:45:52,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 5 states have internal predecessors, (113), 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:52,981 INFO L276 IsEmpty]: Start isEmpty. Operand 7504 states and 9201 transitions. [2024-11-07 01:45:52,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-07 01:45:52,987 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:45:52,987 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:45:52,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-07 01:45:52,987 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:45:52,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:45:52,988 INFO L85 PathProgramCache]: Analyzing trace with hash -1339599331, now seen corresponding path program 1 times [2024-11-07 01:45:52,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:45:52,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510126373] [2024-11-07 01:45:52,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:45:52,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:45:52,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:53,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:45:53,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:53,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 01:45:53,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:53,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-07 01:45:53,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:53,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 01:45:53,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:53,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-07 01:45:53,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:53,159 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:53,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:45:53,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510126373] [2024-11-07 01:45:53,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510126373] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:45:53,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:45:53,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:45:53,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019901201] [2024-11-07 01:45:53,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:45:53,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:45:53,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:45:53,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:45:53,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:45:53,161 INFO L87 Difference]: Start difference. First operand 7504 states and 9201 transitions. Second operand has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 5 states have internal predecessors, (113), 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:56,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:45:56,008 INFO L93 Difference]: Finished difference Result 9208 states and 11893 transitions. [2024-11-07 01:45:56,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 01:45:56,008 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 5 states have internal predecessors, (113), 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 124 [2024-11-07 01:45:56,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:45:56,041 INFO L225 Difference]: With dead ends: 9208 [2024-11-07 01:45:56,042 INFO L226 Difference]: Without dead ends: 8455 [2024-11-07 01:45:56,048 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-07 01:45:56,049 INFO L432 NwaCegarLoop]: 470 mSDtfsCounter, 1248 mSDsluCounter, 1595 mSDsCounter, 0 mSdLazyCounter, 2500 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1272 SdHoareTripleChecker+Valid, 2065 SdHoareTripleChecker+Invalid, 2591 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 2500 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-07 01:45:56,049 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1272 Valid, 2065 Invalid, 2591 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 2500 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-07 01:45:56,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8455 states. [2024-11-07 01:45:57,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8455 to 7989. [2024-11-07 01:45:57,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7989 states, 6310 states have (on average 1.247068145800317) internal successors, (7869), 6448 states have internal predecessors, (7869), 840 states have call successors, (840), 673 states have call predecessors, (840), 837 states have return successors, (1235), 877 states have call predecessors, (1235), 837 states have call successors, (1235) [2024-11-07 01:45:57,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7989 states to 7989 states and 9944 transitions. [2024-11-07 01:45:57,303 INFO L78 Accepts]: Start accepts. Automaton has 7989 states and 9944 transitions. Word has length 124 [2024-11-07 01:45:57,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:45:57,303 INFO L471 AbstractCegarLoop]: Abstraction has 7989 states and 9944 transitions. [2024-11-07 01:45:57,303 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 5 states have internal predecessors, (113), 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,303 INFO L276 IsEmpty]: Start isEmpty. Operand 7989 states and 9944 transitions. [2024-11-07 01:45:57,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-07 01:45:57,309 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:45:57,309 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:45:57,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-07 01:45:57,310 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:45:57,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:45:57,310 INFO L85 PathProgramCache]: Analyzing trace with hash 49694683, now seen corresponding path program 1 times [2024-11-07 01:45:57,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:45:57,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596694003] [2024-11-07 01:45:57,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:45:57,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:45:57,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:57,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:45:57,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:57,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 01:45:57,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:57,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-07 01:45:57,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:57,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 01:45:57,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:57,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-07 01:45:57,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:57,493 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:57,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:45:57,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596694003] [2024-11-07 01:45:57,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596694003] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:45:57,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:45:57,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:45:57,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690625797] [2024-11-07 01:45:57,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:45:57,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:45:57,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:45:57,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:45:57,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:45:57,495 INFO L87 Difference]: Start difference. First operand 7989 states and 9944 transitions. Second operand has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 5 states have internal predecessors, (113), 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:00,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:46:00,459 INFO L93 Difference]: Finished difference Result 10953 states and 14604 transitions. [2024-11-07 01:46:00,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 01:46:00,460 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 5 states have internal predecessors, (113), 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 124 [2024-11-07 01:46:00,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:46:00,500 INFO L225 Difference]: With dead ends: 10953 [2024-11-07 01:46:00,501 INFO L226 Difference]: Without dead ends: 9715 [2024-11-07 01:46:00,511 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-07 01:46:00,511 INFO L432 NwaCegarLoop]: 470 mSDtfsCounter, 1246 mSDsluCounter, 1595 mSDsCounter, 0 mSdLazyCounter, 2492 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1270 SdHoareTripleChecker+Valid, 2065 SdHoareTripleChecker+Invalid, 2583 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 2492 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-07 01:46:00,511 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1270 Valid, 2065 Invalid, 2583 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 2492 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-07 01:46:00,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9715 states. [2024-11-07 01:46:01,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9715 to 8960. [2024-11-07 01:46:01,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8960 states, 7189 states have (on average 1.2812630407567116) internal successors, (9211), 7331 states have internal predecessors, (9211), 904 states have call successors, (904), 697 states have call predecessors, (904), 865 states have return successors, (1321), 945 states have call predecessors, (1321), 901 states have call successors, (1321) [2024-11-07 01:46:01,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8960 states to 8960 states and 11436 transitions. [2024-11-07 01:46:01,633 INFO L78 Accepts]: Start accepts. Automaton has 8960 states and 11436 transitions. Word has length 124 [2024-11-07 01:46:01,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:46:01,633 INFO L471 AbstractCegarLoop]: Abstraction has 8960 states and 11436 transitions. [2024-11-07 01:46:01,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 5 states have internal predecessors, (113), 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:01,633 INFO L276 IsEmpty]: Start isEmpty. Operand 8960 states and 11436 transitions. [2024-11-07 01:46:01,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-07 01:46:01,640 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:46:01,641 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:46:01,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-07 01:46:01,641 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:46:01,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:46:01,644 INFO L85 PathProgramCache]: Analyzing trace with hash -1983699363, now seen corresponding path program 1 times [2024-11-07 01:46:01,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:46:01,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343880754] [2024-11-07 01:46:01,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:46:01,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:46:01,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:01,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:46:01,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:01,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 01:46:01,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:01,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-07 01:46:01,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:01,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 01:46:01,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:01,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-07 01:46:01,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:01,815 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:01,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:46:01,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343880754] [2024-11-07 01:46:01,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343880754] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:46:01,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:46:01,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:46:01,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889220141] [2024-11-07 01:46:01,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:46:01,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:46:01,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:46:01,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:46:01,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:46:01,818 INFO L87 Difference]: Start difference. First operand 8960 states and 11436 transitions. Second operand has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 5 states have internal predecessors, (113), 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:03,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:46:03,797 INFO L93 Difference]: Finished difference Result 11927 states and 16129 transitions. [2024-11-07 01:46:03,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 01:46:03,797 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 5 states have internal predecessors, (113), 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 124 [2024-11-07 01:46:03,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:46:03,834 INFO L225 Difference]: With dead ends: 11927 [2024-11-07 01:46:03,834 INFO L226 Difference]: Without dead ends: 9718 [2024-11-07 01:46:03,843 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-11-07 01:46:03,844 INFO L432 NwaCegarLoop]: 280 mSDtfsCounter, 1134 mSDsluCounter, 689 mSDsCounter, 0 mSdLazyCounter, 1189 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1159 SdHoareTripleChecker+Valid, 969 SdHoareTripleChecker+Invalid, 1320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 1189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-07 01:46:03,844 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1159 Valid, 969 Invalid, 1320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 1189 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-07 01:46:03,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9718 states. [2024-11-07 01:46:05,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9718 to 8960. [2024-11-07 01:46:05,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8960 states, 7189 states have (on average 1.280011128112394) internal successors, (9202), 7331 states have internal predecessors, (9202), 904 states have call successors, (904), 697 states have call predecessors, (904), 865 states have return successors, (1321), 945 states have call predecessors, (1321), 901 states have call successors, (1321) [2024-11-07 01:46:05,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8960 states to 8960 states and 11427 transitions. [2024-11-07 01:46:05,214 INFO L78 Accepts]: Start accepts. Automaton has 8960 states and 11427 transitions. Word has length 124 [2024-11-07 01:46:05,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:46:05,214 INFO L471 AbstractCegarLoop]: Abstraction has 8960 states and 11427 transitions. [2024-11-07 01:46:05,214 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 5 states have internal predecessors, (113), 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:05,215 INFO L276 IsEmpty]: Start isEmpty. Operand 8960 states and 11427 transitions. [2024-11-07 01:46:05,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-07 01:46:05,222 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:46:05,222 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-07 01:46:05,223 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:46:05,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:46:05,223 INFO L85 PathProgramCache]: Analyzing trace with hash 1004125535, now seen corresponding path program 1 times [2024-11-07 01:46:05,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:46:05,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770006528] [2024-11-07 01:46:05,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:46:05,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:46:05,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:05,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:46:05,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:05,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 01:46:05,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:05,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-07 01:46:05,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:05,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 01:46:05,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:05,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-07 01:46:05,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:05,405 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:05,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:46:05,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770006528] [2024-11-07 01:46:05,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770006528] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:46:05,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:46:05,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:46:05,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176941784] [2024-11-07 01:46:05,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:46:05,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:46:05,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:46:05,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:46:05,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:46:05,408 INFO L87 Difference]: Start difference. First operand 8960 states and 11427 transitions. Second operand has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 5 states have internal predecessors, (113), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:46:07,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:46:07,561 INFO L93 Difference]: Finished difference Result 11917 states and 16082 transitions. [2024-11-07 01:46:07,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 01:46:07,562 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 5 states have internal predecessors, (113), 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 124 [2024-11-07 01:46:07,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:46:07,599 INFO L225 Difference]: With dead ends: 11917 [2024-11-07 01:46:07,599 INFO L226 Difference]: Without dead ends: 9708 [2024-11-07 01:46:07,608 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-11-07 01:46:07,609 INFO L432 NwaCegarLoop]: 280 mSDtfsCounter, 1132 mSDsluCounter, 689 mSDsCounter, 0 mSdLazyCounter, 1175 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1157 SdHoareTripleChecker+Valid, 969 SdHoareTripleChecker+Invalid, 1306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 1175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-07 01:46:07,609 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1157 Valid, 969 Invalid, 1306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 1175 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-07 01:46:07,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9708 states. [2024-11-07 01:46:08,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9708 to 8960. [2024-11-07 01:46:08,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8960 states, 7189 states have (on average 1.2787592154680762) internal successors, (9193), 7331 states have internal predecessors, (9193), 904 states have call successors, (904), 697 states have call predecessors, (904), 865 states have return successors, (1321), 945 states have call predecessors, (1321), 901 states have call successors, (1321) [2024-11-07 01:46:08,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8960 states to 8960 states and 11418 transitions. [2024-11-07 01:46:08,682 INFO L78 Accepts]: Start accepts. Automaton has 8960 states and 11418 transitions. Word has length 124 [2024-11-07 01:46:08,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:46:08,683 INFO L471 AbstractCegarLoop]: Abstraction has 8960 states and 11418 transitions. [2024-11-07 01:46:08,683 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 5 states have internal predecessors, (113), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:46:08,683 INFO L276 IsEmpty]: Start isEmpty. Operand 8960 states and 11418 transitions. [2024-11-07 01:46:08,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-07 01:46:08,688 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:46:08,688 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:46:08,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-07 01:46:08,688 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:46:08,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:46:08,688 INFO L85 PathProgramCache]: Analyzing trace with hash -1393344995, now seen corresponding path program 1 times [2024-11-07 01:46:08,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:46:08,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011718915] [2024-11-07 01:46:08,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:46:08,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:46:08,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:08,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:46:08,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:08,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 01:46:08,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:08,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-07 01:46:08,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:08,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 01:46:08,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:08,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-07 01:46:08,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:08,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:46:08,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:46:08,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011718915] [2024-11-07 01:46:08,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011718915] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:46:08,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:46:08,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:46:08,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140627159] [2024-11-07 01:46:08,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:46:08,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:46:08,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:46:08,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:46:08,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:46:08,889 INFO L87 Difference]: Start difference. First operand 8960 states and 11418 transitions. Second operand has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 5 states have internal predecessors, (113), 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:10,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:46:10,708 INFO L93 Difference]: Finished difference Result 11907 states and 16035 transitions. [2024-11-07 01:46:10,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 01:46:10,708 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 5 states have internal predecessors, (113), 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 124 [2024-11-07 01:46:10,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:46:10,737 INFO L225 Difference]: With dead ends: 11907 [2024-11-07 01:46:10,738 INFO L226 Difference]: Without dead ends: 9698 [2024-11-07 01:46:10,748 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-11-07 01:46:10,748 INFO L432 NwaCegarLoop]: 280 mSDtfsCounter, 1130 mSDsluCounter, 689 mSDsCounter, 0 mSdLazyCounter, 1161 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1155 SdHoareTripleChecker+Valid, 969 SdHoareTripleChecker+Invalid, 1292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 1161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-07 01:46:10,749 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1155 Valid, 969 Invalid, 1292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 1161 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-07 01:46:10,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9698 states. [2024-11-07 01:46:11,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9698 to 8960. [2024-11-07 01:46:11,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8960 states, 7189 states have (on average 1.2775073028237585) internal successors, (9184), 7331 states have internal predecessors, (9184), 904 states have call successors, (904), 697 states have call predecessors, (904), 865 states have return successors, (1321), 945 states have call predecessors, (1321), 901 states have call successors, (1321) [2024-11-07 01:46:11,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8960 states to 8960 states and 11409 transitions. [2024-11-07 01:46:11,791 INFO L78 Accepts]: Start accepts. Automaton has 8960 states and 11409 transitions. Word has length 124 [2024-11-07 01:46:11,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:46:11,791 INFO L471 AbstractCegarLoop]: Abstraction has 8960 states and 11409 transitions. [2024-11-07 01:46:11,792 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 5 states have internal predecessors, (113), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:46:11,792 INFO L276 IsEmpty]: Start isEmpty. Operand 8960 states and 11409 transitions. [2024-11-07 01:46:11,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-07 01:46:11,796 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:46:11,796 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:46:11,797 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-07 01:46:11,797 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:46:11,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:46:11,797 INFO L85 PathProgramCache]: Analyzing trace with hash -362304097, now seen corresponding path program 1 times [2024-11-07 01:46:11,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:46:11,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072909611] [2024-11-07 01:46:11,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:46:11,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:46:11,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:11,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:46:11,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:11,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 01:46:11,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:11,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-07 01:46:11,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:11,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 01:46:11,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:11,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-07 01:46:11,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:11,948 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:11,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:46:11,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072909611] [2024-11-07 01:46:11,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072909611] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:46:11,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:46:11,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:46:11,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141193460] [2024-11-07 01:46:11,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:46:11,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:46:11,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:46:11,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:46:11,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:46:11,950 INFO L87 Difference]: Start difference. First operand 8960 states and 11409 transitions. Second operand has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 5 states have internal predecessors, (113), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:46:15,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:46:15,162 INFO L93 Difference]: Finished difference Result 15261 states and 21136 transitions. [2024-11-07 01:46:15,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-07 01:46:15,162 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 5 states have internal predecessors, (113), 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 124 [2024-11-07 01:46:15,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:46:15,200 INFO L225 Difference]: With dead ends: 15261 [2024-11-07 01:46:15,200 INFO L226 Difference]: Without dead ends: 13052 [2024-11-07 01:46:15,210 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-11-07 01:46:15,210 INFO L432 NwaCegarLoop]: 468 mSDtfsCounter, 1294 mSDsluCounter, 1587 mSDsCounter, 0 mSdLazyCounter, 2853 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1317 SdHoareTripleChecker+Valid, 2055 SdHoareTripleChecker+Invalid, 2946 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 2853 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-07 01:46:15,210 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1317 Valid, 2055 Invalid, 2946 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 2853 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-07 01:46:15,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13052 states. [2024-11-07 01:46:16,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13052 to 10919. [2024-11-07 01:46:16,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10919 states, 8972 states have (on average 1.3243423985733394) internal successors, (11882), 9122 states have internal predecessors, (11882), 1024 states have call successors, (1024), 745 states have call predecessors, (1024), 921 states have return successors, (1503), 1073 states have call predecessors, (1503), 1021 states have call successors, (1503) [2024-11-07 01:46:16,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10919 states to 10919 states and 14409 transitions. [2024-11-07 01:46:16,397 INFO L78 Accepts]: Start accepts. Automaton has 10919 states and 14409 transitions. Word has length 124 [2024-11-07 01:46:16,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:46:16,397 INFO L471 AbstractCegarLoop]: Abstraction has 10919 states and 14409 transitions. [2024-11-07 01:46:16,397 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 5 states have internal predecessors, (113), 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:16,397 INFO L276 IsEmpty]: Start isEmpty. Operand 10919 states and 14409 transitions. [2024-11-07 01:46:16,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-07 01:46:16,404 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:46:16,404 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:46:16,404 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-07 01:46:16,404 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:46:16,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:46:16,405 INFO L85 PathProgramCache]: Analyzing trace with hash 2026259933, now seen corresponding path program 1 times [2024-11-07 01:46:16,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:46:16,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455676491] [2024-11-07 01:46:16,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:46:16,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:46:16,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:16,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:46:16,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:16,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 01:46:16,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:16,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-07 01:46:16,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:16,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 01:46:16,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:16,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-07 01:46:16,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:16,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:46:16,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:46:16,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455676491] [2024-11-07 01:46:16,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455676491] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:46:16,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:46:16,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:46:16,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902382068] [2024-11-07 01:46:16,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:46:16,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:46:16,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:46:16,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:46:16,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:46:16,568 INFO L87 Difference]: Start difference. First operand 10919 states and 14409 transitions. Second operand has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 5 states have internal predecessors, (113), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:46:19,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:46:19,841 INFO L93 Difference]: Finished difference Result 22838 states and 32838 transitions. [2024-11-07 01:46:19,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-07 01:46:19,842 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 5 states have internal predecessors, (113), 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 124 [2024-11-07 01:46:19,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:46:19,897 INFO L225 Difference]: With dead ends: 22838 [2024-11-07 01:46:19,897 INFO L226 Difference]: Without dead ends: 18670 [2024-11-07 01:46:19,910 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-11-07 01:46:19,910 INFO L432 NwaCegarLoop]: 328 mSDtfsCounter, 1537 mSDsluCounter, 1136 mSDsCounter, 0 mSdLazyCounter, 2153 mSolverCounterSat, 118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1569 SdHoareTripleChecker+Valid, 1464 SdHoareTripleChecker+Invalid, 2271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 2153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-07 01:46:19,910 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1569 Valid, 1464 Invalid, 2271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [118 Valid, 2153 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-07 01:46:19,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18670 states. [2024-11-07 01:46:21,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18670 to 14660. [2024-11-07 01:46:21,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14660 states, 12369 states have (on average 1.3727868057239874) internal successors, (16980), 12535 states have internal predecessors, (16980), 1256 states have call successors, (1256), 841 states have call predecessors, (1256), 1033 states have return successors, (1913), 1321 states have call predecessors, (1913), 1253 states have call successors, (1913) [2024-11-07 01:46:21,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14660 states to 14660 states and 20149 transitions. [2024-11-07 01:46:21,301 INFO L78 Accepts]: Start accepts. Automaton has 14660 states and 20149 transitions. Word has length 124 [2024-11-07 01:46:21,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:46:21,301 INFO L471 AbstractCegarLoop]: Abstraction has 14660 states and 20149 transitions. [2024-11-07 01:46:21,301 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 5 states have internal predecessors, (113), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:46:21,301 INFO L276 IsEmpty]: Start isEmpty. Operand 14660 states and 20149 transitions. [2024-11-07 01:46:21,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-07 01:46:21,308 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:46:21,308 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:46:21,308 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-07 01:46:21,308 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:46:21,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:46:21,309 INFO L85 PathProgramCache]: Analyzing trace with hash -667636257, now seen corresponding path program 1 times [2024-11-07 01:46:21,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:46:21,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604880833] [2024-11-07 01:46:21,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:46:21,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:46:21,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:21,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:46:21,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:21,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 01:46:21,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:21,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-07 01:46:21,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:21,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 01:46:21,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:21,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-07 01:46:21,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:21,463 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:21,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:46:21,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604880833] [2024-11-07 01:46:21,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604880833] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:46:21,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:46:21,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:46:21,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122340470] [2024-11-07 01:46:21,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:46:21,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:46:21,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:46:21,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:46:21,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:46:21,465 INFO L87 Difference]: Start difference. First operand 14660 states and 20149 transitions. Second operand has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 5 states have internal predecessors, (113), 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)