./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/Problem05_label42+token_ring.05.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4f9af400 extending candidate: java ['java'] extending candidate: /usr/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/oracle-jdk-bin-*/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/openjdk-*/bin/java ['java', '/usr/bin/java'] extending candidate: /usr/lib/jvm/java-*-openjdk-amd64/bin/java ['java', '/usr/bin/java', '/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java', '/usr/lib/jvm/java-17-openjdk-amd64/bin/java', '/usr/lib/jvm/java-11-openjdk-amd64/bin/java', '/usr/lib/jvm/java-1.17.0-openjdk-amd64/bin/java'] ['/root/.sdkman/candidates/java/21.0.5-tem/bin/java', '-Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config', '-Xmx15G', '-Xms4m', '-jar', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar', '-data', '@noDefault', '-ultimatedata', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data', '-tc', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml', '-i', '../sv-benchmarks/c/combinations/Problem05_label42+token_ring.05.cil-1.c', '-s', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf', '--cacsl2boogietranslator.entry.function', 'main', '--witnessprinter.witness.directory', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux', '--witnessprinter.witness.filename', 'witness', '--witnessprinter.write.witness.besides.input.file', 'false', '--witnessprinter.graph.data.specification', 'CHECK( init(main()), LTL(G ! call(reach_error())) )\n\n', '--witnessprinter.graph.data.producer', 'Automizer', '--witnessprinter.graph.data.architecture', '32bit', '--witnessprinter.graph.data.programhash', '241a591afac9616f6eb2efaff376ca7c5ab81b92f8f29d73e0797caec39fd2c8'] 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_label42+token_ring.05.cil-1.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 241a591afac9616f6eb2efaff376ca7c5ab81b92f8f29d73e0797caec39fd2c8 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 00:57:03,429 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 00:57:03,504 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:57:03,509 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 00:57:03,509 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 00:57:03,537 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 00:57:03,538 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 00:57:03,538 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 00:57:03,538 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 00:57:03,538 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 00:57:03,538 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 00:57:03,539 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 00:57:03,539 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 00:57:03,539 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 00:57:03,539 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 00:57:03,539 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 00:57:03,539 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 00:57:03,543 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 00:57:03,543 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 00:57:03,543 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 00:57:03,543 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 00:57:03,543 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 00:57:03,543 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 00:57:03,543 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 00:57:03,543 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 00:57:03,543 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 00:57:03,543 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 00:57:03,543 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 00:57:03,544 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 00:57:03,544 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 00:57:03,544 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 00:57:03,544 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 00:57:03,544 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 00:57:03,544 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 00:57:03,544 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 00:57:03,544 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 00:57:03,544 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 00:57:03,544 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 00:57:03,544 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 00:57:03,544 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 00:57:03,544 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 00:57:03,544 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 00:57:03,544 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 -> 241a591afac9616f6eb2efaff376ca7c5ab81b92f8f29d73e0797caec39fd2c8 [2024-11-07 00:57:03,799 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 00:57:03,812 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 00:57:03,818 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 00:57:03,819 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 00:57:03,820 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 00:57:03,822 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/Problem05_label42+token_ring.05.cil-1.c [2024-11-07 00:57:05,020 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 00:57:05,510 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 00:57:05,511 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label42+token_ring.05.cil-1.c [2024-11-07 00:57:05,556 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1fa787179/62cbc47bc6e246da808eb14e6d34dde9/FLAG5b1f74093 [2024-11-07 00:57:05,592 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1fa787179/62cbc47bc6e246da808eb14e6d34dde9 [2024-11-07 00:57:05,594 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 00:57:05,595 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 00:57:05,597 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 00:57:05,597 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 00:57:05,601 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 00:57:05,601 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:57:05" (1/1) ... [2024-11-07 00:57:05,602 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@229a2ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:57:05, skipping insertion in model container [2024-11-07 00:57:05,602 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:57:05" (1/1) ... [2024-11-07 00:57:05,720 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 00:57:06,661 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_label42+token_ring.05.cil-1.c[378560,378573] [2024-11-07 00:57:06,687 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_label42+token_ring.05.cil-1.c[383339,383352] [2024-11-07 00:57:06,833 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 00:57:06,843 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 00:57:07,391 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_label42+token_ring.05.cil-1.c[378560,378573] [2024-11-07 00:57:07,396 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_label42+token_ring.05.cil-1.c[383339,383352] [2024-11-07 00:57:07,405 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 00:57:07,475 INFO L204 MainTranslator]: Completed translation [2024-11-07 00:57:07,477 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:57:07 WrapperNode [2024-11-07 00:57:07,477 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 00:57:07,478 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 00:57:07,479 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 00:57:07,479 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 00:57:07,484 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:57:07" (1/1) ... [2024-11-07 00:57:07,540 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:57:07" (1/1) ... [2024-11-07 00:57:07,910 INFO L138 Inliner]: procedures = 54, calls = 56, calls flagged for inlining = 32, calls inlined = 32, statements flattened = 12813 [2024-11-07 00:57:07,911 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 00:57:07,912 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 00:57:07,912 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 00:57:07,912 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 00:57:07,919 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:57:07" (1/1) ... [2024-11-07 00:57:07,920 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:57:07" (1/1) ... [2024-11-07 00:57:07,952 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:57:07" (1/1) ... [2024-11-07 00:57:08,093 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:57:08,097 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:57:07" (1/1) ... [2024-11-07 00:57:08,097 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:57:07" (1/1) ... [2024-11-07 00:57:08,346 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:57:07" (1/1) ... [2024-11-07 00:57:08,402 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:57:07" (1/1) ... [2024-11-07 00:57:08,429 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:57:07" (1/1) ... [2024-11-07 00:57:08,453 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:57:07" (1/1) ... [2024-11-07 00:57:08,495 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 00:57:08,497 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 00:57:08,497 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 00:57:08,497 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 00:57:08,499 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:57:07" (1/1) ... [2024-11-07 00:57:08,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 00:57:08,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 00:57:08,522 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:57:08,528 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:57:08,542 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 00:57:08,543 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2024-11-07 00:57:08,543 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2024-11-07 00:57:08,543 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-11-07 00:57:08,543 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-11-07 00:57:08,543 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2024-11-07 00:57:08,543 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2024-11-07 00:57:08,543 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2024-11-07 00:57:08,543 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2024-11-07 00:57:08,543 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2024-11-07 00:57:08,544 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2024-11-07 00:57:08,544 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2024-11-07 00:57:08,544 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2024-11-07 00:57:08,544 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 00:57:08,544 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 00:57:08,544 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 00:57:08,633 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 00:57:08,635 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 00:57:14,547 INFO L? ?]: Removed 1713 outVars from TransFormulas that were not future-live. [2024-11-07 00:57:14,547 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 00:57:14,583 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 00:57:14,584 INFO L316 CfgBuilder]: Removed 9 assume(true) statements. [2024-11-07 00:57:14,584 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:57:14 BoogieIcfgContainer [2024-11-07 00:57:14,584 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 00:57:14,586 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 00:57:14,586 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 00:57:14,590 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 00:57:14,590 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 12:57:05" (1/3) ... [2024-11-07 00:57:14,591 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c9ec7cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:57:14, skipping insertion in model container [2024-11-07 00:57:14,591 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:57:07" (2/3) ... [2024-11-07 00:57:14,591 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c9ec7cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:57:14, skipping insertion in model container [2024-11-07 00:57:14,591 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:57:14" (3/3) ... [2024-11-07 00:57:14,592 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem05_label42+token_ring.05.cil-1.c [2024-11-07 00:57:14,602 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 00:57:14,602 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-07 00:57:14,675 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 00:57:14,686 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;@56a15702, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 00:57:14,686 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-07 00:57:14,699 INFO L276 IsEmpty]: Start isEmpty. Operand has 2396 states, 2368 states have (on average 1.8505067567567568) internal successors, (4382), 2371 states have internal predecessors, (4382), 19 states have call successors, (19), 6 states have call predecessors, (19), 6 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-07 00:57:14,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-07 00:57:14,708 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:57:14,709 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:57:14,710 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:57:14,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:57:14,713 INFO L85 PathProgramCache]: Analyzing trace with hash 1103952823, now seen corresponding path program 1 times [2024-11-07 00:57:14,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:57:14,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270261077] [2024-11-07 00:57:14,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:57:14,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:57:14,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:57:14,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 00:57:14,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:57:14,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 00:57:14,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:57:15,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-07 00:57:15,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:57:15,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-07 00:57:15,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:57:15,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 00:57:15,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:57:15,081 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:57:15,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:57:15,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270261077] [2024-11-07 00:57:15,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270261077] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:57:15,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:57:15,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 00:57:15,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642650509] [2024-11-07 00:57:15,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:57:15,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 00:57:15,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:57:15,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 00:57:15,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 00:57:15,108 INFO L87 Difference]: Start difference. First operand has 2396 states, 2368 states have (on average 1.8505067567567568) internal successors, (4382), 2371 states have internal predecessors, (4382), 19 states have call successors, (19), 6 states have call predecessors, (19), 6 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 5 states, 5 states have (on average 18.2) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 00:57:15,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:57:15,934 INFO L93 Difference]: Finished difference Result 4849 states and 8937 transitions. [2024-11-07 00:57:15,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 00:57:15,936 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 101 [2024-11-07 00:57:15,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:57:15,966 INFO L225 Difference]: With dead ends: 4849 [2024-11-07 00:57:15,967 INFO L226 Difference]: Without dead ends: 2394 [2024-11-07 00:57:15,973 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-07 00:57:15,975 INFO L432 NwaCegarLoop]: 4222 mSDtfsCounter, 517 mSDsluCounter, 12295 mSDsCounter, 0 mSdLazyCounter, 497 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 534 SdHoareTripleChecker+Valid, 16517 SdHoareTripleChecker+Invalid, 539 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 497 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-07 00:57:15,976 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [534 Valid, 16517 Invalid, 539 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [42 Valid, 497 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-07 00:57:15,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2394 states. [2024-11-07 00:57:16,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2394 to 2329. [2024-11-07 00:57:16,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2329 states, 2302 states have (on average 1.8388357949609035) internal successors, (4233), 2304 states have internal predecessors, (4233), 19 states have call successors, (19), 6 states have call predecessors, (19), 6 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-07 00:57:16,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2329 states to 2329 states and 4271 transitions. [2024-11-07 00:57:16,095 INFO L78 Accepts]: Start accepts. Automaton has 2329 states and 4271 transitions. Word has length 101 [2024-11-07 00:57:16,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:57:16,096 INFO L471 AbstractCegarLoop]: Abstraction has 2329 states and 4271 transitions. [2024-11-07 00:57:16,096 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 00:57:16,096 INFO L276 IsEmpty]: Start isEmpty. Operand 2329 states and 4271 transitions. [2024-11-07 00:57:16,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-07 00:57:16,100 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:57:16,100 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:57:16,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 00:57:16,100 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:57:16,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:57:16,101 INFO L85 PathProgramCache]: Analyzing trace with hash -773110407, now seen corresponding path program 1 times [2024-11-07 00:57:16,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:57:16,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69273860] [2024-11-07 00:57:16,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:57:16,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:57:16,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:57:16,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 00:57:16,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:57:16,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 00:57:16,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:57:16,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-07 00:57:16,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:57:16,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-07 00:57:16,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:57:16,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 00:57:16,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:57:16,350 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:57:16,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:57:16,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69273860] [2024-11-07 00:57:16,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [69273860] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:57:16,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:57:16,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 00:57:16,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685461920] [2024-11-07 00:57:16,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:57:16,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 00:57:16,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:57:16,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 00:57:16,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 00:57:16,354 INFO L87 Difference]: Start difference. First operand 2329 states and 4271 transitions. Second operand has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 00:57:17,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:57:17,801 INFO L93 Difference]: Finished difference Result 2853 states and 5090 transitions. [2024-11-07 00:57:17,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 00:57:17,801 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 101 [2024-11-07 00:57:17,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:57:17,814 INFO L225 Difference]: With dead ends: 2853 [2024-11-07 00:57:17,814 INFO L226 Difference]: Without dead ends: 2658 [2024-11-07 00:57:17,816 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:57:17,817 INFO L432 NwaCegarLoop]: 4137 mSDtfsCounter, 4719 mSDsluCounter, 12401 mSDsCounter, 0 mSdLazyCounter, 1089 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4731 SdHoareTripleChecker+Valid, 16538 SdHoareTripleChecker+Invalid, 1169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 1089 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-07 00:57:17,818 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4731 Valid, 16538 Invalid, 1169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 1089 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-07 00:57:17,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2658 states. [2024-11-07 00:57:17,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2658 to 2529. [2024-11-07 00:57:17,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2529 states, 2481 states have (on average 1.8170092704554615) internal successors, (4508), 2484 states have internal predecessors, (4508), 33 states have call successors, (33), 12 states have call predecessors, (33), 13 states have return successors, (36), 33 states have call predecessors, (36), 33 states have call successors, (36) [2024-11-07 00:57:17,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2529 states to 2529 states and 4577 transitions. [2024-11-07 00:57:17,890 INFO L78 Accepts]: Start accepts. Automaton has 2529 states and 4577 transitions. Word has length 101 [2024-11-07 00:57:17,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:57:17,891 INFO L471 AbstractCegarLoop]: Abstraction has 2529 states and 4577 transitions. [2024-11-07 00:57:17,891 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 00:57:17,891 INFO L276 IsEmpty]: Start isEmpty. Operand 2529 states and 4577 transitions. [2024-11-07 00:57:17,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-07 00:57:17,896 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:57:17,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:57:17,896 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 00:57:17,896 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:57:17,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:57:17,897 INFO L85 PathProgramCache]: Analyzing trace with hash 1804972285, now seen corresponding path program 1 times [2024-11-07 00:57:17,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:57:17,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189841837] [2024-11-07 00:57:17,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:57:17,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:57:17,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:57:17,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 00:57:17,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:57:18,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 00:57:18,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:57:18,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-07 00:57:18,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:57:18,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-07 00:57:18,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:57:18,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 00:57:18,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:57:18,076 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:57:18,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:57:18,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189841837] [2024-11-07 00:57:18,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189841837] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:57:18,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:57:18,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 00:57:18,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699313009] [2024-11-07 00:57:18,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:57:18,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 00:57:18,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:57:18,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 00:57:18,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 00:57:18,078 INFO L87 Difference]: Start difference. First operand 2529 states and 4577 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 00:57:19,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:57:19,707 INFO L93 Difference]: Finished difference Result 3323 states and 5813 transitions. [2024-11-07 00:57:19,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 00:57:19,709 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 101 [2024-11-07 00:57:19,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:57:19,720 INFO L225 Difference]: With dead ends: 3323 [2024-11-07 00:57:19,720 INFO L226 Difference]: Without dead ends: 2928 [2024-11-07 00:57:19,722 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:57:19,722 INFO L432 NwaCegarLoop]: 4269 mSDtfsCounter, 4734 mSDsluCounter, 16862 mSDsCounter, 0 mSdLazyCounter, 1742 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4746 SdHoareTripleChecker+Valid, 21131 SdHoareTripleChecker+Invalid, 1789 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 1742 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-07 00:57:19,723 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4746 Valid, 21131 Invalid, 1789 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 1742 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-07 00:57:19,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2928 states. [2024-11-07 00:57:19,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2928 to 2716. [2024-11-07 00:57:19,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2716 states, 2647 states have (on average 1.797128825085002) internal successors, (4757), 2651 states have internal predecessors, (4757), 47 states have call successors, (47), 18 states have call predecessors, (47), 20 states have return successors, (52), 48 states have call predecessors, (52), 47 states have call successors, (52) [2024-11-07 00:57:19,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2716 states to 2716 states and 4856 transitions. [2024-11-07 00:57:19,795 INFO L78 Accepts]: Start accepts. Automaton has 2716 states and 4856 transitions. Word has length 101 [2024-11-07 00:57:19,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:57:19,795 INFO L471 AbstractCegarLoop]: Abstraction has 2716 states and 4856 transitions. [2024-11-07 00:57:19,795 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 00:57:19,796 INFO L276 IsEmpty]: Start isEmpty. Operand 2716 states and 4856 transitions. [2024-11-07 00:57:19,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-07 00:57:19,797 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:57:19,797 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:57:19,797 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 00:57:19,797 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:57:19,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:57:19,798 INFO L85 PathProgramCache]: Analyzing trace with hash -74158661, now seen corresponding path program 1 times [2024-11-07 00:57:19,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:57:19,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649248630] [2024-11-07 00:57:19,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:57:19,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:57:19,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:57:19,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 00:57:19,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:57:19,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 00:57:19,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:57:19,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-07 00:57:19,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:57:19,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-07 00:57:19,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:57:19,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 00:57:19,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:57:19,970 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:57:19,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:57:19,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649248630] [2024-11-07 00:57:19,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [649248630] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:57:19,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:57:19,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 00:57:19,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088661200] [2024-11-07 00:57:19,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:57:19,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 00:57:19,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:57:19,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 00:57:19,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 00:57:19,973 INFO L87 Difference]: Start difference. First operand 2716 states and 4856 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 00:57:21,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:57:21,368 INFO L93 Difference]: Finished difference Result 4014 states and 6872 transitions. [2024-11-07 00:57:21,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 00:57:21,369 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 101 [2024-11-07 00:57:21,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:57:21,379 INFO L225 Difference]: With dead ends: 4014 [2024-11-07 00:57:21,379 INFO L226 Difference]: Without dead ends: 3432 [2024-11-07 00:57:21,380 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:57:21,381 INFO L432 NwaCegarLoop]: 4267 mSDtfsCounter, 4728 mSDsluCounter, 16862 mSDsCounter, 0 mSdLazyCounter, 1721 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4740 SdHoareTripleChecker+Valid, 21129 SdHoareTripleChecker+Invalid, 1770 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 1721 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:57:21,381 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4740 Valid, 21129 Invalid, 1770 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 1721 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-07 00:57:21,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3432 states. [2024-11-07 00:57:21,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3432 to 3094. [2024-11-07 00:57:21,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3094 states, 2983 states have (on average 1.763995977204157) internal successors, (5262), 2989 states have internal predecessors, (5262), 75 states have call successors, (75), 30 states have call predecessors, (75), 34 states have return successors, (88), 78 states have call predecessors, (88), 75 states have call successors, (88) [2024-11-07 00:57:21,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3094 states to 3094 states and 5425 transitions. [2024-11-07 00:57:21,450 INFO L78 Accepts]: Start accepts. Automaton has 3094 states and 5425 transitions. Word has length 101 [2024-11-07 00:57:21,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:57:21,450 INFO L471 AbstractCegarLoop]: Abstraction has 3094 states and 5425 transitions. [2024-11-07 00:57:21,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 00:57:21,451 INFO L276 IsEmpty]: Start isEmpty. Operand 3094 states and 5425 transitions. [2024-11-07 00:57:21,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-07 00:57:21,452 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:57:21,452 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:57:21,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 00:57:21,452 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:57:21,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:57:21,452 INFO L85 PathProgramCache]: Analyzing trace with hash 1492599289, now seen corresponding path program 1 times [2024-11-07 00:57:21,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:57:21,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750001589] [2024-11-07 00:57:21,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:57:21,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:57:21,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:57:21,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 00:57:21,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:57:21,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 00:57:21,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:57:21,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-07 00:57:21,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:57:21,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-07 00:57:21,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:57:21,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 00:57:21,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:57:21,572 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:57:21,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:57:21,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750001589] [2024-11-07 00:57:21,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [750001589] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:57:21,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:57:21,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 00:57:21,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741261548] [2024-11-07 00:57:21,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:57:21,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 00:57:21,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:57:21,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 00:57:21,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 00:57:21,574 INFO L87 Difference]: Start difference. First operand 3094 states and 5425 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 00:57:22,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:57:22,920 INFO L93 Difference]: Finished difference Result 5354 states and 8917 transitions. [2024-11-07 00:57:22,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 00:57:22,921 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 101 [2024-11-07 00:57:22,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:57:22,935 INFO L225 Difference]: With dead ends: 5354 [2024-11-07 00:57:22,935 INFO L226 Difference]: Without dead ends: 4394 [2024-11-07 00:57:22,938 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:57:22,939 INFO L432 NwaCegarLoop]: 4267 mSDtfsCounter, 4727 mSDsluCounter, 16862 mSDsCounter, 0 mSdLazyCounter, 1708 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4739 SdHoareTripleChecker+Valid, 21129 SdHoareTripleChecker+Invalid, 1757 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 1708 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:57:22,940 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4739 Valid, 21129 Invalid, 1757 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 1708 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-07 00:57:22,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4394 states. [2024-11-07 00:57:23,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4394 to 3851. [2024-11-07 00:57:23,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3851 states, 3656 states have (on average 1.7155361050328228) internal successors, (6272), 3666 states have internal predecessors, (6272), 131 states have call successors, (131), 54 states have call predecessors, (131), 62 states have return successors, (166), 138 states have call predecessors, (166), 131 states have call successors, (166) [2024-11-07 00:57:23,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3851 states to 3851 states and 6569 transitions. [2024-11-07 00:57:23,047 INFO L78 Accepts]: Start accepts. Automaton has 3851 states and 6569 transitions. Word has length 101 [2024-11-07 00:57:23,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:57:23,047 INFO L471 AbstractCegarLoop]: Abstraction has 3851 states and 6569 transitions. [2024-11-07 00:57:23,047 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 00:57:23,047 INFO L276 IsEmpty]: Start isEmpty. Operand 3851 states and 6569 transitions. [2024-11-07 00:57:23,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-07 00:57:23,049 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:57:23,049 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:57:23,050 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 00:57:23,050 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:57:23,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:57:23,050 INFO L85 PathProgramCache]: Analyzing trace with hash 434761211, now seen corresponding path program 1 times [2024-11-07 00:57:23,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:57:23,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569557250] [2024-11-07 00:57:23,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:57:23,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:57:23,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:57:23,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 00:57:23,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:57:23,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 00:57:23,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:57:23,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-07 00:57:23,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:57:23,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-07 00:57:23,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:57:23,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 00:57:23,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:57:23,206 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:57:23,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:57:23,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569557250] [2024-11-07 00:57:23,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1569557250] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:57:23,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:57:23,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 00:57:23,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270029349] [2024-11-07 00:57:23,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:57:23,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 00:57:23,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:57:23,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 00:57:23,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 00:57:23,208 INFO L87 Difference]: Start difference. First operand 3851 states and 6569 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 00:57:24,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:57:24,651 INFO L93 Difference]: Finished difference Result 8033 states and 13023 transitions. [2024-11-07 00:57:24,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 00:57:24,651 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 101 [2024-11-07 00:57:24,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:57:24,671 INFO L225 Difference]: With dead ends: 8033 [2024-11-07 00:57:24,671 INFO L226 Difference]: Without dead ends: 6316 [2024-11-07 00:57:24,676 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:57:24,676 INFO L432 NwaCegarLoop]: 4267 mSDtfsCounter, 4726 mSDsluCounter, 16862 mSDsCounter, 0 mSdLazyCounter, 1695 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4738 SdHoareTripleChecker+Valid, 21129 SdHoareTripleChecker+Invalid, 1744 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 1695 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:57:24,677 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4738 Valid, 21129 Invalid, 1744 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 1695 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-07 00:57:24,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6316 states. [2024-11-07 00:57:24,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6316 to 5372. [2024-11-07 00:57:24,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5372 states, 5009 states have (on average 1.657416650029946) internal successors, (8302), 5027 states have internal predecessors, (8302), 243 states have call successors, (243), 102 states have call predecessors, (243), 118 states have return successors, (340), 258 states have call predecessors, (340), 243 states have call successors, (340) [2024-11-07 00:57:24,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5372 states to 5372 states and 8885 transitions. [2024-11-07 00:57:24,829 INFO L78 Accepts]: Start accepts. Automaton has 5372 states and 8885 transitions. Word has length 101 [2024-11-07 00:57:24,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:57:24,829 INFO L471 AbstractCegarLoop]: Abstraction has 5372 states and 8885 transitions. [2024-11-07 00:57:24,829 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 00:57:24,829 INFO L276 IsEmpty]: Start isEmpty. Operand 5372 states and 8885 transitions. [2024-11-07 00:57:24,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-07 00:57:24,832 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:57:24,832 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:57:24,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 00:57:24,832 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:57:24,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:57:24,833 INFO L85 PathProgramCache]: Analyzing trace with hash -707741255, now seen corresponding path program 1 times [2024-11-07 00:57:24,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:57:24,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829293060] [2024-11-07 00:57:24,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:57:24,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:57:24,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:57:24,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 00:57:24,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:57:24,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 00:57:24,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:57:24,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-07 00:57:24,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:57:24,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-07 00:57:24,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:57:24,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 00:57:24,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:57:24,981 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:57:24,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:57:24,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829293060] [2024-11-07 00:57:24,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829293060] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:57:24,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:57:24,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 00:57:24,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248186435] [2024-11-07 00:57:24,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:57:24,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 00:57:24,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:57:24,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 00:57:24,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 00:57:24,982 INFO L87 Difference]: Start difference. First operand 5372 states and 8885 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 00:57:26,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:57:26,451 INFO L93 Difference]: Finished difference Result 14656 states and 23187 transitions. [2024-11-07 00:57:26,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-07 00:57:26,452 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 101 [2024-11-07 00:57:26,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:57:26,485 INFO L225 Difference]: With dead ends: 14656 [2024-11-07 00:57:26,485 INFO L226 Difference]: Without dead ends: 11418 [2024-11-07 00:57:26,494 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:57:26,495 INFO L432 NwaCegarLoop]: 4149 mSDtfsCounter, 4988 mSDsluCounter, 16518 mSDsCounter, 0 mSdLazyCounter, 1443 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5006 SdHoareTripleChecker+Valid, 20667 SdHoareTripleChecker+Invalid, 1517 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 1443 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-07 00:57:26,495 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5006 Valid, 20667 Invalid, 1517 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 1443 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-07 00:57:26,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11418 states. [2024-11-07 00:57:27,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11418 to 8381. [2024-11-07 00:57:27,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8381 states, 7698 states have (on average 1.6045726162639646) internal successors, (12352), 7732 states have internal predecessors, (12352), 451 states have call successors, (451), 198 states have call predecessors, (451), 230 states have return successors, (726), 482 states have call predecessors, (726), 451 states have call successors, (726) [2024-11-07 00:57:27,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8381 states to 8381 states and 13529 transitions. [2024-11-07 00:57:27,144 INFO L78 Accepts]: Start accepts. Automaton has 8381 states and 13529 transitions. Word has length 101 [2024-11-07 00:57:27,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:57:27,144 INFO L471 AbstractCegarLoop]: Abstraction has 8381 states and 13529 transitions. [2024-11-07 00:57:27,145 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 00:57:27,147 INFO L276 IsEmpty]: Start isEmpty. Operand 8381 states and 13529 transitions. [2024-11-07 00:57:27,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-07 00:57:27,154 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:57:27,154 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:57:27,154 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 00:57:27,154 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:57:27,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:57:27,154 INFO L85 PathProgramCache]: Analyzing trace with hash -467501509, now seen corresponding path program 1 times [2024-11-07 00:57:27,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:57:27,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705538479] [2024-11-07 00:57:27,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:57:27,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:57:27,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:57:27,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 00:57:27,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:57:27,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 00:57:27,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:57:27,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-07 00:57:27,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:57:27,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-07 00:57:27,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:57:27,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 00:57:27,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:57:27,279 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:57:27,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:57:27,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705538479] [2024-11-07 00:57:27,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1705538479] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:57:27,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:57:27,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 00:57:27,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731153717] [2024-11-07 00:57:27,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:57:27,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 00:57:27,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:57:27,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 00:57:27,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 00:57:27,281 INFO L87 Difference]: Start difference. First operand 8381 states and 13529 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 00:57:29,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:57:29,300 INFO L93 Difference]: Finished difference Result 26111 states and 41017 transitions. [2024-11-07 00:57:29,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-07 00:57:29,300 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 101 [2024-11-07 00:57:29,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:57:29,407 INFO L225 Difference]: With dead ends: 26111 [2024-11-07 00:57:29,407 INFO L226 Difference]: Without dead ends: 19864 [2024-11-07 00:57:29,445 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:57:29,445 INFO L432 NwaCegarLoop]: 4264 mSDtfsCounter, 4766 mSDsluCounter, 16851 mSDsCounter, 0 mSdLazyCounter, 1971 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4777 SdHoareTripleChecker+Valid, 21115 SdHoareTripleChecker+Invalid, 2022 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 1971 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-07 00:57:29,446 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4777 Valid, 21115 Invalid, 2022 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 1971 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-07 00:57:29,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19864 states. [2024-11-07 00:57:30,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19864 to 14222. [2024-11-07 00:57:30,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14222 states, 12915 states have (on average 1.564847077042199) internal successors, (20210), 12981 states have internal predecessors, (20210), 851 states have call successors, (851), 390 states have call predecessors, (851), 454 states have return successors, (1644), 914 states have call predecessors, (1644), 851 states have call successors, (1644) [2024-11-07 00:57:30,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14222 states to 14222 states and 22705 transitions. [2024-11-07 00:57:30,089 INFO L78 Accepts]: Start accepts. Automaton has 14222 states and 22705 transitions. Word has length 101 [2024-11-07 00:57:30,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:57:30,089 INFO L471 AbstractCegarLoop]: Abstraction has 14222 states and 22705 transitions. [2024-11-07 00:57:30,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 00:57:30,089 INFO L276 IsEmpty]: Start isEmpty. Operand 14222 states and 22705 transitions. [2024-11-07 00:57:30,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-07 00:57:30,097 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:57:30,097 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:57:30,098 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-07 00:57:30,098 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:57:30,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:57:30,098 INFO L85 PathProgramCache]: Analyzing trace with hash 371532153, now seen corresponding path program 1 times [2024-11-07 00:57:30,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:57:30,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308886842] [2024-11-07 00:57:30,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:57:30,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:57:30,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:57:30,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 00:57:30,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:57:30,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 00:57:30,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:57:30,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-07 00:57:30,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:57:30,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-07 00:57:30,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:57:30,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 00:57:30,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:57:30,228 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:57:30,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:57:30,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308886842] [2024-11-07 00:57:30,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308886842] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:57:30,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:57:30,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 00:57:30,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726484797] [2024-11-07 00:57:30,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:57:30,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 00:57:30,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:57:30,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 00:57:30,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 00:57:30,233 INFO L87 Difference]: Start difference. First operand 14222 states and 22705 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 00:57:33,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:57:33,017 INFO L93 Difference]: Finished difference Result 47950 states and 75583 transitions. [2024-11-07 00:57:33,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-07 00:57:33,018 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 101 [2024-11-07 00:57:33,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:57:33,116 INFO L225 Difference]: With dead ends: 47950 [2024-11-07 00:57:33,117 INFO L226 Difference]: Without dead ends: 35862 [2024-11-07 00:57:33,153 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:57:33,154 INFO L432 NwaCegarLoop]: 4265 mSDtfsCounter, 4858 mSDsluCounter, 16854 mSDsCounter, 0 mSdLazyCounter, 1649 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4876 SdHoareTripleChecker+Valid, 21119 SdHoareTripleChecker+Invalid, 1701 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 1649 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-07 00:57:33,155 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4876 Valid, 21119 Invalid, 1701 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 1649 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-07 00:57:33,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35862 states. [2024-11-07 00:57:34,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35862 to 26031. [2024-11-07 00:57:34,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26031 states, 23508 states have (on average 1.5404117747149906) internal successors, (36212), 23638 states have internal predecessors, (36212), 1619 states have call successors, (1619), 774 states have call predecessors, (1619), 902 states have return successors, (3934), 1746 states have call predecessors, (3934), 1619 states have call successors, (3934) [2024-11-07 00:57:34,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26031 states to 26031 states and 41765 transitions. [2024-11-07 00:57:34,519 INFO L78 Accepts]: Start accepts. Automaton has 26031 states and 41765 transitions. Word has length 101 [2024-11-07 00:57:34,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:57:34,519 INFO L471 AbstractCegarLoop]: Abstraction has 26031 states and 41765 transitions. [2024-11-07 00:57:34,520 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 00:57:34,520 INFO L276 IsEmpty]: Start isEmpty. Operand 26031 states and 41765 transitions. [2024-11-07 00:57:34,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-07 00:57:34,535 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:57:34,535 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:57:34,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-07 00:57:34,535 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:57:34,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:57:34,536 INFO L85 PathProgramCache]: Analyzing trace with hash 398597755, now seen corresponding path program 1 times [2024-11-07 00:57:34,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:57:34,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456439376] [2024-11-07 00:57:34,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:57:34,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:57:34,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:57:34,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 00:57:34,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:57:34,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 00:57:34,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:57:34,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-07 00:57:34,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:57:34,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-07 00:57:34,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:57:34,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 00:57:34,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:57:34,670 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:57:34,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:57:34,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456439376] [2024-11-07 00:57:34,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456439376] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:57:34,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:57:34,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 00:57:34,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982487134] [2024-11-07 00:57:34,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:57:34,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 00:57:34,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:57:34,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 00:57:34,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 00:57:34,672 INFO L87 Difference]: Start difference. First operand 26031 states and 41765 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 00:57:38,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:57:38,590 INFO L93 Difference]: Finished difference Result 90861 states and 145477 transitions. [2024-11-07 00:57:38,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-07 00:57:38,591 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 101 [2024-11-07 00:57:38,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:57:38,802 INFO L225 Difference]: With dead ends: 90861 [2024-11-07 00:57:38,803 INFO L226 Difference]: Without dead ends: 66964 [2024-11-07 00:57:38,967 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:57:38,970 INFO L432 NwaCegarLoop]: 4265 mSDtfsCounter, 4824 mSDsluCounter, 16854 mSDsCounter, 0 mSdLazyCounter, 1631 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4842 SdHoareTripleChecker+Valid, 21119 SdHoareTripleChecker+Invalid, 1683 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 1631 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-07 00:57:38,971 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4842 Valid, 21119 Invalid, 1683 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 1631 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-07 00:57:38,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66964 states. [2024-11-07 00:57:41,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66964 to 49584. [2024-11-07 00:57:41,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49584 states, 44693 states have (on average 1.5277112746962611) internal successors, (68278), 44951 states have internal predecessors, (68278), 3091 states have call successors, (3091), 1542 states have call predecessors, (3091), 1798 states have return successors, (9908), 3346 states have call predecessors, (9908), 3091 states have call successors, (9908) [2024-11-07 00:57:41,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49584 states to 49584 states and 81277 transitions. [2024-11-07 00:57:41,592 INFO L78 Accepts]: Start accepts. Automaton has 49584 states and 81277 transitions. Word has length 101 [2024-11-07 00:57:41,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:57:41,592 INFO L471 AbstractCegarLoop]: Abstraction has 49584 states and 81277 transitions. [2024-11-07 00:57:41,592 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 00:57:41,592 INFO L276 IsEmpty]: Start isEmpty. Operand 49584 states and 81277 transitions. [2024-11-07 00:57:41,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-07 00:57:41,619 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:57:41,620 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:57:41,620 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-07 00:57:41,620 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:57:41,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:57:41,620 INFO L85 PathProgramCache]: Analyzing trace with hash -1678739143, now seen corresponding path program 1 times [2024-11-07 00:57:41,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:57:41,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438043199] [2024-11-07 00:57:41,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:57:41,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:57:41,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:57:41,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 00:57:41,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:57:41,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 00:57:41,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:57:41,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-07 00:57:41,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:57:41,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-07 00:57:41,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:57:41,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 00:57:41,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:57:41,770 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:57:41,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:57:41,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438043199] [2024-11-07 00:57:41,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438043199] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:57:41,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:57:41,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 00:57:41,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55138431] [2024-11-07 00:57:41,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:57:41,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 00:57:41,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:57:41,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 00:57:41,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-07 00:57:41,771 INFO L87 Difference]: Start difference. First operand 49584 states and 81277 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 00:57:45,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:57:45,007 INFO L93 Difference]: Finished difference Result 108888 states and 182936 transitions. [2024-11-07 00:57:45,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 00:57:45,008 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 101 [2024-11-07 00:57:45,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:57:45,236 INFO L225 Difference]: With dead ends: 108888 [2024-11-07 00:57:45,236 INFO L226 Difference]: Without dead ends: 61438 [2024-11-07 00:57:45,356 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-11-07 00:57:45,357 INFO L432 NwaCegarLoop]: 4122 mSDtfsCounter, 4533 mSDsluCounter, 16337 mSDsCounter, 0 mSdLazyCounter, 801 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4546 SdHoareTripleChecker+Valid, 20459 SdHoareTripleChecker+Invalid, 854 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 801 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-07 00:57:45,357 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4546 Valid, 20459 Invalid, 854 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 801 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-07 00:57:45,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61438 states. [2024-11-07 00:57:48,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61438 to 49584. [2024-11-07 00:57:48,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49584 states, 44693 states have (on average 1.5219609334795159) internal successors, (68021), 44951 states have internal predecessors, (68021), 3091 states have call successors, (3091), 1542 states have call predecessors, (3091), 1798 states have return successors, (9908), 3346 states have call predecessors, (9908), 3091 states have call successors, (9908) [2024-11-07 00:57:48,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49584 states to 49584 states and 81020 transitions. [2024-11-07 00:57:48,969 INFO L78 Accepts]: Start accepts. Automaton has 49584 states and 81020 transitions. Word has length 101 [2024-11-07 00:57:48,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:57:48,969 INFO L471 AbstractCegarLoop]: Abstraction has 49584 states and 81020 transitions. [2024-11-07 00:57:48,969 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 00:57:48,970 INFO L276 IsEmpty]: Start isEmpty. Operand 49584 states and 81020 transitions. [2024-11-07 00:57:48,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-07 00:57:48,992 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:57:48,992 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:57:48,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-07 00:57:48,993 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:57:48,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:57:48,993 INFO L85 PathProgramCache]: Analyzing trace with hash -791516297, now seen corresponding path program 1 times [2024-11-07 00:57:48,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:57:48,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854194841] [2024-11-07 00:57:48,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:57:48,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:57:49,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:57:49,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 00:57:49,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:57:49,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 00:57:49,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:57:49,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-07 00:57:49,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:57:49,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-07 00:57:49,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:57:49,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 00:57:49,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:57:49,136 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:57:49,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:57:49,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854194841] [2024-11-07 00:57:49,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854194841] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:57:49,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:57:49,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 00:57:49,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255844497] [2024-11-07 00:57:49,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:57:49,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 00:57:49,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:57:49,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 00:57:49,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 00:57:49,138 INFO L87 Difference]: Start difference. First operand 49584 states and 81020 transitions. Second operand has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 00:57:53,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:57:53,266 INFO L93 Difference]: Finished difference Result 137775 states and 222018 transitions. [2024-11-07 00:57:53,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 00:57:53,266 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 101 [2024-11-07 00:57:53,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:57:53,530 INFO L225 Difference]: With dead ends: 137775 [2024-11-07 00:57:53,531 INFO L226 Difference]: Without dead ends: 90326 [2024-11-07 00:57:53,799 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:57:53,800 INFO L432 NwaCegarLoop]: 4309 mSDtfsCounter, 4947 mSDsluCounter, 12534 mSDsCounter, 0 mSdLazyCounter, 1453 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4978 SdHoareTripleChecker+Valid, 16843 SdHoareTripleChecker+Invalid, 1532 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 1453 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-07 00:57:53,800 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4978 Valid, 16843 Invalid, 1532 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 1453 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-07 00:57:53,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90326 states. [2024-11-07 00:57:57,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90326 to 73121. [2024-11-07 00:57:57,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73121 states, 65713 states have (on average 1.5070381811818057) internal successors, (99032), 66228 states have internal predecessors, (99032), 4706 states have call successors, (4706), 2316 states have call predecessors, (4706), 2700 states have return successors, (13711), 4832 states have call predecessors, (13711), 4706 states have call successors, (13711) [2024-11-07 00:57:57,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73121 states to 73121 states and 117449 transitions. [2024-11-07 00:57:57,692 INFO L78 Accepts]: Start accepts. Automaton has 73121 states and 117449 transitions. Word has length 101 [2024-11-07 00:57:57,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:57:57,693 INFO L471 AbstractCegarLoop]: Abstraction has 73121 states and 117449 transitions. [2024-11-07 00:57:57,693 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 00:57:57,693 INFO L276 IsEmpty]: Start isEmpty. Operand 73121 states and 117449 transitions. [2024-11-07 00:57:57,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-07 00:57:57,816 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:57:57,816 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, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:57:57,816 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-07 00:57:57,817 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:57:57,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:57:57,817 INFO L85 PathProgramCache]: Analyzing trace with hash 222823872, now seen corresponding path program 1 times [2024-11-07 00:57:57,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:57:57,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960763848] [2024-11-07 00:57:57,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:57:57,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:57:57,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:57:57,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 00:57:57,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:57:57,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 00:57:57,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:57:57,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-07 00:57:57,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:57:57,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-07 00:57:57,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:57:57,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 00:57:57,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:57:57,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-07 00:57:57,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:57:57,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-07 00:57:57,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:57:57,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-07 00:57:57,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:57:57,958 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-07 00:57:57,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:57:57,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960763848] [2024-11-07 00:57:57,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1960763848] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 00:57:57,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [393217709] [2024-11-07 00:57:57,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:57:57,958 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 00:57:57,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 00:57:57,962 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:57:57,966 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:57:58,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:57:58,088 INFO L255 TraceCheckSpWp]: Trace formula consists of 653 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-07 00:57:58,094 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 00:57:58,176 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-07 00:57:58,178 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 00:57:58,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [393217709] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:57:58,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 00:57:58,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [7] total 8 [2024-11-07 00:57:58,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806961615] [2024-11-07 00:57:58,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:57:58,179 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 00:57:58,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:57:58,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 00:57:58,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-07 00:57:58,180 INFO L87 Difference]: Start difference. First operand 73121 states and 117449 transitions. Second operand has 3 states, 3 states have (on average 45.0) internal successors, (135), 2 states have internal predecessors, (135), 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) [2024-11-07 00:58:03,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:58:03,561 INFO L93 Difference]: Finished difference Result 213738 states and 344389 transitions. [2024-11-07 00:58:03,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 00:58:03,565 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 2 states have internal predecessors, (135), 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) Word has length 165 [2024-11-07 00:58:03,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:58:04,340 INFO L225 Difference]: With dead ends: 213738 [2024-11-07 00:58:04,341 INFO L226 Difference]: Without dead ends: 142752 [2024-11-07 00:58:04,511 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-07 00:58:04,514 INFO L432 NwaCegarLoop]: 4266 mSDtfsCounter, 4198 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4198 SdHoareTripleChecker+Valid, 4547 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:58:04,514 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4198 Valid, 4547 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:58:04,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142752 states. [2024-11-07 00:58:10,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142752 to 141978. [2024-11-07 00:58:10,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141978 states, 127362 states have (on average 1.4996545280381903) internal successors, (190999), 128390 states have internal predecessors, (190999), 9214 states have call successors, (9214), 4632 states have call predecessors, (9214), 5400 states have return successors, (26969), 9211 states have call predecessors, (26969), 9214 states have call successors, (26969) [2024-11-07 00:58:10,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141978 states to 141978 states and 227182 transitions. [2024-11-07 00:58:10,604 INFO L78 Accepts]: Start accepts. Automaton has 141978 states and 227182 transitions. Word has length 165 [2024-11-07 00:58:10,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:58:10,604 INFO L471 AbstractCegarLoop]: Abstraction has 141978 states and 227182 transitions. [2024-11-07 00:58:10,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 2 states have internal predecessors, (135), 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) [2024-11-07 00:58:10,605 INFO L276 IsEmpty]: Start isEmpty. Operand 141978 states and 227182 transitions. [2024-11-07 00:58:10,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-07 00:58:10,800 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:58:10,800 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, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:58:10,813 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-07 00:58:11,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-11-07 00:58:11,001 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:58:11,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:58:11,001 INFO L85 PathProgramCache]: Analyzing trace with hash -837788448, now seen corresponding path program 1 times [2024-11-07 00:58:11,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:58:11,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122328298] [2024-11-07 00:58:11,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:58:11,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:58:11,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:58:11,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 00:58:11,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:58:11,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 00:58:11,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:58:11,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-07 00:58:11,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:58:11,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-07 00:58:11,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:58:11,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 00:58:11,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:58:11,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-07 00:58:11,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:58:11,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-07 00:58:11,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:58:11,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-07 00:58:11,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:58:11,143 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-07 00:58:11,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:58:11,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122328298] [2024-11-07 00:58:11,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122328298] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 00:58:11,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [7473986] [2024-11-07 00:58:11,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:58:11,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 00:58:11,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 00:58:11,145 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 00:58:11,146 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-07 00:58:11,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:58:11,263 INFO L255 TraceCheckSpWp]: Trace formula consists of 647 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-07 00:58:11,266 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 00:58:11,316 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-11-07 00:58:11,316 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 00:58:11,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [7473986] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:58:11,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 00:58:11,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [7] total 8 [2024-11-07 00:58:11,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476577186] [2024-11-07 00:58:11,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:58:11,317 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 00:58:11,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:58:11,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 00:58:11,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-07 00:58:11,318 INFO L87 Difference]: Start difference. First operand 141978 states and 227182 transitions. Second operand has 3 states, 3 states have (on average 39.0) internal successors, (117), 2 states have internal predecessors, (117), 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)