./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/Problem05_label43+token_ring.04.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4f9af400 extending candidate: java ['java'] extending candidate: /usr/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/oracle-jdk-bin-*/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/openjdk-*/bin/java ['java', '/usr/bin/java'] extending candidate: /usr/lib/jvm/java-*-openjdk-amd64/bin/java ['java', '/usr/bin/java', '/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java', '/usr/lib/jvm/java-17-openjdk-amd64/bin/java', '/usr/lib/jvm/java-11-openjdk-amd64/bin/java', '/usr/lib/jvm/java-1.17.0-openjdk-amd64/bin/java'] ['/root/.sdkman/candidates/java/21.0.5-tem/bin/java', '-Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config', '-Xmx15G', '-Xms4m', '-jar', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar', '-data', '@noDefault', '-ultimatedata', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data', '-tc', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml', '-i', '../sv-benchmarks/c/combinations/Problem05_label43+token_ring.04.cil-2.c', '-s', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf', '--cacsl2boogietranslator.entry.function', 'main', '--witnessprinter.witness.directory', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux', '--witnessprinter.witness.filename', 'witness', '--witnessprinter.write.witness.besides.input.file', 'false', '--witnessprinter.graph.data.specification', 'CHECK( init(main()), LTL(G ! call(reach_error())) )\n\n', '--witnessprinter.graph.data.producer', 'Automizer', '--witnessprinter.graph.data.architecture', '32bit', '--witnessprinter.graph.data.programhash', '2c5568751dd37ae3ac79e02a0fd7273b3ab2af9e94f13bec2f84e6a22bfe26f6'] 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_label43+token_ring.04.cil-2.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2c5568751dd37ae3ac79e02a0fd7273b3ab2af9e94f13bec2f84e6a22bfe26f6 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 00:59:13,397 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 00:59:13,486 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:59:13,493 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 00:59:13,494 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 00:59:13,519 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 00:59:13,522 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 00:59:13,523 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 00:59:13,523 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 00:59:13,523 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 00:59:13,523 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 00:59:13,523 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 00:59:13,523 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 00:59:13,523 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 00:59:13,523 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 00:59:13,523 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 00:59:13,523 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 00:59:13,523 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 00:59:13,523 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 00:59:13,524 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 00:59:13,524 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 00:59:13,524 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 00:59:13,524 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 00:59:13,524 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 00:59:13,524 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 00:59:13,524 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 00:59:13,524 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 00:59:13,524 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 00:59:13,524 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 00:59:13,524 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 00:59:13,524 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 00:59:13,524 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 00:59:13,524 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 00:59:13,524 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 00:59:13,524 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 00:59:13,524 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 00:59:13,524 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 00:59:13,524 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 00:59:13,525 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 00:59:13,525 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 00:59:13,525 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 00:59:13,525 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 00:59:13,525 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 -> 2c5568751dd37ae3ac79e02a0fd7273b3ab2af9e94f13bec2f84e6a22bfe26f6 [2024-11-07 00:59:13,742 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 00:59:13,748 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 00:59:13,749 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 00:59:13,750 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 00:59:13,751 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 00:59:13,752 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/Problem05_label43+token_ring.04.cil-2.c [2024-11-07 00:59:15,006 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 00:59:15,674 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 00:59:15,676 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label43+token_ring.04.cil-2.c [2024-11-07 00:59:15,718 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a1ba6c6f7/2133be4617a54cd3b1bfd8104ea84072/FLAG840fa7cb2 [2024-11-07 00:59:16,122 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a1ba6c6f7/2133be4617a54cd3b1bfd8104ea84072 [2024-11-07 00:59:16,123 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 00:59:16,124 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 00:59:16,129 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 00:59:16,129 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 00:59:16,132 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 00:59:16,135 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:59:16" (1/1) ... [2024-11-07 00:59:16,136 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52c1d7a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:59:16, skipping insertion in model container [2024-11-07 00:59:16,136 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:59:16" (1/1) ... [2024-11-07 00:59:16,267 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 00:59:17,333 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_label43+token_ring.04.cil-2.c[381679,381692] [2024-11-07 00:59:17,354 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_label43+token_ring.04.cil-2.c[383339,383352] [2024-11-07 00:59:17,475 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 00:59:17,485 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 00:59:18,066 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_label43+token_ring.04.cil-2.c[381679,381692] [2024-11-07 00:59:18,070 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_label43+token_ring.04.cil-2.c[383339,383352] [2024-11-07 00:59:18,083 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 00:59:18,127 INFO L204 MainTranslator]: Completed translation [2024-11-07 00:59:18,128 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:59:18 WrapperNode [2024-11-07 00:59:18,128 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 00:59:18,129 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 00:59:18,129 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 00:59:18,129 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 00:59:18,134 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:59:18" (1/1) ... [2024-11-07 00:59:18,190 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:59:18" (1/1) ... [2024-11-07 00:59:18,518 INFO L138 Inliner]: procedures = 52, calls = 54, calls flagged for inlining = 29, calls inlined = 29, statements flattened = 12759 [2024-11-07 00:59:18,518 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 00:59:18,520 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 00:59:18,520 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 00:59:18,521 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 00:59:18,528 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:59:18" (1/1) ... [2024-11-07 00:59:18,528 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:59:18" (1/1) ... [2024-11-07 00:59:18,559 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:59:18" (1/1) ... [2024-11-07 00:59:18,689 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:59:18,693 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:59:18" (1/1) ... [2024-11-07 00:59:18,693 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:59:18" (1/1) ... [2024-11-07 00:59:19,064 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:59:18" (1/1) ... [2024-11-07 00:59:19,125 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:59:18" (1/1) ... [2024-11-07 00:59:19,149 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:59:18" (1/1) ... [2024-11-07 00:59:19,170 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:59:18" (1/1) ... [2024-11-07 00:59:19,204 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 00:59:19,206 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 00:59:19,206 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 00:59:19,206 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 00:59:19,207 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:59:18" (1/1) ... [2024-11-07 00:59:19,212 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 00:59:19,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 00:59:19,231 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:59:19,236 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:59:19,253 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 00:59:19,253 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2024-11-07 00:59:19,253 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2024-11-07 00:59:19,253 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-11-07 00:59:19,253 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-11-07 00:59:19,253 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2024-11-07 00:59:19,254 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2024-11-07 00:59:19,254 INFO L130 BoogieDeclarations]: Found specification of procedure error [2024-11-07 00:59:19,254 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2024-11-07 00:59:19,254 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2024-11-07 00:59:19,254 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2024-11-07 00:59:19,254 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2024-11-07 00:59:19,254 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2024-11-07 00:59:19,254 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2024-11-07 00:59:19,255 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2024-11-07 00:59:19,255 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 00:59:19,255 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 00:59:19,255 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 00:59:19,382 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 00:59:19,383 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 00:59:25,291 INFO L? ?]: Removed 1711 outVars from TransFormulas that were not future-live. [2024-11-07 00:59:25,291 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 00:59:25,400 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 00:59:25,404 INFO L316 CfgBuilder]: Removed 8 assume(true) statements. [2024-11-07 00:59:25,404 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:59:25 BoogieIcfgContainer [2024-11-07 00:59:25,405 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 00:59:25,406 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 00:59:25,406 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 00:59:25,413 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 00:59:25,414 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 12:59:16" (1/3) ... [2024-11-07 00:59:25,414 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f2bca29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:59:25, skipping insertion in model container [2024-11-07 00:59:25,414 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:59:18" (2/3) ... [2024-11-07 00:59:25,414 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f2bca29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:59:25, skipping insertion in model container [2024-11-07 00:59:25,414 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:59:25" (3/3) ... [2024-11-07 00:59:25,415 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem05_label43+token_ring.04.cil-2.c [2024-11-07 00:59:25,429 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 00:59:25,433 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-07 00:59:25,579 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 00:59:25,591 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;@7046166b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 00:59:25,591 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-07 00:59:25,600 INFO L276 IsEmpty]: Start isEmpty. Operand has 2378 states, 2348 states have (on average 1.852640545144804) internal successors, (4350), 2353 states have internal predecessors, (4350), 20 states have call successors, (20), 7 states have call predecessors, (20), 7 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-07 00:59:25,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-07 00:59:25,608 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:59:25,608 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:59:25,608 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:59:25,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:59:25,611 INFO L85 PathProgramCache]: Analyzing trace with hash 482633735, now seen corresponding path program 1 times [2024-11-07 00:59:25,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:59:25,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830995583] [2024-11-07 00:59:25,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:59:25,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:59:25,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:59:25,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 00:59:25,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:59:25,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-07 00:59:25,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:59:25,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 00:59:25,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:59:25,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 00:59:25,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:59:25,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 00:59:25,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:59:25,924 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:59:25,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:59:25,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830995583] [2024-11-07 00:59:25,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [830995583] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:59:25,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:59:25,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 00:59:25,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880799229] [2024-11-07 00:59:25,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:59:25,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 00:59:25,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:59:25,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 00:59:25,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 00:59:25,948 INFO L87 Difference]: Start difference. First operand has 2378 states, 2348 states have (on average 1.852640545144804) internal successors, (4350), 2353 states have internal predecessors, (4350), 20 states have call successors, (20), 7 states have call predecessors, (20), 7 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 00:59:26,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:59:26,640 INFO L93 Difference]: Finished difference Result 4803 states and 8862 transitions. [2024-11-07 00:59:26,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 00:59:26,641 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 91 [2024-11-07 00:59:26,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:59:26,657 INFO L225 Difference]: With dead ends: 4803 [2024-11-07 00:59:26,657 INFO L226 Difference]: Without dead ends: 2364 [2024-11-07 00:59:26,663 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-07 00:59:26,665 INFO L432 NwaCegarLoop]: 4210 mSDtfsCounter, 457 mSDsluCounter, 12285 mSDsCounter, 0 mSdLazyCounter, 421 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 473 SdHoareTripleChecker+Valid, 16495 SdHoareTripleChecker+Invalid, 465 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 00:59:26,666 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [473 Valid, 16495 Invalid, 465 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [44 Valid, 421 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 00:59:26,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2364 states. [2024-11-07 00:59:26,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2364 to 2310. [2024-11-07 00:59:26,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2310 states, 2282 states have (on average 1.8418054338299736) internal successors, (4203), 2285 states have internal predecessors, (4203), 20 states have call successors, (20), 7 states have call predecessors, (20), 6 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-07 00:59:26,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2310 states to 2310 states and 4241 transitions. [2024-11-07 00:59:26,794 INFO L78 Accepts]: Start accepts. Automaton has 2310 states and 4241 transitions. Word has length 91 [2024-11-07 00:59:26,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:59:26,795 INFO L471 AbstractCegarLoop]: Abstraction has 2310 states and 4241 transitions. [2024-11-07 00:59:26,795 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 00:59:26,795 INFO L276 IsEmpty]: Start isEmpty. Operand 2310 states and 4241 transitions. [2024-11-07 00:59:26,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-07 00:59:26,800 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:59:26,800 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:59:26,800 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 00:59:26,801 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:59:26,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:59:26,801 INFO L85 PathProgramCache]: Analyzing trace with hash -1084124215, now seen corresponding path program 1 times [2024-11-07 00:59:26,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:59:26,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940281539] [2024-11-07 00:59:26,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:59:26,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:59:26,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:59:26,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 00:59:26,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:59:26,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-07 00:59:27,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:59:27,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 00:59:27,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:59:27,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 00:59:27,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:59:27,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 00:59:27,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:59:27,070 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:59:27,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:59:27,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940281539] [2024-11-07 00:59:27,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940281539] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:59:27,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:59:27,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 00:59:27,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191550969] [2024-11-07 00:59:27,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:59:27,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 00:59:27,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:59:27,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 00:59:27,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 00:59:27,072 INFO L87 Difference]: Start difference. First operand 2310 states and 4241 transitions. Second operand has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 00:59:28,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:59:28,129 INFO L93 Difference]: Finished difference Result 2774 states and 4962 transitions. [2024-11-07 00:59:28,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 00:59:28,130 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 91 [2024-11-07 00:59:28,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:59:28,140 INFO L225 Difference]: With dead ends: 2774 [2024-11-07 00:59:28,140 INFO L226 Difference]: Without dead ends: 2597 [2024-11-07 00:59:28,141 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:59:28,142 INFO L432 NwaCegarLoop]: 4127 mSDtfsCounter, 4619 mSDsluCounter, 12372 mSDsCounter, 0 mSdLazyCounter, 926 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4630 SdHoareTripleChecker+Valid, 16499 SdHoareTripleChecker+Invalid, 1010 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 926 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-07 00:59:28,142 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4630 Valid, 16499 Invalid, 1010 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 926 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-07 00:59:28,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2597 states. [2024-11-07 00:59:28,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2597 to 2488. [2024-11-07 00:59:28,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2488 states, 2440 states have (on average 1.8221311475409836) internal successors, (4446), 2444 states have internal predecessors, (4446), 33 states have call successors, (33), 13 states have call predecessors, (33), 13 states have return successors, (34), 31 states have call predecessors, (34), 31 states have call successors, (34) [2024-11-07 00:59:28,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2488 states to 2488 states and 4513 transitions. [2024-11-07 00:59:28,209 INFO L78 Accepts]: Start accepts. Automaton has 2488 states and 4513 transitions. Word has length 91 [2024-11-07 00:59:28,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:59:28,209 INFO L471 AbstractCegarLoop]: Abstraction has 2488 states and 4513 transitions. [2024-11-07 00:59:28,209 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 00:59:28,209 INFO L276 IsEmpty]: Start isEmpty. Operand 2488 states and 4513 transitions. [2024-11-07 00:59:28,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-07 00:59:28,210 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:59:28,211 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:59:28,211 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 00:59:28,211 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:59:28,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:59:28,211 INFO L85 PathProgramCache]: Analyzing trace with hash 1156138437, now seen corresponding path program 1 times [2024-11-07 00:59:28,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:59:28,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379634056] [2024-11-07 00:59:28,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:59:28,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:59:28,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:59:28,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 00:59:28,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:59:28,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-07 00:59:28,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:59:28,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 00:59:28,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:59:28,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 00:59:28,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:59:28,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 00:59:28,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:59:28,375 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:59:28,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:59:28,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379634056] [2024-11-07 00:59:28,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1379634056] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:59:28,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:59:28,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 00:59:28,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216967052] [2024-11-07 00:59:28,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:59:28,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 00:59:28,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:59:28,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 00:59:28,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 00:59:28,377 INFO L87 Difference]: Start difference. First operand 2488 states and 4513 transitions. Second operand has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 00:59:29,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:59:29,677 INFO L93 Difference]: Finished difference Result 3187 states and 5594 transitions. [2024-11-07 00:59:29,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 00:59:29,678 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 91 [2024-11-07 00:59:29,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:59:29,688 INFO L225 Difference]: With dead ends: 3187 [2024-11-07 00:59:29,688 INFO L226 Difference]: Without dead ends: 2832 [2024-11-07 00:59:29,689 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:59:29,690 INFO L432 NwaCegarLoop]: 4253 mSDtfsCounter, 4620 mSDsluCounter, 16808 mSDsCounter, 0 mSdLazyCounter, 1494 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4631 SdHoareTripleChecker+Valid, 21061 SdHoareTripleChecker+Invalid, 1543 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 1494 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-07 00:59:29,690 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4631 Valid, 21061 Invalid, 1543 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 1494 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-07 00:59:29,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2832 states. [2024-11-07 00:59:29,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2832 to 2655. [2024-11-07 00:59:29,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2655 states, 2587 states have (on average 1.8040201005025125) internal successors, (4667), 2592 states have internal predecessors, (4667), 46 states have call successors, (46), 19 states have call predecessors, (46), 20 states have return successors, (49), 45 states have call predecessors, (49), 44 states have call successors, (49) [2024-11-07 00:59:29,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2655 states to 2655 states and 4762 transitions. [2024-11-07 00:59:29,748 INFO L78 Accepts]: Start accepts. Automaton has 2655 states and 4762 transitions. Word has length 91 [2024-11-07 00:59:29,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:59:29,748 INFO L471 AbstractCegarLoop]: Abstraction has 2655 states and 4762 transitions. [2024-11-07 00:59:29,748 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 00:59:29,749 INFO L276 IsEmpty]: Start isEmpty. Operand 2655 states and 4762 transitions. [2024-11-07 00:59:29,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-07 00:59:29,750 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:59:29,750 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:59:29,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 00:59:29,750 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:59:29,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:59:29,751 INFO L85 PathProgramCache]: Analyzing trace with hash -1404724409, now seen corresponding path program 1 times [2024-11-07 00:59:29,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:59:29,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798637416] [2024-11-07 00:59:29,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:59:29,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:59:29,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:59:29,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 00:59:29,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:59:29,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-07 00:59:29,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:59:29,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 00:59:29,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:59:29,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 00:59:29,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:59:29,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 00:59:29,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:59:29,882 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:59:29,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:59:29,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798637416] [2024-11-07 00:59:29,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798637416] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:59:29,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:59:29,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 00:59:29,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930940855] [2024-11-07 00:59:29,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:59:29,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 00:59:29,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:59:29,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 00:59:29,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 00:59:29,884 INFO L87 Difference]: Start difference. First operand 2655 states and 4762 transitions. Second operand has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 00:59:31,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:59:31,250 INFO L93 Difference]: Finished difference Result 3795 states and 6521 transitions. [2024-11-07 00:59:31,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 00:59:31,251 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 91 [2024-11-07 00:59:31,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:59:31,272 INFO L225 Difference]: With dead ends: 3795 [2024-11-07 00:59:31,273 INFO L226 Difference]: Without dead ends: 3273 [2024-11-07 00:59:31,278 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:59:31,280 INFO L432 NwaCegarLoop]: 4137 mSDtfsCounter, 4670 mSDsluCounter, 16482 mSDsCounter, 0 mSdLazyCounter, 1259 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4681 SdHoareTripleChecker+Valid, 20619 SdHoareTripleChecker+Invalid, 1334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 1259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-07 00:59:31,280 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4681 Valid, 20619 Invalid, 1334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 1259 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-07 00:59:31,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3273 states. [2024-11-07 00:59:31,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3273 to 2990. [2024-11-07 00:59:31,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2990 states, 2882 states have (on average 1.7730742539902846) internal successors, (5110), 2889 states have internal predecessors, (5110), 72 states have call successors, (72), 31 states have call predecessors, (72), 34 states have return successors, (83), 73 states have call predecessors, (83), 70 states have call successors, (83) [2024-11-07 00:59:31,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2990 states to 2990 states and 5265 transitions. [2024-11-07 00:59:31,348 INFO L78 Accepts]: Start accepts. Automaton has 2990 states and 5265 transitions. Word has length 91 [2024-11-07 00:59:31,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:59:31,348 INFO L471 AbstractCegarLoop]: Abstraction has 2990 states and 5265 transitions. [2024-11-07 00:59:31,348 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 00:59:31,348 INFO L276 IsEmpty]: Start isEmpty. Operand 2990 states and 5265 transitions. [2024-11-07 00:59:31,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-07 00:59:31,349 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:59:31,349 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:59:31,349 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 00:59:31,349 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:59:31,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:59:31,350 INFO L85 PathProgramCache]: Analyzing trace with hash -517501563, now seen corresponding path program 1 times [2024-11-07 00:59:31,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:59:31,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501902675] [2024-11-07 00:59:31,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:59:31,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:59:31,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:59:31,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 00:59:31,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:59:31,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-07 00:59:31,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:59:31,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 00:59:31,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:59:31,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 00:59:31,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:59:31,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 00:59:31,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:59:31,502 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:59:31,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:59:31,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501902675] [2024-11-07 00:59:31,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [501902675] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:59:31,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:59:31,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 00:59:31,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322704421] [2024-11-07 00:59:31,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:59:31,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 00:59:31,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:59:31,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 00:59:31,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 00:59:31,504 INFO L87 Difference]: Start difference. First operand 2990 states and 5265 transitions. Second operand has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 00:59:32,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:59:32,756 INFO L93 Difference]: Finished difference Result 4970 states and 8308 transitions. [2024-11-07 00:59:32,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 00:59:32,757 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 91 [2024-11-07 00:59:32,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:59:32,769 INFO L225 Difference]: With dead ends: 4970 [2024-11-07 00:59:32,769 INFO L226 Difference]: Without dead ends: 4113 [2024-11-07 00:59:32,771 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:59:32,772 INFO L432 NwaCegarLoop]: 4251 mSDtfsCounter, 4618 mSDsluCounter, 16808 mSDsCounter, 0 mSdLazyCounter, 1483 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4629 SdHoareTripleChecker+Valid, 21059 SdHoareTripleChecker+Invalid, 1534 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 1483 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-07 00:59:32,772 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4629 Valid, 21059 Invalid, 1534 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 1483 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-07 00:59:32,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4113 states. [2024-11-07 00:59:32,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4113 to 3661. [2024-11-07 00:59:32,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3661 states, 3473 states have (on average 1.7264612726749209) internal successors, (5996), 3484 states have internal predecessors, (5996), 124 states have call successors, (124), 55 states have call predecessors, (124), 62 states have return successors, (157), 129 states have call predecessors, (157), 122 states have call successors, (157) [2024-11-07 00:59:32,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3661 states to 3661 states and 6277 transitions. [2024-11-07 00:59:32,852 INFO L78 Accepts]: Start accepts. Automaton has 3661 states and 6277 transitions. Word has length 91 [2024-11-07 00:59:32,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:59:32,852 INFO L471 AbstractCegarLoop]: Abstraction has 3661 states and 6277 transitions. [2024-11-07 00:59:32,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 00:59:32,853 INFO L276 IsEmpty]: Start isEmpty. Operand 3661 states and 6277 transitions. [2024-11-07 00:59:32,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-07 00:59:32,854 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:59:32,854 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:59:32,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 00:59:32,854 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:59:32,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:59:32,855 INFO L85 PathProgramCache]: Analyzing trace with hash 1866423175, now seen corresponding path program 1 times [2024-11-07 00:59:32,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:59:32,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787451203] [2024-11-07 00:59:32,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:59:32,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:59:32,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:59:32,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 00:59:32,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:59:32,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-07 00:59:32,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:59:32,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 00:59:32,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:59:32,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 00:59:32,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:59:32,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 00:59:32,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:59:32,956 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:59:32,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:59:32,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787451203] [2024-11-07 00:59:32,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787451203] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:59:32,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:59:32,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 00:59:32,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356729688] [2024-11-07 00:59:32,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:59:32,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 00:59:32,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:59:32,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 00:59:32,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 00:59:32,958 INFO L87 Difference]: Start difference. First operand 3661 states and 6277 transitions. Second operand has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 00:59:34,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:59:34,196 INFO L93 Difference]: Finished difference Result 7832 states and 12656 transitions. [2024-11-07 00:59:34,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-07 00:59:34,197 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 91 [2024-11-07 00:59:34,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:59:34,215 INFO L225 Difference]: With dead ends: 7832 [2024-11-07 00:59:34,216 INFO L226 Difference]: Without dead ends: 6304 [2024-11-07 00:59:34,221 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-11-07 00:59:34,221 INFO L432 NwaCegarLoop]: 4249 mSDtfsCounter, 4788 mSDsluCounter, 16800 mSDsCounter, 0 mSdLazyCounter, 1448 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4804 SdHoareTripleChecker+Valid, 21049 SdHoareTripleChecker+Invalid, 1502 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 1448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-07 00:59:34,221 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4804 Valid, 21049 Invalid, 1502 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 1448 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-07 00:59:34,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6304 states. [2024-11-07 00:59:34,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6304 to 4993. [2024-11-07 00:59:34,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4993 states, 4653 states have (on average 1.6711798839458414) internal successors, (7776), 4672 states have internal predecessors, (7776), 220 states have call successors, (220), 103 states have call predecessors, (220), 118 states have return successors, (315), 233 states have call predecessors, (315), 218 states have call successors, (315) [2024-11-07 00:59:34,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4993 states to 4993 states and 8311 transitions. [2024-11-07 00:59:34,380 INFO L78 Accepts]: Start accepts. Automaton has 4993 states and 8311 transitions. Word has length 91 [2024-11-07 00:59:34,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:59:34,380 INFO L471 AbstractCegarLoop]: Abstraction has 4993 states and 8311 transitions. [2024-11-07 00:59:34,380 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 00:59:34,381 INFO L276 IsEmpty]: Start isEmpty. Operand 4993 states and 8311 transitions. [2024-11-07 00:59:34,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-07 00:59:34,386 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:59:34,386 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:59:34,386 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 00:59:34,386 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:59:34,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:59:34,386 INFO L85 PathProgramCache]: Analyzing trace with hash 899072521, now seen corresponding path program 1 times [2024-11-07 00:59:34,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:59:34,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021830087] [2024-11-07 00:59:34,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:59:34,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:59:34,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:59:34,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 00:59:34,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:59:34,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-07 00:59:34,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:59:34,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 00:59:34,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:59:34,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 00:59:34,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:59:34,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 00:59:34,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:59:34,496 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:59:34,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:59:34,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021830087] [2024-11-07 00:59:34,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2021830087] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:59:34,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:59:34,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 00:59:34,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334889675] [2024-11-07 00:59:34,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:59:34,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 00:59:34,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:59:34,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 00:59:34,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 00:59:34,497 INFO L87 Difference]: Start difference. First operand 4993 states and 8311 transitions. Second operand has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 00:59:35,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:59:35,896 INFO L93 Difference]: Finished difference Result 12790 states and 20272 transitions. [2024-11-07 00:59:35,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-07 00:59:35,900 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 91 [2024-11-07 00:59:35,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:59:35,946 INFO L225 Difference]: With dead ends: 12790 [2024-11-07 00:59:35,946 INFO L226 Difference]: Without dead ends: 9930 [2024-11-07 00:59:35,960 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-11-07 00:59:35,961 INFO L432 NwaCegarLoop]: 4248 mSDtfsCounter, 4645 mSDsluCounter, 16797 mSDsCounter, 0 mSdLazyCounter, 1683 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4655 SdHoareTripleChecker+Valid, 21045 SdHoareTripleChecker+Invalid, 1736 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 1683 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-07 00:59:35,965 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4655 Valid, 21045 Invalid, 1736 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 1683 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-07 00:59:35,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9930 states. [2024-11-07 00:59:36,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9930 to 7486. [2024-11-07 00:59:36,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7486 states, 6850 states have (on average 1.6131386861313868) internal successors, (11050), 6885 states have internal predecessors, (11050), 404 states have call successors, (404), 199 states have call predecessors, (404), 230 states have return successors, (677), 433 states have call predecessors, (677), 402 states have call successors, (677) [2024-11-07 00:59:36,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7486 states to 7486 states and 12131 transitions. [2024-11-07 00:59:36,209 INFO L78 Accepts]: Start accepts. Automaton has 7486 states and 12131 transitions. Word has length 91 [2024-11-07 00:59:36,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:59:36,210 INFO L471 AbstractCegarLoop]: Abstraction has 7486 states and 12131 transitions. [2024-11-07 00:59:36,211 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 00:59:36,211 INFO L276 IsEmpty]: Start isEmpty. Operand 7486 states and 12131 transitions. [2024-11-07 00:59:36,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-07 00:59:36,215 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:59:36,216 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:59:36,216 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 00:59:36,216 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:59:36,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:59:36,217 INFO L85 PathProgramCache]: Analyzing trace with hash -1487436985, now seen corresponding path program 1 times [2024-11-07 00:59:36,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:59:36,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542263032] [2024-11-07 00:59:36,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:59:36,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:59:36,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:59:36,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 00:59:36,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:59:36,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-07 00:59:36,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:59:36,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 00:59:36,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:59:36,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 00:59:36,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:59:36,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 00:59:36,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:59:36,330 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:59:36,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:59:36,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542263032] [2024-11-07 00:59:36,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542263032] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:59:36,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:59:36,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 00:59:36,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738638131] [2024-11-07 00:59:36,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:59:36,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 00:59:36,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:59:36,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 00:59:36,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 00:59:36,332 INFO L87 Difference]: Start difference. First operand 7486 states and 12131 transitions. Second operand has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 00:59:37,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:59:37,844 INFO L93 Difference]: Finished difference Result 21929 states and 34366 transitions. [2024-11-07 00:59:37,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-07 00:59:37,844 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 91 [2024-11-07 00:59:37,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:59:37,885 INFO L225 Difference]: With dead ends: 21929 [2024-11-07 00:59:37,885 INFO L226 Difference]: Without dead ends: 16576 [2024-11-07 00:59:37,900 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-11-07 00:59:37,901 INFO L432 NwaCegarLoop]: 4249 mSDtfsCounter, 4708 mSDsluCounter, 16800 mSDsCounter, 0 mSdLazyCounter, 1422 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4724 SdHoareTripleChecker+Valid, 21049 SdHoareTripleChecker+Invalid, 1476 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 1422 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-07 00:59:37,901 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4724 Valid, 21049 Invalid, 1476 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 1422 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-07 00:59:37,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16576 states. [2024-11-07 00:59:38,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16576 to 12615. [2024-11-07 00:59:38,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12615 states, 11403 states have (on average 1.5697623432430061) internal successors, (17900), 11470 states have internal predecessors, (17900), 756 states have call successors, (756), 391 states have call predecessors, (756), 454 states have return successors, (1547), 817 states have call predecessors, (1547), 754 states have call successors, (1547) [2024-11-07 00:59:38,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12615 states to 12615 states and 20203 transitions. [2024-11-07 00:59:38,494 INFO L78 Accepts]: Start accepts. Automaton has 12615 states and 20203 transitions. Word has length 91 [2024-11-07 00:59:38,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:59:38,495 INFO L471 AbstractCegarLoop]: Abstraction has 12615 states and 20203 transitions. [2024-11-07 00:59:38,495 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 00:59:38,495 INFO L276 IsEmpty]: Start isEmpty. Operand 12615 states and 20203 transitions. [2024-11-07 00:59:38,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-07 00:59:38,502 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:59:38,502 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:59:38,502 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-07 00:59:38,502 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:59:38,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:59:38,503 INFO L85 PathProgramCache]: Analyzing trace with hash -1980063159, now seen corresponding path program 1 times [2024-11-07 00:59:38,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:59:38,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884595255] [2024-11-07 00:59:38,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:59:38,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:59:38,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:59:38,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 00:59:38,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:59:38,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-07 00:59:38,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:59:38,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 00:59:38,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:59:38,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 00:59:38,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:59:38,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 00:59:38,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:59:38,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:59:38,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:59:38,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884595255] [2024-11-07 00:59:38,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884595255] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:59:38,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:59:38,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 00:59:38,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110748746] [2024-11-07 00:59:38,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:59:38,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 00:59:38,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:59:38,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 00:59:38,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 00:59:38,609 INFO L87 Difference]: Start difference. First operand 12615 states and 20203 transitions. Second operand has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 00:59:40,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:59:40,973 INFO L93 Difference]: Finished difference Result 40064 states and 63092 transitions. [2024-11-07 00:59:40,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-07 00:59:40,973 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 91 [2024-11-07 00:59:40,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:59:41,072 INFO L225 Difference]: With dead ends: 40064 [2024-11-07 00:59:41,072 INFO L226 Difference]: Without dead ends: 29582 [2024-11-07 00:59:41,111 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-11-07 00:59:41,112 INFO L432 NwaCegarLoop]: 4249 mSDtfsCounter, 4668 mSDsluCounter, 16800 mSDsCounter, 0 mSdLazyCounter, 1409 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4684 SdHoareTripleChecker+Valid, 21049 SdHoareTripleChecker+Invalid, 1463 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 1409 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-07 00:59:41,112 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4684 Valid, 21049 Invalid, 1463 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 1409 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-07 00:59:41,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29582 states. [2024-11-07 00:59:41,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29582 to 22840. [2024-11-07 00:59:41,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22840 states, 20508 states have (on average 1.5423249463623951) internal successors, (31630), 20639 states have internal predecessors, (31630), 1428 states have call successors, (1428), 775 states have call predecessors, (1428), 902 states have return successors, (3741), 1553 states have call predecessors, (3741), 1426 states have call successors, (3741) [2024-11-07 00:59:42,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22840 states to 22840 states and 36799 transitions. [2024-11-07 00:59:42,028 INFO L78 Accepts]: Start accepts. Automaton has 22840 states and 36799 transitions. Word has length 91 [2024-11-07 00:59:42,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:59:42,028 INFO L471 AbstractCegarLoop]: Abstraction has 22840 states and 36799 transitions. [2024-11-07 00:59:42,028 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 00:59:42,028 INFO L276 IsEmpty]: Start isEmpty. Operand 22840 states and 36799 transitions. [2024-11-07 00:59:42,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-07 00:59:42,040 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:59:42,040 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:59:42,040 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-07 00:59:42,040 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:59:42,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:59:42,041 INFO L85 PathProgramCache]: Analyzing trace with hash -1026123001, now seen corresponding path program 1 times [2024-11-07 00:59:42,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:59:42,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240508149] [2024-11-07 00:59:42,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:59:42,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:59:42,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:59:42,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 00:59:42,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:59:42,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-07 00:59:42,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:59:42,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 00:59:42,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:59:42,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 00:59:42,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:59:42,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 00:59:42,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:59:42,130 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:59:42,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:59:42,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240508149] [2024-11-07 00:59:42,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240508149] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:59:42,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:59:42,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 00:59:42,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181917644] [2024-11-07 00:59:42,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:59:42,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 00:59:42,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:59:42,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 00:59:42,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 00:59:42,131 INFO L87 Difference]: Start difference. First operand 22840 states and 36799 transitions. Second operand has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 00:59:45,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:59:45,077 INFO L93 Difference]: Finished difference Result 75079 states and 120530 transitions. [2024-11-07 00:59:45,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-07 00:59:45,078 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 91 [2024-11-07 00:59:45,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:59:45,268 INFO L225 Difference]: With dead ends: 75079 [2024-11-07 00:59:45,269 INFO L226 Difference]: Without dead ends: 54372 [2024-11-07 00:59:45,321 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-11-07 00:59:45,323 INFO L432 NwaCegarLoop]: 4238 mSDtfsCounter, 4610 mSDsluCounter, 16785 mSDsCounter, 0 mSdLazyCounter, 1466 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4620 SdHoareTripleChecker+Valid, 21023 SdHoareTripleChecker+Invalid, 1526 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 1466 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:59:45,323 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4620 Valid, 21023 Invalid, 1526 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 1466 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-07 00:59:45,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54372 states. [2024-11-07 00:59:47,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54372 to 43201. [2024-11-07 00:59:47,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43201 states, 38709 states have (on average 1.5279134051512568) internal successors, (59144), 38968 states have internal predecessors, (59144), 2700 states have call successors, (2700), 1535 states have call predecessors, (2700), 1790 states have return successors, (9515), 2953 states have call predecessors, (9515), 2698 states have call successors, (9515) [2024-11-07 00:59:47,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43201 states to 43201 states and 71359 transitions. [2024-11-07 00:59:47,899 INFO L78 Accepts]: Start accepts. Automaton has 43201 states and 71359 transitions. Word has length 91 [2024-11-07 00:59:47,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:59:47,900 INFO L471 AbstractCegarLoop]: Abstraction has 43201 states and 71359 transitions. [2024-11-07 00:59:47,901 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 00:59:47,901 INFO L276 IsEmpty]: Start isEmpty. Operand 43201 states and 71359 transitions. [2024-11-07 00:59:47,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-07 00:59:47,928 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:59:47,928 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:59:47,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-07 00:59:47,928 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:59:47,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:59:47,929 INFO L85 PathProgramCache]: Analyzing trace with hash 2052690569, now seen corresponding path program 1 times [2024-11-07 00:59:47,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:59:47,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656834816] [2024-11-07 00:59:47,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:59:47,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:59:47,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:59:47,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 00:59:47,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:59:47,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-07 00:59:47,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:59:47,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 00:59:47,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:59:48,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 00:59:48,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:59:48,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 00:59:48,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:59:48,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:59:48,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:59:48,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656834816] [2024-11-07 00:59:48,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656834816] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:59:48,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:59:48,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 00:59:48,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866511815] [2024-11-07 00:59:48,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:59:48,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 00:59:48,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:59:48,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 00:59:48,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 00:59:48,018 INFO L87 Difference]: Start difference. First operand 43201 states and 71359 transitions. Second operand has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 00:59:52,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:59:52,372 INFO L93 Difference]: Finished difference Result 117999 states and 191198 transitions. [2024-11-07 00:59:52,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 00:59:52,372 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 91 [2024-11-07 00:59:52,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:59:52,674 INFO L225 Difference]: With dead ends: 117999 [2024-11-07 00:59:52,674 INFO L226 Difference]: Without dead ends: 76932 [2024-11-07 00:59:52,814 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2024-11-07 00:59:52,818 INFO L432 NwaCegarLoop]: 4276 mSDtfsCounter, 4816 mSDsluCounter, 12469 mSDsCounter, 0 mSdLazyCounter, 1242 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4845 SdHoareTripleChecker+Valid, 16745 SdHoareTripleChecker+Invalid, 1321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 1242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-07 00:59:52,818 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4845 Valid, 16745 Invalid, 1321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 1242 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-07 00:59:52,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76932 states. [2024-11-07 00:59:56,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76932 to 63237. [2024-11-07 00:59:56,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63237 states, 56421 states have (on average 1.5080555112458127) internal successors, (85086), 56937 states have internal predecessors, (85086), 4122 states have call successors, (4122), 2309 states have call predecessors, (4122), 2692 states have return successors, (13125), 4246 states have call predecessors, (13125), 4120 states have call successors, (13125) [2024-11-07 00:59:56,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63237 states to 63237 states and 102333 transitions. [2024-11-07 00:59:56,466 INFO L78 Accepts]: Start accepts. Automaton has 63237 states and 102333 transitions. Word has length 91 [2024-11-07 00:59:56,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:59:56,466 INFO L471 AbstractCegarLoop]: Abstraction has 63237 states and 102333 transitions. [2024-11-07 00:59:56,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 00:59:56,467 INFO L276 IsEmpty]: Start isEmpty. Operand 63237 states and 102333 transitions. [2024-11-07 00:59:56,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-07 00:59:56,569 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:59:56,569 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:59:56,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-07 00:59:56,570 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:59:56,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:59:56,570 INFO L85 PathProgramCache]: Analyzing trace with hash -1980373666, now seen corresponding path program 1 times [2024-11-07 00:59:56,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:59:56,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168633548] [2024-11-07 00:59:56,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:59:56,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:59:56,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:59:56,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 00:59:56,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:59:56,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-07 00:59:56,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:59:56,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 00:59:56,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:59:56,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 00:59:56,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:59:56,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 00:59:56,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:59:56,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 00:59:56,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:59:56,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-07 00:59:56,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:59:56,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-07 00:59:56,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:59:56,739 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-07 00:59:56,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:59:56,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168633548] [2024-11-07 00:59:56,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168633548] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 00:59:56,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [500256645] [2024-11-07 00:59:56,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:59:56,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 00:59:56,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 00:59:56,746 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:59:56,747 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:59:56,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:59:56,857 INFO L255 TraceCheckSpWp]: Trace formula consists of 573 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-07 00:59:56,864 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 00:59:56,944 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-07 00:59:56,945 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 00:59:56,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [500256645] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:59:56,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 00:59:56,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [7] total 8 [2024-11-07 00:59:56,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780261713] [2024-11-07 00:59:56,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:59:56,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 00:59:56,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:59:56,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 00:59:56,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-07 00:59:56,946 INFO L87 Difference]: Start difference. First operand 63237 states and 102333 transitions. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 2 states have internal predecessors, (105), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-07 01:00:00,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:00:00,975 INFO L93 Difference]: Finished difference Result 184064 states and 298427 transitions. [2024-11-07 01:00:00,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 01:00:00,975 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 2 states have internal predecessors, (105), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 148 [2024-11-07 01:00:00,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:00:01,814 INFO L225 Difference]: With dead ends: 184064 [2024-11-07 01:00:01,814 INFO L226 Difference]: Without dead ends: 122961 [2024-11-07 01:00:01,930 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-07 01:00:01,931 INFO L432 NwaCegarLoop]: 4237 mSDtfsCounter, 4190 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4190 SdHoareTripleChecker+Valid, 4491 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 01:00:01,931 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4190 Valid, 4491 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 01:00:02,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122961 states.