./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/Problem05_label42+token_ring.11.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4f9af400 extending candidate: java ['java'] extending candidate: /usr/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/oracle-jdk-bin-*/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/openjdk-*/bin/java ['java', '/usr/bin/java'] extending candidate: /usr/lib/jvm/java-*-openjdk-amd64/bin/java ['java', '/usr/bin/java', '/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java', '/usr/lib/jvm/java-17-openjdk-amd64/bin/java', '/usr/lib/jvm/java-11-openjdk-amd64/bin/java', '/usr/lib/jvm/java-1.17.0-openjdk-amd64/bin/java'] ['/root/.sdkman/candidates/java/21.0.5-tem/bin/java', '-Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config', '-Xmx15G', '-Xms4m', '-jar', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar', '-data', '@noDefault', '-ultimatedata', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data', '-tc', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml', '-i', '../sv-benchmarks/c/combinations/Problem05_label42+token_ring.11.cil-1.c', '-s', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf', '--cacsl2boogietranslator.entry.function', 'main', '--witnessprinter.witness.directory', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux', '--witnessprinter.witness.filename', 'witness', '--witnessprinter.write.witness.besides.input.file', 'false', '--witnessprinter.graph.data.specification', 'CHECK( init(main()), LTL(G ! call(reach_error())) )\n\n', '--witnessprinter.graph.data.producer', 'Automizer', '--witnessprinter.graph.data.architecture', '32bit', '--witnessprinter.graph.data.programhash', '257fbefed94a1e5b18da17b648f63b8a4a376ab6bd67ba2a090c30b5997c5667'] Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/Problem05_label42+token_ring.11.cil-1.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 257fbefed94a1e5b18da17b648f63b8a4a376ab6bd67ba2a090c30b5997c5667 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 00:57:51,460 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 00:57:51,535 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-07 00:57:51,539 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 00:57:51,540 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 00:57:51,563 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 00:57:51,563 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 00:57:51,563 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 00:57:51,564 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 00:57:51,564 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 00:57:51,564 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 00:57:51,564 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 00:57:51,564 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 00:57:51,564 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 00:57:51,564 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 00:57:51,564 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 00:57:51,564 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 00:57:51,564 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 00:57:51,564 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 00:57:51,564 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 00:57:51,564 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 00:57:51,564 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 00:57:51,564 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 00:57:51,565 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 00:57:51,565 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 00:57:51,565 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 00:57:51,565 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 00:57:51,565 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 00:57:51,565 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 00:57:51,565 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 00:57:51,565 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 00:57:51,565 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 00:57:51,565 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 00:57:51,565 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 00:57:51,565 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 00:57:51,565 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 00:57:51,565 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 00:57:51,565 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 00:57:51,565 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 00:57:51,565 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 00:57:51,565 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 00:57:51,565 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 00:57:51,566 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 -> 257fbefed94a1e5b18da17b648f63b8a4a376ab6bd67ba2a090c30b5997c5667 [2024-11-07 00:57:51,803 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 00:57:51,812 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 00:57:51,813 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 00:57:51,814 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 00:57:51,814 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 00:57:51,815 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/Problem05_label42+token_ring.11.cil-1.c [2024-11-07 00:57:52,940 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 00:57:53,488 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 00:57:53,489 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label42+token_ring.11.cil-1.c [2024-11-07 00:57:53,527 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8b60dc083/07419f56ccf0451a9691f60bab4ebf00/FLAGac1150222 [2024-11-07 00:57:53,538 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8b60dc083/07419f56ccf0451a9691f60bab4ebf00 [2024-11-07 00:57:53,540 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 00:57:53,542 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 00:57:53,543 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 00:57:53,543 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 00:57:53,546 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 00:57:53,547 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:57:53" (1/1) ... [2024-11-07 00:57:53,547 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22015b96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:57:53, skipping insertion in model container [2024-11-07 00:57:53,548 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:57:53" (1/1) ... [2024-11-07 00:57:53,677 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 00:57:54,584 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label42+token_ring.11.cil-1.c[378560,378573] [2024-11-07 00:57:54,603 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label42+token_ring.11.cil-1.c[383339,383352] [2024-11-07 00:57:54,767 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 00:57:54,775 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 00:57:55,248 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label42+token_ring.11.cil-1.c[378560,378573] [2024-11-07 00:57:55,253 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label42+token_ring.11.cil-1.c[383339,383352] [2024-11-07 00:57:55,278 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 00:57:55,336 INFO L204 MainTranslator]: Completed translation [2024-11-07 00:57:55,340 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:57:55 WrapperNode [2024-11-07 00:57:55,341 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 00:57:55,341 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 00:57:55,342 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 00:57:55,342 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 00:57:55,354 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:57:55" (1/1) ... [2024-11-07 00:57:55,429 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:57:55" (1/1) ... [2024-11-07 00:57:55,759 INFO L138 Inliner]: procedures = 66, calls = 75, calls flagged for inlining = 43, calls inlined = 43, statements flattened = 13179 [2024-11-07 00:57:55,760 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 00:57:55,760 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 00:57:55,760 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 00:57:55,760 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 00:57:55,777 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:57:55" (1/1) ... [2024-11-07 00:57:55,778 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:57:55" (1/1) ... [2024-11-07 00:57:55,847 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:57:55" (1/1) ... [2024-11-07 00:57:55,984 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-07 00:57:55,984 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:57:55" (1/1) ... [2024-11-07 00:57:55,984 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:57:55" (1/1) ... [2024-11-07 00:57:56,134 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:57:55" (1/1) ... [2024-11-07 00:57:56,174 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:57:55" (1/1) ... [2024-11-07 00:57:56,205 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:57:55" (1/1) ... [2024-11-07 00:57:56,225 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:57:55" (1/1) ... [2024-11-07 00:57:56,268 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 00:57:56,270 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 00:57:56,271 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 00:57:56,271 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 00:57:56,272 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:57:55" (1/1) ... [2024-11-07 00:57:56,277 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 00:57:56,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 00:57:56,297 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-07 00:57:56,300 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-07 00:57:56,317 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 00:57:56,317 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2024-11-07 00:57:56,317 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2024-11-07 00:57:56,317 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-11-07 00:57:56,317 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-11-07 00:57:56,317 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2024-11-07 00:57:56,317 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2024-11-07 00:57:56,317 INFO L130 BoogieDeclarations]: Found specification of procedure error [2024-11-07 00:57:56,317 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2024-11-07 00:57:56,318 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2024-11-07 00:57:56,318 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2024-11-07 00:57:56,318 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2024-11-07 00:57:56,318 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2024-11-07 00:57:56,318 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2024-11-07 00:57:56,318 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2024-11-07 00:57:56,318 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 00:57:56,318 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 00:57:56,318 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 00:57:56,417 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 00:57:56,419 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 00:58:02,389 INFO L? ?]: Removed 1753 outVars from TransFormulas that were not future-live. [2024-11-07 00:58:02,390 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 00:58:02,433 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 00:58:02,433 INFO L316 CfgBuilder]: Removed 15 assume(true) statements. [2024-11-07 00:58:02,433 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:58:02 BoogieIcfgContainer [2024-11-07 00:58:02,433 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 00:58:02,438 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 00:58:02,439 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 00:58:02,443 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 00:58:02,443 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 12:57:53" (1/3) ... [2024-11-07 00:58:02,443 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45013a57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:58:02, skipping insertion in model container [2024-11-07 00:58:02,444 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:57:55" (2/3) ... [2024-11-07 00:58:02,444 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45013a57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:58:02, skipping insertion in model container [2024-11-07 00:58:02,444 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:58:02" (3/3) ... [2024-11-07 00:58:02,445 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem05_label42+token_ring.11.cil-1.c [2024-11-07 00:58:02,455 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 00:58:02,455 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-07 00:58:02,542 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 00:58:02,550 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;@370b1852, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 00:58:02,550 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-07 00:58:02,561 INFO L276 IsEmpty]: Start isEmpty. Operand has 2560 states, 2523 states have (on average 1.840665873959572) internal successors, (4644), 2528 states have internal predecessors, (4644), 27 states have call successors, (27), 7 states have call predecessors, (27), 7 states have return successors, (27), 26 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-07 00:58:02,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-07 00:58:02,576 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:58:02,579 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:58:02,580 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:58:02,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:58:02,583 INFO L85 PathProgramCache]: Analyzing trace with hash -1643265123, now seen corresponding path program 1 times [2024-11-07 00:58:02,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:58:02,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687381332] [2024-11-07 00:58:02,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:58:02,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:58:02,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:58:02,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 00:58:02,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:58:02,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 00:58:02,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:58:02,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 00:58:02,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:58:03,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-07 00:58:03,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:58:03,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-07 00:58:03,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:58:03,036 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:58:03,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:58:03,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687381332] [2024-11-07 00:58:03,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687381332] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:58:03,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:58:03,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 00:58:03,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3948993] [2024-11-07 00:58:03,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:58:03,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 00:58:03,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:58:03,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 00:58:03,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 00:58:03,061 INFO L87 Difference]: Start difference. First operand has 2560 states, 2523 states have (on average 1.840665873959572) internal successors, (4644), 2528 states have internal predecessors, (4644), 27 states have call successors, (27), 7 states have call predecessors, (27), 7 states have return successors, (27), 26 states have call predecessors, (27), 27 states have call successors, (27) Second operand has 5 states, 5 states have (on average 31.4) internal successors, (157), 3 states have internal predecessors, (157), 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:58:04,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:58:04,538 INFO L93 Difference]: Finished difference Result 5238 states and 9599 transitions. [2024-11-07 00:58:04,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 00:58:04,541 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.4) internal successors, (157), 3 states have internal predecessors, (157), 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 168 [2024-11-07 00:58:04,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:58:04,564 INFO L225 Difference]: With dead ends: 5238 [2024-11-07 00:58:04,566 INFO L226 Difference]: Without dead ends: 2623 [2024-11-07 00:58:04,575 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-07 00:58:04,578 INFO L432 NwaCegarLoop]: 4371 mSDtfsCounter, 983 mSDsluCounter, 12481 mSDsCounter, 0 mSdLazyCounter, 960 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1006 SdHoareTripleChecker+Valid, 16852 SdHoareTripleChecker+Invalid, 1018 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 960 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-07 00:58:04,580 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1006 Valid, 16852 Invalid, 1018 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 960 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-07 00:58:04,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2623 states. [2024-11-07 00:58:04,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2623 to 2492. [2024-11-07 00:58:04,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2492 states, 2457 states have (on average 1.8245828245828246) internal successors, (4483), 2460 states have internal predecessors, (4483), 27 states have call successors, (27), 7 states have call predecessors, (27), 6 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-07 00:58:04,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2492 states to 2492 states and 4535 transitions. [2024-11-07 00:58:04,700 INFO L78 Accepts]: Start accepts. Automaton has 2492 states and 4535 transitions. Word has length 168 [2024-11-07 00:58:04,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:58:04,700 INFO L471 AbstractCegarLoop]: Abstraction has 2492 states and 4535 transitions. [2024-11-07 00:58:04,700 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.4) internal successors, (157), 3 states have internal predecessors, (157), 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:58:04,700 INFO L276 IsEmpty]: Start isEmpty. Operand 2492 states and 4535 transitions. [2024-11-07 00:58:04,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-07 00:58:04,707 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:58:04,707 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:58:04,707 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 00:58:04,708 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:58:04,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:58:04,708 INFO L85 PathProgramCache]: Analyzing trace with hash -238073445, now seen corresponding path program 1 times [2024-11-07 00:58:04,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:58:04,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716218829] [2024-11-07 00:58:04,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:58:04,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:58:04,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:58:04,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 00:58:04,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:58:04,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 00:58:04,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:58:04,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 00:58:05,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:58:05,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-07 00:58:05,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:58:05,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-07 00:58:05,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:58:05,036 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:58:05,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:58:05,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716218829] [2024-11-07 00:58:05,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1716218829] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:58:05,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:58:05,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 00:58:05,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487991102] [2024-11-07 00:58:05,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:58:05,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 00:58:05,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:58:05,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 00:58:05,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 00:58:05,041 INFO L87 Difference]: Start difference. First operand 2492 states and 4535 transitions. Second operand has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 4 states have internal predecessors, (157), 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:58:07,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:58:07,418 INFO L93 Difference]: Finished difference Result 3474 states and 6110 transitions. [2024-11-07 00:58:07,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 00:58:07,419 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 4 states have internal predecessors, (157), 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 168 [2024-11-07 00:58:07,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:58:07,429 INFO L225 Difference]: With dead ends: 3474 [2024-11-07 00:58:07,430 INFO L226 Difference]: Without dead ends: 3122 [2024-11-07 00:58:07,431 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-11-07 00:58:07,432 INFO L432 NwaCegarLoop]: 4274 mSDtfsCounter, 5431 mSDsluCounter, 12841 mSDsCounter, 0 mSdLazyCounter, 2102 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5449 SdHoareTripleChecker+Valid, 17115 SdHoareTripleChecker+Invalid, 2214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 2102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-07 00:58:07,432 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5449 Valid, 17115 Invalid, 2214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 2102 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-07 00:58:07,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3122 states. [2024-11-07 00:58:07,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3122 to 2859. [2024-11-07 00:58:07,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2859 states, 2797 states have (on average 1.794780121558813) internal successors, (5020), 2801 states have internal predecessors, (5020), 47 states have call successors, (47), 13 states have call predecessors, (47), 13 states have return successors, (48), 45 states have call predecessors, (48), 45 states have call successors, (48) [2024-11-07 00:58:07,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2859 states to 2859 states and 5115 transitions. [2024-11-07 00:58:07,541 INFO L78 Accepts]: Start accepts. Automaton has 2859 states and 5115 transitions. Word has length 168 [2024-11-07 00:58:07,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:58:07,542 INFO L471 AbstractCegarLoop]: Abstraction has 2859 states and 5115 transitions. [2024-11-07 00:58:07,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 4 states have internal predecessors, (157), 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:58:07,542 INFO L276 IsEmpty]: Start isEmpty. Operand 2859 states and 5115 transitions. [2024-11-07 00:58:07,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-07 00:58:07,544 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:58:07,544 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:58:07,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 00:58:07,544 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:58:07,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:58:07,544 INFO L85 PathProgramCache]: Analyzing trace with hash 684327063, now seen corresponding path program 1 times [2024-11-07 00:58:07,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:58:07,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790960097] [2024-11-07 00:58:07,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:58:07,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:58:07,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:58:07,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 00:58:07,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:58:07,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 00:58:07,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:58:07,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 00:58:07,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:58:07,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-07 00:58:07,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:58:07,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-07 00:58:07,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:58:07,818 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:58:07,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:58:07,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790960097] [2024-11-07 00:58:07,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1790960097] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:58:07,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:58:07,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 00:58:07,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415637368] [2024-11-07 00:58:07,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:58:07,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 00:58:07,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:58:07,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 00:58:07,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 00:58:07,821 INFO L87 Difference]: Start difference. First operand 2859 states and 5115 transitions. Second operand has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 5 states have internal predecessors, (157), 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:58:10,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:58:10,369 INFO L93 Difference]: Finished difference Result 4356 states and 7519 transitions. [2024-11-07 00:58:10,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 00:58:10,370 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 5 states have internal predecessors, (157), 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 168 [2024-11-07 00:58:10,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:58:10,381 INFO L225 Difference]: With dead ends: 4356 [2024-11-07 00:58:10,381 INFO L226 Difference]: Without dead ends: 3637 [2024-11-07 00:58:10,383 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-07 00:58:10,384 INFO L432 NwaCegarLoop]: 4519 mSDtfsCounter, 5458 mSDsluCounter, 17767 mSDsCounter, 0 mSdLazyCounter, 3342 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5476 SdHoareTripleChecker+Valid, 22286 SdHoareTripleChecker+Invalid, 3405 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 3342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-07 00:58:10,384 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5476 Valid, 22286 Invalid, 3405 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 3342 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-07 00:58:10,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3637 states. [2024-11-07 00:58:10,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3637 to 3201. [2024-11-07 00:58:10,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3201 states, 3112 states have (on average 1.7696015424164524) internal successors, (5507), 3117 states have internal predecessors, (5507), 67 states have call successors, (67), 19 states have call predecessors, (67), 20 states have return successors, (70), 66 states have call predecessors, (70), 65 states have call successors, (70) [2024-11-07 00:58:10,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3201 states to 3201 states and 5644 transitions. [2024-11-07 00:58:10,532 INFO L78 Accepts]: Start accepts. Automaton has 3201 states and 5644 transitions. Word has length 168 [2024-11-07 00:58:10,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:58:10,532 INFO L471 AbstractCegarLoop]: Abstraction has 3201 states and 5644 transitions. [2024-11-07 00:58:10,532 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 5 states have internal predecessors, (157), 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:58:10,532 INFO L276 IsEmpty]: Start isEmpty. Operand 3201 states and 5644 transitions. [2024-11-07 00:58:10,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-07 00:58:10,534 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:58:10,534 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:58:10,534 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 00:58:10,534 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:58:10,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:58:10,535 INFO L85 PathProgramCache]: Analyzing trace with hash -1713660775, now seen corresponding path program 1 times [2024-11-07 00:58:10,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:58:10,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196842846] [2024-11-07 00:58:10,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:58:10,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:58:10,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:58:10,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 00:58:10,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:58:10,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 00:58:10,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:58:10,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 00:58:10,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:58:10,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-07 00:58:10,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:58:10,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-07 00:58:10,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:58:10,898 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:58:10,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:58:10,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196842846] [2024-11-07 00:58:10,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [196842846] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:58:10,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:58:10,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 00:58:10,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348136424] [2024-11-07 00:58:10,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:58:10,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 00:58:10,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:58:10,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 00:58:10,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 00:58:10,900 INFO L87 Difference]: Start difference. First operand 3201 states and 5644 transitions. Second operand has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 5 states have internal predecessors, (157), 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:58:13,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:58:13,367 INFO L93 Difference]: Finished difference Result 5657 states and 9580 transitions. [2024-11-07 00:58:13,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 00:58:13,367 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 5 states have internal predecessors, (157), 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 168 [2024-11-07 00:58:13,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:58:13,380 INFO L225 Difference]: With dead ends: 5657 [2024-11-07 00:58:13,380 INFO L226 Difference]: Without dead ends: 4596 [2024-11-07 00:58:13,382 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-07 00:58:13,383 INFO L432 NwaCegarLoop]: 4517 mSDtfsCounter, 5456 mSDsluCounter, 17767 mSDsCounter, 0 mSdLazyCounter, 3338 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5474 SdHoareTripleChecker+Valid, 22284 SdHoareTripleChecker+Invalid, 3403 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 3338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-07 00:58:13,383 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5474 Valid, 22284 Invalid, 3403 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 3338 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-07 00:58:13,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4596 states. [2024-11-07 00:58:13,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4596 to 3886. [2024-11-07 00:58:13,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3886 states, 3743 states have (on average 1.7317659631311781) internal successors, (6482), 3750 states have internal predecessors, (6482), 107 states have call successors, (107), 31 states have call predecessors, (107), 34 states have return successors, (118), 108 states have call predecessors, (118), 105 states have call successors, (118) [2024-11-07 00:58:13,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3886 states to 3886 states and 6707 transitions. [2024-11-07 00:58:13,473 INFO L78 Accepts]: Start accepts. Automaton has 3886 states and 6707 transitions. Word has length 168 [2024-11-07 00:58:13,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:58:13,473 INFO L471 AbstractCegarLoop]: Abstraction has 3886 states and 6707 transitions. [2024-11-07 00:58:13,474 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 5 states have internal predecessors, (157), 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:58:13,474 INFO L276 IsEmpty]: Start isEmpty. Operand 3886 states and 6707 transitions. [2024-11-07 00:58:13,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-07 00:58:13,479 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:58:13,479 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:58:13,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 00:58:13,479 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:58:13,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:58:13,479 INFO L85 PathProgramCache]: Analyzing trace with hash -1375373225, now seen corresponding path program 1 times [2024-11-07 00:58:13,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:58:13,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324472705] [2024-11-07 00:58:13,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:58:13,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:58:13,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:58:13,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 00:58:13,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:58:13,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 00:58:13,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:58:13,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 00:58:13,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:58:13,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-07 00:58:13,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:58:13,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-07 00:58:13,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:58:13,677 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:58:13,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:58:13,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324472705] [2024-11-07 00:58:13,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1324472705] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:58:13,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:58:13,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 00:58:13,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137722026] [2024-11-07 00:58:13,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:58:13,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 00:58:13,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:58:13,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 00:58:13,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 00:58:13,681 INFO L87 Difference]: Start difference. First operand 3886 states and 6707 transitions. Second operand has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 5 states have internal predecessors, (157), 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:58:16,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:58:16,229 INFO L93 Difference]: Finished difference Result 8162 states and 13523 transitions. [2024-11-07 00:58:16,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 00:58:16,229 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 5 states have internal predecessors, (157), 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 168 [2024-11-07 00:58:16,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:58:16,247 INFO L225 Difference]: With dead ends: 8162 [2024-11-07 00:58:16,247 INFO L226 Difference]: Without dead ends: 6416 [2024-11-07 00:58:16,251 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-07 00:58:16,251 INFO L432 NwaCegarLoop]: 4517 mSDtfsCounter, 5452 mSDsluCounter, 17767 mSDsCounter, 0 mSdLazyCounter, 3329 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5470 SdHoareTripleChecker+Valid, 22284 SdHoareTripleChecker+Invalid, 3394 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 3329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-07 00:58:16,252 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5470 Valid, 22284 Invalid, 3394 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 3329 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-07 00:58:16,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6416 states. [2024-11-07 00:58:16,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6416 to 5257. [2024-11-07 00:58:16,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5257 states, 5006 states have (on average 1.6843787455053936) internal successors, (8432), 5017 states have internal predecessors, (8432), 187 states have call successors, (187), 55 states have call predecessors, (187), 62 states have return successors, (220), 192 states have call predecessors, (220), 185 states have call successors, (220) [2024-11-07 00:58:16,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5257 states to 5257 states and 8839 transitions. [2024-11-07 00:58:16,387 INFO L78 Accepts]: Start accepts. Automaton has 5257 states and 8839 transitions. Word has length 168 [2024-11-07 00:58:16,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:58:16,387 INFO L471 AbstractCegarLoop]: Abstraction has 5257 states and 8839 transitions. [2024-11-07 00:58:16,387 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 5 states have internal predecessors, (157), 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:58:16,387 INFO L276 IsEmpty]: Start isEmpty. Operand 5257 states and 8839 transitions. [2024-11-07 00:58:16,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-07 00:58:16,432 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:58:16,432 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:58:16,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 00:58:16,433 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:58:16,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:58:16,434 INFO L85 PathProgramCache]: Analyzing trace with hash -948818727, now seen corresponding path program 1 times [2024-11-07 00:58:16,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:58:16,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341281079] [2024-11-07 00:58:16,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:58:16,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:58:16,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:58:16,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 00:58:16,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:58:16,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 00:58:16,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:58:16,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 00:58:16,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:58:16,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-07 00:58:16,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:58:16,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-07 00:58:16,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:58:16,654 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:58:16,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:58:16,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341281079] [2024-11-07 00:58:16,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1341281079] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:58:16,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:58:16,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 00:58:16,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831736014] [2024-11-07 00:58:16,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:58:16,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 00:58:16,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:58:16,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 00:58:16,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 00:58:16,656 INFO L87 Difference]: Start difference. First operand 5257 states and 8839 transitions. Second operand has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 5 states have internal predecessors, (157), 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:58:19,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:58:19,378 INFO L93 Difference]: Finished difference Result 13171 states and 21425 transitions. [2024-11-07 00:58:19,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 00:58:19,378 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 5 states have internal predecessors, (157), 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 168 [2024-11-07 00:58:19,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:58:19,414 INFO L225 Difference]: With dead ends: 13171 [2024-11-07 00:58:19,414 INFO L226 Difference]: Without dead ends: 10054 [2024-11-07 00:58:19,421 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-07 00:58:19,423 INFO L432 NwaCegarLoop]: 4517 mSDtfsCounter, 5448 mSDsluCounter, 17767 mSDsCounter, 0 mSdLazyCounter, 3320 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5466 SdHoareTripleChecker+Valid, 22284 SdHoareTripleChecker+Invalid, 3385 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 3320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-07 00:58:19,424 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5466 Valid, 22284 Invalid, 3385 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 3320 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-07 00:58:19,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10054 states. [2024-11-07 00:58:19,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10054 to 8004. [2024-11-07 00:58:19,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8004 states, 7537 states have (on average 1.6369908451638584) internal successors, (12338), 7556 states have internal predecessors, (12338), 347 states have call successors, (347), 103 states have call predecessors, (347), 118 states have return successors, (442), 360 states have call predecessors, (442), 345 states have call successors, (442) [2024-11-07 00:58:19,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8004 states to 8004 states and 13127 transitions. [2024-11-07 00:58:19,705 INFO L78 Accepts]: Start accepts. Automaton has 8004 states and 13127 transitions. Word has length 168 [2024-11-07 00:58:19,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:58:19,705 INFO L471 AbstractCegarLoop]: Abstraction has 8004 states and 13127 transitions. [2024-11-07 00:58:19,705 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 5 states have internal predecessors, (157), 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:58:19,706 INFO L276 IsEmpty]: Start isEmpty. Operand 8004 states and 13127 transitions. [2024-11-07 00:58:19,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-07 00:58:19,709 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:58:19,709 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:58:19,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 00:58:19,709 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:58:19,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:58:19,710 INFO L85 PathProgramCache]: Analyzing trace with hash -1489248233, now seen corresponding path program 1 times [2024-11-07 00:58:19,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:58:19,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732901426] [2024-11-07 00:58:19,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:58:19,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:58:19,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:58:19,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 00:58:19,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:58:19,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 00:58:19,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:58:19,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 00:58:19,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:58:19,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-07 00:58:19,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:58:19,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-07 00:58:19,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:58:19,912 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:58:19,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:58:19,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732901426] [2024-11-07 00:58:19,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732901426] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:58:19,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:58:19,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 00:58:19,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397973261] [2024-11-07 00:58:19,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:58:19,914 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 00:58:19,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:58:19,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 00:58:19,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 00:58:19,914 INFO L87 Difference]: Start difference. First operand 8004 states and 13127 transitions. Second operand has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 5 states have internal predecessors, (157), 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:58:22,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:58:22,685 INFO L93 Difference]: Finished difference Result 23188 states and 37287 transitions. [2024-11-07 00:58:22,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 00:58:22,686 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 5 states have internal predecessors, (157), 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 168 [2024-11-07 00:58:22,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:58:22,726 INFO L225 Difference]: With dead ends: 23188 [2024-11-07 00:58:22,726 INFO L226 Difference]: Without dead ends: 17324 [2024-11-07 00:58:22,740 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-07 00:58:22,740 INFO L432 NwaCegarLoop]: 4517 mSDtfsCounter, 5450 mSDsluCounter, 17767 mSDsCounter, 0 mSdLazyCounter, 3306 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5468 SdHoareTripleChecker+Valid, 22284 SdHoareTripleChecker+Invalid, 3371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 3306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-07 00:58:22,740 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5468 Valid, 22284 Invalid, 3371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 3306 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-07 00:58:22,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17324 states. [2024-11-07 00:58:23,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17324 to 13511. [2024-11-07 00:58:23,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13511 states, 12612 states have (on average 1.5991119568664764) internal successors, (20168), 12647 states have internal predecessors, (20168), 667 states have call successors, (667), 199 states have call predecessors, (667), 230 states have return successors, (940), 696 states have call predecessors, (940), 665 states have call successors, (940) [2024-11-07 00:58:23,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13511 states to 13511 states and 21775 transitions. [2024-11-07 00:58:23,428 INFO L78 Accepts]: Start accepts. Automaton has 13511 states and 21775 transitions. Word has length 168 [2024-11-07 00:58:23,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:58:23,429 INFO L471 AbstractCegarLoop]: Abstraction has 13511 states and 21775 transitions. [2024-11-07 00:58:23,430 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 5 states have internal predecessors, (157), 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:58:23,430 INFO L276 IsEmpty]: Start isEmpty. Operand 13511 states and 21775 transitions. [2024-11-07 00:58:23,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-07 00:58:23,436 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:58:23,436 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:58:23,436 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 00:58:23,437 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:58:23,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:58:23,437 INFO L85 PathProgramCache]: Analyzing trace with hash -1645228775, now seen corresponding path program 1 times [2024-11-07 00:58:23,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:58:23,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894617140] [2024-11-07 00:58:23,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:58:23,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:58:23,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:58:23,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 00:58:23,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:58:23,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 00:58:23,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:58:23,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 00:58:23,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:58:23,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-07 00:58:23,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:58:23,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-07 00:58:23,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:58:23,634 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:58:23,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:58:23,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894617140] [2024-11-07 00:58:23,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1894617140] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:58:23,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:58:23,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 00:58:23,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82445943] [2024-11-07 00:58:23,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:58:23,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 00:58:23,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:58:23,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 00:58:23,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-07 00:58:23,636 INFO L87 Difference]: Start difference. First operand 13511 states and 21775 transitions. Second operand has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 5 states have internal predecessors, (157), 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:58:25,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:58:25,456 INFO L93 Difference]: Finished difference Result 28900 states and 46552 transitions. [2024-11-07 00:58:25,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 00:58:25,456 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 5 states have internal predecessors, (157), 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 168 [2024-11-07 00:58:25,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:58:25,502 INFO L225 Difference]: With dead ends: 28900 [2024-11-07 00:58:25,503 INFO L226 Difference]: Without dead ends: 17529 [2024-11-07 00:58:25,572 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-11-07 00:58:25,573 INFO L432 NwaCegarLoop]: 4259 mSDtfsCounter, 5043 mSDsluCounter, 16783 mSDsCounter, 0 mSdLazyCounter, 1676 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5062 SdHoareTripleChecker+Valid, 21042 SdHoareTripleChecker+Invalid, 1743 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 1676 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:58:25,573 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5062 Valid, 21042 Invalid, 1743 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 1676 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-07 00:58:25,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17529 states. [2024-11-07 00:58:25,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17529 to 13511. [2024-11-07 00:58:26,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13511 states, 12612 states have (on average 1.5964954012052015) internal successors, (20135), 12647 states have internal predecessors, (20135), 667 states have call successors, (667), 199 states have call predecessors, (667), 230 states have return successors, (940), 696 states have call predecessors, (940), 665 states have call successors, (940) [2024-11-07 00:58:26,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13511 states to 13511 states and 21742 transitions. [2024-11-07 00:58:26,031 INFO L78 Accepts]: Start accepts. Automaton has 13511 states and 21742 transitions. Word has length 168 [2024-11-07 00:58:26,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:58:26,032 INFO L471 AbstractCegarLoop]: Abstraction has 13511 states and 21742 transitions. [2024-11-07 00:58:26,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 5 states have internal predecessors, (157), 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:58:26,032 INFO L276 IsEmpty]: Start isEmpty. Operand 13511 states and 21742 transitions. [2024-11-07 00:58:26,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-07 00:58:26,038 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:58:26,038 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:58:26,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-07 00:58:26,038 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:58:26,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:58:26,039 INFO L85 PathProgramCache]: Analyzing trace with hash 861868699, now seen corresponding path program 1 times [2024-11-07 00:58:26,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:58:26,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464798032] [2024-11-07 00:58:26,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:58:26,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:58:26,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:58:26,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 00:58:26,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:58:26,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 00:58:26,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:58:26,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 00:58:26,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:58:26,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-07 00:58:26,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:58:26,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-07 00:58:26,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:58:26,226 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:58:26,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:58:26,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464798032] [2024-11-07 00:58:26,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464798032] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:58:26,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:58:26,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 00:58:26,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758481896] [2024-11-07 00:58:26,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:58:26,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 00:58:26,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:58:26,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 00:58:26,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 00:58:26,228 INFO L87 Difference]: Start difference. First operand 13511 states and 21742 transitions. Second operand has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 5 states have internal predecessors, (157), 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:58:29,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:58:29,722 INFO L93 Difference]: Finished difference Result 43156 states and 68909 transitions. [2024-11-07 00:58:29,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 00:58:29,725 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 5 states have internal predecessors, (157), 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 168 [2024-11-07 00:58:29,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:58:29,823 INFO L225 Difference]: With dead ends: 43156 [2024-11-07 00:58:29,823 INFO L226 Difference]: Without dead ends: 31785 [2024-11-07 00:58:29,854 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-07 00:58:29,855 INFO L432 NwaCegarLoop]: 4517 mSDtfsCounter, 5439 mSDsluCounter, 17767 mSDsCounter, 0 mSdLazyCounter, 3253 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5457 SdHoareTripleChecker+Valid, 22284 SdHoareTripleChecker+Invalid, 3318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 3253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:58:29,855 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5457 Valid, 22284 Invalid, 3318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 3253 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-07 00:58:29,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31785 states. [2024-11-07 00:58:30,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31785 to 24620. [2024-11-07 00:58:30,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24620 states, 22857 states have (on average 1.570853567834799) internal successors, (35905), 22924 states have internal predecessors, (35905), 1307 states have call successors, (1307), 391 states have call predecessors, (1307), 454 states have return successors, (2098), 1368 states have call predecessors, (2098), 1305 states have call successors, (2098) [2024-11-07 00:58:30,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24620 states to 24620 states and 39310 transitions. [2024-11-07 00:58:30,946 INFO L78 Accepts]: Start accepts. Automaton has 24620 states and 39310 transitions. Word has length 168 [2024-11-07 00:58:30,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:58:30,946 INFO L471 AbstractCegarLoop]: Abstraction has 24620 states and 39310 transitions. [2024-11-07 00:58:30,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 5 states have internal predecessors, (157), 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:58:30,946 INFO L276 IsEmpty]: Start isEmpty. Operand 24620 states and 39310 transitions. [2024-11-07 00:58:30,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-07 00:58:30,956 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:58:30,956 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:58:30,956 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-07 00:58:30,956 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:58:30,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:58:30,957 INFO L85 PathProgramCache]: Analyzing trace with hash -1274014503, now seen corresponding path program 1 times [2024-11-07 00:58:30,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:58:30,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372663071] [2024-11-07 00:58:30,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:58:30,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:58:30,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:58:31,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 00:58:31,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:58:31,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 00:58:31,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:58:31,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 00:58:31,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:58:31,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-07 00:58:31,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:58:31,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-07 00:58:31,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:58:31,141 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:58:31,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:58:31,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372663071] [2024-11-07 00:58:31,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372663071] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:58:31,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:58:31,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 00:58:31,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67959310] [2024-11-07 00:58:31,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:58:31,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 00:58:31,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:58:31,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 00:58:31,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 00:58:31,143 INFO L87 Difference]: Start difference. First operand 24620 states and 39310 transitions. Second operand has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 5 states have internal predecessors, (157), 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:58:35,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:58:35,376 INFO L93 Difference]: Finished difference Result 83227 states and 133155 transitions. [2024-11-07 00:58:35,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 00:58:35,377 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 5 states have internal predecessors, (157), 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 168 [2024-11-07 00:58:35,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:58:35,535 INFO L225 Difference]: With dead ends: 83227 [2024-11-07 00:58:35,536 INFO L226 Difference]: Without dead ends: 60747 [2024-11-07 00:58:35,590 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-07 00:58:35,594 INFO L432 NwaCegarLoop]: 4517 mSDtfsCounter, 5438 mSDsluCounter, 17767 mSDsCounter, 0 mSdLazyCounter, 3240 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5456 SdHoareTripleChecker+Valid, 22284 SdHoareTripleChecker+Invalid, 3305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 3240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-07 00:58:35,594 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5456 Valid, 22284 Invalid, 3305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 3240 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-07 00:58:35,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60747 states. [2024-11-07 00:58:37,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60747 to 46897. [2024-11-07 00:58:37,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46897 states, 43406 states have (on average 1.555798737501728) internal successors, (67531), 43537 states have internal predecessors, (67531), 2587 states have call successors, (2587), 775 states have call predecessors, (2587), 902 states have return successors, (4900), 2712 states have call predecessors, (4900), 2585 states have call successors, (4900) [2024-11-07 00:58:37,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46897 states to 46897 states and 75018 transitions. [2024-11-07 00:58:37,427 INFO L78 Accepts]: Start accepts. Automaton has 46897 states and 75018 transitions. Word has length 168 [2024-11-07 00:58:37,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:58:37,428 INFO L471 AbstractCegarLoop]: Abstraction has 46897 states and 75018 transitions. [2024-11-07 00:58:37,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 5 states have internal predecessors, (157), 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:58:37,428 INFO L276 IsEmpty]: Start isEmpty. Operand 46897 states and 75018 transitions. [2024-11-07 00:58:37,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-07 00:58:37,446 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:58:37,446 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:58:37,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-07 00:58:37,446 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:58:37,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:58:37,447 INFO L85 PathProgramCache]: Analyzing trace with hash -1204366629, now seen corresponding path program 1 times [2024-11-07 00:58:37,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:58:37,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865844436] [2024-11-07 00:58:37,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:58:37,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:58:37,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:58:37,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 00:58:37,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:58:37,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 00:58:37,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:58:37,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 00:58:37,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:58:37,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-07 00:58:37,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:58:37,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-07 00:58:37,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:58:37,615 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:58:37,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:58:37,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865844436] [2024-11-07 00:58:37,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865844436] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:58:37,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:58:37,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 00:58:37,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378312541] [2024-11-07 00:58:37,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:58:37,616 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 00:58:37,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:58:37,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 00:58:37,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 00:58:37,616 INFO L87 Difference]: Start difference. First operand 46897 states and 75018 transitions. Second operand has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 5 states have internal predecessors, (157), 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:58:44,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:58:44,374 INFO L93 Difference]: Finished difference Result 163366 states and 263489 transitions. [2024-11-07 00:58:44,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 00:58:44,375 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 5 states have internal predecessors, (157), 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 168 [2024-11-07 00:58:44,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:58:44,775 INFO L225 Difference]: With dead ends: 163366 [2024-11-07 00:58:44,775 INFO L226 Difference]: Without dead ends: 118609 [2024-11-07 00:58:44,893 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-07 00:58:44,894 INFO L432 NwaCegarLoop]: 4517 mSDtfsCounter, 5437 mSDsluCounter, 17767 mSDsCounter, 0 mSdLazyCounter, 3227 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5455 SdHoareTripleChecker+Valid, 22284 SdHoareTripleChecker+Invalid, 3292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 3227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-07 00:58:44,894 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5455 Valid, 22284 Invalid, 3292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 3227 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-07 00:58:44,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118609 states. [2024-11-07 00:58:48,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118609 to 91578. [2024-11-07 00:58:48,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91578 states, 84631 states have (on average 1.5475771289480214) internal successors, (130973), 84890 states have internal predecessors, (130973), 5147 states have call successors, (5147), 1543 states have call predecessors, (5147), 1798 states have return successors, (11962), 5400 states have call predecessors, (11962), 5145 states have call successors, (11962) [2024-11-07 00:58:48,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91578 states to 91578 states and 148082 transitions. [2024-11-07 00:58:48,625 INFO L78 Accepts]: Start accepts. Automaton has 91578 states and 148082 transitions. Word has length 168 [2024-11-07 00:58:48,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:58:48,627 INFO L471 AbstractCegarLoop]: Abstraction has 91578 states and 148082 transitions. [2024-11-07 00:58:48,627 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 5 states have internal predecessors, (157), 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:58:48,627 INFO L276 IsEmpty]: Start isEmpty. Operand 91578 states and 148082 transitions. [2024-11-07 00:58:48,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-07 00:58:48,662 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:58:48,662 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:58:48,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-07 00:58:48,662 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:58:48,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:58:48,663 INFO L85 PathProgramCache]: Analyzing trace with hash -786477927, now seen corresponding path program 1 times [2024-11-07 00:58:48,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:58:48,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148742330] [2024-11-07 00:58:48,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:58:48,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:58:48,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:58:48,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 00:58:48,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:58:48,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 00:58:48,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:58:48,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 00:58:48,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:58:48,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-07 00:58:48,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:58:48,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-07 00:58:48,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:58:48,822 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:58:48,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:58:48,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148742330] [2024-11-07 00:58:48,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [148742330] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:58:48,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:58:48,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 00:58:48,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081338295] [2024-11-07 00:58:48,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:58:48,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 00:58:48,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:58:48,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 00:58:48,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-07 00:58:48,824 INFO L87 Difference]: Start difference. First operand 91578 states and 148082 transitions. Second operand has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 5 states have internal predecessors, (157), 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:58:54,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:58:54,997 INFO L93 Difference]: Finished difference Result 209666 states and 345979 transitions. [2024-11-07 00:58:54,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 00:58:54,997 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 5 states have internal predecessors, (157), 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 168 [2024-11-07 00:58:54,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:58:55,395 INFO L225 Difference]: With dead ends: 209666 [2024-11-07 00:58:55,395 INFO L226 Difference]: Without dead ends: 120228 [2024-11-07 00:58:55,596 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-11-07 00:58:55,596 INFO L432 NwaCegarLoop]: 4259 mSDtfsCounter, 5044 mSDsluCounter, 16783 mSDsCounter, 0 mSdLazyCounter, 1630 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5063 SdHoareTripleChecker+Valid, 21042 SdHoareTripleChecker+Invalid, 1697 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 1630 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:58:55,596 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5063 Valid, 21042 Invalid, 1697 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 1630 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-07 00:58:55,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120228 states. [2024-11-07 00:58:59,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120228 to 91578. [2024-11-07 00:58:59,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91578 states, 84631 states have (on average 1.5445404166322034) internal successors, (130716), 84890 states have internal predecessors, (130716), 5147 states have call successors, (5147), 1543 states have call predecessors, (5147), 1798 states have return successors, (11962), 5400 states have call predecessors, (11962), 5145 states have call successors, (11962) [2024-11-07 00:58:59,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91578 states to 91578 states and 147825 transitions. [2024-11-07 00:58:59,399 INFO L78 Accepts]: Start accepts. Automaton has 91578 states and 147825 transitions. Word has length 168 [2024-11-07 00:58:59,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:58:59,400 INFO L471 AbstractCegarLoop]: Abstraction has 91578 states and 147825 transitions. [2024-11-07 00:58:59,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 5 states have internal predecessors, (157), 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:58:59,400 INFO L276 IsEmpty]: Start isEmpty. Operand 91578 states and 147825 transitions. [2024-11-07 00:58:59,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-07 00:58:59,430 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:58:59,430 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:58:59,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-07 00:58:59,430 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:58:59,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:58:59,431 INFO L85 PathProgramCache]: Analyzing trace with hash 612475675, now seen corresponding path program 1 times [2024-11-07 00:58:59,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:58:59,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197248731] [2024-11-07 00:58:59,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:58:59,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:58:59,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:58:59,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 00:58:59,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:58:59,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 00:58:59,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:58:59,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 00:58:59,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:58:59,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-07 00:58:59,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:58:59,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-07 00:58:59,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:58:59,597 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:58:59,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:58:59,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197248731] [2024-11-07 00:58:59,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [197248731] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:58:59,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:58:59,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 00:58:59,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951240462] [2024-11-07 00:58:59,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:58:59,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 00:58:59,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:58:59,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 00:58:59,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 00:58:59,599 INFO L87 Difference]: Start difference. First operand 91578 states and 147825 transitions. Second operand has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 5 states have internal predecessors, (157), 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)