./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.05.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_2.cil-1+token_ring.05.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', '52de5146a3a24866d31d2076a85235f80d04004402c35cfcf3c3304704a7fec0'] Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.05.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 52de5146a3a24866d31d2076a85235f80d04004402c35cfcf3c3304704a7fec0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 01:44:54,854 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 01:44:54,941 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-07 01:44:54,946 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 01:44:54,947 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 01:44:54,968 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 01:44:54,969 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 01:44:54,969 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 01:44:54,970 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 01:44:54,970 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 01:44:54,970 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 01:44:54,970 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 01:44:54,971 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 01:44:54,971 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 01:44:54,971 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 01:44:54,971 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 01:44:54,971 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 01:44:54,971 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 01:44:54,971 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 01:44:54,972 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 01:44:54,972 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 01:44:54,972 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 01:44:54,972 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 01:44:54,972 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 01:44:54,972 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 01:44:54,972 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 01:44:54,972 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 01:44:54,972 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 01:44:54,973 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 01:44:54,973 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 01:44:54,973 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 01:44:54,973 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 01:44:54,973 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 01:44:54,973 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 01:44:54,973 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 01:44:54,973 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 01:44:54,973 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 01:44:54,973 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 01:44:54,973 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 01:44:54,973 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 01:44:54,973 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 01:44:54,974 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 01:44:54,974 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 -> 52de5146a3a24866d31d2076a85235f80d04004402c35cfcf3c3304704a7fec0 [2024-11-07 01:44:55,283 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 01:44:55,293 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 01:44:55,295 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 01:44:55,298 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 01:44:55,298 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 01:44:55,299 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.05.cil-1.c [2024-11-07 01:44:56,642 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 01:44:56,872 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 01:44:56,873 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.05.cil-1.c [2024-11-07 01:44:56,884 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c29ab1405/fa33b01297474e7fb7ac166b3f729ea1/FLAGdee702ae1 [2024-11-07 01:44:56,896 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c29ab1405/fa33b01297474e7fb7ac166b3f729ea1 [2024-11-07 01:44:56,898 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 01:44:56,900 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 01:44:56,901 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 01:44:56,901 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 01:44:56,904 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 01:44:56,904 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:44:56" (1/1) ... [2024-11-07 01:44:56,905 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20fb7bd7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:44:56, skipping insertion in model container [2024-11-07 01:44:56,905 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:44:56" (1/1) ... [2024-11-07 01:44:56,944 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 01:44:57,097 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.05.cil-1.c[914,927] [2024-11-07 01:44:57,168 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.05.cil-1.c[7115,7128] [2024-11-07 01:44:57,235 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 01:44:57,251 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 01:44:57,262 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.05.cil-1.c[914,927] [2024-11-07 01:44:57,297 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.05.cil-1.c[7115,7128] [2024-11-07 01:44:57,328 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 01:44:57,358 INFO L204 MainTranslator]: Completed translation [2024-11-07 01:44:57,358 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:44:57 WrapperNode [2024-11-07 01:44:57,359 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 01:44:57,360 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 01:44:57,361 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 01:44:57,361 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 01:44:57,367 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:44:57" (1/1) ... [2024-11-07 01:44:57,383 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:44:57" (1/1) ... [2024-11-07 01:44:57,442 INFO L138 Inliner]: procedures = 63, calls = 72, calls flagged for inlining = 32, calls inlined = 32, statements flattened = 648 [2024-11-07 01:44:57,446 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 01:44:57,447 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 01:44:57,447 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 01:44:57,447 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 01:44:57,456 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:44:57" (1/1) ... [2024-11-07 01:44:57,458 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:44:57" (1/1) ... [2024-11-07 01:44:57,466 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:44:57" (1/1) ... [2024-11-07 01:44:57,499 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-07 01:44:57,500 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:44:57" (1/1) ... [2024-11-07 01:44:57,500 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:44:57" (1/1) ... [2024-11-07 01:44:57,514 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:44:57" (1/1) ... [2024-11-07 01:44:57,533 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:44:57" (1/1) ... [2024-11-07 01:44:57,536 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:44:57" (1/1) ... [2024-11-07 01:44:57,542 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:44:57" (1/1) ... [2024-11-07 01:44:57,548 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 01:44:57,550 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 01:44:57,550 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 01:44:57,550 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 01:44:57,551 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:44:57" (1/1) ... [2024-11-07 01:44:57,560 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 01:44:57,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 01:44:57,585 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-07 01:44:57,589 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-07 01:44:57,611 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 01:44:57,611 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-11-07 01:44:57,611 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-11-07 01:44:57,612 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2024-11-07 01:44:57,612 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2024-11-07 01:44:57,612 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2024-11-07 01:44:57,612 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2024-11-07 01:44:57,612 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2024-11-07 01:44:57,612 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2024-11-07 01:44:57,613 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2024-11-07 01:44:57,613 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2024-11-07 01:44:57,613 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2024-11-07 01:44:57,613 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2024-11-07 01:44:57,613 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2024-11-07 01:44:57,613 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2024-11-07 01:44:57,613 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2024-11-07 01:44:57,613 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2024-11-07 01:44:57,614 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2024-11-07 01:44:57,614 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2024-11-07 01:44:57,614 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2024-11-07 01:44:57,614 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2024-11-07 01:44:57,614 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2024-11-07 01:44:57,614 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2024-11-07 01:44:57,614 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 01:44:57,614 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2024-11-07 01:44:57,615 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2024-11-07 01:44:57,615 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2024-11-07 01:44:57,615 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2024-11-07 01:44:57,615 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 01:44:57,615 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 01:44:57,615 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2024-11-07 01:44:57,615 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2024-11-07 01:44:57,723 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 01:44:57,724 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 01:44:58,399 INFO L? ?]: Removed 85 outVars from TransFormulas that were not future-live. [2024-11-07 01:44:58,399 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 01:44:58,424 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 01:44:58,425 INFO L316 CfgBuilder]: Removed 12 assume(true) statements. [2024-11-07 01:44:58,426 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:44:58 BoogieIcfgContainer [2024-11-07 01:44:58,426 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 01:44:58,429 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 01:44:58,430 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 01:44:58,434 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 01:44:58,434 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 01:44:56" (1/3) ... [2024-11-07 01:44:58,434 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c569e4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:44:58, skipping insertion in model container [2024-11-07 01:44:58,434 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:44:57" (2/3) ... [2024-11-07 01:44:58,435 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c569e4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:44:58, skipping insertion in model container [2024-11-07 01:44:58,435 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:44:58" (3/3) ... [2024-11-07 01:44:58,436 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-1+token_ring.05.cil-1.c [2024-11-07 01:44:58,448 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 01:44:58,449 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-07 01:44:58,519 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 01:44:58,530 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;@ae00acb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 01:44:58,530 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-07 01:44:58,535 INFO L276 IsEmpty]: Start isEmpty. Operand has 314 states, 264 states have (on average 1.5833333333333333) internal successors, (418), 270 states have internal predecessors, (418), 33 states have call successors, (33), 14 states have call predecessors, (33), 14 states have return successors, (33), 32 states have call predecessors, (33), 33 states have call successors, (33) [2024-11-07 01:44:58,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-07 01:44:58,548 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:44:58,549 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:44:58,550 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:44:58,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:44:58,556 INFO L85 PathProgramCache]: Analyzing trace with hash -1889753707, now seen corresponding path program 1 times [2024-11-07 01:44:58,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:44:58,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065685042] [2024-11-07 01:44:58,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:44:58,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:44:58,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:44:58,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:44:58,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:44:58,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-07 01:44:58,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:44:58,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 01:44:58,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:44:58,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 01:44:58,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:44:58,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 01:44:58,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:44:58,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 01:44:58,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:44:58,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 01:44:58,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:44:58,945 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:44:58,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:44:58,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065685042] [2024-11-07 01:44:58,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065685042] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:44:58,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:44:58,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 01:44:58,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096881839] [2024-11-07 01:44:58,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:44:58,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 01:44:58,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:44:58,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 01:44:58,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-07 01:44:58,974 INFO L87 Difference]: Start difference. First operand has 314 states, 264 states have (on average 1.5833333333333333) internal successors, (418), 270 states have internal predecessors, (418), 33 states have call successors, (33), 14 states have call predecessors, (33), 14 states have return successors, (33), 32 states have call predecessors, (33), 33 states have call successors, (33) Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-07 01:44:59,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:44:59,845 INFO L93 Difference]: Finished difference Result 625 states and 961 transitions. [2024-11-07 01:44:59,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 01:44:59,847 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2024-11-07 01:44:59,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:44:59,859 INFO L225 Difference]: With dead ends: 625 [2024-11-07 01:44:59,859 INFO L226 Difference]: Without dead ends: 322 [2024-11-07 01:44:59,864 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-11-07 01:44:59,866 INFO L432 NwaCegarLoop]: 273 mSDtfsCounter, 476 mSDsluCounter, 781 mSDsCounter, 0 mSdLazyCounter, 512 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 486 SdHoareTripleChecker+Valid, 1054 SdHoareTripleChecker+Invalid, 589 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 512 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-07 01:44:59,867 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [486 Valid, 1054 Invalid, 589 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 512 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-07 01:44:59,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2024-11-07 01:44:59,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 304. [2024-11-07 01:44:59,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 256 states have (on average 1.48828125) internal successors, (381), 260 states have internal predecessors, (381), 33 states have call successors, (33), 14 states have call predecessors, (33), 13 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2024-11-07 01:44:59,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 445 transitions. [2024-11-07 01:44:59,947 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 445 transitions. Word has length 65 [2024-11-07 01:44:59,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:44:59,949 INFO L471 AbstractCegarLoop]: Abstraction has 304 states and 445 transitions. [2024-11-07 01:44:59,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-07 01:44:59,950 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 445 transitions. [2024-11-07 01:44:59,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-07 01:44:59,954 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:44:59,955 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:44:59,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 01:44:59,955 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:44:59,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:44:59,956 INFO L85 PathProgramCache]: Analyzing trace with hash 1018428179, now seen corresponding path program 1 times [2024-11-07 01:44:59,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:44:59,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952453456] [2024-11-07 01:44:59,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:44:59,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:44:59,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:00,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:45:00,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:00,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-07 01:45:00,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:00,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 01:45:00,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:00,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 01:45:00,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:00,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 01:45:00,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:00,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 01:45:00,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:00,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 01:45:00,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:00,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:45:00,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:45:00,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952453456] [2024-11-07 01:45:00,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [952453456] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:45:00,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:45:00,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 01:45:00,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365891107] [2024-11-07 01:45:00,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:45:00,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 01:45:00,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:45:00,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 01:45:00,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-07 01:45:00,289 INFO L87 Difference]: Start difference. First operand 304 states and 445 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-07 01:45:01,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:45:01,356 INFO L93 Difference]: Finished difference Result 527 states and 759 transitions. [2024-11-07 01:45:01,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 01:45:01,357 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2024-11-07 01:45:01,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:45:01,362 INFO L225 Difference]: With dead ends: 527 [2024-11-07 01:45:01,362 INFO L226 Difference]: Without dead ends: 439 [2024-11-07 01:45:01,363 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2024-11-07 01:45:01,364 INFO L432 NwaCegarLoop]: 264 mSDtfsCounter, 580 mSDsluCounter, 1223 mSDsCounter, 0 mSdLazyCounter, 983 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 585 SdHoareTripleChecker+Valid, 1487 SdHoareTripleChecker+Invalid, 1093 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 983 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-07 01:45:01,365 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [585 Valid, 1487 Invalid, 1093 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 983 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-07 01:45:01,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2024-11-07 01:45:01,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 400. [2024-11-07 01:45:01,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 400 states, 332 states have (on average 1.4608433734939759) internal successors, (485), 338 states have internal predecessors, (485), 44 states have call successors, (44), 21 states have call predecessors, (44), 22 states have return successors, (47), 43 states have call predecessors, (47), 42 states have call successors, (47) [2024-11-07 01:45:01,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 576 transitions. [2024-11-07 01:45:01,431 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 576 transitions. Word has length 65 [2024-11-07 01:45:01,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:45:01,431 INFO L471 AbstractCegarLoop]: Abstraction has 400 states and 576 transitions. [2024-11-07 01:45:01,432 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-07 01:45:01,432 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 576 transitions. [2024-11-07 01:45:01,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-07 01:45:01,438 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:45:01,438 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:45:01,438 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 01:45:01,438 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:45:01,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:45:01,439 INFO L85 PathProgramCache]: Analyzing trace with hash 1422214130, now seen corresponding path program 1 times [2024-11-07 01:45:01,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:45:01,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105230452] [2024-11-07 01:45:01,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:45:01,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:45:01,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:01,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:45:01,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:01,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-07 01:45:01,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:01,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 01:45:01,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:01,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 01:45:01,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:01,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 01:45:01,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:01,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 01:45:01,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:01,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 01:45:01,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:01,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:45:01,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:45:01,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105230452] [2024-11-07 01:45:01,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105230452] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:45:01,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:45:01,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 01:45:01,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700169553] [2024-11-07 01:45:01,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:45:01,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 01:45:01,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:45:01,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 01:45:01,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-07 01:45:01,660 INFO L87 Difference]: Start difference. First operand 400 states and 576 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-07 01:45:02,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:45:02,803 INFO L93 Difference]: Finished difference Result 747 states and 1052 transitions. [2024-11-07 01:45:02,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-07 01:45:02,804 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2024-11-07 01:45:02,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:45:02,812 INFO L225 Difference]: With dead ends: 747 [2024-11-07 01:45:02,812 INFO L226 Difference]: Without dead ends: 570 [2024-11-07 01:45:02,814 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2024-11-07 01:45:02,815 INFO L432 NwaCegarLoop]: 302 mSDtfsCounter, 1098 mSDsluCounter, 1030 mSDsCounter, 0 mSdLazyCounter, 1144 mSolverCounterSat, 154 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1121 SdHoareTripleChecker+Valid, 1332 SdHoareTripleChecker+Invalid, 1298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 154 IncrementalHoareTripleChecker+Valid, 1144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-07 01:45:02,815 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1121 Valid, 1332 Invalid, 1298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [154 Valid, 1144 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-07 01:45:02,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2024-11-07 01:45:02,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 496. [2024-11-07 01:45:02,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 496 states, 408 states have (on average 1.4411764705882353) internal successors, (588), 416 states have internal predecessors, (588), 55 states have call successors, (55), 28 states have call predecessors, (55), 31 states have return successors, (66), 55 states have call predecessors, (66), 53 states have call successors, (66) [2024-11-07 01:45:02,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 709 transitions. [2024-11-07 01:45:02,885 INFO L78 Accepts]: Start accepts. Automaton has 496 states and 709 transitions. Word has length 65 [2024-11-07 01:45:02,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:45:02,885 INFO L471 AbstractCegarLoop]: Abstraction has 496 states and 709 transitions. [2024-11-07 01:45:02,885 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-07 01:45:02,885 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 709 transitions. [2024-11-07 01:45:02,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-07 01:45:02,888 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:45:02,888 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:45:02,888 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 01:45:02,888 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:45:02,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:45:02,889 INFO L85 PathProgramCache]: Analyzing trace with hash -606371980, now seen corresponding path program 1 times [2024-11-07 01:45:02,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:45:02,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976410865] [2024-11-07 01:45:02,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:45:02,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:45:02,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:02,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:45:02,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:03,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-07 01:45:03,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:03,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 01:45:03,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:03,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 01:45:03,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:03,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 01:45:03,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:03,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 01:45:03,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:03,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 01:45:03,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:03,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:45:03,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:45:03,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976410865] [2024-11-07 01:45:03,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976410865] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:45:03,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:45:03,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-07 01:45:03,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030116223] [2024-11-07 01:45:03,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:45:03,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 01:45:03,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:45:03,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 01:45:03,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-07 01:45:03,106 INFO L87 Difference]: Start difference. First operand 496 states and 709 transitions. Second operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-07 01:45:04,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:45:04,056 INFO L93 Difference]: Finished difference Result 795 states and 1120 transitions. [2024-11-07 01:45:04,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 01:45:04,057 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 65 [2024-11-07 01:45:04,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:45:04,063 INFO L225 Difference]: With dead ends: 795 [2024-11-07 01:45:04,063 INFO L226 Difference]: Without dead ends: 528 [2024-11-07 01:45:04,064 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2024-11-07 01:45:04,067 INFO L432 NwaCegarLoop]: 265 mSDtfsCounter, 368 mSDsluCounter, 1516 mSDsCounter, 0 mSdLazyCounter, 1249 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 369 SdHoareTripleChecker+Valid, 1781 SdHoareTripleChecker+Invalid, 1322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 1249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-07 01:45:04,067 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [369 Valid, 1781 Invalid, 1322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 1249 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-07 01:45:04,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2024-11-07 01:45:04,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 501. [2024-11-07 01:45:04,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 501 states, 412 states have (on average 1.4320388349514563) internal successors, (590), 420 states have internal predecessors, (590), 55 states have call successors, (55), 28 states have call predecessors, (55), 32 states have return successors, (67), 56 states have call predecessors, (67), 53 states have call successors, (67) [2024-11-07 01:45:04,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 712 transitions. [2024-11-07 01:45:04,122 INFO L78 Accepts]: Start accepts. Automaton has 501 states and 712 transitions. Word has length 65 [2024-11-07 01:45:04,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:45:04,123 INFO L471 AbstractCegarLoop]: Abstraction has 501 states and 712 transitions. [2024-11-07 01:45:04,126 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-07 01:45:04,126 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 712 transitions. [2024-11-07 01:45:04,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-07 01:45:04,128 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:45:04,128 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:45:04,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 01:45:04,128 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:45:04,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:45:04,129 INFO L85 PathProgramCache]: Analyzing trace with hash -1635731278, now seen corresponding path program 1 times [2024-11-07 01:45:04,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:45:04,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287379289] [2024-11-07 01:45:04,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:45:04,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:45:04,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:04,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:45:04,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:04,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-07 01:45:04,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:04,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 01:45:04,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:04,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 01:45:04,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:04,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 01:45:04,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:04,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 01:45:04,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:04,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 01:45:04,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:04,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:45:04,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:45:04,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287379289] [2024-11-07 01:45:04,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1287379289] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:45:04,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:45:04,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-07 01:45:04,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54590319] [2024-11-07 01:45:04,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:45:04,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 01:45:04,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:45:04,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 01:45:04,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-07 01:45:04,322 INFO L87 Difference]: Start difference. First operand 501 states and 712 transitions. Second operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-07 01:45:05,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:45:05,196 INFO L93 Difference]: Finished difference Result 817 states and 1142 transitions. [2024-11-07 01:45:05,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-07 01:45:05,196 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 65 [2024-11-07 01:45:05,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:45:05,200 INFO L225 Difference]: With dead ends: 817 [2024-11-07 01:45:05,200 INFO L226 Difference]: Without dead ends: 545 [2024-11-07 01:45:05,201 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2024-11-07 01:45:05,202 INFO L432 NwaCegarLoop]: 263 mSDtfsCounter, 552 mSDsluCounter, 1318 mSDsCounter, 0 mSdLazyCounter, 1179 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 554 SdHoareTripleChecker+Valid, 1581 SdHoareTripleChecker+Invalid, 1290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 1179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-07 01:45:05,202 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [554 Valid, 1581 Invalid, 1290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 1179 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-07 01:45:05,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2024-11-07 01:45:05,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 516. [2024-11-07 01:45:05,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 516 states, 424 states have (on average 1.419811320754717) internal successors, (602), 432 states have internal predecessors, (602), 55 states have call successors, (55), 28 states have call predecessors, (55), 35 states have return successors, (70), 59 states have call predecessors, (70), 53 states have call successors, (70) [2024-11-07 01:45:05,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 727 transitions. [2024-11-07 01:45:05,254 INFO L78 Accepts]: Start accepts. Automaton has 516 states and 727 transitions. Word has length 65 [2024-11-07 01:45:05,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:45:05,254 INFO L471 AbstractCegarLoop]: Abstraction has 516 states and 727 transitions. [2024-11-07 01:45:05,254 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-07 01:45:05,255 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 727 transitions. [2024-11-07 01:45:05,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-07 01:45:05,257 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:45:05,258 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:45:05,258 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 01:45:05,258 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:45:05,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:45:05,259 INFO L85 PathProgramCache]: Analyzing trace with hash -249527884, now seen corresponding path program 1 times [2024-11-07 01:45:05,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:45:05,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172245572] [2024-11-07 01:45:05,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:45:05,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:45:05,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:05,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:45:05,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:05,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-07 01:45:05,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:05,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 01:45:05,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:05,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 01:45:05,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:05,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 01:45:05,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:05,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 01:45:05,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:05,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 01:45:05,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:05,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:45:05,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:45:05,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172245572] [2024-11-07 01:45:05,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172245572] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:45:05,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:45:05,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 01:45:05,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096621270] [2024-11-07 01:45:05,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:45:05,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 01:45:05,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:45:05,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 01:45:05,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-07 01:45:05,463 INFO L87 Difference]: Start difference. First operand 516 states and 727 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-07 01:45:06,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:45:06,369 INFO L93 Difference]: Finished difference Result 908 states and 1238 transitions. [2024-11-07 01:45:06,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-07 01:45:06,370 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2024-11-07 01:45:06,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:45:06,374 INFO L225 Difference]: With dead ends: 908 [2024-11-07 01:45:06,374 INFO L226 Difference]: Without dead ends: 623 [2024-11-07 01:45:06,375 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2024-11-07 01:45:06,377 INFO L432 NwaCegarLoop]: 258 mSDtfsCounter, 1090 mSDsluCounter, 886 mSDsCounter, 0 mSdLazyCounter, 1056 mSolverCounterSat, 162 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1114 SdHoareTripleChecker+Valid, 1144 SdHoareTripleChecker+Invalid, 1218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 162 IncrementalHoareTripleChecker+Valid, 1056 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-07 01:45:06,377 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1114 Valid, 1144 Invalid, 1218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [162 Valid, 1056 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-07 01:45:06,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 623 states. [2024-11-07 01:45:06,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 623 to 528. [2024-11-07 01:45:06,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 528 states, 434 states have (on average 1.4101382488479262) internal successors, (612), 442 states have internal predecessors, (612), 56 states have call successors, (56), 29 states have call predecessors, (56), 36 states have return successors, (69), 60 states have call predecessors, (69), 54 states have call successors, (69) [2024-11-07 01:45:06,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 737 transitions. [2024-11-07 01:45:06,422 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 737 transitions. Word has length 65 [2024-11-07 01:45:06,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:45:06,423 INFO L471 AbstractCegarLoop]: Abstraction has 528 states and 737 transitions. [2024-11-07 01:45:06,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-07 01:45:06,423 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 737 transitions. [2024-11-07 01:45:06,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-07 01:45:06,426 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:45:06,426 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:45:06,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 01:45:06,427 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:45:06,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:45:06,427 INFO L85 PathProgramCache]: Analyzing trace with hash -383541390, now seen corresponding path program 1 times [2024-11-07 01:45:06,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:45:06,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446115027] [2024-11-07 01:45:06,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:45:06,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:45:06,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:06,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:45:06,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:06,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-07 01:45:06,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:06,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 01:45:06,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:06,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 01:45:06,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:06,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 01:45:06,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:06,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 01:45:06,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:06,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 01:45:06,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:06,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:45:06,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:45:06,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446115027] [2024-11-07 01:45:06,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446115027] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:45:06,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:45:06,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:45:06,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048302148] [2024-11-07 01:45:06,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:45:06,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:45:06,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:45:06,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:45:06,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:45:06,577 INFO L87 Difference]: Start difference. First operand 528 states and 737 transitions. Second operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-07 01:45:07,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:45:07,214 INFO L93 Difference]: Finished difference Result 1170 states and 1581 transitions. [2024-11-07 01:45:07,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-07 01:45:07,214 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2024-11-07 01:45:07,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:45:07,219 INFO L225 Difference]: With dead ends: 1170 [2024-11-07 01:45:07,220 INFO L226 Difference]: Without dead ends: 874 [2024-11-07 01:45:07,221 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2024-11-07 01:45:07,221 INFO L432 NwaCegarLoop]: 243 mSDtfsCounter, 1072 mSDsluCounter, 651 mSDsCounter, 0 mSdLazyCounter, 467 mSolverCounterSat, 158 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1097 SdHoareTripleChecker+Valid, 894 SdHoareTripleChecker+Invalid, 625 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 158 IncrementalHoareTripleChecker+Valid, 467 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-07 01:45:07,222 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1097 Valid, 894 Invalid, 625 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [158 Valid, 467 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-07 01:45:07,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 874 states. [2024-11-07 01:45:07,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 874 to 818. [2024-11-07 01:45:07,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 818 states, 658 states have (on average 1.3617021276595744) internal successors, (896), 673 states have internal predecessors, (896), 91 states have call successors, (91), 51 states have call predecessors, (91), 67 states have return successors, (126), 100 states have call predecessors, (126), 89 states have call successors, (126) [2024-11-07 01:45:07,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 818 states to 818 states and 1113 transitions. [2024-11-07 01:45:07,288 INFO L78 Accepts]: Start accepts. Automaton has 818 states and 1113 transitions. Word has length 65 [2024-11-07 01:45:07,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:45:07,289 INFO L471 AbstractCegarLoop]: Abstraction has 818 states and 1113 transitions. [2024-11-07 01:45:07,289 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-07 01:45:07,289 INFO L276 IsEmpty]: Start isEmpty. Operand 818 states and 1113 transitions. [2024-11-07 01:45:07,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-07 01:45:07,293 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:45:07,293 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:45:07,293 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 01:45:07,293 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:45:07,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:45:07,294 INFO L85 PathProgramCache]: Analyzing trace with hash 1678158755, now seen corresponding path program 1 times [2024-11-07 01:45:07,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:45:07,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482963083] [2024-11-07 01:45:07,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:45:07,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:45:07,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:07,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:45:07,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:07,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-07 01:45:07,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:07,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 01:45:07,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:07,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 01:45:07,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:07,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 01:45:07,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:07,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 01:45:07,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:07,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 01:45:07,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:07,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:45:07,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:45:07,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482963083] [2024-11-07 01:45:07,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1482963083] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:45:07,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:45:07,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 01:45:07,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168375423] [2024-11-07 01:45:07,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:45:07,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 01:45:07,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:45:07,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 01:45:07,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-07 01:45:07,385 INFO L87 Difference]: Start difference. First operand 818 states and 1113 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-07 01:45:08,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:45:08,069 INFO L93 Difference]: Finished difference Result 2021 states and 2680 transitions. [2024-11-07 01:45:08,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 01:45:08,070 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 66 [2024-11-07 01:45:08,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:45:08,077 INFO L225 Difference]: With dead ends: 2021 [2024-11-07 01:45:08,077 INFO L226 Difference]: Without dead ends: 1414 [2024-11-07 01:45:08,079 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2024-11-07 01:45:08,079 INFO L432 NwaCegarLoop]: 260 mSDtfsCounter, 560 mSDsluCounter, 790 mSDsCounter, 0 mSdLazyCounter, 561 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 568 SdHoareTripleChecker+Valid, 1050 SdHoareTripleChecker+Invalid, 669 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 561 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-07 01:45:08,080 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [568 Valid, 1050 Invalid, 669 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 561 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-07 01:45:08,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1414 states. [2024-11-07 01:45:08,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1414 to 1299. [2024-11-07 01:45:08,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1299 states, 1037 states have (on average 1.3297974927675988) internal successors, (1379), 1055 states have internal predecessors, (1379), 136 states have call successors, (136), 95 states have call predecessors, (136), 124 states have return successors, (198), 155 states have call predecessors, (198), 134 states have call successors, (198) [2024-11-07 01:45:08,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1299 states to 1299 states and 1713 transitions. [2024-11-07 01:45:08,169 INFO L78 Accepts]: Start accepts. Automaton has 1299 states and 1713 transitions. Word has length 66 [2024-11-07 01:45:08,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:45:08,170 INFO L471 AbstractCegarLoop]: Abstraction has 1299 states and 1713 transitions. [2024-11-07 01:45:08,170 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-07 01:45:08,170 INFO L276 IsEmpty]: Start isEmpty. Operand 1299 states and 1713 transitions. [2024-11-07 01:45:08,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-07 01:45:08,172 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:45:08,172 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:45:08,172 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-07 01:45:08,172 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:45:08,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:45:08,173 INFO L85 PathProgramCache]: Analyzing trace with hash -1158568882, now seen corresponding path program 1 times [2024-11-07 01:45:08,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:45:08,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207945542] [2024-11-07 01:45:08,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:45:08,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:45:08,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:08,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:45:08,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:08,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-07 01:45:08,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:08,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 01:45:08,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:08,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 01:45:08,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:08,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 01:45:08,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:08,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 01:45:08,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:08,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 01:45:08,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:08,244 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:45:08,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:45:08,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207945542] [2024-11-07 01:45:08,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207945542] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:45:08,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:45:08,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 01:45:08,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098696827] [2024-11-07 01:45:08,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:45:08,245 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 01:45:08,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:45:08,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 01:45:08,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-07 01:45:08,246 INFO L87 Difference]: Start difference. First operand 1299 states and 1713 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-07 01:45:08,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:45:08,958 INFO L93 Difference]: Finished difference Result 3487 states and 4519 transitions. [2024-11-07 01:45:08,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-07 01:45:08,958 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 66 [2024-11-07 01:45:08,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:45:08,972 INFO L225 Difference]: With dead ends: 3487 [2024-11-07 01:45:08,972 INFO L226 Difference]: Without dead ends: 2419 [2024-11-07 01:45:08,975 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2024-11-07 01:45:08,976 INFO L432 NwaCegarLoop]: 261 mSDtfsCounter, 1072 mSDsluCounter, 437 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 158 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1098 SdHoareTripleChecker+Valid, 698 SdHoareTripleChecker+Invalid, 518 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 158 IncrementalHoareTripleChecker+Valid, 360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-07 01:45:08,976 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1098 Valid, 698 Invalid, 518 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [158 Valid, 360 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-07 01:45:08,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2419 states. [2024-11-07 01:45:09,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2419 to 2161. [2024-11-07 01:45:09,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2161 states, 1703 states have (on average 1.2953611274221961) internal successors, (2206), 1731 states have internal predecessors, (2206), 234 states have call successors, (234), 179 states have call predecessors, (234), 222 states have return successors, (334), 257 states have call predecessors, (334), 232 states have call successors, (334) [2024-11-07 01:45:09,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2161 states to 2161 states and 2774 transitions. [2024-11-07 01:45:09,143 INFO L78 Accepts]: Start accepts. Automaton has 2161 states and 2774 transitions. Word has length 66 [2024-11-07 01:45:09,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:45:09,144 INFO L471 AbstractCegarLoop]: Abstraction has 2161 states and 2774 transitions. [2024-11-07 01:45:09,144 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-07 01:45:09,144 INFO L276 IsEmpty]: Start isEmpty. Operand 2161 states and 2774 transitions. [2024-11-07 01:45:09,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-07 01:45:09,146 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:45:09,147 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:45:09,147 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-07 01:45:09,147 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:45:09,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:45:09,147 INFO L85 PathProgramCache]: Analyzing trace with hash 135899394, now seen corresponding path program 1 times [2024-11-07 01:45:09,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:45:09,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418398272] [2024-11-07 01:45:09,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:45:09,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:45:09,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:09,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:45:09,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:09,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-07 01:45:09,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:09,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 01:45:09,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:09,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 01:45:09,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:09,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 01:45:09,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:09,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 01:45:09,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:09,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 01:45:09,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:09,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:45:09,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:45:09,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418398272] [2024-11-07 01:45:09,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418398272] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:45:09,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:45:09,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 01:45:09,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418582027] [2024-11-07 01:45:09,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:45:09,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 01:45:09,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:45:09,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 01:45:09,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-07 01:45:09,214 INFO L87 Difference]: Start difference. First operand 2161 states and 2774 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 3 states have internal predecessors, (57), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-07 01:45:09,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:45:09,933 INFO L93 Difference]: Finished difference Result 5071 states and 6424 transitions. [2024-11-07 01:45:09,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 01:45:09,934 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 3 states have internal predecessors, (57), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 72 [2024-11-07 01:45:09,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:45:09,950 INFO L225 Difference]: With dead ends: 5071 [2024-11-07 01:45:09,951 INFO L226 Difference]: Without dead ends: 3141 [2024-11-07 01:45:09,957 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2024-11-07 01:45:09,958 INFO L432 NwaCegarLoop]: 275 mSDtfsCounter, 1053 mSDsluCounter, 459 mSDsCounter, 0 mSdLazyCounter, 364 mSolverCounterSat, 145 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1079 SdHoareTripleChecker+Valid, 734 SdHoareTripleChecker+Invalid, 509 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 145 IncrementalHoareTripleChecker+Valid, 364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 01:45:09,959 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1079 Valid, 734 Invalid, 509 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [145 Valid, 364 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 01:45:09,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3141 states. [2024-11-07 01:45:10,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3141 to 2893. [2024-11-07 01:45:10,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2893 states, 2271 states have (on average 1.2813738441215323) internal successors, (2910), 2307 states have internal predecessors, (2910), 314 states have call successors, (314), 249 states have call predecessors, (314), 306 states have return successors, (443), 343 states have call predecessors, (443), 312 states have call successors, (443) [2024-11-07 01:45:10,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2893 states to 2893 states and 3667 transitions. [2024-11-07 01:45:10,209 INFO L78 Accepts]: Start accepts. Automaton has 2893 states and 3667 transitions. Word has length 72 [2024-11-07 01:45:10,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:45:10,209 INFO L471 AbstractCegarLoop]: Abstraction has 2893 states and 3667 transitions. [2024-11-07 01:45:10,209 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 3 states have internal predecessors, (57), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-07 01:45:10,210 INFO L276 IsEmpty]: Start isEmpty. Operand 2893 states and 3667 transitions. [2024-11-07 01:45:10,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-07 01:45:10,212 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:45:10,213 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:45:10,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-07 01:45:10,213 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:45:10,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:45:10,213 INFO L85 PathProgramCache]: Analyzing trace with hash -598508016, now seen corresponding path program 1 times [2024-11-07 01:45:10,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:45:10,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291294766] [2024-11-07 01:45:10,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:45:10,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:45:10,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:10,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:45:10,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:10,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-07 01:45:10,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:10,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 01:45:10,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:10,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 01:45:10,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:10,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 01:45:10,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:10,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 01:45:10,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:10,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 01:45:10,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:10,322 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:45:10,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:45:10,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291294766] [2024-11-07 01:45:10,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [291294766] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:45:10,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:45:10,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:45:10,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342953542] [2024-11-07 01:45:10,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:45:10,323 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:45:10,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:45:10,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:45:10,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:45:10,324 INFO L87 Difference]: Start difference. First operand 2893 states and 3667 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-07 01:45:11,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:45:11,111 INFO L93 Difference]: Finished difference Result 3667 states and 4598 transitions. [2024-11-07 01:45:11,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-07 01:45:11,111 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 73 [2024-11-07 01:45:11,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:45:11,129 INFO L225 Difference]: With dead ends: 3667 [2024-11-07 01:45:11,129 INFO L226 Difference]: Without dead ends: 3664 [2024-11-07 01:45:11,131 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2024-11-07 01:45:11,132 INFO L432 NwaCegarLoop]: 268 mSDtfsCounter, 1502 mSDsluCounter, 442 mSDsCounter, 0 mSdLazyCounter, 379 mSolverCounterSat, 280 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1512 SdHoareTripleChecker+Valid, 710 SdHoareTripleChecker+Invalid, 659 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 280 IncrementalHoareTripleChecker+Valid, 379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-07 01:45:11,132 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1512 Valid, 710 Invalid, 659 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [280 Valid, 379 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-07 01:45:11,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3664 states. [2024-11-07 01:45:11,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3664 to 3387. [2024-11-07 01:45:11,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3387 states, 2656 states have (on average 1.2733433734939759) internal successors, (3382), 2697 states have internal predecessors, (3382), 364 states have call successors, (364), 293 states have call predecessors, (364), 365 states have return successors, (522), 403 states have call predecessors, (522), 363 states have call successors, (522) [2024-11-07 01:45:11,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3387 states to 3387 states and 4268 transitions. [2024-11-07 01:45:11,475 INFO L78 Accepts]: Start accepts. Automaton has 3387 states and 4268 transitions. Word has length 73 [2024-11-07 01:45:11,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:45:11,476 INFO L471 AbstractCegarLoop]: Abstraction has 3387 states and 4268 transitions. [2024-11-07 01:45:11,476 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-07 01:45:11,476 INFO L276 IsEmpty]: Start isEmpty. Operand 3387 states and 4268 transitions. [2024-11-07 01:45:11,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-07 01:45:11,478 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:45:11,478 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:45:11,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-07 01:45:11,478 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:45:11,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:45:11,479 INFO L85 PathProgramCache]: Analyzing trace with hash -1374805236, now seen corresponding path program 1 times [2024-11-07 01:45:11,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:45:11,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965842766] [2024-11-07 01:45:11,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:45:11,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:45:11,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:11,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:45:11,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:11,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-07 01:45:11,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:11,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 01:45:11,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:11,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 01:45:11,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:11,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 01:45:11,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:11,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 01:45:11,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:11,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 01:45:11,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:11,661 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:45:11,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:45:11,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965842766] [2024-11-07 01:45:11,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1965842766] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 01:45:11,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1322696429] [2024-11-07 01:45:11,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:45:11,662 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 01:45:11,662 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 01:45:11,665 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 01:45:11,667 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-07 01:45:11,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:11,774 INFO L255 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-07 01:45:11,783 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 01:45:12,048 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:45:12,048 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 01:45:12,137 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:45:12,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1322696429] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 01:45:12,138 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 01:45:12,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 4] total 10 [2024-11-07 01:45:12,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201746362] [2024-11-07 01:45:12,138 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 01:45:12,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-07 01:45:12,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:45:12,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-07 01:45:12,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-07 01:45:12,140 INFO L87 Difference]: Start difference. First operand 3387 states and 4268 transitions. Second operand has 10 states, 10 states have (on average 12.0) internal successors, (120), 7 states have internal predecessors, (120), 4 states have call successors, (20), 6 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2024-11-07 01:45:13,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:45:13,889 INFO L93 Difference]: Finished difference Result 7828 states and 9754 transitions. [2024-11-07 01:45:13,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-11-07 01:45:13,890 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 12.0) internal successors, (120), 7 states have internal predecessors, (120), 4 states have call successors, (20), 6 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) Word has length 74 [2024-11-07 01:45:13,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:45:13,923 INFO L225 Difference]: With dead ends: 7828 [2024-11-07 01:45:13,923 INFO L226 Difference]: Without dead ends: 7825 [2024-11-07 01:45:13,927 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=170, Invalid=642, Unknown=0, NotChecked=0, Total=812 [2024-11-07 01:45:13,928 INFO L432 NwaCegarLoop]: 352 mSDtfsCounter, 1690 mSDsluCounter, 1567 mSDsCounter, 0 mSdLazyCounter, 1678 mSolverCounterSat, 212 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1755 SdHoareTripleChecker+Valid, 1919 SdHoareTripleChecker+Invalid, 1890 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 212 IncrementalHoareTripleChecker+Valid, 1678 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-07 01:45:13,928 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1755 Valid, 1919 Invalid, 1890 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [212 Valid, 1678 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-07 01:45:13,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7825 states. [2024-11-07 01:45:14,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7825 to 5177. [2024-11-07 01:45:14,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5177 states, 4060 states have (on average 1.2704433497536947) internal successors, (5158), 4123 states have internal predecessors, (5158), 548 states have call successors, (548), 451 states have call predecessors, (548), 567 states have return successors, (800), 609 states have call predecessors, (800), 547 states have call successors, (800) [2024-11-07 01:45:14,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5177 states to 5177 states and 6506 transitions. [2024-11-07 01:45:14,473 INFO L78 Accepts]: Start accepts. Automaton has 5177 states and 6506 transitions. Word has length 74 [2024-11-07 01:45:14,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:45:14,474 INFO L471 AbstractCegarLoop]: Abstraction has 5177 states and 6506 transitions. [2024-11-07 01:45:14,474 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.0) internal successors, (120), 7 states have internal predecessors, (120), 4 states have call successors, (20), 6 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2024-11-07 01:45:14,474 INFO L276 IsEmpty]: Start isEmpty. Operand 5177 states and 6506 transitions. [2024-11-07 01:45:14,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-07 01:45:14,476 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:45:14,476 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:45:14,496 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-07 01:45:14,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-11-07 01:45:14,677 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:45:14,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:45:14,678 INFO L85 PathProgramCache]: Analyzing trace with hash -1132390512, now seen corresponding path program 2 times [2024-11-07 01:45:14,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:45:14,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991138835] [2024-11-07 01:45:14,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:45:14,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:45:14,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:14,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:45:14,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:14,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-07 01:45:14,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:14,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 01:45:14,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:14,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 01:45:14,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:14,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 01:45:14,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:14,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 01:45:14,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:14,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 01:45:14,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:14,749 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:45:14,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:45:14,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991138835] [2024-11-07 01:45:14,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1991138835] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:45:14,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:45:14,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 01:45:14,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127998352] [2024-11-07 01:45:14,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:45:14,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 01:45:14,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:45:14,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 01:45:14,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-07 01:45:14,750 INFO L87 Difference]: Start difference. First operand 5177 states and 6506 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 3 states have internal predecessors, (62), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-07 01:45:15,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:45:15,618 INFO L93 Difference]: Finished difference Result 7859 states and 9879 transitions. [2024-11-07 01:45:15,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 01:45:15,619 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 3 states have internal predecessors, (62), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 77 [2024-11-07 01:45:15,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:45:15,637 INFO L225 Difference]: With dead ends: 7859 [2024-11-07 01:45:15,638 INFO L226 Difference]: Without dead ends: 3784 [2024-11-07 01:45:15,647 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-11-07 01:45:15,648 INFO L432 NwaCegarLoop]: 302 mSDtfsCounter, 761 mSDsluCounter, 724 mSDsCounter, 0 mSdLazyCounter, 506 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 790 SdHoareTripleChecker+Valid, 1026 SdHoareTripleChecker+Invalid, 590 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 506 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-07 01:45:15,648 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [790 Valid, 1026 Invalid, 590 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 506 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-07 01:45:15,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3784 states. [2024-11-07 01:45:16,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3784 to 3549. [2024-11-07 01:45:16,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3549 states, 2788 states have (on average 1.2546628407460545) internal successors, (3498), 2829 states have internal predecessors, (3498), 380 states have call successors, (380), 307 states have call predecessors, (380), 379 states have return successors, (526), 419 states have call predecessors, (526), 379 states have call successors, (526) [2024-11-07 01:45:16,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3549 states to 3549 states and 4404 transitions. [2024-11-07 01:45:16,137 INFO L78 Accepts]: Start accepts. Automaton has 3549 states and 4404 transitions. Word has length 77 [2024-11-07 01:45:16,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:45:16,140 INFO L471 AbstractCegarLoop]: Abstraction has 3549 states and 4404 transitions. [2024-11-07 01:45:16,140 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 3 states have internal predecessors, (62), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-07 01:45:16,140 INFO L276 IsEmpty]: Start isEmpty. Operand 3549 states and 4404 transitions. [2024-11-07 01:45:16,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-07 01:45:16,143 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:45:16,143 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:45:16,143 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-07 01:45:16,144 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:45:16,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:45:16,144 INFO L85 PathProgramCache]: Analyzing trace with hash 532498142, now seen corresponding path program 1 times [2024-11-07 01:45:16,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:45:16,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769402653] [2024-11-07 01:45:16,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:45:16,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:45:16,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:16,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:45:16,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:16,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-07 01:45:16,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:16,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 01:45:16,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:16,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 01:45:16,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:16,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 01:45:16,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:16,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 01:45:16,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:16,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 01:45:16,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:16,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-07 01:45:16,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:16,287 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-07 01:45:16,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:45:16,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769402653] [2024-11-07 01:45:16,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1769402653] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:45:16,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:45:16,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 01:45:16,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340457801] [2024-11-07 01:45:16,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:45:16,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 01:45:16,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:45:16,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 01:45:16,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-07 01:45:16,288 INFO L87 Difference]: Start difference. First operand 3549 states and 4404 transitions. Second operand has 8 states, 8 states have (on average 7.875) internal successors, (63), 5 states have internal predecessors, (63), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-11-07 01:45:17,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:45:17,837 INFO L93 Difference]: Finished difference Result 10405 states and 12785 transitions. [2024-11-07 01:45:17,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-07 01:45:17,838 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 5 states have internal predecessors, (63), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 84 [2024-11-07 01:45:17,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:45:17,862 INFO L225 Difference]: With dead ends: 10405 [2024-11-07 01:45:17,862 INFO L226 Difference]: Without dead ends: 5784 [2024-11-07 01:45:17,875 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=131, Invalid=331, Unknown=0, NotChecked=0, Total=462 [2024-11-07 01:45:17,876 INFO L432 NwaCegarLoop]: 275 mSDtfsCounter, 786 mSDsluCounter, 1339 mSDsCounter, 0 mSdLazyCounter, 1021 mSolverCounterSat, 172 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 798 SdHoareTripleChecker+Valid, 1614 SdHoareTripleChecker+Invalid, 1193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 172 IncrementalHoareTripleChecker+Valid, 1021 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-07 01:45:17,876 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [798 Valid, 1614 Invalid, 1193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [172 Valid, 1021 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-07 01:45:17,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5784 states. [2024-11-07 01:45:18,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5784 to 5464. [2024-11-07 01:45:18,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5464 states, 4246 states have (on average 1.2305699481865284) internal successors, (5225), 4330 states have internal predecessors, (5225), 584 states have call successors, (584), 481 states have call predecessors, (584), 632 states have return successors, (908), 659 states have call predecessors, (908), 583 states have call successors, (908) [2024-11-07 01:45:18,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5464 states to 5464 states and 6717 transitions. [2024-11-07 01:45:18,400 INFO L78 Accepts]: Start accepts. Automaton has 5464 states and 6717 transitions. Word has length 84 [2024-11-07 01:45:18,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:45:18,401 INFO L471 AbstractCegarLoop]: Abstraction has 5464 states and 6717 transitions. [2024-11-07 01:45:18,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 5 states have internal predecessors, (63), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-11-07 01:45:18,401 INFO L276 IsEmpty]: Start isEmpty. Operand 5464 states and 6717 transitions. [2024-11-07 01:45:18,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-07 01:45:18,405 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:45:18,405 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:45:18,405 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-07 01:45:18,405 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:45:18,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:45:18,406 INFO L85 PathProgramCache]: Analyzing trace with hash 17095470, now seen corresponding path program 1 times [2024-11-07 01:45:18,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:45:18,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741313415] [2024-11-07 01:45:18,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:45:18,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:45:18,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:18,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:45:18,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:18,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-07 01:45:18,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:18,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 01:45:18,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:18,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 01:45:18,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:18,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 01:45:18,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:18,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 01:45:18,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:18,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 01:45:18,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:18,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-07 01:45:18,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:18,547 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-07 01:45:18,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:45:18,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741313415] [2024-11-07 01:45:18,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [741313415] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:45:18,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:45:18,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-07 01:45:18,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895023184] [2024-11-07 01:45:18,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:45:18,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 01:45:18,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:45:18,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 01:45:18,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-07 01:45:18,551 INFO L87 Difference]: Start difference. First operand 5464 states and 6717 transitions. Second operand has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 6 states have internal predecessors, (74), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-11-07 01:45:20,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:45:20,050 INFO L93 Difference]: Finished difference Result 9467 states and 11557 transitions. [2024-11-07 01:45:20,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-07 01:45:20,052 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 6 states have internal predecessors, (74), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 93 [2024-11-07 01:45:20,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:45:20,071 INFO L225 Difference]: With dead ends: 9467 [2024-11-07 01:45:20,071 INFO L226 Difference]: Without dead ends: 4874 [2024-11-07 01:45:20,079 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=162, Invalid=540, Unknown=0, NotChecked=0, Total=702 [2024-11-07 01:45:20,079 INFO L432 NwaCegarLoop]: 273 mSDtfsCounter, 2024 mSDsluCounter, 945 mSDsCounter, 0 mSdLazyCounter, 1094 mSolverCounterSat, 439 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2063 SdHoareTripleChecker+Valid, 1218 SdHoareTripleChecker+Invalid, 1533 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 439 IncrementalHoareTripleChecker+Valid, 1094 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-07 01:45:20,079 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2063 Valid, 1218 Invalid, 1533 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [439 Valid, 1094 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-07 01:45:20,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4874 states. [2024-11-07 01:45:20,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4874 to 4540. [2024-11-07 01:45:20,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4540 states, 3535 states have (on average 1.223196605374823) internal successors, (4324), 3601 states have internal predecessors, (4324), 485 states have call successors, (485), 396 states have call predecessors, (485), 518 states have return successors, (686), 549 states have call predecessors, (686), 484 states have call successors, (686) [2024-11-07 01:45:20,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4540 states to 4540 states and 5495 transitions. [2024-11-07 01:45:20,630 INFO L78 Accepts]: Start accepts. Automaton has 4540 states and 5495 transitions. Word has length 93 [2024-11-07 01:45:20,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:45:20,630 INFO L471 AbstractCegarLoop]: Abstraction has 4540 states and 5495 transitions. [2024-11-07 01:45:20,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 6 states have internal predecessors, (74), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-11-07 01:45:20,631 INFO L276 IsEmpty]: Start isEmpty. Operand 4540 states and 5495 transitions. [2024-11-07 01:45:20,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-07 01:45:20,635 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:45:20,635 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] [2024-11-07 01:45:20,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-07 01:45:20,636 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:45:20,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:45:20,636 INFO L85 PathProgramCache]: Analyzing trace with hash -890336660, now seen corresponding path program 1 times [2024-11-07 01:45:20,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:45:20,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413707714] [2024-11-07 01:45:20,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:45:20,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:45:20,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:20,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:45:20,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:20,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 01:45:20,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:20,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-07 01:45:20,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:20,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-07 01:45:20,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:20,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 01:45:20,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:20,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:45:20,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:45:20,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413707714] [2024-11-07 01:45:20,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1413707714] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:45:20,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:45:20,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 01:45:20,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907840424] [2024-11-07 01:45:20,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:45:20,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 01:45:20,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:45:20,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 01:45:20,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 01:45:20,738 INFO L87 Difference]: Start difference. First operand 4540 states and 5495 transitions. Second operand has 5 states, 5 states have (on average 18.2) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:45:22,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:45:22,018 INFO L93 Difference]: Finished difference Result 4803 states and 5905 transitions. [2024-11-07 01:45:22,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 01:45:22,019 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 101 [2024-11-07 01:45:22,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:45:22,036 INFO L225 Difference]: With dead ends: 4803 [2024-11-07 01:45:22,037 INFO L226 Difference]: Without dead ends: 4605 [2024-11-07 01:45:22,039 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-11-07 01:45:22,039 INFO L432 NwaCegarLoop]: 269 mSDtfsCounter, 613 mSDsluCounter, 389 mSDsCounter, 0 mSdLazyCounter, 637 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 630 SdHoareTripleChecker+Valid, 658 SdHoareTripleChecker+Invalid, 709 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 637 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-07 01:45:22,039 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [630 Valid, 658 Invalid, 709 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 637 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-07 01:45:22,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4605 states. [2024-11-07 01:45:22,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4605 to 4540. [2024-11-07 01:45:22,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4540 states, 3535 states have (on average 1.222913719943423) internal successors, (4323), 3601 states have internal predecessors, (4323), 485 states have call successors, (485), 396 states have call predecessors, (485), 518 states have return successors, (686), 549 states have call predecessors, (686), 484 states have call successors, (686) [2024-11-07 01:45:22,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4540 states to 4540 states and 5494 transitions. [2024-11-07 01:45:22,638 INFO L78 Accepts]: Start accepts. Automaton has 4540 states and 5494 transitions. Word has length 101 [2024-11-07 01:45:22,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:45:22,638 INFO L471 AbstractCegarLoop]: Abstraction has 4540 states and 5494 transitions. [2024-11-07 01:45:22,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:45:22,639 INFO L276 IsEmpty]: Start isEmpty. Operand 4540 states and 5494 transitions. [2024-11-07 01:45:22,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-07 01:45:22,643 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:45:22,643 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] [2024-11-07 01:45:22,643 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-07 01:45:22,643 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:45:22,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:45:22,644 INFO L85 PathProgramCache]: Analyzing trace with hash -119603094, now seen corresponding path program 1 times [2024-11-07 01:45:22,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:45:22,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417276230] [2024-11-07 01:45:22,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:45:22,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:45:22,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:22,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:45:22,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:22,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 01:45:22,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:22,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-07 01:45:22,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:22,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-07 01:45:22,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:22,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 01:45:22,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:22,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:45:22,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:45:22,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417276230] [2024-11-07 01:45:22,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1417276230] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:45:22,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:45:22,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 01:45:22,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159151200] [2024-11-07 01:45:22,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:45:22,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 01:45:22,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:45:22,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 01:45:22,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 01:45:22,772 INFO L87 Difference]: Start difference. First operand 4540 states and 5494 transitions. Second operand has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:45:24,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:45:24,374 INFO L93 Difference]: Finished difference Result 5064 states and 6313 transitions. [2024-11-07 01:45:24,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 01:45:24,374 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 101 [2024-11-07 01:45:24,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:45:24,391 INFO L225 Difference]: With dead ends: 5064 [2024-11-07 01:45:24,391 INFO L226 Difference]: Without dead ends: 4869 [2024-11-07 01:45:24,393 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-11-07 01:45:24,393 INFO L432 NwaCegarLoop]: 243 mSDtfsCounter, 984 mSDsluCounter, 686 mSDsCounter, 0 mSdLazyCounter, 1245 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1006 SdHoareTripleChecker+Valid, 929 SdHoareTripleChecker+Invalid, 1359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 1245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-07 01:45:24,394 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1006 Valid, 929 Invalid, 1359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 1245 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-07 01:45:24,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4869 states. [2024-11-07 01:45:25,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4869 to 4740. [2024-11-07 01:45:25,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4740 states, 3714 states have (on average 1.2380183091007) internal successors, (4598), 3781 states have internal predecessors, (4598), 499 states have call successors, (499), 402 states have call predecessors, (499), 525 states have return successors, (703), 563 states have call predecessors, (703), 498 states have call successors, (703) [2024-11-07 01:45:25,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4740 states to 4740 states and 5800 transitions. [2024-11-07 01:45:25,167 INFO L78 Accepts]: Start accepts. Automaton has 4740 states and 5800 transitions. Word has length 101 [2024-11-07 01:45:25,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:45:25,168 INFO L471 AbstractCegarLoop]: Abstraction has 4740 states and 5800 transitions. [2024-11-07 01:45:25,168 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:45:25,168 INFO L276 IsEmpty]: Start isEmpty. Operand 4740 states and 5800 transitions. [2024-11-07 01:45:25,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-07 01:45:25,173 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:45:25,173 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] [2024-11-07 01:45:25,173 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-07 01:45:25,173 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:45:25,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:45:25,174 INFO L85 PathProgramCache]: Analyzing trace with hash -1836487698, now seen corresponding path program 1 times [2024-11-07 01:45:25,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:45:25,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806256987] [2024-11-07 01:45:25,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:45:25,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:45:25,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:25,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:45:25,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:25,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 01:45:25,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:25,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-07 01:45:25,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:25,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-07 01:45:25,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:25,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 01:45:25,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:25,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:45:25,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:45:25,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806256987] [2024-11-07 01:45:25,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [806256987] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:45:25,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:45:25,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:45:25,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172249049] [2024-11-07 01:45:25,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:45:25,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:45:25,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:45:25,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:45:25,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:45:25,327 INFO L87 Difference]: Start difference. First operand 4740 states and 5800 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:45:27,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:45:27,367 INFO L93 Difference]: Finished difference Result 5536 states and 7042 transitions. [2024-11-07 01:45:27,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 01:45:27,368 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 101 [2024-11-07 01:45:27,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:45:27,387 INFO L225 Difference]: With dead ends: 5536 [2024-11-07 01:45:27,387 INFO L226 Difference]: Without dead ends: 5141 [2024-11-07 01:45:27,392 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-07 01:45:27,392 INFO L432 NwaCegarLoop]: 375 mSDtfsCounter, 997 mSDsluCounter, 1242 mSDsCounter, 0 mSdLazyCounter, 1978 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1019 SdHoareTripleChecker+Valid, 1617 SdHoareTripleChecker+Invalid, 2060 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 1978 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-07 01:45:27,393 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1019 Valid, 1617 Invalid, 2060 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 1978 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-07 01:45:27,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5141 states. [2024-11-07 01:45:28,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5141 to 4928. [2024-11-07 01:45:28,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4928 states, 3881 states have (on average 1.249420252512239) internal successors, (4849), 3949 states have internal predecessors, (4849), 513 states have call successors, (513), 408 states have call predecessors, (513), 532 states have return successors, (719), 578 states have call predecessors, (719), 512 states have call successors, (719) [2024-11-07 01:45:28,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4928 states to 4928 states and 6081 transitions. [2024-11-07 01:45:28,060 INFO L78 Accepts]: Start accepts. Automaton has 4928 states and 6081 transitions. Word has length 101 [2024-11-07 01:45:28,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:45:28,061 INFO L471 AbstractCegarLoop]: Abstraction has 4928 states and 6081 transitions. [2024-11-07 01:45:28,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:45:28,061 INFO L276 IsEmpty]: Start isEmpty. Operand 4928 states and 6081 transitions. [2024-11-07 01:45:28,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-07 01:45:28,066 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:45:28,066 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] [2024-11-07 01:45:28,066 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-07 01:45:28,066 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:45:28,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:45:28,066 INFO L85 PathProgramCache]: Analyzing trace with hash -511631504, now seen corresponding path program 1 times [2024-11-07 01:45:28,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:45:28,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661419273] [2024-11-07 01:45:28,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:45:28,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:45:28,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:28,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:45:28,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:28,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 01:45:28,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:28,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-07 01:45:28,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:28,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-07 01:45:28,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:28,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 01:45:28,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:28,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:45:28,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:45:28,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661419273] [2024-11-07 01:45:28,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1661419273] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:45:28,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:45:28,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:45:28,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647742186] [2024-11-07 01:45:28,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:45:28,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:45:28,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:45:28,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:45:28,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:45:28,202 INFO L87 Difference]: Start difference. First operand 4928 states and 6081 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:45:30,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:45:30,265 INFO L93 Difference]: Finished difference Result 6229 states and 8103 transitions. [2024-11-07 01:45:30,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 01:45:30,265 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 101 [2024-11-07 01:45:30,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:45:30,283 INFO L225 Difference]: With dead ends: 6229 [2024-11-07 01:45:30,283 INFO L226 Difference]: Without dead ends: 5646 [2024-11-07 01:45:30,287 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-07 01:45:30,288 INFO L432 NwaCegarLoop]: 373 mSDtfsCounter, 992 mSDsluCounter, 1242 mSDsCounter, 0 mSdLazyCounter, 1953 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1014 SdHoareTripleChecker+Valid, 1615 SdHoareTripleChecker+Invalid, 2037 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 1953 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-07 01:45:30,288 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1014 Valid, 1615 Invalid, 2037 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 1953 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-07 01:45:30,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5646 states. [2024-11-07 01:45:30,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5646 to 5307. [2024-11-07 01:45:30,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5307 states, 4218 states have (on average 1.269796111901375) internal successors, (5356), 4288 states have internal predecessors, (5356), 541 states have call successors, (541), 420 states have call predecessors, (541), 546 states have return successors, (755), 608 states have call predecessors, (755), 540 states have call successors, (755) [2024-11-07 01:45:30,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5307 states to 5307 states and 6652 transitions. [2024-11-07 01:45:30,979 INFO L78 Accepts]: Start accepts. Automaton has 5307 states and 6652 transitions. Word has length 101 [2024-11-07 01:45:30,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:45:30,979 INFO L471 AbstractCegarLoop]: Abstraction has 5307 states and 6652 transitions. [2024-11-07 01:45:30,979 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:45:30,979 INFO L276 IsEmpty]: Start isEmpty. Operand 5307 states and 6652 transitions. [2024-11-07 01:45:30,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-07 01:45:30,984 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:45:30,984 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:45:30,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-07 01:45:30,984 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:45:30,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:45:30,985 INFO L85 PathProgramCache]: Analyzing trace with hash 1055126446, now seen corresponding path program 1 times [2024-11-07 01:45:30,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:45:30,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449089847] [2024-11-07 01:45:30,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:45:30,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:45:30,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:31,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:45:31,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:31,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 01:45:31,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:31,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-07 01:45:31,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:31,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-07 01:45:31,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:31,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 01:45:31,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:31,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:45:31,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:45:31,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449089847] [2024-11-07 01:45:31,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [449089847] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:45:31,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:45:31,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:45:31,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624601063] [2024-11-07 01:45:31,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:45:31,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:45:31,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:45:31,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:45:31,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:45:31,119 INFO L87 Difference]: Start difference. First operand 5307 states and 6652 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:45:33,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:45:33,177 INFO L93 Difference]: Finished difference Result 7574 states and 10158 transitions. [2024-11-07 01:45:33,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 01:45:33,177 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 101 [2024-11-07 01:45:33,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:45:33,199 INFO L225 Difference]: With dead ends: 7574 [2024-11-07 01:45:33,199 INFO L226 Difference]: Without dead ends: 6612 [2024-11-07 01:45:33,205 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-07 01:45:33,205 INFO L432 NwaCegarLoop]: 373 mSDtfsCounter, 991 mSDsluCounter, 1242 mSDsCounter, 0 mSdLazyCounter, 1940 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1013 SdHoareTripleChecker+Valid, 1615 SdHoareTripleChecker+Invalid, 2024 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 1940 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-07 01:45:33,206 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1013 Valid, 1615 Invalid, 2024 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 1940 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-07 01:45:33,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6612 states. [2024-11-07 01:45:33,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6612 to 6068. [2024-11-07 01:45:33,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6068 states, 4895 states have (on average 1.3021450459652706) internal successors, (6374), 4969 states have internal predecessors, (6374), 597 states have call successors, (597), 444 states have call predecessors, (597), 574 states have return successors, (833), 668 states have call predecessors, (833), 596 states have call successors, (833) [2024-11-07 01:45:33,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6068 states to 6068 states and 7804 transitions. [2024-11-07 01:45:33,894 INFO L78 Accepts]: Start accepts. Automaton has 6068 states and 7804 transitions. Word has length 101 [2024-11-07 01:45:33,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:45:33,894 INFO L471 AbstractCegarLoop]: Abstraction has 6068 states and 7804 transitions. [2024-11-07 01:45:33,894 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:45:33,894 INFO L276 IsEmpty]: Start isEmpty. Operand 6068 states and 7804 transitions. [2024-11-07 01:45:33,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-07 01:45:33,898 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:45:33,899 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] [2024-11-07 01:45:33,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-07 01:45:33,899 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:45:33,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:45:33,899 INFO L85 PathProgramCache]: Analyzing trace with hash -2711632, now seen corresponding path program 1 times [2024-11-07 01:45:33,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:45:33,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715121900] [2024-11-07 01:45:33,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:45:33,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:45:33,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:33,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:45:33,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:33,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 01:45:33,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:34,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-07 01:45:34,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:34,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-07 01:45:34,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:34,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 01:45:34,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:34,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:45:34,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:45:34,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715121900] [2024-11-07 01:45:34,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715121900] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:45:34,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:45:34,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:45:34,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048825518] [2024-11-07 01:45:34,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:45:34,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:45:34,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:45:34,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:45:34,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:45:34,035 INFO L87 Difference]: Start difference. First operand 6068 states and 7804 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:45:36,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:45:36,343 INFO L93 Difference]: Finished difference Result 10265 states and 14288 transitions. [2024-11-07 01:45:36,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 01:45:36,343 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 101 [2024-11-07 01:45:36,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:45:36,371 INFO L225 Difference]: With dead ends: 10265 [2024-11-07 01:45:36,371 INFO L226 Difference]: Without dead ends: 8542 [2024-11-07 01:45:36,381 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-07 01:45:36,382 INFO L432 NwaCegarLoop]: 373 mSDtfsCounter, 990 mSDsluCounter, 1242 mSDsCounter, 0 mSdLazyCounter, 1927 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1012 SdHoareTripleChecker+Valid, 1615 SdHoareTripleChecker+Invalid, 2011 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 1927 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-07 01:45:36,382 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1012 Valid, 1615 Invalid, 2011 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 1927 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-07 01:45:36,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8542 states. [2024-11-07 01:45:37,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8542 to 7597. [2024-11-07 01:45:37,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7597 states, 6256 states have (on average 1.3459079283887467) internal successors, (8420), 6338 states have internal predecessors, (8420), 709 states have call successors, (709), 492 states have call predecessors, (709), 630 states have return successors, (1007), 788 states have call predecessors, (1007), 708 states have call successors, (1007) [2024-11-07 01:45:37,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7597 states to 7597 states and 10136 transitions. [2024-11-07 01:45:37,229 INFO L78 Accepts]: Start accepts. Automaton has 7597 states and 10136 transitions. Word has length 101 [2024-11-07 01:45:37,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:45:37,230 INFO L471 AbstractCegarLoop]: Abstraction has 7597 states and 10136 transitions. [2024-11-07 01:45:37,230 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:45:37,230 INFO L276 IsEmpty]: Start isEmpty. Operand 7597 states and 10136 transitions. [2024-11-07 01:45:37,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-07 01:45:37,234 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:45:37,234 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] [2024-11-07 01:45:37,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-07 01:45:37,234 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:45:37,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:45:37,235 INFO L85 PathProgramCache]: Analyzing trace with hash -1145214098, now seen corresponding path program 1 times [2024-11-07 01:45:37,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:45:37,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559875080] [2024-11-07 01:45:37,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:45:37,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:45:37,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:37,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:45:37,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:37,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 01:45:37,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:37,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-07 01:45:37,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:37,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-07 01:45:37,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:37,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 01:45:37,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:37,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:45:37,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:45:37,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559875080] [2024-11-07 01:45:37,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [559875080] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:45:37,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:45:37,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:45:37,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106534014] [2024-11-07 01:45:37,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:45:37,381 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:45:37,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:45:37,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:45:37,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:45:37,382 INFO L87 Difference]: Start difference. First operand 7597 states and 10136 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:45:39,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:45:39,864 INFO L93 Difference]: Finished difference Result 16912 states and 24500 transitions. [2024-11-07 01:45:39,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-07 01:45:39,865 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 101 [2024-11-07 01:45:39,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:45:39,900 INFO L225 Difference]: With dead ends: 16912 [2024-11-07 01:45:39,900 INFO L226 Difference]: Without dead ends: 13660 [2024-11-07 01:45:39,911 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-11-07 01:45:39,914 INFO L432 NwaCegarLoop]: 371 mSDtfsCounter, 1042 mSDsluCounter, 1234 mSDsCounter, 0 mSdLazyCounter, 2256 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1063 SdHoareTripleChecker+Valid, 1605 SdHoareTripleChecker+Invalid, 2342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 2256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-07 01:45:39,914 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1063 Valid, 1605 Invalid, 2342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 2256 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-07 01:45:39,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13660 states. [2024-11-07 01:45:40,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13660 to 10622. [2024-11-07 01:45:40,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10622 states, 8961 states have (on average 1.3951567905367706) internal successors, (12502), 9059 states have internal predecessors, (12502), 917 states have call successors, (917), 588 states have call predecessors, (917), 742 states have return successors, (1393), 1012 states have call predecessors, (1393), 916 states have call successors, (1393) [2024-11-07 01:45:40,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10622 states to 10622 states and 14812 transitions. [2024-11-07 01:45:40,867 INFO L78 Accepts]: Start accepts. Automaton has 10622 states and 14812 transitions. Word has length 101 [2024-11-07 01:45:40,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:45:40,868 INFO L471 AbstractCegarLoop]: Abstraction has 10622 states and 14812 transitions. [2024-11-07 01:45:40,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:45:40,868 INFO L276 IsEmpty]: Start isEmpty. Operand 10622 states and 14812 transitions. [2024-11-07 01:45:40,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-07 01:45:40,874 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:45:40,875 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] [2024-11-07 01:45:40,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-07 01:45:40,875 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:45:40,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:45:40,875 INFO L85 PathProgramCache]: Analyzing trace with hash -904974352, now seen corresponding path program 1 times [2024-11-07 01:45:40,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:45:40,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900743711] [2024-11-07 01:45:40,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:45:40,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:45:40,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:40,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:45:40,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:40,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 01:45:40,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:40,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-07 01:45:40,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:40,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-07 01:45:41,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:41,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 01:45:41,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:41,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:45:41,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:45:41,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900743711] [2024-11-07 01:45:41,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1900743711] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:45:41,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:45:41,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:45:41,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461913024] [2024-11-07 01:45:41,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:45:41,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:45:41,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:45:41,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:45:41,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:45:41,006 INFO L87 Difference]: Start difference. First operand 10622 states and 14812 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:45:43,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:45:43,573 INFO L93 Difference]: Finished difference Result 28415 states and 42426 transitions. [2024-11-07 01:45:43,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-07 01:45:43,574 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 101 [2024-11-07 01:45:43,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:45:43,642 INFO L225 Difference]: With dead ends: 28415 [2024-11-07 01:45:43,642 INFO L226 Difference]: Without dead ends: 22138 [2024-11-07 01:45:43,669 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-11-07 01:45:43,670 INFO L432 NwaCegarLoop]: 258 mSDtfsCounter, 1200 mSDsluCounter, 898 mSDsCounter, 0 mSdLazyCounter, 1704 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1228 SdHoareTripleChecker+Valid, 1156 SdHoareTripleChecker+Invalid, 1815 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 1704 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-07 01:45:43,670 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1228 Valid, 1156 Invalid, 1815 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 1704 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-07 01:45:43,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22138 states. [2024-11-07 01:45:45,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22138 to 16495. [2024-11-07 01:45:45,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16495 states, 14210 states have (on average 1.4372976776917663) internal successors, (20424), 14340 states have internal predecessors, (20424), 1317 states have call successors, (1317), 780 states have call predecessors, (1317), 966 states have return successors, (2311), 1444 states have call predecessors, (2311), 1316 states have call successors, (2311) [2024-11-07 01:45:45,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16495 states to 16495 states and 24052 transitions. [2024-11-07 01:45:45,249 INFO L78 Accepts]: Start accepts. Automaton has 16495 states and 24052 transitions. Word has length 101 [2024-11-07 01:45:45,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:45:45,249 INFO L471 AbstractCegarLoop]: Abstraction has 16495 states and 24052 transitions. [2024-11-07 01:45:45,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:45:45,250 INFO L276 IsEmpty]: Start isEmpty. Operand 16495 states and 24052 transitions. [2024-11-07 01:45:45,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-07 01:45:45,258 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:45:45,258 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:45:45,258 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-07 01:45:45,258 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:45:45,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:45:45,259 INFO L85 PathProgramCache]: Analyzing trace with hash -65940690, now seen corresponding path program 1 times [2024-11-07 01:45:45,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:45:45,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941656919] [2024-11-07 01:45:45,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:45:45,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:45:45,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:45,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:45:45,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:45,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 01:45:45,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:45,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-07 01:45:45,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:45,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-07 01:45:45,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:45,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 01:45:45,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:45,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:45:45,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:45:45,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941656919] [2024-11-07 01:45:45,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1941656919] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:45:45,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:45:45,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:45:45,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132535132] [2024-11-07 01:45:45,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:45:45,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:45:45,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:45:45,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:45:45,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:45:45,393 INFO L87 Difference]: Start difference. First operand 16495 states and 24052 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:45:48,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:45:48,946 INFO L93 Difference]: Finished difference Result 50350 states and 77184 transitions. [2024-11-07 01:45:48,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-07 01:45:48,946 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 101 [2024-11-07 01:45:48,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:45:49,073 INFO L225 Difference]: With dead ends: 50350 [2024-11-07 01:45:49,073 INFO L226 Difference]: Without dead ends: 38200 [2024-11-07 01:45:49,113 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-11-07 01:45:49,114 INFO L432 NwaCegarLoop]: 371 mSDtfsCounter, 1026 mSDsluCounter, 1234 mSDsCounter, 0 mSdLazyCounter, 2135 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1047 SdHoareTripleChecker+Valid, 1605 SdHoareTripleChecker+Invalid, 2221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 2135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-07 01:45:49,114 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1047 Valid, 1605 Invalid, 2221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 2135 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-07 01:45:49,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38200 states. [2024-11-07 01:45:51,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38200 to 28368. [2024-11-07 01:45:51,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28368 states, 24867 states have (on average 1.469980295170306) internal successors, (36554), 25061 states have internal predecessors, (36554), 2085 states have call successors, (2085), 1164 states have call predecessors, (2085), 1414 states have return successors, (4601), 2276 states have call predecessors, (4601), 2084 states have call successors, (4601) [2024-11-07 01:45:51,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28368 states to 28368 states and 43240 transitions. [2024-11-07 01:45:51,970 INFO L78 Accepts]: Start accepts. Automaton has 28368 states and 43240 transitions. Word has length 101 [2024-11-07 01:45:51,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:45:51,970 INFO L471 AbstractCegarLoop]: Abstraction has 28368 states and 43240 transitions. [2024-11-07 01:45:51,970 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:45:51,970 INFO L276 IsEmpty]: Start isEmpty. Operand 28368 states and 43240 transitions. [2024-11-07 01:45:51,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-07 01:45:51,984 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:45:51,984 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:45:51,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-07 01:45:51,984 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:45:51,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:45:51,984 INFO L85 PathProgramCache]: Analyzing trace with hash -38875088, now seen corresponding path program 1 times [2024-11-07 01:45:51,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:45:51,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599176217] [2024-11-07 01:45:51,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:45:51,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:45:51,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:52,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:45:52,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:52,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 01:45:52,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:52,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-07 01:45:52,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:52,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-07 01:45:52,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:52,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 01:45:52,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:45:52,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:45:52,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:45:52,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599176217] [2024-11-07 01:45:52,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599176217] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:45:52,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:45:52,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:45:52,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810208552] [2024-11-07 01:45:52,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:45:52,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:45:52,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:45:52,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:45:52,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:45:52,103 INFO L87 Difference]: Start difference. First operand 28368 states and 43240 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:45:57,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:45:57,671 INFO L93 Difference]: Finished difference Result 91531 states and 144642 transitions. [2024-11-07 01:45:57,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-07 01:45:57,671 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 101 [2024-11-07 01:45:57,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:45:57,927 INFO L225 Difference]: With dead ends: 91531 [2024-11-07 01:45:57,927 INFO L226 Difference]: Without dead ends: 67508 [2024-11-07 01:45:58,013 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-11-07 01:45:58,013 INFO L432 NwaCegarLoop]: 371 mSDtfsCounter, 1045 mSDsluCounter, 1234 mSDsCounter, 0 mSdLazyCounter, 1849 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1073 SdHoareTripleChecker+Valid, 1605 SdHoareTripleChecker+Invalid, 1936 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 1849 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-07 01:45:58,013 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1073 Valid, 1605 Invalid, 1936 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 1849 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-07 01:45:58,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67508 states. [2024-11-07 01:46:01,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67508 to 52178. [2024-11-07 01:46:01,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52178 states, 46309 states have (on average 1.4928847524239348) internal successors, (69134), 46631 states have internal predecessors, (69134), 3557 states have call successors, (3557), 1932 states have call predecessors, (3557), 2310 states have return successors, (10575), 3876 states have call predecessors, (10575), 3556 states have call successors, (10575) [2024-11-07 01:46:01,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52178 states to 52178 states and 83266 transitions. [2024-11-07 01:46:02,004 INFO L78 Accepts]: Start accepts. Automaton has 52178 states and 83266 transitions. Word has length 101 [2024-11-07 01:46:02,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:46:02,004 INFO L471 AbstractCegarLoop]: Abstraction has 52178 states and 83266 transitions. [2024-11-07 01:46:02,004 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:46:02,004 INFO L276 IsEmpty]: Start isEmpty. Operand 52178 states and 83266 transitions. [2024-11-07 01:46:02,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-07 01:46:02,034 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:46:02,034 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] [2024-11-07 01:46:02,034 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-07 01:46:02,034 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:46:02,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:46:02,035 INFO L85 PathProgramCache]: Analyzing trace with hash 1695229362, now seen corresponding path program 1 times [2024-11-07 01:46:02,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:46:02,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086553147] [2024-11-07 01:46:02,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:46:02,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:46:02,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:02,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:46:02,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:02,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 01:46:02,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:02,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-07 01:46:02,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:02,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-07 01:46:02,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:02,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 01:46:02,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:46:02,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:46:02,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:46:02,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086553147] [2024-11-07 01:46:02,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1086553147] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:46:02,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:46:02,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:46:02,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803103112] [2024-11-07 01:46:02,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:46:02,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:46:02,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:46:02,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:46:02,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:46:02,164 INFO L87 Difference]: Start difference. First operand 52178 states and 83266 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5)