./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.13.cil-1.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_3.cil+token_ring.13.cil-1.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', '0e49baa02682605d5c6b8a86e9e1d38b2cd4076796b3122e76d3b43b5274a0df'] 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_3.cil+token_ring.13.cil-1.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 0e49baa02682605d5c6b8a86e9e1d38b2cd4076796b3122e76d3b43b5274a0df --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 01:49:08,224 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 01:49:08,300 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:49:08,305 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 01:49:08,305 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 01:49:08,324 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 01:49:08,325 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 01:49:08,325 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 01:49:08,325 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 01:49:08,325 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 01:49:08,325 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 01:49:08,326 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 01:49:08,326 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 01:49:08,326 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 01:49:08,326 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 01:49:08,326 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 01:49:08,326 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 01:49:08,327 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 01:49:08,327 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 01:49:08,327 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 01:49:08,327 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 01:49:08,327 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 01:49:08,328 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 01:49:08,328 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 01:49:08,328 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 01:49:08,328 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 01:49:08,328 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 01:49:08,328 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 01:49:08,328 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 01:49:08,329 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 01:49:08,329 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 01:49:08,329 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 01:49:08,329 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 01:49:08,329 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 01:49:08,329 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 01:49:08,329 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 01:49:08,329 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 01:49:08,330 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 01:49:08,330 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 01:49:08,330 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 01:49:08,330 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 01:49:08,330 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 01:49:08,330 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 -> 0e49baa02682605d5c6b8a86e9e1d38b2cd4076796b3122e76d3b43b5274a0df [2024-11-07 01:49:08,619 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 01:49:08,627 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 01:49:08,630 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 01:49:08,631 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 01:49:08,631 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 01:49:08,633 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.13.cil-1.c [2024-11-07 01:49:09,938 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 01:49:10,215 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 01:49:10,219 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.13.cil-1.c [2024-11-07 01:49:10,236 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d1811cb04/c4e7840b5bbb428ebaea044889056ad8/FLAG45188f431 [2024-11-07 01:49:10,255 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d1811cb04/c4e7840b5bbb428ebaea044889056ad8 [2024-11-07 01:49:10,257 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 01:49:10,259 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 01:49:10,260 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 01:49:10,261 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 01:49:10,265 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 01:49:10,265 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:49:10" (1/1) ... [2024-11-07 01:49:10,268 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6541ff9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:49:10, skipping insertion in model container [2024-11-07 01:49:10,268 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:49:10" (1/1) ... [2024-11-07 01:49:10,306 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 01:49:10,444 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_3.cil+token_ring.13.cil-1.c[911,924] [2024-11-07 01:49:10,508 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_3.cil+token_ring.13.cil-1.c[8416,8429] [2024-11-07 01:49:10,614 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 01:49:10,628 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 01:49:10,635 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_3.cil+token_ring.13.cil-1.c[911,924] [2024-11-07 01:49:10,655 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_3.cil+token_ring.13.cil-1.c[8416,8429] [2024-11-07 01:49:10,706 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 01:49:10,733 INFO L204 MainTranslator]: Completed translation [2024-11-07 01:49:10,733 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:49:10 WrapperNode [2024-11-07 01:49:10,734 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 01:49:10,734 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 01:49:10,735 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 01:49:10,735 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 01:49:10,740 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:49:10" (1/1) ... [2024-11-07 01:49:10,759 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:49:10" (1/1) ... [2024-11-07 01:49:10,830 INFO L138 Inliner]: procedures = 81, calls = 101, calls flagged for inlining = 49, calls inlined = 49, statements flattened = 1172 [2024-11-07 01:49:10,830 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 01:49:10,831 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 01:49:10,831 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 01:49:10,831 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 01:49:10,843 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:49:10" (1/1) ... [2024-11-07 01:49:10,843 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:49:10" (1/1) ... [2024-11-07 01:49:10,849 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:49:10" (1/1) ... [2024-11-07 01:49:10,882 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:49:10,886 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:49:10" (1/1) ... [2024-11-07 01:49:10,887 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:49:10" (1/1) ... [2024-11-07 01:49:10,907 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:49:10" (1/1) ... [2024-11-07 01:49:10,929 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:49:10" (1/1) ... [2024-11-07 01:49:10,937 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:49:10" (1/1) ... [2024-11-07 01:49:10,944 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:49:10" (1/1) ... [2024-11-07 01:49:10,954 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 01:49:10,955 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 01:49:10,955 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 01:49:10,955 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 01:49:10,958 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:49:10" (1/1) ... [2024-11-07 01:49:10,966 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 01:49:10,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 01:49:10,993 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:49:11,000 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:49:11,020 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 01:49:11,021 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-11-07 01:49:11,021 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-11-07 01:49:11,021 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2024-11-07 01:49:11,021 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2024-11-07 01:49:11,021 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2024-11-07 01:49:11,021 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2024-11-07 01:49:11,022 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2024-11-07 01:49:11,022 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2024-11-07 01:49:11,022 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2024-11-07 01:49:11,022 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2024-11-07 01:49:11,022 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2024-11-07 01:49:11,022 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2024-11-07 01:49:11,022 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2024-11-07 01:49:11,022 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2024-11-07 01:49:11,022 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2024-11-07 01:49:11,023 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2024-11-07 01:49:11,023 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2024-11-07 01:49:11,023 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2024-11-07 01:49:11,023 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2024-11-07 01:49:11,023 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2024-11-07 01:49:11,023 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2024-11-07 01:49:11,023 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2024-11-07 01:49:11,024 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 01:49:11,024 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2024-11-07 01:49:11,024 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2024-11-07 01:49:11,024 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2024-11-07 01:49:11,024 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2024-11-07 01:49:11,024 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 01:49:11,024 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 01:49:11,024 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2024-11-07 01:49:11,024 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2024-11-07 01:49:11,024 INFO L130 BoogieDeclarations]: Found specification of procedure error2 [2024-11-07 01:49:11,024 INFO L138 BoogieDeclarations]: Found implementation of procedure error2 [2024-11-07 01:49:11,188 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 01:49:11,190 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 01:49:11,972 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##56: assume !(1 == ~q_free~0); [2024-11-07 01:49:11,973 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##55: assume 1 == ~q_free~0;~c_dr_st~0 := 2;~c_dr_pc~0 := 2;~a_t~0 := do_read_c_~a~0#1; [2024-11-07 01:49:12,270 INFO L? ?]: Removed 140 outVars from TransFormulas that were not future-live. [2024-11-07 01:49:12,270 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 01:49:12,301 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 01:49:12,301 INFO L316 CfgBuilder]: Removed 20 assume(true) statements. [2024-11-07 01:49:12,302 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:49:12 BoogieIcfgContainer [2024-11-07 01:49:12,304 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 01:49:12,306 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 01:49:12,306 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 01:49:12,311 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 01:49:12,311 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 01:49:10" (1/3) ... [2024-11-07 01:49:12,311 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@750acaee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:49:12, skipping insertion in model container [2024-11-07 01:49:12,311 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:49:10" (2/3) ... [2024-11-07 01:49:12,312 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@750acaee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:49:12, skipping insertion in model container [2024-11-07 01:49:12,312 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:49:12" (3/3) ... [2024-11-07 01:49:12,314 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_3.cil+token_ring.13.cil-1.c [2024-11-07 01:49:12,326 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 01:49:12,327 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-07 01:49:12,399 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 01:49:12,414 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;@4b3e3443, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 01:49:12,414 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-07 01:49:12,423 INFO L276 IsEmpty]: Start isEmpty. Operand has 546 states, 483 states have (on average 1.6273291925465838) internal successors, (786), 491 states have internal predecessors, (786), 45 states have call successors, (45), 15 states have call predecessors, (45), 15 states have return successors, (45), 43 states have call predecessors, (45), 45 states have call successors, (45) [2024-11-07 01:49:12,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-07 01:49:12,435 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:49:12,435 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:49:12,436 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:49:12,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:49:12,440 INFO L85 PathProgramCache]: Analyzing trace with hash -1732254382, now seen corresponding path program 1 times [2024-11-07 01:49:12,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:49:12,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095271856] [2024-11-07 01:49:12,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:49:12,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:49:12,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:12,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:49:12,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:12,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-07 01:49:12,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:13,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 01:49:13,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:13,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 01:49:13,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:13,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 01:49:13,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:13,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 01:49:13,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:13,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 01:49:13,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:13,052 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:49:13,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:49:13,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095271856] [2024-11-07 01:49:13,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095271856] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:49:13,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:49:13,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 01:49:13,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376815847] [2024-11-07 01:49:13,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:49:13,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 01:49:13,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:49:13,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 01:49:13,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-07 01:49:13,080 INFO L87 Difference]: Start difference. First operand has 546 states, 483 states have (on average 1.6273291925465838) internal successors, (786), 491 states have internal predecessors, (786), 45 states have call successors, (45), 15 states have call predecessors, (45), 15 states have return successors, (45), 43 states have call predecessors, (45), 45 states have call successors, (45) 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:49:14,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:49:14,734 INFO L93 Difference]: Finished difference Result 1213 states and 1937 transitions. [2024-11-07 01:49:14,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 01:49:14,738 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:49:14,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:49:14,757 INFO L225 Difference]: With dead ends: 1213 [2024-11-07 01:49:14,757 INFO L226 Difference]: Without dead ends: 686 [2024-11-07 01:49:14,764 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2024-11-07 01:49:14,766 INFO L432 NwaCegarLoop]: 475 mSDtfsCounter, 1733 mSDsluCounter, 1601 mSDsCounter, 0 mSdLazyCounter, 1419 mSolverCounterSat, 258 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1740 SdHoareTripleChecker+Valid, 2076 SdHoareTripleChecker+Invalid, 1677 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 258 IncrementalHoareTripleChecker+Valid, 1419 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-07 01:49:14,766 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1740 Valid, 2076 Invalid, 1677 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [258 Valid, 1419 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-07 01:49:14,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 686 states. [2024-11-07 01:49:14,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 686 to 647. [2024-11-07 01:49:14,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 647 states, 565 states have (on average 1.5238938053097346) internal successors, (861), 572 states have internal predecessors, (861), 58 states have call successors, (58), 22 states have call predecessors, (58), 22 states have return successors, (59), 55 states have call predecessors, (59), 54 states have call successors, (59) [2024-11-07 01:49:14,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 647 states to 647 states and 978 transitions. [2024-11-07 01:49:14,875 INFO L78 Accepts]: Start accepts. Automaton has 647 states and 978 transitions. Word has length 65 [2024-11-07 01:49:14,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:49:14,876 INFO L471 AbstractCegarLoop]: Abstraction has 647 states and 978 transitions. [2024-11-07 01:49:14,876 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:49:14,876 INFO L276 IsEmpty]: Start isEmpty. Operand 647 states and 978 transitions. [2024-11-07 01:49:14,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-07 01:49:14,881 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:49:14,881 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:49:14,881 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 01:49:14,882 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:49:14,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:49:14,883 INFO L85 PathProgramCache]: Analyzing trace with hash -53365742, now seen corresponding path program 1 times [2024-11-07 01:49:14,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:49:14,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218785489] [2024-11-07 01:49:14,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:49:14,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:49:14,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:14,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:49:14,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:14,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-07 01:49:14,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:15,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 01:49:15,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:15,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 01:49:15,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:15,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 01:49:15,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:15,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 01:49:15,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:15,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 01:49:15,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:15,077 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:49:15,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:49:15,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218785489] [2024-11-07 01:49:15,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [218785489] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:49:15,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:49:15,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:49:15,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908652809] [2024-11-07 01:49:15,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:49:15,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:49:15,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:49:15,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:49:15,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:49:15,083 INFO L87 Difference]: Start difference. First operand 647 states and 978 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), 2 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2024-11-07 01:49:16,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:49:16,310 INFO L93 Difference]: Finished difference Result 1115 states and 1630 transitions. [2024-11-07 01:49:16,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-07 01:49:16,311 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), 2 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) Word has length 65 [2024-11-07 01:49:16,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:49:16,320 INFO L225 Difference]: With dead ends: 1115 [2024-11-07 01:49:16,321 INFO L226 Difference]: Without dead ends: 906 [2024-11-07 01:49:16,322 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2024-11-07 01:49:16,323 INFO L432 NwaCegarLoop]: 537 mSDtfsCounter, 2067 mSDsluCounter, 1261 mSDsCounter, 0 mSdLazyCounter, 1186 mSolverCounterSat, 198 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2114 SdHoareTripleChecker+Valid, 1798 SdHoareTripleChecker+Invalid, 1384 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 198 IncrementalHoareTripleChecker+Valid, 1186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-07 01:49:16,323 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2114 Valid, 1798 Invalid, 1384 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [198 Valid, 1186 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-07 01:49:16,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 906 states. [2024-11-07 01:49:16,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 906 to 832. [2024-11-07 01:49:16,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 832 states, 714 states have (on average 1.4915966386554622) internal successors, (1065), 723 states have internal predecessors, (1065), 78 states have call successors, (78), 36 states have call predecessors, (78), 38 states have return successors, (82), 75 states have call predecessors, (82), 74 states have call successors, (82) [2024-11-07 01:49:16,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 832 states to 832 states and 1225 transitions. [2024-11-07 01:49:16,399 INFO L78 Accepts]: Start accepts. Automaton has 832 states and 1225 transitions. Word has length 65 [2024-11-07 01:49:16,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:49:16,400 INFO L471 AbstractCegarLoop]: Abstraction has 832 states and 1225 transitions. [2024-11-07 01:49:16,400 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), 2 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2024-11-07 01:49:16,400 INFO L276 IsEmpty]: Start isEmpty. Operand 832 states and 1225 transitions. [2024-11-07 01:49:16,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-07 01:49:16,404 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:49: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] [2024-11-07 01:49:16,404 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 01:49:16,404 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:49:16,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:49:16,405 INFO L85 PathProgramCache]: Analyzing trace with hash 86637519, now seen corresponding path program 1 times [2024-11-07 01:49:16,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:49:16,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576381949] [2024-11-07 01:49:16,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:49:16,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:49:16,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:16,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:49:16,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:16,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-07 01:49:16,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:16,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 01:49:16,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:16,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 01:49:16,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:16,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 01:49:16,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:16,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-07 01:49:16,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:16,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 01:49:16,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:16,608 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:49:16,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:49:16,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576381949] [2024-11-07 01:49:16,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576381949] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:49:16,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:49:16,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-07 01:49:16,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831704466] [2024-11-07 01:49:16,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:49:16,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 01:49:16,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:49:16,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 01:49:16,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-07 01:49:16,611 INFO L87 Difference]: Start difference. First operand 832 states and 1225 transitions. Second operand has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 5 states have internal predecessors, (51), 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:49:18,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:49:18,064 INFO L93 Difference]: Finished difference Result 1296 states and 1866 transitions. [2024-11-07 01:49:18,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 01:49:18,066 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 5 states have internal predecessors, (51), 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 66 [2024-11-07 01:49:18,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:49:18,075 INFO L225 Difference]: With dead ends: 1296 [2024-11-07 01:49:18,075 INFO L226 Difference]: Without dead ends: 902 [2024-11-07 01:49:18,077 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:49:18,079 INFO L432 NwaCegarLoop]: 471 mSDtfsCounter, 707 mSDsluCounter, 2850 mSDsCounter, 0 mSdLazyCounter, 2159 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 708 SdHoareTripleChecker+Valid, 3321 SdHoareTripleChecker+Invalid, 2256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 2159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-07 01:49:18,080 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [708 Valid, 3321 Invalid, 2256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 2159 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-07 01:49:18,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 902 states. [2024-11-07 01:49:18,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 902 to 842. [2024-11-07 01:49:18,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 842 states, 722 states have (on average 1.4833795013850415) internal successors, (1071), 731 states have internal predecessors, (1071), 78 states have call successors, (78), 36 states have call predecessors, (78), 40 states have return successors, (84), 77 states have call predecessors, (84), 74 states have call successors, (84) [2024-11-07 01:49:18,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 842 states to 842 states and 1233 transitions. [2024-11-07 01:49:18,125 INFO L78 Accepts]: Start accepts. Automaton has 842 states and 1233 transitions. Word has length 66 [2024-11-07 01:49:18,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:49:18,126 INFO L471 AbstractCegarLoop]: Abstraction has 842 states and 1233 transitions. [2024-11-07 01:49:18,126 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 5 states have internal predecessors, (51), 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:49:18,126 INFO L276 IsEmpty]: Start isEmpty. Operand 842 states and 1233 transitions. [2024-11-07 01:49:18,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-07 01:49:18,129 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:49:18,129 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:49:18,129 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 01:49:18,130 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:49:18,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:49:18,130 INFO L85 PathProgramCache]: Analyzing trace with hash -942721779, now seen corresponding path program 1 times [2024-11-07 01:49:18,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:49:18,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16914280] [2024-11-07 01:49:18,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:49:18,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:49:18,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:18,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:49:18,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:18,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-07 01:49:18,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:18,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 01:49:18,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:18,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 01:49:18,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:18,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 01:49:18,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:18,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-07 01:49:18,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:18,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 01:49:18,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:18,373 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:49:18,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:49:18,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16914280] [2024-11-07 01:49:18,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16914280] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:49:18,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:49:18,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-07 01:49:18,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781192874] [2024-11-07 01:49:18,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:49:18,375 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 01:49:18,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:49:18,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 01:49:18,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-07 01:49:18,377 INFO L87 Difference]: Start difference. First operand 842 states and 1233 transitions. Second operand has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 6 states have internal predecessors, (51), 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:49:20,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:49:20,778 INFO L93 Difference]: Finished difference Result 2382 states and 3397 transitions. [2024-11-07 01:49:20,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-11-07 01:49:20,781 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 6 states have internal predecessors, (51), 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 66 [2024-11-07 01:49:20,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:49:20,789 INFO L225 Difference]: With dead ends: 2382 [2024-11-07 01:49:20,789 INFO L226 Difference]: Without dead ends: 1120 [2024-11-07 01:49:20,796 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 292 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=235, Invalid=887, Unknown=0, NotChecked=0, Total=1122 [2024-11-07 01:49:20,797 INFO L432 NwaCegarLoop]: 628 mSDtfsCounter, 2723 mSDsluCounter, 2512 mSDsCounter, 0 mSdLazyCounter, 2566 mSolverCounterSat, 388 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2743 SdHoareTripleChecker+Valid, 3140 SdHoareTripleChecker+Invalid, 2954 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 388 IncrementalHoareTripleChecker+Valid, 2566 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-07 01:49:20,798 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2743 Valid, 3140 Invalid, 2954 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [388 Valid, 2566 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-07 01:49:20,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1120 states. [2024-11-07 01:49:20,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1120 to 982. [2024-11-07 01:49:20,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 982 states, 825 states have (on average 1.450909090909091) internal successors, (1197), 836 states have internal predecessors, (1197), 98 states have call successors, (98), 50 states have call predecessors, (98), 57 states have return successors, (115), 98 states have call predecessors, (115), 94 states have call successors, (115) [2024-11-07 01:49:20,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 982 states to 982 states and 1410 transitions. [2024-11-07 01:49:20,880 INFO L78 Accepts]: Start accepts. Automaton has 982 states and 1410 transitions. Word has length 66 [2024-11-07 01:49:20,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:49:20,880 INFO L471 AbstractCegarLoop]: Abstraction has 982 states and 1410 transitions. [2024-11-07 01:49:20,880 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 6 states have internal predecessors, (51), 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:49:20,880 INFO L276 IsEmpty]: Start isEmpty. Operand 982 states and 1410 transitions. [2024-11-07 01:49:20,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-07 01:49:20,881 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:49:20,882 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] [2024-11-07 01:49:20,882 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 01:49:20,882 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:49:20,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:49:20,882 INFO L85 PathProgramCache]: Analyzing trace with hash 2049773155, now seen corresponding path program 1 times [2024-11-07 01:49:20,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:49:20,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486845118] [2024-11-07 01:49:20,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:49:20,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:49:20,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:20,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:49:20,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:21,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-07 01:49:21,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:21,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 01:49:21,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:21,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 01:49:21,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:21,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 01:49:21,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:21,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 01:49:21,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:21,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 01:49:21,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:21,050 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:49:21,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:49:21,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486845118] [2024-11-07 01:49:21,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486845118] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:49:21,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:49:21,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-07 01:49:21,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055422842] [2024-11-07 01:49:21,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:49:21,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 01:49:21,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:49:21,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 01:49:21,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-07 01:49:21,052 INFO L87 Difference]: Start difference. First operand 982 states and 1410 transitions. Second operand has 9 states, 8 states have (on average 6.5) internal successors, (52), 5 states have internal predecessors, (52), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) [2024-11-07 01:49:22,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:49:22,243 INFO L93 Difference]: Finished difference Result 1901 states and 2664 transitions. [2024-11-07 01:49:22,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-07 01:49:22,243 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.5) internal successors, (52), 5 states have internal predecessors, (52), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) Word has length 67 [2024-11-07 01:49:22,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:49:22,247 INFO L225 Difference]: With dead ends: 1901 [2024-11-07 01:49:22,247 INFO L226 Difference]: Without dead ends: 424 [2024-11-07 01:49:22,251 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=97, Invalid=209, Unknown=0, NotChecked=0, Total=306 [2024-11-07 01:49:22,252 INFO L432 NwaCegarLoop]: 475 mSDtfsCounter, 1658 mSDsluCounter, 2313 mSDsCounter, 0 mSdLazyCounter, 1573 mSolverCounterSat, 142 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1706 SdHoareTripleChecker+Valid, 2788 SdHoareTripleChecker+Invalid, 1715 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 142 IncrementalHoareTripleChecker+Valid, 1573 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-07 01:49:22,252 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1706 Valid, 2788 Invalid, 1715 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [142 Valid, 1573 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-07 01:49:22,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2024-11-07 01:49:22,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 424. [2024-11-07 01:49:22,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 424 states, 388 states have (on average 1.5644329896907216) internal successors, (607), 390 states have internal predecessors, (607), 29 states have call successors, (29), 7 states have call predecessors, (29), 6 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-07 01:49:22,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 663 transitions. [2024-11-07 01:49:22,282 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 663 transitions. Word has length 67 [2024-11-07 01:49:22,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:49:22,282 INFO L471 AbstractCegarLoop]: Abstraction has 424 states and 663 transitions. [2024-11-07 01:49:22,282 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.5) internal successors, (52), 5 states have internal predecessors, (52), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) [2024-11-07 01:49:22,282 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 663 transitions. [2024-11-07 01:49:22,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-07 01:49:22,285 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:49:22,286 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:22,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 01:49:22,287 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:49:22,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:49:22,287 INFO L85 PathProgramCache]: Analyzing trace with hash -197874790, now seen corresponding path program 1 times [2024-11-07 01:49:22,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:49:22,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033742842] [2024-11-07 01:49:22,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:49:22,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:49:22,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:22,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:49:22,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:22,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 01:49:22,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:22,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 01:49:22,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:22,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-07 01:49:22,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:22,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-07 01:49:22,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:22,537 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:49:22,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:49:22,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033742842] [2024-11-07 01:49:22,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033742842] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:49:22,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:49:22,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 01:49:22,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286292232] [2024-11-07 01:49:22,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:49:22,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 01:49:22,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:49:22,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 01:49:22,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 01:49:22,540 INFO L87 Difference]: Start difference. First operand 424 states and 663 transitions. Second operand has 5 states, 5 states have (on average 35.8) internal successors, (179), 3 states have internal predecessors, (179), 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:49:24,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:49:24,084 INFO L93 Difference]: Finished difference Result 989 states and 1571 transitions. [2024-11-07 01:49:24,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 01:49:24,085 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 35.8) internal successors, (179), 3 states have internal predecessors, (179), 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 190 [2024-11-07 01:49:24,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:49:24,088 INFO L225 Difference]: With dead ends: 989 [2024-11-07 01:49:24,088 INFO L226 Difference]: Without dead ends: 577 [2024-11-07 01:49:24,089 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-07 01:49:24,090 INFO L432 NwaCegarLoop]: 391 mSDtfsCounter, 1132 mSDsluCounter, 464 mSDsCounter, 0 mSdLazyCounter, 1114 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1157 SdHoareTripleChecker+Valid, 855 SdHoareTripleChecker+Invalid, 1176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 1114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-07 01:49:24,090 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1157 Valid, 855 Invalid, 1176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 1114 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-07 01:49:24,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2024-11-07 01:49:24,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 424. [2024-11-07 01:49:24,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 424 states, 388 states have (on average 1.5618556701030928) internal successors, (606), 390 states have internal predecessors, (606), 29 states have call successors, (29), 7 states have call predecessors, (29), 6 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-07 01:49:24,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 662 transitions. [2024-11-07 01:49:24,114 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 662 transitions. Word has length 190 [2024-11-07 01:49:24,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:49:24,115 INFO L471 AbstractCegarLoop]: Abstraction has 424 states and 662 transitions. [2024-11-07 01:49:24,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 35.8) internal successors, (179), 3 states have internal predecessors, (179), 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:49:24,115 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 662 transitions. [2024-11-07 01:49:24,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-07 01:49:24,117 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:49:24,117 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:24,117 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 01:49:24,117 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:49:24,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:49:24,118 INFO L85 PathProgramCache]: Analyzing trace with hash -1797023848, now seen corresponding path program 1 times [2024-11-07 01:49:24,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:49:24,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924358576] [2024-11-07 01:49:24,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:49:24,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:49:24,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:24,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:49:24,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:24,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 01:49:24,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:24,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 01:49:24,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:24,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-07 01:49:24,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:24,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-07 01:49:24,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:24,374 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:49:24,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:49:24,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924358576] [2024-11-07 01:49:24,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924358576] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:49:24,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:49:24,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 01:49:24,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903436883] [2024-11-07 01:49:24,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:49:24,375 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 01:49:24,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:49:24,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 01:49:24,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 01:49:24,376 INFO L87 Difference]: Start difference. First operand 424 states and 662 transitions. Second operand has 5 states, 5 states have (on average 35.8) internal successors, (179), 3 states have internal predecessors, (179), 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:49:25,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:49:25,860 INFO L93 Difference]: Finished difference Result 981 states and 1554 transitions. [2024-11-07 01:49:25,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 01:49:25,860 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 35.8) internal successors, (179), 3 states have internal predecessors, (179), 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 190 [2024-11-07 01:49:25,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:49:25,863 INFO L225 Difference]: With dead ends: 981 [2024-11-07 01:49:25,863 INFO L226 Difference]: Without dead ends: 577 [2024-11-07 01:49:25,864 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-07 01:49:25,865 INFO L432 NwaCegarLoop]: 390 mSDtfsCounter, 1123 mSDsluCounter, 463 mSDsCounter, 0 mSdLazyCounter, 1113 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1148 SdHoareTripleChecker+Valid, 853 SdHoareTripleChecker+Invalid, 1175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 1113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-07 01:49:25,865 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1148 Valid, 853 Invalid, 1175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 1113 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-07 01:49:25,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2024-11-07 01:49:25,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 424. [2024-11-07 01:49:25,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 424 states, 388 states have (on average 1.559278350515464) internal successors, (605), 390 states have internal predecessors, (605), 29 states have call successors, (29), 7 states have call predecessors, (29), 6 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-07 01:49:25,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 661 transitions. [2024-11-07 01:49:25,889 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 661 transitions. Word has length 190 [2024-11-07 01:49:25,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:49:25,889 INFO L471 AbstractCegarLoop]: Abstraction has 424 states and 661 transitions. [2024-11-07 01:49:25,890 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 35.8) internal successors, (179), 3 states have internal predecessors, (179), 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:49:25,890 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 661 transitions. [2024-11-07 01:49:25,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-07 01:49:25,891 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:49:25,891 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:25,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 01:49:25,892 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:49:25,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:49:25,892 INFO L85 PathProgramCache]: Analyzing trace with hash -1887084138, now seen corresponding path program 1 times [2024-11-07 01:49:25,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:49:25,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814392975] [2024-11-07 01:49:25,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:49:25,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:49:25,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:26,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:49:26,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:26,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 01:49:26,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:26,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 01:49:26,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:26,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-07 01:49:26,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:26,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-07 01:49:26,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:26,204 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:49:26,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:49:26,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814392975] [2024-11-07 01:49:26,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1814392975] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:49:26,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:49:26,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 01:49:26,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087174835] [2024-11-07 01:49:26,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:49:26,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 01:49:26,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:49:26,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 01:49:26,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 01:49:26,206 INFO L87 Difference]: Start difference. First operand 424 states and 661 transitions. Second operand has 6 states, 6 states have (on average 29.833333333333332) internal successors, (179), 4 states have internal predecessors, (179), 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:49:28,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:49:28,736 INFO L93 Difference]: Finished difference Result 1554 states and 2480 transitions. [2024-11-07 01:49:28,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 01:49:28,737 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 29.833333333333332) internal successors, (179), 4 states have internal predecessors, (179), 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 190 [2024-11-07 01:49:28,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:49:28,743 INFO L225 Difference]: With dead ends: 1554 [2024-11-07 01:49:28,743 INFO L226 Difference]: Without dead ends: 1152 [2024-11-07 01:49:28,745 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-11-07 01:49:28,745 INFO L432 NwaCegarLoop]: 358 mSDtfsCounter, 1705 mSDsluCounter, 1102 mSDsCounter, 0 mSdLazyCounter, 2437 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1725 SdHoareTripleChecker+Valid, 1460 SdHoareTripleChecker+Invalid, 2557 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 2437 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-07 01:49:28,745 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1725 Valid, 1460 Invalid, 2557 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 2437 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-07 01:49:28,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1152 states. [2024-11-07 01:49:28,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1152 to 845. [2024-11-07 01:49:28,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 845 states, 780 states have (on average 1.5717948717948718) internal successors, (1226), 783 states have internal predecessors, (1226), 51 states have call successors, (51), 13 states have call predecessors, (51), 13 states have return successors, (52), 49 states have call predecessors, (52), 49 states have call successors, (52) [2024-11-07 01:49:28,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 845 states to 845 states and 1329 transitions. [2024-11-07 01:49:28,798 INFO L78 Accepts]: Start accepts. Automaton has 845 states and 1329 transitions. Word has length 190 [2024-11-07 01:49:28,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:49:28,798 INFO L471 AbstractCegarLoop]: Abstraction has 845 states and 1329 transitions. [2024-11-07 01:49:28,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 29.833333333333332) internal successors, (179), 4 states have internal predecessors, (179), 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:49:28,799 INFO L276 IsEmpty]: Start isEmpty. Operand 845 states and 1329 transitions. [2024-11-07 01:49:28,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-07 01:49:28,800 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:49:28,801 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:28,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-07 01:49:28,801 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:49:28,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:49:28,801 INFO L85 PathProgramCache]: Analyzing trace with hash 560856722, now seen corresponding path program 1 times [2024-11-07 01:49:28,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:49:28,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157708936] [2024-11-07 01:49:28,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:49:28,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:49:28,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:28,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:49:28,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:28,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 01:49:29,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:29,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 01:49:29,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:29,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-07 01:49:29,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:29,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-07 01:49:29,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:29,102 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:49:29,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:49:29,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157708936] [2024-11-07 01:49:29,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [157708936] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:49:29,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:49:29,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:49:29,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925875494] [2024-11-07 01:49:29,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:49:29,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:49:29,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:49:29,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:49:29,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:49:29,106 INFO L87 Difference]: Start difference. First operand 845 states and 1329 transitions. Second operand has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 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:49:32,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:49:32,808 INFO L93 Difference]: Finished difference Result 2570 states and 4111 transitions. [2024-11-07 01:49:32,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 01:49:32,808 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 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 190 [2024-11-07 01:49:32,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:49:32,816 INFO L225 Difference]: With dead ends: 2570 [2024-11-07 01:49:32,817 INFO L226 Difference]: Without dead ends: 1747 [2024-11-07 01:49:32,819 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-07 01:49:32,820 INFO L432 NwaCegarLoop]: 637 mSDtfsCounter, 1742 mSDsluCounter, 2210 mSDsCounter, 0 mSdLazyCounter, 3860 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1762 SdHoareTripleChecker+Valid, 2847 SdHoareTripleChecker+Invalid, 3927 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 3860 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-11-07 01:49:32,820 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1762 Valid, 2847 Invalid, 3927 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 3860 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-11-07 01:49:32,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1747 states. [2024-11-07 01:49:32,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1747 to 1237. [2024-11-07 01:49:32,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1237 states, 1143 states have (on average 1.5651793525809274) internal successors, (1789), 1147 states have internal predecessors, (1789), 73 states have call successors, (73), 19 states have call predecessors, (73), 20 states have return successors, (76), 72 states have call predecessors, (76), 71 states have call successors, (76) [2024-11-07 01:49:32,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1237 states to 1237 states and 1938 transitions. [2024-11-07 01:49:32,911 INFO L78 Accepts]: Start accepts. Automaton has 1237 states and 1938 transitions. Word has length 190 [2024-11-07 01:49:32,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:49:32,911 INFO L471 AbstractCegarLoop]: Abstraction has 1237 states and 1938 transitions. [2024-11-07 01:49:32,912 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 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:49:32,912 INFO L276 IsEmpty]: Start isEmpty. Operand 1237 states and 1938 transitions. [2024-11-07 01:49:32,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-07 01:49:32,914 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:49:32,914 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:32,914 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-07 01:49:32,914 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:49:32,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:49:32,915 INFO L85 PathProgramCache]: Analyzing trace with hash -1362393708, now seen corresponding path program 1 times [2024-11-07 01:49:32,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:49:32,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772954097] [2024-11-07 01:49:32,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:49:32,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:49:32,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:33,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:49:33,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:33,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 01:49:33,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:33,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 01:49:33,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:33,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-07 01:49:33,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:33,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-07 01:49:33,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:33,256 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:49:33,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:49:33,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772954097] [2024-11-07 01:49:33,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [772954097] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:49:33,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:49:33,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:49:33,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932333511] [2024-11-07 01:49:33,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:49:33,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:49:33,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:49:33,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:49:33,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:49:33,260 INFO L87 Difference]: Start difference. First operand 1237 states and 1938 transitions. Second operand has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 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:49:36,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:49:36,761 INFO L93 Difference]: Finished difference Result 4069 states and 6496 transitions. [2024-11-07 01:49:36,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 01:49:36,761 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 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 190 [2024-11-07 01:49:36,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:49:36,776 INFO L225 Difference]: With dead ends: 4069 [2024-11-07 01:49:36,776 INFO L226 Difference]: Without dead ends: 2854 [2024-11-07 01:49:36,781 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-07 01:49:36,782 INFO L432 NwaCegarLoop]: 368 mSDtfsCounter, 1864 mSDsluCounter, 1434 mSDsCounter, 0 mSdLazyCounter, 3283 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1884 SdHoareTripleChecker+Valid, 1802 SdHoareTripleChecker+Invalid, 3394 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 3283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-07 01:49:36,782 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1884 Valid, 1802 Invalid, 3394 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 3283 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-07 01:49:36,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2854 states. [2024-11-07 01:49:36,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2854 to 2022. [2024-11-07 01:49:36,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2022 states, 1870 states have (on average 1.5593582887700534) internal successors, (2916), 1876 states have internal predecessors, (2916), 117 states have call successors, (117), 31 states have call predecessors, (117), 34 states have return successors, (128), 118 states have call predecessors, (128), 115 states have call successors, (128) [2024-11-07 01:49:36,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2022 states to 2022 states and 3161 transitions. [2024-11-07 01:49:36,925 INFO L78 Accepts]: Start accepts. Automaton has 2022 states and 3161 transitions. Word has length 190 [2024-11-07 01:49:36,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:49:36,925 INFO L471 AbstractCegarLoop]: Abstraction has 2022 states and 3161 transitions. [2024-11-07 01:49:36,926 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 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:49:36,926 INFO L276 IsEmpty]: Start isEmpty. Operand 2022 states and 3161 transitions. [2024-11-07 01:49:36,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-07 01:49:36,928 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:49:36,929 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:36,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-07 01:49:36,930 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:49:36,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:49:36,930 INFO L85 PathProgramCache]: Analyzing trace with hash 1207965266, now seen corresponding path program 1 times [2024-11-07 01:49:36,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:49:36,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945567875] [2024-11-07 01:49:36,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:49:36,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:49:36,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:37,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:49:37,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:37,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 01:49:37,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:37,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 01:49:37,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:37,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-07 01:49:37,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:37,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-07 01:49:37,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:37,231 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:49:37,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:49:37,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945567875] [2024-11-07 01:49:37,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [945567875] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:49:37,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:49:37,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:49:37,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140428795] [2024-11-07 01:49:37,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:49:37,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:49:37,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:49:37,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:49:37,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:49:37,233 INFO L87 Difference]: Start difference. First operand 2022 states and 3161 transitions. Second operand has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 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:49:40,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:49:40,974 INFO L93 Difference]: Finished difference Result 6954 states and 11055 transitions. [2024-11-07 01:49:40,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 01:49:40,974 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 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 190 [2024-11-07 01:49:40,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:49:40,996 INFO L225 Difference]: With dead ends: 6954 [2024-11-07 01:49:40,996 INFO L226 Difference]: Without dead ends: 4954 [2024-11-07 01:49:41,001 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-07 01:49:41,002 INFO L432 NwaCegarLoop]: 635 mSDtfsCounter, 1734 mSDsluCounter, 2210 mSDsCounter, 0 mSdLazyCounter, 3854 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1754 SdHoareTripleChecker+Valid, 2845 SdHoareTripleChecker+Invalid, 3923 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 3854 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-11-07 01:49:41,002 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1754 Valid, 2845 Invalid, 3923 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 3854 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-11-07 01:49:41,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4954 states. [2024-11-07 01:49:41,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4954 to 3593. [2024-11-07 01:49:41,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3593 states, 3325 states have (on average 1.5548872180451128) internal successors, (5170), 3335 states have internal predecessors, (5170), 205 states have call successors, (205), 55 states have call predecessors, (205), 62 states have return successors, (238), 210 states have call predecessors, (238), 203 states have call successors, (238) [2024-11-07 01:49:41,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3593 states to 3593 states and 5613 transitions. [2024-11-07 01:49:41,245 INFO L78 Accepts]: Start accepts. Automaton has 3593 states and 5613 transitions. Word has length 190 [2024-11-07 01:49:41,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:49:41,245 INFO L471 AbstractCegarLoop]: Abstraction has 3593 states and 5613 transitions. [2024-11-07 01:49:41,246 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 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:49:41,246 INFO L276 IsEmpty]: Start isEmpty. Operand 3593 states and 5613 transitions. [2024-11-07 01:49:41,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-07 01:49:41,249 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:49:41,249 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:41,249 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-07 01:49:41,250 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:49:41,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:49:41,250 INFO L85 PathProgramCache]: Analyzing trace with hash 1706522068, now seen corresponding path program 1 times [2024-11-07 01:49:41,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:49:41,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095156088] [2024-11-07 01:49:41,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:49:41,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:49:41,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:41,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:49:41,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:41,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 01:49:41,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:41,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 01:49:41,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:41,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-07 01:49:41,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:41,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-07 01:49:41,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:41,557 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:49:41,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:49:41,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095156088] [2024-11-07 01:49:41,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095156088] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:49:41,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:49:41,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:49:41,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563004799] [2024-11-07 01:49:41,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:49:41,558 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:49:41,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:49:41,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:49:41,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:49:41,559 INFO L87 Difference]: Start difference. First operand 3593 states and 5613 transitions. Second operand has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 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:49:45,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:49:45,267 INFO L93 Difference]: Finished difference Result 12723 states and 20189 transitions. [2024-11-07 01:49:45,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 01:49:45,267 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 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 190 [2024-11-07 01:49:45,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:49:45,302 INFO L225 Difference]: With dead ends: 12723 [2024-11-07 01:49:45,303 INFO L226 Difference]: Without dead ends: 9152 [2024-11-07 01:49:45,313 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-07 01:49:45,314 INFO L432 NwaCegarLoop]: 635 mSDtfsCounter, 1736 mSDsluCounter, 2210 mSDsCounter, 0 mSdLazyCounter, 3840 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1756 SdHoareTripleChecker+Valid, 2845 SdHoareTripleChecker+Invalid, 3909 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 3840 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-07 01:49:45,314 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1756 Valid, 2845 Invalid, 3909 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 3840 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-11-07 01:49:45,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9152 states. [2024-11-07 01:49:45,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9152 to 6740. [2024-11-07 01:49:45,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6740 states, 6240 states have (on average 1.551923076923077) internal successors, (9684), 6258 states have internal predecessors, (9684), 381 states have call successors, (381), 103 states have call predecessors, (381), 118 states have return successors, (476), 394 states have call predecessors, (476), 379 states have call successors, (476) [2024-11-07 01:49:45,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6740 states to 6740 states and 10541 transitions. [2024-11-07 01:49:45,817 INFO L78 Accepts]: Start accepts. Automaton has 6740 states and 10541 transitions. Word has length 190 [2024-11-07 01:49:45,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:49:45,817 INFO L471 AbstractCegarLoop]: Abstraction has 6740 states and 10541 transitions. [2024-11-07 01:49:45,817 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 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:49:45,818 INFO L276 IsEmpty]: Start isEmpty. Operand 6740 states and 10541 transitions. [2024-11-07 01:49:45,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-07 01:49:45,823 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:49:45,823 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:45,823 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-07 01:49:45,824 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:49:45,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:49:45,825 INFO L85 PathProgramCache]: Analyzing trace with hash -2018173422, now seen corresponding path program 1 times [2024-11-07 01:49:45,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:49:45,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254058209] [2024-11-07 01:49:45,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:49:45,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:49:45,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:45,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:49:45,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:45,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 01:49:46,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:46,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 01:49:46,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:46,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-07 01:49:46,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:46,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-07 01:49:46,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:46,093 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:49:46,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:49:46,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254058209] [2024-11-07 01:49:46,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254058209] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:49:46,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:49:46,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:49:46,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549415540] [2024-11-07 01:49:46,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:49:46,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:49:46,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:49:46,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:49:46,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:49:46,096 INFO L87 Difference]: Start difference. First operand 6740 states and 10541 transitions. Second operand has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 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:49:50,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:49:50,182 INFO L93 Difference]: Finished difference Result 24245 states and 38487 transitions. [2024-11-07 01:49:50,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 01:49:50,183 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 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 190 [2024-11-07 01:49:50,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:49:50,239 INFO L225 Difference]: With dead ends: 24245 [2024-11-07 01:49:50,239 INFO L226 Difference]: Without dead ends: 17527 [2024-11-07 01:49:50,256 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-07 01:49:50,256 INFO L432 NwaCegarLoop]: 635 mSDtfsCounter, 1732 mSDsluCounter, 2210 mSDsCounter, 0 mSdLazyCounter, 3812 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1752 SdHoareTripleChecker+Valid, 2845 SdHoareTripleChecker+Invalid, 3881 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 3812 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-11-07 01:49:50,257 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1752 Valid, 2845 Invalid, 3881 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 3812 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-11-07 01:49:50,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17527 states. [2024-11-07 01:49:51,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17527 to 13064. [2024-11-07 01:49:51,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13064 states, 12100 states have (on average 1.5507438016528925) internal successors, (18764), 12134 states have internal predecessors, (18764), 733 states have call successors, (733), 199 states have call predecessors, (733), 230 states have return successors, (1006), 762 states have call predecessors, (1006), 731 states have call successors, (1006) [2024-11-07 01:49:51,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13064 states to 13064 states and 20503 transitions. [2024-11-07 01:49:51,069 INFO L78 Accepts]: Start accepts. Automaton has 13064 states and 20503 transitions. Word has length 190 [2024-11-07 01:49:51,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:49:51,069 INFO L471 AbstractCegarLoop]: Abstraction has 13064 states and 20503 transitions. [2024-11-07 01:49:51,070 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 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:49:51,070 INFO L276 IsEmpty]: Start isEmpty. Operand 13064 states and 20503 transitions. [2024-11-07 01:49:51,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-07 01:49:51,079 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:49:51,080 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:51,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-07 01:49:51,080 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:49:51,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:49:51,080 INFO L85 PathProgramCache]: Analyzing trace with hash 1490795984, now seen corresponding path program 1 times [2024-11-07 01:49:51,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:49:51,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93514605] [2024-11-07 01:49:51,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:49:51,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:49:51,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:51,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:49:51,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:51,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 01:49:51,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:51,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 01:49:51,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:51,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-07 01:49:51,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:51,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-07 01:49:51,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:51,401 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:49:51,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:49:51,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93514605] [2024-11-07 01:49:51,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [93514605] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:49:51,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:49:51,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:49:51,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624208180] [2024-11-07 01:49:51,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:49:51,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:49:51,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:49:51,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:49:51,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:49:51,404 INFO L87 Difference]: Start difference. First operand 13064 states and 20503 transitions. Second operand has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 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:49:56,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:49:56,123 INFO L93 Difference]: Finished difference Result 47323 states and 75339 transitions. [2024-11-07 01:49:56,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 01:49:56,124 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 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 190 [2024-11-07 01:49:56,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:49:56,284 INFO L225 Difference]: With dead ends: 47323 [2024-11-07 01:49:56,284 INFO L226 Difference]: Without dead ends: 34281 [2024-11-07 01:49:56,335 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-07 01:49:56,335 INFO L432 NwaCegarLoop]: 635 mSDtfsCounter, 1731 mSDsluCounter, 2210 mSDsCounter, 0 mSdLazyCounter, 3799 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1751 SdHoareTripleChecker+Valid, 2845 SdHoareTripleChecker+Invalid, 3868 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 3799 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-11-07 01:49:56,336 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1751 Valid, 2845 Invalid, 3868 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 3799 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-11-07 01:49:56,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34281 states. [2024-11-07 01:49:57,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34281 to 25741. [2024-11-07 01:49:57,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25741 states, 23849 states have (on average 1.5500020965239634) internal successors, (36966), 23915 states have internal predecessors, (36966), 1437 states have call successors, (1437), 391 states have call predecessors, (1437), 454 states have return successors, (2228), 1498 states have call predecessors, (2228), 1435 states have call successors, (2228) [2024-11-07 01:49:58,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25741 states to 25741 states and 40631 transitions. [2024-11-07 01:49:58,053 INFO L78 Accepts]: Start accepts. Automaton has 25741 states and 40631 transitions. Word has length 190 [2024-11-07 01:49:58,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:49:58,053 INFO L471 AbstractCegarLoop]: Abstraction has 25741 states and 40631 transitions. [2024-11-07 01:49:58,053 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 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:49:58,054 INFO L276 IsEmpty]: Start isEmpty. Operand 25741 states and 40631 transitions. [2024-11-07 01:49:58,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-07 01:49:58,067 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:49:58,067 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:58,067 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-07 01:49:58,067 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:49:58,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:49:58,068 INFO L85 PathProgramCache]: Analyzing trace with hash -2136789422, now seen corresponding path program 1 times [2024-11-07 01:49:58,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:49:58,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590325732] [2024-11-07 01:49:58,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:49:58,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:49:58,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:58,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:49:58,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:58,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 01:49:58,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:58,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 01:49:58,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:58,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-07 01:49:58,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:58,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-07 01:49:58,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:58,329 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:49:58,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:49:58,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590325732] [2024-11-07 01:49:58,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590325732] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:49:58,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:49:58,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:49:58,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965404692] [2024-11-07 01:49:58,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:49:58,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:49:58,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:49:58,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:49:58,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:49:58,331 INFO L87 Difference]: Start difference. First operand 25741 states and 40631 transitions. Second operand has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 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:50:04,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:50:04,589 INFO L93 Difference]: Finished difference Result 93478 states and 149641 transitions. [2024-11-07 01:50:04,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 01:50:04,590 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 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 190 [2024-11-07 01:50:04,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:50:04,861 INFO L225 Difference]: With dead ends: 93478 [2024-11-07 01:50:04,861 INFO L226 Difference]: Without dead ends: 67759 [2024-11-07 01:50:04,952 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-07 01:50:04,953 INFO L432 NwaCegarLoop]: 635 mSDtfsCounter, 1730 mSDsluCounter, 2210 mSDsCounter, 0 mSdLazyCounter, 3786 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1750 SdHoareTripleChecker+Valid, 2845 SdHoareTripleChecker+Invalid, 3855 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 3786 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-11-07 01:50:04,953 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1750 Valid, 2845 Invalid, 3855 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 3786 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-11-07 01:50:04,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67759 states. [2024-11-07 01:50:07,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67759 to 51158. [2024-11-07 01:50:07,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51158 states, 47410 states have (on average 1.5495465091752796) internal successors, (73464), 47540 states have internal predecessors, (73464), 2845 states have call successors, (2845), 775 states have call predecessors, (2845), 902 states have return successors, (5158), 2970 states have call predecessors, (5158), 2843 states have call successors, (5158) [2024-11-07 01:50:07,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51158 states to 51158 states and 81467 transitions. [2024-11-07 01:50:07,644 INFO L78 Accepts]: Start accepts. Automaton has 51158 states and 81467 transitions. Word has length 190 [2024-11-07 01:50:07,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:50:07,645 INFO L471 AbstractCegarLoop]: Abstraction has 51158 states and 81467 transitions. [2024-11-07 01:50:07,645 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 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:50:07,645 INFO L276 IsEmpty]: Start isEmpty. Operand 51158 states and 81467 transitions. [2024-11-07 01:50:07,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-07 01:50:07,668 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:50:07,669 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:07,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-07 01:50:07,669 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:50:07,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:50:07,669 INFO L85 PathProgramCache]: Analyzing trace with hash -37050992, now seen corresponding path program 1 times [2024-11-07 01:50:07,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:50:07,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972295745] [2024-11-07 01:50:07,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:50:07,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:50:07,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:50:07,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:50:07,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:50:07,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 01:50:07,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:50:07,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 01:50:07,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:50:07,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-07 01:50:07,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:50:07,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-07 01:50:07,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:50:07,915 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:50:07,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:50:07,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972295745] [2024-11-07 01:50:07,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1972295745] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:50:07,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:50:07,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:50:07,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867159210] [2024-11-07 01:50:07,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:50:07,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:50:07,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:50:07,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:50:07,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:50:07,919 INFO L87 Difference]: Start difference. First operand 51158 states and 81467 transitions. Second operand has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 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:50:13,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:50:13,856 INFO L93 Difference]: Finished difference Result 120056 states and 194804 transitions. [2024-11-07 01:50:13,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 01:50:13,856 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 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 190 [2024-11-07 01:50:13,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:50:14,165 INFO L225 Difference]: With dead ends: 120056 [2024-11-07 01:50:14,165 INFO L226 Difference]: Without dead ends: 68920 [2024-11-07 01:50:14,296 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-11-07 01:50:14,297 INFO L432 NwaCegarLoop]: 343 mSDtfsCounter, 1253 mSDsluCounter, 1088 mSDsCounter, 0 mSdLazyCounter, 1931 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1274 SdHoareTripleChecker+Valid, 1431 SdHoareTripleChecker+Invalid, 2002 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 1931 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-07 01:50:14,297 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1274 Valid, 1431 Invalid, 2002 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 1931 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-07 01:50:14,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68920 states. [2024-11-07 01:50:16,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68920 to 51158. [2024-11-07 01:50:16,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51158 states, 47410 states have (on average 1.5468255642269564) internal successors, (73335), 47540 states have internal predecessors, (73335), 2845 states have call successors, (2845), 775 states have call predecessors, (2845), 902 states have return successors, (5158), 2970 states have call predecessors, (5158), 2843 states have call successors, (5158) [2024-11-07 01:50:17,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51158 states to 51158 states and 81338 transitions. [2024-11-07 01:50:17,110 INFO L78 Accepts]: Start accepts. Automaton has 51158 states and 81338 transitions. Word has length 190 [2024-11-07 01:50:17,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:50:17,110 INFO L471 AbstractCegarLoop]: Abstraction has 51158 states and 81338 transitions. [2024-11-07 01:50:17,111 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 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:50:17,111 INFO L276 IsEmpty]: Start isEmpty. Operand 51158 states and 81338 transitions. [2024-11-07 01:50:17,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-07 01:50:17,133 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:50:17,133 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:17,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-07 01:50:17,133 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:50:17,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:50:17,134 INFO L85 PathProgramCache]: Analyzing trace with hash 307777170, now seen corresponding path program 1 times [2024-11-07 01:50:17,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:50:17,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485523069] [2024-11-07 01:50:17,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:50:17,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:50:17,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:50:17,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:50:17,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:50:17,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 01:50:17,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:50:17,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 01:50:17,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:50:17,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-07 01:50:17,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:50:17,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-07 01:50:17,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:50:17,399 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:50:17,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:50:17,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485523069] [2024-11-07 01:50:17,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485523069] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:50:17,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:50:17,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:50:17,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872458948] [2024-11-07 01:50:17,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:50:17,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:50:17,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:50:17,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:50:17,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:50:17,402 INFO L87 Difference]: Start difference. First operand 51158 states and 81338 transitions. Second operand has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 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:50:26,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:50:26,198 INFO L93 Difference]: Finished difference Result 185659 states and 299191 transitions. [2024-11-07 01:50:26,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 01:50:26,198 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 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 190 [2024-11-07 01:50:26,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:50:26,742 INFO L225 Difference]: With dead ends: 185659 [2024-11-07 01:50:26,743 INFO L226 Difference]: Without dead ends: 134523 [2024-11-07 01:50:26,875 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-07 01:50:26,876 INFO L432 NwaCegarLoop]: 368 mSDtfsCounter, 1837 mSDsluCounter, 1434 mSDsCounter, 0 mSdLazyCounter, 3207 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1857 SdHoareTripleChecker+Valid, 1802 SdHoareTripleChecker+Invalid, 3318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 3207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-07 01:50:26,876 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1857 Valid, 1802 Invalid, 3318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 3207 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-07 01:50:26,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134523 states.