./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/Problem05_label41+token_ring.04.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4f9af400 extending candidate: java ['java'] extending candidate: /usr/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/oracle-jdk-bin-*/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/openjdk-*/bin/java ['java', '/usr/bin/java'] extending candidate: /usr/lib/jvm/java-*-openjdk-amd64/bin/java ['java', '/usr/bin/java', '/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java', '/usr/lib/jvm/java-17-openjdk-amd64/bin/java', '/usr/lib/jvm/java-11-openjdk-amd64/bin/java', '/usr/lib/jvm/java-1.17.0-openjdk-amd64/bin/java'] ['/root/.sdkman/candidates/java/21.0.5-tem/bin/java', '-Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config', '-Xmx15G', '-Xms4m', '-jar', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar', '-data', '@noDefault', '-ultimatedata', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data', '-tc', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml', '-i', '../sv-benchmarks/c/combinations/Problem05_label41+token_ring.04.cil-1.c', '-s', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf', '--cacsl2boogietranslator.entry.function', 'main', '--witnessprinter.witness.directory', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux', '--witnessprinter.witness.filename', 'witness', '--witnessprinter.write.witness.besides.input.file', 'false', '--witnessprinter.graph.data.specification', 'CHECK( init(main()), LTL(G ! call(reach_error())) )\n\n', '--witnessprinter.graph.data.producer', 'Automizer', '--witnessprinter.graph.data.architecture', '32bit', '--witnessprinter.graph.data.programhash', 'b18a76c867b23fc238210d30f7146aaa10cc52d26bc0f62c42cd3676dc575e59'] 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_label41+token_ring.04.cil-1.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b18a76c867b23fc238210d30f7146aaa10cc52d26bc0f62c42cd3676dc575e59 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 00:55:29,320 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 00:55:29,394 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-07 00:55:29,401 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 00:55:29,402 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 00:55:29,429 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 00:55:29,430 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 00:55:29,430 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 00:55:29,431 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 00:55:29,431 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 00:55:29,431 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 00:55:29,431 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 00:55:29,431 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 00:55:29,431 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 00:55:29,431 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 00:55:29,432 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 00:55:29,432 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 00:55:29,432 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 00:55:29,432 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 00:55:29,432 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 00:55:29,432 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 00:55:29,432 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 00:55:29,432 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 00:55:29,432 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 00:55:29,432 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 00:55:29,432 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 00:55:29,432 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 00:55:29,433 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 00:55:29,433 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 00:55:29,433 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 00:55:29,433 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 00:55:29,433 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 00:55:29,433 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 00:55:29,433 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 00:55:29,433 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 00:55:29,433 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 00:55:29,433 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 00:55:29,433 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 00:55:29,433 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 00:55:29,433 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 00:55:29,434 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 00:55:29,434 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 00:55:29,434 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 -> b18a76c867b23fc238210d30f7146aaa10cc52d26bc0f62c42cd3676dc575e59 [2024-11-07 00:55:29,723 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 00:55:29,734 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 00:55:29,736 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 00:55:29,737 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 00:55:29,737 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 00:55:29,738 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/Problem05_label41+token_ring.04.cil-1.c [2024-11-07 00:55:31,016 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 00:55:31,795 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 00:55:31,797 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label41+token_ring.04.cil-1.c [2024-11-07 00:55:31,853 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0a023d32b/47f06731657b4d81b09388de81674b3a/FLAG65fa97115 [2024-11-07 00:55:31,872 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0a023d32b/47f06731657b4d81b09388de81674b3a [2024-11-07 00:55:31,875 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 00:55:31,877 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 00:55:31,879 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 00:55:31,879 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 00:55:31,883 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 00:55:31,885 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:55:31" (1/1) ... [2024-11-07 00:55:31,885 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17c209e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:55:31, skipping insertion in model container [2024-11-07 00:55:31,886 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:55:31" (1/1) ... [2024-11-07 00:55:32,059 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 00:55:33,250 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_label41+token_ring.04.cil-1.c[376251,376264] [2024-11-07 00:55:33,281 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_label41+token_ring.04.cil-1.c[383339,383352] [2024-11-07 00:55:33,453 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 00:55:33,464 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 00:55:34,156 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_label41+token_ring.04.cil-1.c[376251,376264] [2024-11-07 00:55:34,167 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_label41+token_ring.04.cil-1.c[383339,383352] [2024-11-07 00:55:34,184 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 00:55:34,235 INFO L204 MainTranslator]: Completed translation [2024-11-07 00:55:34,236 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:55:34 WrapperNode [2024-11-07 00:55:34,236 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 00:55:34,237 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 00:55:34,238 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 00:55:34,238 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 00:55:34,243 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:55:34" (1/1) ... [2024-11-07 00:55:34,334 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:55:34" (1/1) ... [2024-11-07 00:55:34,731 INFO L138 Inliner]: procedures = 52, calls = 53, calls flagged for inlining = 30, calls inlined = 30, statements flattened = 12753 [2024-11-07 00:55:34,733 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 00:55:34,735 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 00:55:34,735 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 00:55:34,735 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 00:55:34,744 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:55:34" (1/1) ... [2024-11-07 00:55:34,744 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:55:34" (1/1) ... [2024-11-07 00:55:34,785 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:55:34" (1/1) ... [2024-11-07 00:55:34,912 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 00:55:34,913 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:55:34" (1/1) ... [2024-11-07 00:55:34,913 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:55:34" (1/1) ... [2024-11-07 00:55:35,102 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:55:34" (1/1) ... [2024-11-07 00:55:35,237 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:55:34" (1/1) ... [2024-11-07 00:55:35,271 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:55:34" (1/1) ... [2024-11-07 00:55:35,350 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:55:34" (1/1) ... [2024-11-07 00:55:35,427 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 00:55:35,430 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 00:55:35,430 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 00:55:35,431 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 00:55:35,432 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:55:34" (1/1) ... [2024-11-07 00:55:35,440 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 00:55:35,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 00:55:35,466 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 00:55:35,471 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 00:55:35,496 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 00:55:35,496 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2024-11-07 00:55:35,496 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2024-11-07 00:55:35,496 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-11-07 00:55:35,496 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-11-07 00:55:35,496 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2024-11-07 00:55:35,497 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2024-11-07 00:55:35,497 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2024-11-07 00:55:35,497 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2024-11-07 00:55:35,497 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2024-11-07 00:55:35,497 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2024-11-07 00:55:35,497 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2024-11-07 00:55:35,497 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2024-11-07 00:55:35,498 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 00:55:35,498 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 00:55:35,498 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 00:55:35,620 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 00:55:35,621 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 00:55:43,250 INFO L? ?]: Removed 1707 outVars from TransFormulas that were not future-live. [2024-11-07 00:55:43,251 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 00:55:43,311 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 00:55:43,311 INFO L316 CfgBuilder]: Removed 8 assume(true) statements. [2024-11-07 00:55:43,312 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:55:43 BoogieIcfgContainer [2024-11-07 00:55:43,314 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 00:55:43,318 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 00:55:43,318 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 00:55:43,322 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 00:55:43,323 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 12:55:31" (1/3) ... [2024-11-07 00:55:43,324 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48aa6e87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:55:43, skipping insertion in model container [2024-11-07 00:55:43,324 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:55:34" (2/3) ... [2024-11-07 00:55:43,324 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48aa6e87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:55:43, skipping insertion in model container [2024-11-07 00:55:43,324 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:55:43" (3/3) ... [2024-11-07 00:55:43,325 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem05_label41+token_ring.04.cil-1.c [2024-11-07 00:55:43,338 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 00:55:43,338 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-07 00:55:43,443 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 00:55:43,454 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;@1d9ea9ba, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 00:55:43,455 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-07 00:55:43,469 INFO L276 IsEmpty]: Start isEmpty. Operand has 2370 states, 2343 states have (on average 1.8523260776781905) internal successors, (4340), 2346 states have internal predecessors, (4340), 18 states have call successors, (18), 6 states have call predecessors, (18), 6 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-07 00:55:43,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-07 00:55:43,478 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:55:43,479 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] [2024-11-07 00:55:43,479 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:55:43,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:55:43,482 INFO L85 PathProgramCache]: Analyzing trace with hash -1995785756, now seen corresponding path program 1 times [2024-11-07 00:55:43,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:55:43,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919104332] [2024-11-07 00:55:43,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:55:43,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:55:43,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:55:43,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 00:55:43,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:55:43,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-07 00:55:43,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:55:43,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 00:55:43,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:55:43,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 00:55:43,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:55:43,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 00:55:43,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:55:43,916 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 00:55:43,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:55:43,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919104332] [2024-11-07 00:55:43,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919104332] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:55:43,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:55:43,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 00:55:43,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549633241] [2024-11-07 00:55:43,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:55:43,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 00:55:43,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:55:43,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 00:55:43,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 00:55:43,948 INFO L87 Difference]: Start difference. First operand has 2370 states, 2343 states have (on average 1.8523260776781905) internal successors, (4340), 2346 states have internal predecessors, (4340), 18 states have call successors, (18), 6 states have call predecessors, (18), 6 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) 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, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 00:55:44,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:55:44,921 INFO L93 Difference]: Finished difference Result 4788 states and 8834 transitions. [2024-11-07 00:55:44,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 00:55:44,923 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, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 90 [2024-11-07 00:55:44,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:55:44,955 INFO L225 Difference]: With dead ends: 4788 [2024-11-07 00:55:44,955 INFO L226 Difference]: Without dead ends: 2357 [2024-11-07 00:55:44,967 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 00:55:44,972 INFO L432 NwaCegarLoop]: 4199 mSDtfsCounter, 443 mSDsluCounter, 12267 mSDsCounter, 0 mSdLazyCounter, 420 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 459 SdHoareTripleChecker+Valid, 16466 SdHoareTripleChecker+Invalid, 460 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 420 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-07 00:55:44,972 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [459 Valid, 16466 Invalid, 460 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [40 Valid, 420 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-07 00:55:44,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2357 states. [2024-11-07 00:55:45,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2357 to 2303. [2024-11-07 00:55:45,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2303 states, 2277 states have (on average 1.8414580588493632) internal successors, (4193), 2279 states have internal predecessors, (4193), 18 states have call successors, (18), 6 states have call predecessors, (18), 6 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-07 00:55:45,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2303 states to 2303 states and 4229 transitions. [2024-11-07 00:55:45,153 INFO L78 Accepts]: Start accepts. Automaton has 2303 states and 4229 transitions. Word has length 90 [2024-11-07 00:55:45,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:55:45,154 INFO L471 AbstractCegarLoop]: Abstraction has 2303 states and 4229 transitions. [2024-11-07 00:55:45,154 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, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 00:55:45,155 INFO L276 IsEmpty]: Start isEmpty. Operand 2303 states and 4229 transitions. [2024-11-07 00:55:45,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-07 00:55:45,160 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:55:45,160 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] [2024-11-07 00:55:45,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 00:55:45,161 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:55:45,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:55:45,162 INFO L85 PathProgramCache]: Analyzing trace with hash -937947678, now seen corresponding path program 1 times [2024-11-07 00:55:45,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:55:45,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481427779] [2024-11-07 00:55:45,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:55:45,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:55:45,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:55:45,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 00:55:45,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:55:45,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-07 00:55:45,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:55:45,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 00:55:45,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:55:45,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 00:55:45,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:55:45,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 00:55:45,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:55:45,481 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 00:55:45,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:55:45,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481427779] [2024-11-07 00:55:45,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481427779] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:55:45,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:55:45,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 00:55:45,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42461997] [2024-11-07 00:55:45,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:55:45,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 00:55:45,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:55:45,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 00:55:45,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 00:55:45,485 INFO L87 Difference]: Start difference. First operand 2303 states and 4229 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 00:55:46,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:55:46,737 INFO L93 Difference]: Finished difference Result 2753 states and 4926 transitions. [2024-11-07 00:55:46,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 00:55:46,737 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 90 [2024-11-07 00:55:46,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:55:46,752 INFO L225 Difference]: With dead ends: 2753 [2024-11-07 00:55:46,752 INFO L226 Difference]: Without dead ends: 2583 [2024-11-07 00:55:46,755 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 00:55:46,756 INFO L432 NwaCegarLoop]: 4116 mSDtfsCounter, 4603 mSDsluCounter, 12334 mSDsCounter, 0 mSdLazyCounter, 921 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4614 SdHoareTripleChecker+Valid, 16450 SdHoareTripleChecker+Invalid, 997 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 921 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-07 00:55:46,756 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4614 Valid, 16450 Invalid, 997 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 921 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-07 00:55:46,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2583 states. [2024-11-07 00:55:46,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2583 to 2476. [2024-11-07 00:55:46,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2476 states, 2430 states have (on average 1.8213991769547324) internal successors, (4426), 2433 states have internal predecessors, (4426), 31 states have call successors, (31), 12 states have call predecessors, (31), 13 states have return successors, (34), 31 states have call predecessors, (34), 31 states have call successors, (34) [2024-11-07 00:55:46,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2476 states to 2476 states and 4491 transitions. [2024-11-07 00:55:46,863 INFO L78 Accepts]: Start accepts. Automaton has 2476 states and 4491 transitions. Word has length 90 [2024-11-07 00:55:46,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:55:46,864 INFO L471 AbstractCegarLoop]: Abstraction has 2476 states and 4491 transitions. [2024-11-07 00:55:46,864 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 00:55:46,864 INFO L276 IsEmpty]: Start isEmpty. Operand 2476 states and 4491 transitions. [2024-11-07 00:55:46,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-07 00:55:46,869 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:55:46,869 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] [2024-11-07 00:55:46,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 00:55:46,869 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:55:46,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:55:46,870 INFO L85 PathProgramCache]: Analyzing trace with hash -2112607130, now seen corresponding path program 1 times [2024-11-07 00:55:46,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:55:46,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119847490] [2024-11-07 00:55:46,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:55:46,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:55:46,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:55:47,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 00:55:47,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:55:47,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-07 00:55:47,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:55:47,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 00:55:47,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:55:47,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 00:55:47,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:55:47,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 00:55:47,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:55:47,140 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 00:55:47,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:55:47,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119847490] [2024-11-07 00:55:47,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119847490] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:55:47,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:55:47,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 00:55:47,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464347395] [2024-11-07 00:55:47,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:55:47,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 00:55:47,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:55:47,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 00:55:47,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 00:55:47,141 INFO L87 Difference]: Start difference. First operand 2476 states and 4491 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 00:55:48,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:55:48,712 INFO L93 Difference]: Finished difference Result 3156 states and 5538 transitions. [2024-11-07 00:55:48,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 00:55:48,713 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 90 [2024-11-07 00:55:48,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:55:48,726 INFO L225 Difference]: With dead ends: 3156 [2024-11-07 00:55:48,726 INFO L226 Difference]: Without dead ends: 2813 [2024-11-07 00:55:48,729 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-07 00:55:48,730 INFO L432 NwaCegarLoop]: 4231 mSDtfsCounter, 4606 mSDsluCounter, 16725 mSDsCounter, 0 mSdLazyCounter, 1479 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4617 SdHoareTripleChecker+Valid, 20956 SdHoareTripleChecker+Invalid, 1524 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 1479 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-07 00:55:48,730 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4617 Valid, 20956 Invalid, 1524 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [45 Valid, 1479 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-07 00:55:48,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2813 states. [2024-11-07 00:55:48,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2813 to 2638. [2024-11-07 00:55:48,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2638 states, 2572 states have (on average 1.802877138413686) internal successors, (4637), 2576 states have internal predecessors, (4637), 44 states have call successors, (44), 18 states have call predecessors, (44), 20 states have return successors, (49), 45 states have call predecessors, (49), 44 states have call successors, (49) [2024-11-07 00:55:48,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2638 states to 2638 states and 4730 transitions. [2024-11-07 00:55:48,893 INFO L78 Accepts]: Start accepts. Automaton has 2638 states and 4730 transitions. Word has length 90 [2024-11-07 00:55:48,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:55:48,894 INFO L471 AbstractCegarLoop]: Abstraction has 2638 states and 4730 transitions. [2024-11-07 00:55:48,894 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 00:55:48,894 INFO L276 IsEmpty]: Start isEmpty. Operand 2638 states and 4730 transitions. [2024-11-07 00:55:48,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-07 00:55:48,896 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:55:48,896 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] [2024-11-07 00:55:48,896 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 00:55:48,897 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:55:48,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:55:48,898 INFO L85 PathProgramCache]: Analyzing trace with hash -1225384284, now seen corresponding path program 1 times [2024-11-07 00:55:48,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:55:48,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528018180] [2024-11-07 00:55:48,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:55:48,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:55:48,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:55:48,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 00:55:48,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:55:49,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-07 00:55:49,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:55:49,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 00:55:49,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:55:49,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 00:55:49,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:55:49,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 00:55:49,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:55:49,084 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 00:55:49,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:55:49,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528018180] [2024-11-07 00:55:49,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528018180] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:55:49,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:55:49,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 00:55:49,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567331630] [2024-11-07 00:55:49,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:55:49,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 00:55:49,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:55:49,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 00:55:49,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 00:55:49,086 INFO L87 Difference]: Start difference. First operand 2638 states and 4730 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 00:55:50,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:55:50,372 INFO L93 Difference]: Finished difference Result 3749 states and 6435 transitions. [2024-11-07 00:55:50,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 00:55:50,373 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 90 [2024-11-07 00:55:50,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:55:50,388 INFO L225 Difference]: With dead ends: 3749 [2024-11-07 00:55:50,389 INFO L226 Difference]: Without dead ends: 3244 [2024-11-07 00:55:50,392 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-07 00:55:50,392 INFO L432 NwaCegarLoop]: 4126 mSDtfsCounter, 4654 mSDsluCounter, 16435 mSDsCounter, 0 mSdLazyCounter, 1251 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4665 SdHoareTripleChecker+Valid, 20561 SdHoareTripleChecker+Invalid, 1318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 1251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-07 00:55:50,392 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4665 Valid, 20561 Invalid, 1318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 1251 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-07 00:55:50,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3244 states. [2024-11-07 00:55:50,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3244 to 2963. [2024-11-07 00:55:50,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2963 states, 2857 states have (on average 1.7710885544277213) internal successors, (5060), 2863 states have internal predecessors, (5060), 70 states have call successors, (70), 30 states have call predecessors, (70), 34 states have return successors, (83), 73 states have call predecessors, (83), 70 states have call successors, (83) [2024-11-07 00:55:50,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2963 states to 2963 states and 5213 transitions. [2024-11-07 00:55:50,493 INFO L78 Accepts]: Start accepts. Automaton has 2963 states and 5213 transitions. Word has length 90 [2024-11-07 00:55:50,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:55:50,493 INFO L471 AbstractCegarLoop]: Abstraction has 2963 states and 5213 transitions. [2024-11-07 00:55:50,493 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 00:55:50,494 INFO L276 IsEmpty]: Start isEmpty. Operand 2963 states and 5213 transitions. [2024-11-07 00:55:50,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-07 00:55:50,495 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:55:50,495 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] [2024-11-07 00:55:50,495 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 00:55:50,496 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:55:50,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:55:50,496 INFO L85 PathProgramCache]: Analyzing trace with hash 1158540454, now seen corresponding path program 1 times [2024-11-07 00:55:50,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:55:50,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055067387] [2024-11-07 00:55:50,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:55:50,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:55:50,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:55:50,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 00:55:50,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:55:50,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-07 00:55:50,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:55:50,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 00:55:50,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:55:50,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 00:55:50,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:55:50,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 00:55:50,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:55:50,688 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 00:55:50,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:55:50,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055067387] [2024-11-07 00:55:50,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2055067387] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:55:50,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:55:50,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 00:55:50,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812938040] [2024-11-07 00:55:50,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:55:50,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 00:55:50,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:55:50,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 00:55:50,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 00:55:50,689 INFO L87 Difference]: Start difference. First operand 2963 states and 5213 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 00:55:51,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:55:51,995 INFO L93 Difference]: Finished difference Result 4894 states and 8162 transitions. [2024-11-07 00:55:51,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 00:55:51,996 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 90 [2024-11-07 00:55:51,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:55:52,011 INFO L225 Difference]: With dead ends: 4894 [2024-11-07 00:55:52,011 INFO L226 Difference]: Without dead ends: 4064 [2024-11-07 00:55:52,015 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 00:55:52,016 INFO L432 NwaCegarLoop]: 4229 mSDtfsCounter, 4604 mSDsluCounter, 16725 mSDsCounter, 0 mSdLazyCounter, 1468 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4615 SdHoareTripleChecker+Valid, 20954 SdHoareTripleChecker+Invalid, 1515 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 1468 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-07 00:55:52,016 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4615 Valid, 20954 Invalid, 1515 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 1468 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-07 00:55:52,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4064 states. [2024-11-07 00:55:52,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4064 to 3614. [2024-11-07 00:55:52,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3614 states, 3428 states have (on average 1.7228704784130688) internal successors, (5906), 3438 states have internal predecessors, (5906), 122 states have call successors, (122), 54 states have call predecessors, (122), 62 states have return successors, (157), 129 states have call predecessors, (157), 122 states have call successors, (157) [2024-11-07 00:55:52,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3614 states to 3614 states and 6185 transitions. [2024-11-07 00:55:52,155 INFO L78 Accepts]: Start accepts. Automaton has 3614 states and 6185 transitions. Word has length 90 [2024-11-07 00:55:52,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:55:52,155 INFO L471 AbstractCegarLoop]: Abstraction has 3614 states and 6185 transitions. [2024-11-07 00:55:52,156 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 00:55:52,156 INFO L276 IsEmpty]: Start isEmpty. Operand 3614 states and 6185 transitions. [2024-11-07 00:55:52,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-07 00:55:52,160 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:55:52,161 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] [2024-11-07 00:55:52,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 00:55:52,161 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:55:52,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:55:52,162 INFO L85 PathProgramCache]: Analyzing trace with hash 1235441252, now seen corresponding path program 1 times [2024-11-07 00:55:52,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:55:52,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320617145] [2024-11-07 00:55:52,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:55:52,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:55:52,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:55:52,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 00:55:52,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:55:52,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-07 00:55:52,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:55:52,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 00:55:52,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:55:52,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 00:55:52,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:55:52,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 00:55:52,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:55:52,338 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 00:55:52,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:55:52,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320617145] [2024-11-07 00:55:52,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1320617145] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:55:52,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:55:52,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 00:55:52,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861443601] [2024-11-07 00:55:52,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:55:52,339 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 00:55:52,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:55:52,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 00:55:52,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 00:55:52,339 INFO L87 Difference]: Start difference. First operand 3614 states and 6185 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 00:55:53,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:55:53,731 INFO L93 Difference]: Finished difference Result 7696 states and 12390 transitions. [2024-11-07 00:55:53,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-07 00:55:53,731 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 90 [2024-11-07 00:55:53,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:55:53,760 INFO L225 Difference]: With dead ends: 7696 [2024-11-07 00:55:53,760 INFO L226 Difference]: Without dead ends: 6215 [2024-11-07 00:55:53,769 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-11-07 00:55:53,770 INFO L432 NwaCegarLoop]: 4227 mSDtfsCounter, 4774 mSDsluCounter, 16717 mSDsCounter, 0 mSdLazyCounter, 1433 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4790 SdHoareTripleChecker+Valid, 20944 SdHoareTripleChecker+Invalid, 1483 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 1433 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:55:53,770 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4790 Valid, 20944 Invalid, 1483 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 1433 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-07 00:55:53,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6215 states. [2024-11-07 00:55:54,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6215 to 4906. [2024-11-07 00:55:54,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4906 states, 4568 states have (on average 1.665061295971979) internal successors, (7606), 4586 states have internal predecessors, (7606), 218 states have call successors, (218), 102 states have call predecessors, (218), 118 states have return successors, (315), 233 states have call predecessors, (315), 218 states have call successors, (315) [2024-11-07 00:55:54,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4906 states to 4906 states and 8139 transitions. [2024-11-07 00:55:54,064 INFO L78 Accepts]: Start accepts. Automaton has 4906 states and 8139 transitions. Word has length 90 [2024-11-07 00:55:54,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:55:54,064 INFO L471 AbstractCegarLoop]: Abstraction has 4906 states and 8139 transitions. [2024-11-07 00:55:54,064 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 00:55:54,065 INFO L276 IsEmpty]: Start isEmpty. Operand 4906 states and 8139 transitions. [2024-11-07 00:55:54,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-07 00:55:54,069 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:55:54,069 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] [2024-11-07 00:55:54,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 00:55:54,069 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:55:54,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:55:54,070 INFO L85 PathProgramCache]: Analyzing trace with hash -1151068254, now seen corresponding path program 1 times [2024-11-07 00:55:54,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:55:54,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865143525] [2024-11-07 00:55:54,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:55:54,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:55:54,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:55:54,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 00:55:54,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:55:54,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-07 00:55:54,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:55:54,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 00:55:54,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:55:54,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 00:55:54,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:55:54,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 00:55:54,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:55:54,220 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 00:55:54,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:55:54,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865143525] [2024-11-07 00:55:54,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865143525] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:55:54,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:55:54,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 00:55:54,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589383766] [2024-11-07 00:55:54,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:55:54,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 00:55:54,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:55:54,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 00:55:54,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 00:55:54,222 INFO L87 Difference]: Start difference. First operand 4906 states and 8139 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 00:55:55,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:55:55,733 INFO L93 Difference]: Finished difference Result 12534 states and 19766 transitions. [2024-11-07 00:55:55,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-07 00:55:55,734 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 90 [2024-11-07 00:55:55,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:55:55,787 INFO L225 Difference]: With dead ends: 12534 [2024-11-07 00:55:55,787 INFO L226 Difference]: Without dead ends: 9761 [2024-11-07 00:55:55,799 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 00:55:55,800 INFO L432 NwaCegarLoop]: 4226 mSDtfsCounter, 4631 mSDsluCounter, 16714 mSDsCounter, 0 mSdLazyCounter, 1668 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4641 SdHoareTripleChecker+Valid, 20940 SdHoareTripleChecker+Invalid, 1717 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 1668 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-07 00:55:55,800 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4641 Valid, 20940 Invalid, 1717 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 1668 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-07 00:55:55,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9761 states. [2024-11-07 00:55:56,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9761 to 7399. [2024-11-07 00:55:56,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7399 states, 6765 states have (on average 1.608277900960828) internal successors, (10880), 6799 states have internal predecessors, (10880), 402 states have call successors, (402), 198 states have call predecessors, (402), 230 states have return successors, (677), 433 states have call predecessors, (677), 402 states have call successors, (677) [2024-11-07 00:55:56,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7399 states to 7399 states and 11959 transitions. [2024-11-07 00:55:56,221 INFO L78 Accepts]: Start accepts. Automaton has 7399 states and 11959 transitions. Word has length 90 [2024-11-07 00:55:56,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:55:56,222 INFO L471 AbstractCegarLoop]: Abstraction has 7399 states and 11959 transitions. [2024-11-07 00:55:56,222 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 00:55:56,222 INFO L276 IsEmpty]: Start isEmpty. Operand 7399 states and 11959 transitions. [2024-11-07 00:55:56,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-07 00:55:56,226 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:55:56,226 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] [2024-11-07 00:55:56,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 00:55:56,227 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:55:56,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:55:56,227 INFO L85 PathProgramCache]: Analyzing trace with hash -1643694428, now seen corresponding path program 1 times [2024-11-07 00:55:56,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:55:56,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727357519] [2024-11-07 00:55:56,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:55:56,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:55:56,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:55:56,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 00:55:56,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:55:56,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-07 00:55:56,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:55:56,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 00:55:56,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:55:56,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 00:55:56,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:55:56,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 00:55:56,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:55:56,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:55:56,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:55:56,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727357519] [2024-11-07 00:55:56,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727357519] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:55:56,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:55:56,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 00:55:56,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247149300] [2024-11-07 00:55:56,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:55:56,375 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 00:55:56,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:55:56,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 00:55:56,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 00:55:56,377 INFO L87 Difference]: Start difference. First operand 7399 states and 11959 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 00:55:57,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:55:57,933 INFO L93 Difference]: Finished difference Result 21673 states and 33860 transitions. [2024-11-07 00:55:57,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-07 00:55:57,934 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 90 [2024-11-07 00:55:57,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:55:57,998 INFO L225 Difference]: With dead ends: 21673 [2024-11-07 00:55:57,998 INFO L226 Difference]: Without dead ends: 16407 [2024-11-07 00:55:58,022 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 00:55:58,023 INFO L432 NwaCegarLoop]: 4227 mSDtfsCounter, 4694 mSDsluCounter, 16717 mSDsCounter, 0 mSdLazyCounter, 1407 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4710 SdHoareTripleChecker+Valid, 20944 SdHoareTripleChecker+Invalid, 1457 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 1407 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-07 00:55:58,023 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4710 Valid, 20944 Invalid, 1457 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 1407 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-07 00:55:58,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16407 states. [2024-11-07 00:55:58,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16407 to 12448. [2024-11-07 00:55:58,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12448 states, 11238 states have (on average 1.5634454529275672) internal successors, (17570), 11304 states have internal predecessors, (17570), 754 states have call successors, (754), 390 states have call predecessors, (754), 454 states have return successors, (1547), 817 states have call predecessors, (1547), 754 states have call successors, (1547) [2024-11-07 00:55:58,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12448 states to 12448 states and 19871 transitions. [2024-11-07 00:55:58,656 INFO L78 Accepts]: Start accepts. Automaton has 12448 states and 19871 transitions. Word has length 90 [2024-11-07 00:55:58,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:55:58,657 INFO L471 AbstractCegarLoop]: Abstraction has 12448 states and 19871 transitions. [2024-11-07 00:55:58,658 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 00:55:58,658 INFO L276 IsEmpty]: Start isEmpty. Operand 12448 states and 19871 transitions. [2024-11-07 00:55:58,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-07 00:55:58,667 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:55:58,667 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] [2024-11-07 00:55:58,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-07 00:55:58,668 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:55:58,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:55:58,668 INFO L85 PathProgramCache]: Analyzing trace with hash -689754270, now seen corresponding path program 1 times [2024-11-07 00:55:58,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:55:58,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679334194] [2024-11-07 00:55:58,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:55:58,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:55:58,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:55:58,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 00:55:58,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:55:58,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-07 00:55:58,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:55:58,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 00:55:58,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:55:58,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 00:55:58,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:55:58,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 00:55:58,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:55:58,809 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 00:55:58,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:55:58,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679334194] [2024-11-07 00:55:58,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679334194] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:55:58,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:55:58,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 00:55:58,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530886654] [2024-11-07 00:55:58,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:55:58,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 00:55:58,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:55:58,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 00:55:58,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 00:55:58,811 INFO L87 Difference]: Start difference. First operand 12448 states and 19871 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 00:56:01,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:56:01,370 INFO L93 Difference]: Finished difference Result 39568 states and 62106 transitions. [2024-11-07 00:56:01,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-07 00:56:01,371 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 90 [2024-11-07 00:56:01,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:56:01,500 INFO L225 Difference]: With dead ends: 39568 [2024-11-07 00:56:01,500 INFO L226 Difference]: Without dead ends: 29253 [2024-11-07 00:56:01,546 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 00:56:01,548 INFO L432 NwaCegarLoop]: 4227 mSDtfsCounter, 4654 mSDsluCounter, 16717 mSDsCounter, 0 mSdLazyCounter, 1394 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4670 SdHoareTripleChecker+Valid, 20944 SdHoareTripleChecker+Invalid, 1444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 1394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:56:01,549 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4670 Valid, 20944 Invalid, 1444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 1394 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-07 00:56:01,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29253 states. [2024-11-07 00:56:02,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29253 to 22513. [2024-11-07 00:56:02,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22513 states, 20183 states have (on average 1.5349551602834068) internal successors, (30980), 20313 states have internal predecessors, (30980), 1426 states have call successors, (1426), 774 states have call predecessors, (1426), 902 states have return successors, (3741), 1553 states have call predecessors, (3741), 1426 states have call successors, (3741) [2024-11-07 00:56:02,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22513 states to 22513 states and 36147 transitions. [2024-11-07 00:56:02,977 INFO L78 Accepts]: Start accepts. Automaton has 22513 states and 36147 transitions. Word has length 90 [2024-11-07 00:56:02,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:56:02,978 INFO L471 AbstractCegarLoop]: Abstraction has 22513 states and 36147 transitions. [2024-11-07 00:56:02,978 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 00:56:02,978 INFO L276 IsEmpty]: Start isEmpty. Operand 22513 states and 36147 transitions. [2024-11-07 00:56:02,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-07 00:56:02,998 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:56:02,998 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] [2024-11-07 00:56:02,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-07 00:56:02,999 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:56:02,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:56:02,999 INFO L85 PathProgramCache]: Analyzing trace with hash -1905907996, now seen corresponding path program 1 times [2024-11-07 00:56:02,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:56:03,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141640624] [2024-11-07 00:56:03,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:56:03,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:56:03,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:56:03,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 00:56:03,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:56:03,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-07 00:56:03,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:56:03,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 00:56:03,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:56:03,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 00:56:03,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:56:03,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 00:56:03,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:56:03,211 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 00:56:03,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:56:03,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141640624] [2024-11-07 00:56:03,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141640624] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:56:03,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:56:03,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 00:56:03,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312705741] [2024-11-07 00:56:03,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:56:03,212 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 00:56:03,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:56:03,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 00:56:03,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 00:56:03,213 INFO L87 Difference]: Start difference. First operand 22513 states and 36147 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 00:56:06,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:56:06,854 INFO L93 Difference]: Finished difference Result 74103 states and 118584 transitions. [2024-11-07 00:56:06,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-07 00:56:06,855 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 90 [2024-11-07 00:56:06,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:56:07,112 INFO L225 Difference]: With dead ends: 74103 [2024-11-07 00:56:07,113 INFO L226 Difference]: Without dead ends: 53723 [2024-11-07 00:56:07,200 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-11-07 00:56:07,203 INFO L432 NwaCegarLoop]: 4216 mSDtfsCounter, 4596 mSDsluCounter, 16702 mSDsCounter, 0 mSdLazyCounter, 1451 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4606 SdHoareTripleChecker+Valid, 20918 SdHoareTripleChecker+Invalid, 1507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 1451 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:56:07,204 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4606 Valid, 20918 Invalid, 1507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 1451 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-07 00:56:07,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53723 states. [2024-11-07 00:56:09,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53723 to 42554. [2024-11-07 00:56:09,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42554 states, 38064 states have (on average 1.519913829340059) internal successors, (57854), 38322 states have internal predecessors, (57854), 2698 states have call successors, (2698), 1534 states have call predecessors, (2698), 1790 states have return successors, (9515), 2953 states have call predecessors, (9515), 2698 states have call successors, (9515) [2024-11-07 00:56:09,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42554 states to 42554 states and 70067 transitions. [2024-11-07 00:56:09,558 INFO L78 Accepts]: Start accepts. Automaton has 42554 states and 70067 transitions. Word has length 90 [2024-11-07 00:56:09,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:56:09,560 INFO L471 AbstractCegarLoop]: Abstraction has 42554 states and 70067 transitions. [2024-11-07 00:56:09,561 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 00:56:09,561 INFO L276 IsEmpty]: Start isEmpty. Operand 42554 states and 70067 transitions. [2024-11-07 00:56:09,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-07 00:56:09,598 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:56:09,598 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] [2024-11-07 00:56:09,598 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-07 00:56:09,598 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:56:09,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:56:09,599 INFO L85 PathProgramCache]: Analyzing trace with hash 1657091874, now seen corresponding path program 1 times [2024-11-07 00:56:09,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:56:09,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981049191] [2024-11-07 00:56:09,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:56:09,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:56:09,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:56:09,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 00:56:09,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:56:09,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-07 00:56:09,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:56:09,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 00:56:09,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:56:09,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 00:56:09,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:56:09,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 00:56:09,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:56:09,716 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 00:56:09,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:56:09,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981049191] [2024-11-07 00:56:09,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [981049191] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:56:09,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:56:09,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 00:56:09,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303409838] [2024-11-07 00:56:09,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:56:09,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 00:56:09,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:56:09,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 00:56:09,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 00:56:09,718 INFO L87 Difference]: Start difference. First operand 42554 states and 70067 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 00:56:14,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:56:14,326 INFO L93 Difference]: Finished difference Result 116705 states and 188614 transitions. [2024-11-07 00:56:14,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 00:56:14,327 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 90 [2024-11-07 00:56:14,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:56:14,742 INFO L225 Difference]: With dead ends: 116705 [2024-11-07 00:56:14,742 INFO L226 Difference]: Without dead ends: 76285 [2024-11-07 00:56:14,916 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2024-11-07 00:56:14,918 INFO L432 NwaCegarLoop]: 4265 mSDtfsCounter, 4802 mSDsluCounter, 12442 mSDsCounter, 0 mSdLazyCounter, 1238 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4831 SdHoareTripleChecker+Valid, 16707 SdHoareTripleChecker+Invalid, 1313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 1238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-07 00:56:14,918 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4831 Valid, 16707 Invalid, 1313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 1238 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-07 00:56:14,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76285 states. [2024-11-07 00:56:18,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76285 to 62590. [2024-11-07 00:56:18,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62590 states, 55776 states have (on average 1.5023666092943202) internal successors, (83796), 56291 states have internal predecessors, (83796), 4120 states have call successors, (4120), 2308 states have call predecessors, (4120), 2692 states have return successors, (13125), 4246 states have call predecessors, (13125), 4120 states have call successors, (13125) [2024-11-07 00:56:18,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62590 states to 62590 states and 101041 transitions. [2024-11-07 00:56:18,708 INFO L78 Accepts]: Start accepts. Automaton has 62590 states and 101041 transitions. Word has length 90 [2024-11-07 00:56:18,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:56:18,708 INFO L471 AbstractCegarLoop]: Abstraction has 62590 states and 101041 transitions. [2024-11-07 00:56:18,709 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 00:56:18,709 INFO L276 IsEmpty]: Start isEmpty. Operand 62590 states and 101041 transitions. [2024-11-07 00:56:18,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-07 00:56:18,876 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:56:18,877 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] [2024-11-07 00:56:18,877 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-07 00:56:18,877 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:56:18,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:56:18,878 INFO L85 PathProgramCache]: Analyzing trace with hash -1759816949, now seen corresponding path program 1 times [2024-11-07 00:56:18,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:56:18,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634475340] [2024-11-07 00:56:18,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:56:18,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:56:18,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:56:18,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 00:56:18,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:56:18,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-07 00:56:18,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:56:18,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 00:56:18,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:56:19,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 00:56:19,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:56:19,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 00:56:19,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:56:19,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 00:56:19,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:56:19,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-07 00:56:19,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:56:19,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-07 00:56:19,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:56:19,109 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 00:56:19,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:56:19,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634475340] [2024-11-07 00:56:19,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1634475340] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 00:56:19,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1851423854] [2024-11-07 00:56:19,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:56:19,109 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 00:56:19,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 00:56:19,113 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 00:56:19,114 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 00:56:19,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:56:19,269 INFO L255 TraceCheckSpWp]: Trace formula consists of 566 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-07 00:56:19,275 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 00:56:19,350 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 00:56:19,350 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 00:56:19,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1851423854] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:56:19,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 00:56:19,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [7] total 8 [2024-11-07 00:56:19,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451164943] [2024-11-07 00:56:19,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:56:19,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 00:56:19,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:56:19,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 00:56:19,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-07 00:56:19,352 INFO L87 Difference]: Start difference. First operand 62590 states and 101041 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, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7)