./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/Problem05_label46+token_ring.04.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4f9af400 extending candidate: java ['java'] extending candidate: /usr/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/oracle-jdk-bin-*/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/openjdk-*/bin/java ['java', '/usr/bin/java'] extending candidate: /usr/lib/jvm/java-*-openjdk-amd64/bin/java ['java', '/usr/bin/java', '/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java', '/usr/lib/jvm/java-17-openjdk-amd64/bin/java', '/usr/lib/jvm/java-11-openjdk-amd64/bin/java', '/usr/lib/jvm/java-1.17.0-openjdk-amd64/bin/java'] ['/root/.sdkman/candidates/java/21.0.5-tem/bin/java', '-Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config', '-Xmx15G', '-Xms4m', '-jar', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar', '-data', '@noDefault', '-ultimatedata', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data', '-tc', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml', '-i', '../sv-benchmarks/c/combinations/Problem05_label46+token_ring.04.cil-2.c', '-s', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf', '--cacsl2boogietranslator.entry.function', 'main', '--witnessprinter.witness.directory', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux', '--witnessprinter.witness.filename', 'witness', '--witnessprinter.write.witness.besides.input.file', 'false', '--witnessprinter.graph.data.specification', 'CHECK( init(main()), LTL(G ! call(reach_error())) )\n\n', '--witnessprinter.graph.data.producer', 'Automizer', '--witnessprinter.graph.data.architecture', '32bit', '--witnessprinter.graph.data.programhash', '7640909f7ef47a12c6daa58dacf29a693ba9f7401fa2c48138a16311fc07e97d'] 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/Problem05_label46+token_ring.04.cil-2.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7640909f7ef47a12c6daa58dacf29a693ba9f7401fa2c48138a16311fc07e97d --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 01:04:58,779 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 01:04:58,854 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:04:58,858 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 01:04:58,858 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 01:04:58,872 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 01:04:58,872 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 01:04:58,872 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 01:04:58,873 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 01:04:58,873 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 01:04:58,873 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 01:04:58,873 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 01:04:58,873 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 01:04:58,873 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 01:04:58,873 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 01:04:58,874 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 01:04:58,874 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 01:04:58,874 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 01:04:58,874 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 01:04:58,874 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 01:04:58,874 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 01:04:58,874 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 01:04:58,874 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 01:04:58,874 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 01:04:58,874 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 01:04:58,875 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 01:04:58,875 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 01:04:58,875 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 01:04:58,875 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 01:04:58,875 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 01:04:58,875 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 01:04:58,875 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 01:04:58,875 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 01:04:58,875 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 01:04:58,875 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 01:04:58,875 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 01:04:58,876 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 01:04:58,876 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 01:04:58,876 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 01:04:58,876 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 01:04:58,876 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 01:04:58,876 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 01:04:58,876 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 -> 7640909f7ef47a12c6daa58dacf29a693ba9f7401fa2c48138a16311fc07e97d [2024-11-07 01:04:59,120 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 01:04:59,128 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 01:04:59,130 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 01:04:59,131 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 01:04:59,132 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 01:04:59,132 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/Problem05_label46+token_ring.04.cil-2.c [2024-11-07 01:05:00,303 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 01:05:00,866 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 01:05:00,868 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label46+token_ring.04.cil-2.c [2024-11-07 01:05:00,911 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a7c28220b/b48e7127151443cf8b6ec255afed803a/FLAGcbdef4be0 [2024-11-07 01:05:00,929 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a7c28220b/b48e7127151443cf8b6ec255afed803a [2024-11-07 01:05:00,931 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 01:05:00,932 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 01:05:00,933 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 01:05:00,933 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 01:05:00,936 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 01:05:00,937 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:05:00" (1/1) ... [2024-11-07 01:05:00,939 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e10ccaf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:05:00, skipping insertion in model container [2024-11-07 01:05:00,939 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:05:00" (1/1) ... [2024-11-07 01:05:01,058 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 01:05:02,157 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/Problem05_label46+token_ring.04.cil-2.c[382357,382370] [2024-11-07 01:05:02,178 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label46+token_ring.04.cil-2.c[383339,383352] [2024-11-07 01:05:02,322 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 01:05:02,332 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 01:05:02,947 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/Problem05_label46+token_ring.04.cil-2.c[382357,382370] [2024-11-07 01:05:02,951 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/Problem05_label46+token_ring.04.cil-2.c[383339,383352] [2024-11-07 01:05:02,963 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 01:05:03,001 INFO L204 MainTranslator]: Completed translation [2024-11-07 01:05:03,002 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:05:03 WrapperNode [2024-11-07 01:05:03,002 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 01:05:03,003 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 01:05:03,003 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 01:05:03,003 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 01:05:03,008 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:05:03" (1/1) ... [2024-11-07 01:05:03,058 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:05:03" (1/1) ... [2024-11-07 01:05:03,648 INFO L138 Inliner]: procedures = 52, calls = 54, calls flagged for inlining = 29, calls inlined = 29, statements flattened = 12759 [2024-11-07 01:05:03,650 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 01:05:03,652 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 01:05:03,652 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 01:05:03,652 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 01:05:03,679 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:05:03" (1/1) ... [2024-11-07 01:05:03,679 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:05:03" (1/1) ... [2024-11-07 01:05:03,793 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:05:03" (1/1) ... [2024-11-07 01:05:04,037 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:05:04,037 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:05:03" (1/1) ... [2024-11-07 01:05:04,038 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:05:03" (1/1) ... [2024-11-07 01:05:04,336 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:05:03" (1/1) ... [2024-11-07 01:05:04,429 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:05:03" (1/1) ... [2024-11-07 01:05:04,463 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:05:03" (1/1) ... [2024-11-07 01:05:04,498 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:05:03" (1/1) ... [2024-11-07 01:05:04,589 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 01:05:04,592 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 01:05:04,593 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 01:05:04,593 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 01:05:04,594 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:05:03" (1/1) ... [2024-11-07 01:05:04,601 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 01:05:04,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 01:05:04,638 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:05:04,640 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:05:04,654 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 01:05:04,655 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2024-11-07 01:05:04,655 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2024-11-07 01:05:04,655 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-11-07 01:05:04,655 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-11-07 01:05:04,655 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2024-11-07 01:05:04,655 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2024-11-07 01:05:04,655 INFO L130 BoogieDeclarations]: Found specification of procedure error [2024-11-07 01:05:04,655 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2024-11-07 01:05:04,655 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2024-11-07 01:05:04,655 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2024-11-07 01:05:04,655 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2024-11-07 01:05:04,655 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2024-11-07 01:05:04,655 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2024-11-07 01:05:04,656 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2024-11-07 01:05:04,656 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 01:05:04,656 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 01:05:04,656 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 01:05:04,727 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 01:05:04,729 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 01:05:11,356 INFO L? ?]: Removed 1711 outVars from TransFormulas that were not future-live. [2024-11-07 01:05:11,357 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 01:05:11,419 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 01:05:11,419 INFO L316 CfgBuilder]: Removed 8 assume(true) statements. [2024-11-07 01:05:11,420 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:05:11 BoogieIcfgContainer [2024-11-07 01:05:11,420 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 01:05:11,425 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 01:05:11,425 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 01:05:11,433 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 01:05:11,433 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 01:05:00" (1/3) ... [2024-11-07 01:05:11,434 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2eff5a81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:05:11, skipping insertion in model container [2024-11-07 01:05:11,434 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:05:03" (2/3) ... [2024-11-07 01:05:11,435 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2eff5a81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:05:11, skipping insertion in model container [2024-11-07 01:05:11,435 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:05:11" (3/3) ... [2024-11-07 01:05:11,435 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem05_label46+token_ring.04.cil-2.c [2024-11-07 01:05:11,460 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 01:05:11,461 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-07 01:05:11,601 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 01:05:11,617 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;@2fc186fb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 01:05:11,617 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-07 01:05:11,637 INFO L276 IsEmpty]: Start isEmpty. Operand has 2378 states, 2348 states have (on average 1.852640545144804) internal successors, (4350), 2353 states have internal predecessors, (4350), 20 states have call successors, (20), 7 states have call predecessors, (20), 7 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-07 01:05:11,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-07 01:05:11,645 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:05:11,646 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:05:11,646 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:05:11,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:05:11,649 INFO L85 PathProgramCache]: Analyzing trace with hash 482633735, now seen corresponding path program 1 times [2024-11-07 01:05:11,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:05:11,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612776959] [2024-11-07 01:05:11,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:05:11,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:05:11,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:05:11,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:05:11,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:05:11,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-07 01:05:11,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:05:11,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 01:05:11,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:05:12,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 01:05:12,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:05:12,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 01:05:12,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:05:12,048 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:05:12,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:05:12,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612776959] [2024-11-07 01:05:12,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612776959] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:05:12,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:05:12,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 01:05:12,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759903963] [2024-11-07 01:05:12,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:05:12,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 01:05:12,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:05:12,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 01:05:12,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 01:05:12,081 INFO L87 Difference]: Start difference. First operand has 2378 states, 2348 states have (on average 1.852640545144804) internal successors, (4350), 2353 states have internal predecessors, (4350), 20 states have call successors, (20), 7 states have call predecessors, (20), 7 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:05:12,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:05:12,822 INFO L93 Difference]: Finished difference Result 4803 states and 8862 transitions. [2024-11-07 01:05:12,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 01:05:12,824 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 91 [2024-11-07 01:05:12,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:05:12,841 INFO L225 Difference]: With dead ends: 4803 [2024-11-07 01:05:12,842 INFO L226 Difference]: Without dead ends: 2364 [2024-11-07 01:05:12,849 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-07 01:05:12,851 INFO L432 NwaCegarLoop]: 4210 mSDtfsCounter, 457 mSDsluCounter, 12285 mSDsCounter, 0 mSdLazyCounter, 421 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 473 SdHoareTripleChecker+Valid, 16495 SdHoareTripleChecker+Invalid, 465 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-07 01:05:12,851 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [473 Valid, 16495 Invalid, 465 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 421 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-07 01:05:12,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2364 states. [2024-11-07 01:05:12,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2364 to 2310. [2024-11-07 01:05:12,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2310 states, 2282 states have (on average 1.8418054338299736) internal successors, (4203), 2285 states have internal predecessors, (4203), 20 states have call successors, (20), 7 states have call predecessors, (20), 6 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-07 01:05:12,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2310 states to 2310 states and 4241 transitions. [2024-11-07 01:05:12,960 INFO L78 Accepts]: Start accepts. Automaton has 2310 states and 4241 transitions. Word has length 91 [2024-11-07 01:05:12,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:05:12,961 INFO L471 AbstractCegarLoop]: Abstraction has 2310 states and 4241 transitions. [2024-11-07 01:05:12,961 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:05:12,961 INFO L276 IsEmpty]: Start isEmpty. Operand 2310 states and 4241 transitions. [2024-11-07 01:05:12,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-07 01:05:12,964 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:05:12,964 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:05:12,964 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 01:05:12,964 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:05:12,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:05:12,965 INFO L85 PathProgramCache]: Analyzing trace with hash -1084124215, now seen corresponding path program 1 times [2024-11-07 01:05:12,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:05:12,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720945289] [2024-11-07 01:05:12,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:05:12,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:05:12,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:05:13,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:05:13,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:05:13,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-07 01:05:13,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:05:13,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 01:05:13,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:05:13,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 01:05:13,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:05:13,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 01:05:13,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:05:13,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:05:13,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:05:13,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720945289] [2024-11-07 01:05:13,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1720945289] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:05:13,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:05:13,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 01:05:13,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807007551] [2024-11-07 01:05:13,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:05:13,212 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 01:05:13,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:05:13,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 01:05:13,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 01:05:13,216 INFO L87 Difference]: Start difference. First operand 2310 states and 4241 transitions. Second operand has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:05:14,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:05:14,746 INFO L93 Difference]: Finished difference Result 2774 states and 4962 transitions. [2024-11-07 01:05:14,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 01:05:14,746 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 91 [2024-11-07 01:05:14,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:05:14,769 INFO L225 Difference]: With dead ends: 2774 [2024-11-07 01:05:14,769 INFO L226 Difference]: Without dead ends: 2597 [2024-11-07 01:05:14,773 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:05:14,774 INFO L432 NwaCegarLoop]: 4127 mSDtfsCounter, 4619 mSDsluCounter, 12372 mSDsCounter, 0 mSdLazyCounter, 926 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4630 SdHoareTripleChecker+Valid, 16499 SdHoareTripleChecker+Invalid, 1010 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 926 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-07 01:05:14,775 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4630 Valid, 16499 Invalid, 1010 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [84 Valid, 926 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-07 01:05:14,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2597 states. [2024-11-07 01:05:14,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2597 to 2488. [2024-11-07 01:05:14,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2488 states, 2440 states have (on average 1.8221311475409836) internal successors, (4446), 2444 states have internal predecessors, (4446), 33 states have call successors, (33), 13 states have call predecessors, (33), 13 states have return successors, (34), 31 states have call predecessors, (34), 31 states have call successors, (34) [2024-11-07 01:05:14,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2488 states to 2488 states and 4513 transitions. [2024-11-07 01:05:14,862 INFO L78 Accepts]: Start accepts. Automaton has 2488 states and 4513 transitions. Word has length 91 [2024-11-07 01:05:14,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:05:14,863 INFO L471 AbstractCegarLoop]: Abstraction has 2488 states and 4513 transitions. [2024-11-07 01:05:14,863 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:05:14,863 INFO L276 IsEmpty]: Start isEmpty. Operand 2488 states and 4513 transitions. [2024-11-07 01:05:14,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-07 01:05:14,866 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:05:14,867 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:05:14,867 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 01:05:14,867 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:05:14,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:05:14,867 INFO L85 PathProgramCache]: Analyzing trace with hash 1156138437, now seen corresponding path program 1 times [2024-11-07 01:05:14,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:05:14,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422071890] [2024-11-07 01:05:14,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:05:14,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:05:14,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:05:14,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:05:14,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:05:14,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-07 01:05:14,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:05:15,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 01:05:15,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:05:15,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 01:05:15,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:05:15,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 01:05:15,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:05:15,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:05:15,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:05:15,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422071890] [2024-11-07 01:05:15,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422071890] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:05:15,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:05:15,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:05:15,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266221458] [2024-11-07 01:05:15,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:05:15,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:05:15,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:05:15,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:05:15,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:05:15,035 INFO L87 Difference]: Start difference. First operand 2488 states and 4513 transitions. Second operand has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:05:16,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:05:16,312 INFO L93 Difference]: Finished difference Result 3187 states and 5594 transitions. [2024-11-07 01:05:16,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 01:05:16,313 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 91 [2024-11-07 01:05:16,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:05:16,322 INFO L225 Difference]: With dead ends: 3187 [2024-11-07 01:05:16,322 INFO L226 Difference]: Without dead ends: 2832 [2024-11-07 01:05:16,324 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-07 01:05:16,325 INFO L432 NwaCegarLoop]: 4253 mSDtfsCounter, 4620 mSDsluCounter, 16808 mSDsCounter, 0 mSdLazyCounter, 1494 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4631 SdHoareTripleChecker+Valid, 21061 SdHoareTripleChecker+Invalid, 1543 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 1494 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-07 01:05:16,325 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4631 Valid, 21061 Invalid, 1543 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 1494 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-07 01:05:16,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2832 states. [2024-11-07 01:05:16,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2832 to 2655. [2024-11-07 01:05:16,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2655 states, 2587 states have (on average 1.8040201005025125) internal successors, (4667), 2592 states have internal predecessors, (4667), 46 states have call successors, (46), 19 states have call predecessors, (46), 20 states have return successors, (49), 45 states have call predecessors, (49), 44 states have call successors, (49) [2024-11-07 01:05:16,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2655 states to 2655 states and 4762 transitions. [2024-11-07 01:05:16,383 INFO L78 Accepts]: Start accepts. Automaton has 2655 states and 4762 transitions. Word has length 91 [2024-11-07 01:05:16,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:05:16,384 INFO L471 AbstractCegarLoop]: Abstraction has 2655 states and 4762 transitions. [2024-11-07 01:05:16,384 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:05:16,384 INFO L276 IsEmpty]: Start isEmpty. Operand 2655 states and 4762 transitions. [2024-11-07 01:05:16,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-07 01:05:16,385 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:05:16,385 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:05:16,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 01:05:16,385 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:05:16,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:05:16,386 INFO L85 PathProgramCache]: Analyzing trace with hash -1404724409, now seen corresponding path program 1 times [2024-11-07 01:05:16,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:05:16,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496265842] [2024-11-07 01:05:16,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:05:16,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:05:16,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:05:16,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:05:16,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:05:16,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-07 01:05:16,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:05:16,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 01:05:16,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:05:16,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 01:05:16,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:05:16,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 01:05:16,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:05:16,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:05:16,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:05:16,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496265842] [2024-11-07 01:05:16,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [496265842] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:05:16,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:05:16,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:05:16,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235103297] [2024-11-07 01:05:16,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:05:16,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:05:16,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:05:16,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:05:16,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:05:16,569 INFO L87 Difference]: Start difference. First operand 2655 states and 4762 transitions. Second operand has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:05:17,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:05:17,750 INFO L93 Difference]: Finished difference Result 3795 states and 6521 transitions. [2024-11-07 01:05:17,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 01:05:17,751 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 91 [2024-11-07 01:05:17,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:05:17,761 INFO L225 Difference]: With dead ends: 3795 [2024-11-07 01:05:17,761 INFO L226 Difference]: Without dead ends: 3273 [2024-11-07 01:05:17,764 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-07 01:05:17,765 INFO L432 NwaCegarLoop]: 4137 mSDtfsCounter, 4670 mSDsluCounter, 16482 mSDsCounter, 0 mSdLazyCounter, 1259 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4681 SdHoareTripleChecker+Valid, 20619 SdHoareTripleChecker+Invalid, 1334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 1259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-07 01:05:17,766 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4681 Valid, 20619 Invalid, 1334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 1259 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-07 01:05:17,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3273 states. [2024-11-07 01:05:17,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3273 to 2990. [2024-11-07 01:05:17,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2990 states, 2882 states have (on average 1.7730742539902846) internal successors, (5110), 2889 states have internal predecessors, (5110), 72 states have call successors, (72), 31 states have call predecessors, (72), 34 states have return successors, (83), 73 states have call predecessors, (83), 70 states have call successors, (83) [2024-11-07 01:05:17,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2990 states to 2990 states and 5265 transitions. [2024-11-07 01:05:17,847 INFO L78 Accepts]: Start accepts. Automaton has 2990 states and 5265 transitions. Word has length 91 [2024-11-07 01:05:17,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:05:17,848 INFO L471 AbstractCegarLoop]: Abstraction has 2990 states and 5265 transitions. [2024-11-07 01:05:17,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:05:17,848 INFO L276 IsEmpty]: Start isEmpty. Operand 2990 states and 5265 transitions. [2024-11-07 01:05:17,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-07 01:05:17,851 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:05:17,851 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:05:17,851 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 01:05:17,851 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:05:17,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:05:17,852 INFO L85 PathProgramCache]: Analyzing trace with hash -517501563, now seen corresponding path program 1 times [2024-11-07 01:05:17,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:05:17,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912904850] [2024-11-07 01:05:17,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:05:17,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:05:17,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:05:17,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:05:17,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:05:17,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-07 01:05:17,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:05:17,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 01:05:17,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:05:18,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 01:05:18,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:05:18,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 01:05:18,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:05:18,016 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:05:18,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:05:18,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912904850] [2024-11-07 01:05:18,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1912904850] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:05:18,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:05:18,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:05:18,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012852792] [2024-11-07 01:05:18,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:05:18,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:05:18,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:05:18,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:05:18,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:05:18,020 INFO L87 Difference]: Start difference. First operand 2990 states and 5265 transitions. Second operand has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:05:19,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:05:19,151 INFO L93 Difference]: Finished difference Result 4970 states and 8308 transitions. [2024-11-07 01:05:19,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 01:05:19,151 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 91 [2024-11-07 01:05:19,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:05:19,165 INFO L225 Difference]: With dead ends: 4970 [2024-11-07 01:05:19,165 INFO L226 Difference]: Without dead ends: 4113 [2024-11-07 01:05:19,169 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-07 01:05:19,170 INFO L432 NwaCegarLoop]: 4251 mSDtfsCounter, 4618 mSDsluCounter, 16808 mSDsCounter, 0 mSdLazyCounter, 1483 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4629 SdHoareTripleChecker+Valid, 21059 SdHoareTripleChecker+Invalid, 1534 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 1483 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-07 01:05:19,170 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4629 Valid, 21059 Invalid, 1534 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 1483 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-07 01:05:19,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4113 states. [2024-11-07 01:05:19,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4113 to 3661. [2024-11-07 01:05:19,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3661 states, 3473 states have (on average 1.7264612726749209) internal successors, (5996), 3484 states have internal predecessors, (5996), 124 states have call successors, (124), 55 states have call predecessors, (124), 62 states have return successors, (157), 129 states have call predecessors, (157), 122 states have call successors, (157) [2024-11-07 01:05:19,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3661 states to 3661 states and 6277 transitions. [2024-11-07 01:05:19,262 INFO L78 Accepts]: Start accepts. Automaton has 3661 states and 6277 transitions. Word has length 91 [2024-11-07 01:05:19,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:05:19,263 INFO L471 AbstractCegarLoop]: Abstraction has 3661 states and 6277 transitions. [2024-11-07 01:05:19,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:05:19,263 INFO L276 IsEmpty]: Start isEmpty. Operand 3661 states and 6277 transitions. [2024-11-07 01:05:19,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-07 01:05:19,266 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:05:19,266 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:05:19,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 01:05:19,267 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:05:19,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:05:19,267 INFO L85 PathProgramCache]: Analyzing trace with hash 1866423175, now seen corresponding path program 1 times [2024-11-07 01:05:19,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:05:19,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511584197] [2024-11-07 01:05:19,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:05:19,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:05:19,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:05:19,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:05:19,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:05:19,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-07 01:05:19,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:05:19,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 01:05:19,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:05:19,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 01:05:19,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:05:19,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 01:05:19,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:05:19,402 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:05:19,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:05:19,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511584197] [2024-11-07 01:05:19,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511584197] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:05:19,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:05:19,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:05:19,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83758105] [2024-11-07 01:05:19,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:05:19,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:05:19,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:05:19,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:05:19,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:05:19,403 INFO L87 Difference]: Start difference. First operand 3661 states and 6277 transitions. Second operand has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:05:20,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:05:20,765 INFO L93 Difference]: Finished difference Result 7832 states and 12656 transitions. [2024-11-07 01:05:20,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-07 01:05:20,766 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 91 [2024-11-07 01:05:20,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:05:20,782 INFO L225 Difference]: With dead ends: 7832 [2024-11-07 01:05:20,783 INFO L226 Difference]: Without dead ends: 6304 [2024-11-07 01:05:20,785 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-11-07 01:05:20,786 INFO L432 NwaCegarLoop]: 4249 mSDtfsCounter, 4788 mSDsluCounter, 16800 mSDsCounter, 0 mSdLazyCounter, 1448 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4804 SdHoareTripleChecker+Valid, 21049 SdHoareTripleChecker+Invalid, 1502 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 1448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-07 01:05:20,786 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4804 Valid, 21049 Invalid, 1502 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 1448 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-07 01:05:20,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6304 states. [2024-11-07 01:05:20,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6304 to 4993. [2024-11-07 01:05:20,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4993 states, 4653 states have (on average 1.6711798839458414) internal successors, (7776), 4672 states have internal predecessors, (7776), 220 states have call successors, (220), 103 states have call predecessors, (220), 118 states have return successors, (315), 233 states have call predecessors, (315), 218 states have call successors, (315) [2024-11-07 01:05:20,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4993 states to 4993 states and 8311 transitions. [2024-11-07 01:05:20,957 INFO L78 Accepts]: Start accepts. Automaton has 4993 states and 8311 transitions. Word has length 91 [2024-11-07 01:05:20,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:05:20,958 INFO L471 AbstractCegarLoop]: Abstraction has 4993 states and 8311 transitions. [2024-11-07 01:05:20,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:05:20,958 INFO L276 IsEmpty]: Start isEmpty. Operand 4993 states and 8311 transitions. [2024-11-07 01:05:20,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-07 01:05:20,962 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:05:20,962 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:05:20,962 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 01:05:20,963 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:05:20,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:05:20,963 INFO L85 PathProgramCache]: Analyzing trace with hash 899072521, now seen corresponding path program 1 times [2024-11-07 01:05:20,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:05:20,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859849439] [2024-11-07 01:05:20,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:05:20,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:05:20,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:05:21,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:05:21,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:05:21,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-07 01:05:21,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:05:21,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 01:05:21,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:05:21,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 01:05:21,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:05:21,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 01:05:21,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:05:21,086 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:05:21,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:05:21,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859849439] [2024-11-07 01:05:21,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859849439] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:05:21,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:05:21,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:05:21,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131120951] [2024-11-07 01:05:21,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:05:21,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:05:21,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:05:21,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:05:21,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:05:21,087 INFO L87 Difference]: Start difference. First operand 4993 states and 8311 transitions. Second operand has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:05:22,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:05:22,602 INFO L93 Difference]: Finished difference Result 12790 states and 20272 transitions. [2024-11-07 01:05:22,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-07 01:05:22,603 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 91 [2024-11-07 01:05:22,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:05:22,636 INFO L225 Difference]: With dead ends: 12790 [2024-11-07 01:05:22,636 INFO L226 Difference]: Without dead ends: 9930 [2024-11-07 01:05:22,658 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-11-07 01:05:22,659 INFO L432 NwaCegarLoop]: 4248 mSDtfsCounter, 4645 mSDsluCounter, 16797 mSDsCounter, 0 mSdLazyCounter, 1683 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4655 SdHoareTripleChecker+Valid, 21045 SdHoareTripleChecker+Invalid, 1736 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 1683 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-07 01:05:22,659 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4655 Valid, 21045 Invalid, 1736 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 1683 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-07 01:05:22,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9930 states. [2024-11-07 01:05:23,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9930 to 7486. [2024-11-07 01:05:23,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7486 states, 6850 states have (on average 1.6131386861313868) internal successors, (11050), 6885 states have internal predecessors, (11050), 404 states have call successors, (404), 199 states have call predecessors, (404), 230 states have return successors, (677), 433 states have call predecessors, (677), 402 states have call successors, (677) [2024-11-07 01:05:23,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7486 states to 7486 states and 12131 transitions. [2024-11-07 01:05:23,092 INFO L78 Accepts]: Start accepts. Automaton has 7486 states and 12131 transitions. Word has length 91 [2024-11-07 01:05:23,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:05:23,092 INFO L471 AbstractCegarLoop]: Abstraction has 7486 states and 12131 transitions. [2024-11-07 01:05:23,092 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:05:23,092 INFO L276 IsEmpty]: Start isEmpty. Operand 7486 states and 12131 transitions. [2024-11-07 01:05:23,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-07 01:05:23,098 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:05:23,098 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:05:23,098 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 01:05:23,098 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:05:23,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:05:23,099 INFO L85 PathProgramCache]: Analyzing trace with hash -1487436985, now seen corresponding path program 1 times [2024-11-07 01:05:23,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:05:23,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923227901] [2024-11-07 01:05:23,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:05:23,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:05:23,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:05:23,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:05:23,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:05:23,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-07 01:05:23,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:05:23,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 01:05:23,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:05:23,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 01:05:23,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:05:23,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 01:05:23,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:05:23,227 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:05:23,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:05:23,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923227901] [2024-11-07 01:05:23,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1923227901] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:05:23,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:05:23,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:05:23,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018397587] [2024-11-07 01:05:23,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:05:23,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:05:23,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:05:23,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:05:23,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:05:23,228 INFO L87 Difference]: Start difference. First operand 7486 states and 12131 transitions. Second operand has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:05:24,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:05:24,776 INFO L93 Difference]: Finished difference Result 21929 states and 34366 transitions. [2024-11-07 01:05:24,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-07 01:05:24,776 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 91 [2024-11-07 01:05:24,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:05:24,813 INFO L225 Difference]: With dead ends: 21929 [2024-11-07 01:05:24,813 INFO L226 Difference]: Without dead ends: 16576 [2024-11-07 01:05:24,822 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-11-07 01:05:24,822 INFO L432 NwaCegarLoop]: 4249 mSDtfsCounter, 4708 mSDsluCounter, 16800 mSDsCounter, 0 mSdLazyCounter, 1422 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4724 SdHoareTripleChecker+Valid, 21049 SdHoareTripleChecker+Invalid, 1476 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 1422 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-07 01:05:24,823 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4724 Valid, 21049 Invalid, 1476 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 1422 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-07 01:05:24,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16576 states. [2024-11-07 01:05:25,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16576 to 12615. [2024-11-07 01:05:25,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12615 states, 11403 states have (on average 1.5697623432430061) internal successors, (17900), 11470 states have internal predecessors, (17900), 756 states have call successors, (756), 391 states have call predecessors, (756), 454 states have return successors, (1547), 817 states have call predecessors, (1547), 754 states have call successors, (1547) [2024-11-07 01:05:25,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12615 states to 12615 states and 20203 transitions. [2024-11-07 01:05:25,222 INFO L78 Accepts]: Start accepts. Automaton has 12615 states and 20203 transitions. Word has length 91 [2024-11-07 01:05:25,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:05:25,222 INFO L471 AbstractCegarLoop]: Abstraction has 12615 states and 20203 transitions. [2024-11-07 01:05:25,223 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:05:25,223 INFO L276 IsEmpty]: Start isEmpty. Operand 12615 states and 20203 transitions. [2024-11-07 01:05:25,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-07 01:05:25,230 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:05:25,230 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:05:25,230 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-07 01:05:25,230 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:05:25,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:05:25,231 INFO L85 PathProgramCache]: Analyzing trace with hash -1980063159, now seen corresponding path program 1 times [2024-11-07 01:05:25,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:05:25,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686666671] [2024-11-07 01:05:25,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:05:25,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:05:25,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:05:25,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:05:25,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:05:25,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-07 01:05:25,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:05:25,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 01:05:25,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:05:25,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 01:05:25,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:05:25,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 01:05:25,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:05:25,362 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:05:25,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:05:25,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686666671] [2024-11-07 01:05:25,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [686666671] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:05:25,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:05:25,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:05:25,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697194579] [2024-11-07 01:05:25,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:05:25,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:05:25,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:05:25,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:05:25,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:05:25,363 INFO L87 Difference]: Start difference. First operand 12615 states and 20203 transitions. Second operand has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:05:27,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:05:27,471 INFO L93 Difference]: Finished difference Result 40064 states and 63092 transitions. [2024-11-07 01:05:27,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-07 01:05:27,471 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 91 [2024-11-07 01:05:27,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:05:27,550 INFO L225 Difference]: With dead ends: 40064 [2024-11-07 01:05:27,550 INFO L226 Difference]: Without dead ends: 29582 [2024-11-07 01:05:27,574 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:05:27,575 INFO L432 NwaCegarLoop]: 4249 mSDtfsCounter, 4668 mSDsluCounter, 16800 mSDsCounter, 0 mSdLazyCounter, 1409 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4684 SdHoareTripleChecker+Valid, 21049 SdHoareTripleChecker+Invalid, 1463 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 1409 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-07 01:05:27,575 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4684 Valid, 21049 Invalid, 1463 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 1409 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-07 01:05:27,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29582 states. [2024-11-07 01:05:28,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29582 to 22840. [2024-11-07 01:05:28,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22840 states, 20508 states have (on average 1.5423249463623951) internal successors, (31630), 20639 states have internal predecessors, (31630), 1428 states have call successors, (1428), 775 states have call predecessors, (1428), 902 states have return successors, (3741), 1553 states have call predecessors, (3741), 1426 states have call successors, (3741) [2024-11-07 01:05:28,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22840 states to 22840 states and 36799 transitions. [2024-11-07 01:05:28,808 INFO L78 Accepts]: Start accepts. Automaton has 22840 states and 36799 transitions. Word has length 91 [2024-11-07 01:05:28,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:05:28,808 INFO L471 AbstractCegarLoop]: Abstraction has 22840 states and 36799 transitions. [2024-11-07 01:05:28,808 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:05:28,808 INFO L276 IsEmpty]: Start isEmpty. Operand 22840 states and 36799 transitions. [2024-11-07 01:05:28,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-07 01:05:28,823 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:05:28,823 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:05:28,823 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-07 01:05:28,824 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:05:28,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:05:28,824 INFO L85 PathProgramCache]: Analyzing trace with hash -1026123001, now seen corresponding path program 1 times [2024-11-07 01:05:28,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:05:28,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850878616] [2024-11-07 01:05:28,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:05:28,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:05:28,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:05:28,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:05:28,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:05:28,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-07 01:05:28,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:05:28,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 01:05:28,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:05:28,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 01:05:28,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:05:28,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 01:05:28,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:05:28,960 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:05:28,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:05:28,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850878616] [2024-11-07 01:05:28,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850878616] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:05:28,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:05:28,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:05:28,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387006767] [2024-11-07 01:05:28,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:05:28,960 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:05:28,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:05:28,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:05:28,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:05:28,961 INFO L87 Difference]: Start difference. First operand 22840 states and 36799 transitions. Second operand has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:05:32,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:05:32,014 INFO L93 Difference]: Finished difference Result 75079 states and 120530 transitions. [2024-11-07 01:05:32,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-07 01:05:32,014 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 91 [2024-11-07 01:05:32,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:05:32,158 INFO L225 Difference]: With dead ends: 75079 [2024-11-07 01:05:32,158 INFO L226 Difference]: Without dead ends: 54372 [2024-11-07 01:05:32,208 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:05:32,209 INFO L432 NwaCegarLoop]: 4238 mSDtfsCounter, 4610 mSDsluCounter, 16785 mSDsCounter, 0 mSdLazyCounter, 1466 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4620 SdHoareTripleChecker+Valid, 21023 SdHoareTripleChecker+Invalid, 1526 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 1466 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-07 01:05:32,210 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4620 Valid, 21023 Invalid, 1526 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 1466 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-07 01:05:32,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54372 states. [2024-11-07 01:05:34,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54372 to 43201. [2024-11-07 01:05:34,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43201 states, 38709 states have (on average 1.5279134051512568) internal successors, (59144), 38968 states have internal predecessors, (59144), 2700 states have call successors, (2700), 1535 states have call predecessors, (2700), 1790 states have return successors, (9515), 2953 states have call predecessors, (9515), 2698 states have call successors, (9515) [2024-11-07 01:05:34,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43201 states to 43201 states and 71359 transitions. [2024-11-07 01:05:34,836 INFO L78 Accepts]: Start accepts. Automaton has 43201 states and 71359 transitions. Word has length 91 [2024-11-07 01:05:34,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:05:34,837 INFO L471 AbstractCegarLoop]: Abstraction has 43201 states and 71359 transitions. [2024-11-07 01:05:34,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:05:34,837 INFO L276 IsEmpty]: Start isEmpty. Operand 43201 states and 71359 transitions. [2024-11-07 01:05:34,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-07 01:05:34,866 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:05:34,866 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:05:34,866 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-07 01:05:34,866 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:05:34,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:05:34,867 INFO L85 PathProgramCache]: Analyzing trace with hash 2052690569, now seen corresponding path program 1 times [2024-11-07 01:05:34,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:05:34,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839514405] [2024-11-07 01:05:34,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:05:34,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:05:34,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:05:34,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:05:34,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:05:34,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-07 01:05:34,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:05:34,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 01:05:34,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:05:34,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 01:05:34,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:05:34,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 01:05:34,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:05:34,971 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:05:34,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:05:34,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839514405] [2024-11-07 01:05:34,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839514405] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:05:34,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:05:34,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 01:05:34,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454015083] [2024-11-07 01:05:34,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:05:34,972 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 01:05:34,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:05:34,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 01:05:34,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 01:05:34,972 INFO L87 Difference]: Start difference. First operand 43201 states and 71359 transitions. Second operand has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:05:39,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:05:39,218 INFO L93 Difference]: Finished difference Result 117999 states and 191198 transitions. [2024-11-07 01:05:39,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 01:05:39,218 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 91 [2024-11-07 01:05:39,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:05:39,482 INFO L225 Difference]: With dead ends: 117999 [2024-11-07 01:05:39,482 INFO L226 Difference]: Without dead ends: 76932 [2024-11-07 01:05:39,575 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2024-11-07 01:05:39,576 INFO L432 NwaCegarLoop]: 4276 mSDtfsCounter, 4816 mSDsluCounter, 12469 mSDsCounter, 0 mSdLazyCounter, 1242 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4845 SdHoareTripleChecker+Valid, 16745 SdHoareTripleChecker+Invalid, 1321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 1242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-07 01:05:39,576 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4845 Valid, 16745 Invalid, 1321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 1242 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-07 01:05:39,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76932 states. [2024-11-07 01:05:42,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76932 to 63237. [2024-11-07 01:05:42,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63237 states, 56421 states have (on average 1.5080555112458127) internal successors, (85086), 56937 states have internal predecessors, (85086), 4122 states have call successors, (4122), 2309 states have call predecessors, (4122), 2692 states have return successors, (13125), 4246 states have call predecessors, (13125), 4120 states have call successors, (13125) [2024-11-07 01:05:42,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63237 states to 63237 states and 102333 transitions. [2024-11-07 01:05:42,344 INFO L78 Accepts]: Start accepts. Automaton has 63237 states and 102333 transitions. Word has length 91 [2024-11-07 01:05:42,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:05:42,344 INFO L471 AbstractCegarLoop]: Abstraction has 63237 states and 102333 transitions. [2024-11-07 01:05:42,344 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:05:42,345 INFO L276 IsEmpty]: Start isEmpty. Operand 63237 states and 102333 transitions. [2024-11-07 01:05:42,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-07 01:05:42,465 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:05:42,466 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1] [2024-11-07 01:05:42,466 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-07 01:05:42,466 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:05:42,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:05:42,466 INFO L85 PathProgramCache]: Analyzing trace with hash -1980373666, now seen corresponding path program 1 times [2024-11-07 01:05:42,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:05:42,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958965884] [2024-11-07 01:05:42,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:05:42,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:05:42,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:05:42,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:05:42,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:05:42,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-07 01:05:42,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:05:42,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 01:05:42,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:05:42,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 01:05:42,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:05:42,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 01:05:42,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:05:42,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 01:05:42,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:05:42,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-07 01:05:42,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:05:42,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-07 01:05:42,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:05:42,659 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-07 01:05:42,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:05:42,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958965884] [2024-11-07 01:05:42,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [958965884] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 01:05:42,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1411653719] [2024-11-07 01:05:42,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:05:42,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 01:05:42,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 01:05:42,661 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:05:42,669 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:05:42,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:05:42,788 INFO L255 TraceCheckSpWp]: Trace formula consists of 573 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-07 01:05:42,797 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 01:05:42,864 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-07 01:05:42,867 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 01:05:42,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1411653719] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:05:42,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 01:05:42,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [7] total 8 [2024-11-07 01:05:42,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981316603] [2024-11-07 01:05:42,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:05:42,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 01:05:42,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:05:42,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 01:05:42,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-07 01:05:42,868 INFO L87 Difference]: Start difference. First operand 63237 states and 102333 transitions. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 2 states have internal predecessors, (105), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-07 01:05:48,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:05:48,195 INFO L93 Difference]: Finished difference Result 184064 states and 298427 transitions. [2024-11-07 01:05:48,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 01:05:48,195 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 2 states have internal predecessors, (105), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 148 [2024-11-07 01:05:48,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:05:48,688 INFO L225 Difference]: With dead ends: 184064 [2024-11-07 01:05:48,688 INFO L226 Difference]: Without dead ends: 122961 [2024-11-07 01:05:48,859 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-07 01:05:48,859 INFO L432 NwaCegarLoop]: 4237 mSDtfsCounter, 4190 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4190 SdHoareTripleChecker+Valid, 4491 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 01:05:48,859 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4190 Valid, 4491 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 01:05:48,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122961 states. [2024-11-07 01:05:53,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122961 to 122185. [2024-11-07 01:05:54,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122185 states, 108771 states have (on average 1.4994897537027332) internal successors, (163101), 109800 states have internal predecessors, (163101), 8036 states have call successors, (8036), 4609 states have call predecessors, (8036), 5376 states have return successors, (25789), 8031 states have call predecessors, (25789), 8034 states have call successors, (25789) [2024-11-07 01:05:54,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122185 states to 122185 states and 196926 transitions. [2024-11-07 01:05:54,433 INFO L78 Accepts]: Start accepts. Automaton has 122185 states and 196926 transitions. Word has length 148 [2024-11-07 01:05:54,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:05:54,433 INFO L471 AbstractCegarLoop]: Abstraction has 122185 states and 196926 transitions. [2024-11-07 01:05:54,433 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 2 states have internal predecessors, (105), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-07 01:05:54,433 INFO L276 IsEmpty]: Start isEmpty. Operand 122185 states and 196926 transitions. [2024-11-07 01:05:54,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-07 01:05:54,702 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:05:54,702 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1] [2024-11-07 01:05:54,716 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:05:54,903 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:05:54,903 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:05:54,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:05:54,904 INFO L85 PathProgramCache]: Analyzing trace with hash -1884414594, now seen corresponding path program 1 times [2024-11-07 01:05:54,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:05:54,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943034477] [2024-11-07 01:05:54,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:05:54,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:05:54,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:05:54,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:05:54,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:05:55,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-07 01:05:55,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:05:55,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 01:05:55,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:05:55,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 01:05:55,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:05:55,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 01:05:55,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:05:55,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 01:05:55,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:05:55,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-07 01:05:55,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:05:55,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-07 01:05:55,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:05:55,097 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-07 01:05:55,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:05:55,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943034477] [2024-11-07 01:05:55,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943034477] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 01:05:55,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [478874228] [2024-11-07 01:05:55,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:05:55,098 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 01:05:55,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 01:05:55,100 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 01:05:55,103 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-07 01:05:55,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:05:55,202 INFO L255 TraceCheckSpWp]: Trace formula consists of 567 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-07 01:05:55,204 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 01:05:55,263 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-07 01:05:55,263 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 01:05:55,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [478874228] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:05:55,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 01:05:55,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [7] total 8 [2024-11-07 01:05:55,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135692762] [2024-11-07 01:05:55,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:05:55,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 01:05:55,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:05:55,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 01:05:55,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-07 01:05:55,265 INFO L87 Difference]: Start difference. First operand 122185 states and 196926 transitions. Second operand has 3 states, 3 states have (on average 37.0) internal successors, (111), 2 states have internal predecessors, (111), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7)