./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/systemc/transmitter.02.cil.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/systemc/transmitter.02.cil.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', '2cbfaf31aa56f767af01fea9a12ccb47d60ab19076d72b85e8ca46d6ff778e4c'] 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/systemc/transmitter.02.cil.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 2cbfaf31aa56f767af01fea9a12ccb47d60ab19076d72b85e8ca46d6ff778e4c --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-06 23:59:27,298 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-06 23:59:27,393 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-06 23:59:27,397 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-06 23:59:27,398 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-06 23:59:27,423 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-06 23:59:27,424 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-06 23:59:27,424 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-06 23:59:27,424 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-06 23:59:27,425 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-06 23:59:27,425 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-06 23:59:27,425 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-06 23:59:27,425 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-06 23:59:27,426 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-06 23:59:27,426 INFO L153 SettingsManager]: * Use SBE=true [2024-11-06 23:59:27,426 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-06 23:59:27,426 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-06 23:59:27,426 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-06 23:59:27,426 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-06 23:59:27,426 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-06 23:59:27,426 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-06 23:59:27,426 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-06 23:59:27,426 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-06 23:59:27,426 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-06 23:59:27,426 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-06 23:59:27,426 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-06 23:59:27,427 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-06 23:59:27,427 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-06 23:59:27,427 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-06 23:59:27,427 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-06 23:59:27,427 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-06 23:59:27,427 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-06 23:59:27,427 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 23:59:27,427 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-06 23:59:27,427 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-06 23:59:27,427 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-06 23:59:27,427 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-06 23:59:27,427 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-06 23:59:27,427 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-06 23:59:27,427 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-06 23:59:27,427 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-06 23:59:27,427 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-06 23:59:27,427 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 -> 2cbfaf31aa56f767af01fea9a12ccb47d60ab19076d72b85e8ca46d6ff778e4c [2024-11-06 23:59:27,706 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-06 23:59:27,717 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-06 23:59:27,719 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-06 23:59:27,720 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-06 23:59:27,720 INFO L274 PluginConnector]: CDTParser initialized [2024-11-06 23:59:27,722 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/transmitter.02.cil.c [2024-11-06 23:59:28,854 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-06 23:59:29,036 INFO L384 CDTParser]: Found 1 translation units. [2024-11-06 23:59:29,037 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/systemc/transmitter.02.cil.c [2024-11-06 23:59:29,044 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2504c0081/a5258e7bb1b84a909c0a5d90332b4e5b/FLAG48bd84b3e [2024-11-06 23:59:29,423 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2504c0081/a5258e7bb1b84a909c0a5d90332b4e5b [2024-11-06 23:59:29,425 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-06 23:59:29,426 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-06 23:59:29,427 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-06 23:59:29,427 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-06 23:59:29,430 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-06 23:59:29,431 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 11:59:29" (1/1) ... [2024-11-06 23:59:29,431 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f2859f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:59:29, skipping insertion in model container [2024-11-06 23:59:29,431 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 11:59:29" (1/1) ... [2024-11-06 23:59:29,451 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-06 23:59:29,549 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/systemc/transmitter.02.cil.c[706,719] [2024-11-06 23:59:29,595 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 23:59:29,604 INFO L200 MainTranslator]: Completed pre-run [2024-11-06 23:59:29,611 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/systemc/transmitter.02.cil.c[706,719] [2024-11-06 23:59:29,625 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 23:59:29,640 INFO L204 MainTranslator]: Completed translation [2024-11-06 23:59:29,640 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:59:29 WrapperNode [2024-11-06 23:59:29,641 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-06 23:59:29,641 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-06 23:59:29,642 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-06 23:59:29,642 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-06 23:59:29,646 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:59:29" (1/1) ... [2024-11-06 23:59:29,657 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:59:29" (1/1) ... [2024-11-06 23:59:29,674 INFO L138 Inliner]: procedures = 32, calls = 36, calls flagged for inlining = 16, calls inlined = 16, statements flattened = 269 [2024-11-06 23:59:29,674 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-06 23:59:29,674 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-06 23:59:29,675 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-06 23:59:29,675 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-06 23:59:29,680 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:59:29" (1/1) ... [2024-11-06 23:59:29,680 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:59:29" (1/1) ... [2024-11-06 23:59:29,682 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:59:29" (1/1) ... [2024-11-06 23:59:29,691 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-06 23:59:29,692 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:59:29" (1/1) ... [2024-11-06 23:59:29,692 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:59:29" (1/1) ... [2024-11-06 23:59:29,695 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:59:29" (1/1) ... [2024-11-06 23:59:29,699 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:59:29" (1/1) ... [2024-11-06 23:59:29,701 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:59:29" (1/1) ... [2024-11-06 23:59:29,702 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:59:29" (1/1) ... [2024-11-06 23:59:29,703 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-06 23:59:29,704 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-06 23:59:29,704 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-06 23:59:29,704 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-06 23:59:29,705 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:59:29" (1/1) ... [2024-11-06 23:59:29,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 23:59:29,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 23:59:29,736 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-06 23:59:29,740 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-06 23:59:29,763 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-06 23:59:29,763 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2024-11-06 23:59:29,764 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2024-11-06 23:59:29,764 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2024-11-06 23:59:29,764 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2024-11-06 23:59:29,764 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-11-06 23:59:29,764 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-11-06 23:59:29,764 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2024-11-06 23:59:29,764 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2024-11-06 23:59:29,765 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2024-11-06 23:59:29,765 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2024-11-06 23:59:29,765 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-06 23:59:29,765 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2024-11-06 23:59:29,765 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2024-11-06 23:59:29,765 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-06 23:59:29,765 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-06 23:59:29,829 INFO L238 CfgBuilder]: Building ICFG [2024-11-06 23:59:29,831 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-06 23:59:30,086 INFO L? ?]: Removed 37 outVars from TransFormulas that were not future-live. [2024-11-06 23:59:30,086 INFO L287 CfgBuilder]: Performing block encoding [2024-11-06 23:59:30,100 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-06 23:59:30,100 INFO L316 CfgBuilder]: Removed 6 assume(true) statements. [2024-11-06 23:59:30,100 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 11:59:30 BoogieIcfgContainer [2024-11-06 23:59:30,100 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-06 23:59:30,102 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-06 23:59:30,103 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-06 23:59:30,106 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-06 23:59:30,106 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 11:59:29" (1/3) ... [2024-11-06 23:59:30,107 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fa6f6a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 11:59:30, skipping insertion in model container [2024-11-06 23:59:30,107 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:59:29" (2/3) ... [2024-11-06 23:59:30,108 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fa6f6a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 11:59:30, skipping insertion in model container [2024-11-06 23:59:30,108 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 11:59:30" (3/3) ... [2024-11-06 23:59:30,109 INFO L112 eAbstractionObserver]: Analyzing ICFG transmitter.02.cil.c [2024-11-06 23:59:30,121 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-06 23:59:30,121 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-06 23:59:30,172 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-06 23:59:30,182 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;@47656bfd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-06 23:59:30,182 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-06 23:59:30,187 INFO L276 IsEmpty]: Start isEmpty. Operand has 131 states, 108 states have (on average 1.5462962962962963) internal successors, (167), 110 states have internal predecessors, (167), 15 states have call successors, (15), 6 states have call predecessors, (15), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-06 23:59:30,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-06 23:59:30,195 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 23:59:30,195 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] [2024-11-06 23:59:30,195 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 23:59:30,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 23:59:30,200 INFO L85 PathProgramCache]: Analyzing trace with hash -806611058, now seen corresponding path program 1 times [2024-11-06 23:59:30,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 23:59:30,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009650264] [2024-11-06 23:59:30,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 23:59:30,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 23:59:30,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:30,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-06 23:59:30,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:30,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-06 23:59:30,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:30,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-06 23:59:30,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:30,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-06 23:59:30,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:30,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-06 23:59:30,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:30,500 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-06 23:59:30,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 23:59:30,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009650264] [2024-11-06 23:59:30,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1009650264] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 23:59:30,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 23:59:30,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-06 23:59:30,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733436745] [2024-11-06 23:59:30,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 23:59:30,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-06 23:59:30,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 23:59:30,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-06 23:59:30,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-06 23:59:30,528 INFO L87 Difference]: Start difference. First operand has 131 states, 108 states have (on average 1.5462962962962963) internal successors, (167), 110 states have internal predecessors, (167), 15 states have call successors, (15), 6 states have call predecessors, (15), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 3 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-06 23:59:30,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 23:59:30,919 INFO L93 Difference]: Finished difference Result 283 states and 431 transitions. [2024-11-06 23:59:30,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-06 23:59:30,921 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 3 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 67 [2024-11-06 23:59:30,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 23:59:30,929 INFO L225 Difference]: With dead ends: 283 [2024-11-06 23:59:30,929 INFO L226 Difference]: Without dead ends: 156 [2024-11-06 23:59:30,931 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-06 23:59:30,935 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 275 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 288 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-06 23:59:30,935 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [288 Valid, 265 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-06 23:59:30,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2024-11-06 23:59:30,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 126. [2024-11-06 23:59:30,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 104 states have (on average 1.4230769230769231) internal successors, (148), 105 states have internal predecessors, (148), 15 states have call successors, (15), 6 states have call predecessors, (15), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-06 23:59:30,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 178 transitions. [2024-11-06 23:59:30,995 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 178 transitions. Word has length 67 [2024-11-06 23:59:30,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 23:59:30,997 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 178 transitions. [2024-11-06 23:59:30,997 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 3 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-06 23:59:30,997 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 178 transitions. [2024-11-06 23:59:30,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-06 23:59:31,000 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 23:59:31,001 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] [2024-11-06 23:59:31,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-06 23:59:31,001 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 23:59:31,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 23:59:31,002 INFO L85 PathProgramCache]: Analyzing trace with hash -1240340144, now seen corresponding path program 1 times [2024-11-06 23:59:31,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 23:59:31,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972250444] [2024-11-06 23:59:31,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 23:59:31,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 23:59:31,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:31,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-06 23:59:31,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:31,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-06 23:59:31,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:31,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-06 23:59:31,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:31,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-06 23:59:31,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:31,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-06 23:59:31,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:31,177 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-06 23:59:31,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 23:59:31,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972250444] [2024-11-06 23:59:31,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1972250444] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 23:59:31,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 23:59:31,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-06 23:59:31,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345425885] [2024-11-06 23:59:31,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 23:59:31,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-06 23:59:31,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 23:59:31,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-06 23:59:31,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-06 23:59:31,183 INFO L87 Difference]: Start difference. First operand 126 states and 178 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-06 23:59:31,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 23:59:31,823 INFO L93 Difference]: Finished difference Result 415 states and 606 transitions. [2024-11-06 23:59:31,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-06 23:59:31,824 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 67 [2024-11-06 23:59:31,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 23:59:31,827 INFO L225 Difference]: With dead ends: 415 [2024-11-06 23:59:31,829 INFO L226 Difference]: Without dead ends: 299 [2024-11-06 23:59:31,830 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-11-06 23:59:31,832 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 388 mSDsluCounter, 317 mSDsCounter, 0 mSdLazyCounter, 536 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 396 SdHoareTripleChecker+Valid, 429 SdHoareTripleChecker+Invalid, 601 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 536 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-06 23:59:31,834 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [396 Valid, 429 Invalid, 601 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 536 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-06 23:59:31,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2024-11-06 23:59:31,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 239. [2024-11-06 23:59:31,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 200 states have (on average 1.43) internal successors, (286), 202 states have internal predecessors, (286), 25 states have call successors, (25), 12 states have call predecessors, (25), 13 states have return successors, (28), 25 states have call predecessors, (28), 25 states have call successors, (28) [2024-11-06 23:59:31,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 339 transitions. [2024-11-06 23:59:31,869 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 339 transitions. Word has length 67 [2024-11-06 23:59:31,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 23:59:31,870 INFO L471 AbstractCegarLoop]: Abstraction has 239 states and 339 transitions. [2024-11-06 23:59:31,870 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-06 23:59:31,870 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 339 transitions. [2024-11-06 23:59:31,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-06 23:59:31,872 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 23:59:31,872 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] [2024-11-06 23:59:31,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-06 23:59:31,873 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 23:59:31,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 23:59:31,874 INFO L85 PathProgramCache]: Analyzing trace with hash -1099519889, now seen corresponding path program 1 times [2024-11-06 23:59:31,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 23:59:31,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457658670] [2024-11-06 23:59:31,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 23:59:31,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 23:59:31,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:31,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-06 23:59:31,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:31,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-06 23:59:31,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:32,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-06 23:59:32,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:32,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-06 23:59:32,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:32,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-06 23:59:32,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:32,049 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-06 23:59:32,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 23:59:32,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457658670] [2024-11-06 23:59:32,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457658670] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 23:59:32,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 23:59:32,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-06 23:59:32,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438096340] [2024-11-06 23:59:32,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 23:59:32,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-06 23:59:32,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 23:59:32,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-06 23:59:32,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-06 23:59:32,053 INFO L87 Difference]: Start difference. First operand 239 states and 339 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-06 23:59:32,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 23:59:32,439 INFO L93 Difference]: Finished difference Result 528 states and 762 transitions. [2024-11-06 23:59:32,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-06 23:59:32,440 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 67 [2024-11-06 23:59:32,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 23:59:32,442 INFO L225 Difference]: With dead ends: 528 [2024-11-06 23:59:32,442 INFO L226 Difference]: Without dead ends: 299 [2024-11-06 23:59:32,443 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-11-06 23:59:32,444 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 294 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 454 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 303 SdHoareTripleChecker+Valid, 393 SdHoareTripleChecker+Invalid, 496 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 454 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-06 23:59:32,444 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [303 Valid, 393 Invalid, 496 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 454 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-06 23:59:32,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2024-11-06 23:59:32,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 239. [2024-11-06 23:59:32,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 200 states have (on average 1.42) internal successors, (284), 202 states have internal predecessors, (284), 25 states have call successors, (25), 12 states have call predecessors, (25), 13 states have return successors, (28), 25 states have call predecessors, (28), 25 states have call successors, (28) [2024-11-06 23:59:32,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 337 transitions. [2024-11-06 23:59:32,478 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 337 transitions. Word has length 67 [2024-11-06 23:59:32,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 23:59:32,478 INFO L471 AbstractCegarLoop]: Abstraction has 239 states and 337 transitions. [2024-11-06 23:59:32,478 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-06 23:59:32,478 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 337 transitions. [2024-11-06 23:59:32,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-06 23:59:32,480 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 23:59:32,480 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] [2024-11-06 23:59:32,481 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-06 23:59:32,481 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 23:59:32,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 23:59:32,481 INFO L85 PathProgramCache]: Analyzing trace with hash -223500883, now seen corresponding path program 1 times [2024-11-06 23:59:32,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 23:59:32,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910006774] [2024-11-06 23:59:32,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 23:59:32,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 23:59:32,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:32,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-06 23:59:32,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:32,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-06 23:59:32,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:32,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-06 23:59:32,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:32,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-06 23:59:32,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:32,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-06 23:59:32,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:32,600 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-06 23:59:32,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 23:59:32,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910006774] [2024-11-06 23:59:32,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910006774] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 23:59:32,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 23:59:32,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-06 23:59:32,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444633146] [2024-11-06 23:59:32,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 23:59:32,601 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-06 23:59:32,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 23:59:32,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-06 23:59:32,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-06 23:59:32,602 INFO L87 Difference]: Start difference. First operand 239 states and 337 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-06 23:59:33,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 23:59:33,397 INFO L93 Difference]: Finished difference Result 704 states and 1001 transitions. [2024-11-06 23:59:33,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-06 23:59:33,397 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 67 [2024-11-06 23:59:33,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 23:59:33,400 INFO L225 Difference]: With dead ends: 704 [2024-11-06 23:59:33,400 INFO L226 Difference]: Without dead ends: 475 [2024-11-06 23:59:33,401 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2024-11-06 23:59:33,401 INFO L432 NwaCegarLoop]: 195 mSDtfsCounter, 404 mSDsluCounter, 605 mSDsCounter, 0 mSdLazyCounter, 1052 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 412 SdHoareTripleChecker+Valid, 800 SdHoareTripleChecker+Invalid, 1093 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 1052 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-06 23:59:33,401 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [412 Valid, 800 Invalid, 1093 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 1052 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-06 23:59:33,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 475 states. [2024-11-06 23:59:33,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 475 to 346. [2024-11-06 23:59:33,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 346 states, 290 states have (on average 1.410344827586207) internal successors, (409), 293 states have internal predecessors, (409), 35 states have call successors, (35), 18 states have call predecessors, (35), 20 states have return successors, (40), 36 states have call predecessors, (40), 35 states have call successors, (40) [2024-11-06 23:59:33,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 484 transitions. [2024-11-06 23:59:33,426 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 484 transitions. Word has length 67 [2024-11-06 23:59:33,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 23:59:33,426 INFO L471 AbstractCegarLoop]: Abstraction has 346 states and 484 transitions. [2024-11-06 23:59:33,426 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-06 23:59:33,426 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 484 transitions. [2024-11-06 23:59:33,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-06 23:59:33,427 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 23:59:33,427 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] [2024-11-06 23:59:33,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-06 23:59:33,427 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 23:59:33,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 23:59:33,428 INFO L85 PathProgramCache]: Analyzing trace with hash 220399791, now seen corresponding path program 1 times [2024-11-06 23:59:33,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 23:59:33,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384558913] [2024-11-06 23:59:33,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 23:59:33,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 23:59:33,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:33,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-06 23:59:33,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:33,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-06 23:59:33,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:33,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-06 23:59:33,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:33,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-06 23:59:33,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:33,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-06 23:59:33,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:33,558 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-06 23:59:33,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 23:59:33,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384558913] [2024-11-06 23:59:33,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1384558913] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 23:59:33,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 23:59:33,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-06 23:59:33,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296194629] [2024-11-06 23:59:33,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 23:59:33,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-06 23:59:33,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 23:59:33,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-06 23:59:33,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-06 23:59:33,562 INFO L87 Difference]: Start difference. First operand 346 states and 484 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-06 23:59:34,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 23:59:34,367 INFO L93 Difference]: Finished difference Result 1098 states and 1548 transitions. [2024-11-06 23:59:34,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-06 23:59:34,371 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 67 [2024-11-06 23:59:34,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 23:59:34,374 INFO L225 Difference]: With dead ends: 1098 [2024-11-06 23:59:34,375 INFO L226 Difference]: Without dead ends: 762 [2024-11-06 23:59:34,375 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=226, Unknown=0, NotChecked=0, Total=306 [2024-11-06 23:59:34,376 INFO L432 NwaCegarLoop]: 187 mSDtfsCounter, 413 mSDsluCounter, 597 mSDsCounter, 0 mSdLazyCounter, 962 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 423 SdHoareTripleChecker+Valid, 784 SdHoareTripleChecker+Invalid, 1009 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 962 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-06 23:59:34,380 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [423 Valid, 784 Invalid, 1009 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 962 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-06 23:59:34,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 762 states. [2024-11-06 23:59:34,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 762 to 559. [2024-11-06 23:59:34,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 559 states, 471 states have (on average 1.4097664543524415) internal successors, (664), 476 states have internal predecessors, (664), 53 states have call successors, (53), 30 states have call predecessors, (53), 34 states have return successors, (66), 56 states have call predecessors, (66), 53 states have call successors, (66) [2024-11-06 23:59:34,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 783 transitions. [2024-11-06 23:59:34,428 INFO L78 Accepts]: Start accepts. Automaton has 559 states and 783 transitions. Word has length 67 [2024-11-06 23:59:34,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 23:59:34,428 INFO L471 AbstractCegarLoop]: Abstraction has 559 states and 783 transitions. [2024-11-06 23:59:34,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-06 23:59:34,428 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 783 transitions. [2024-11-06 23:59:34,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-06 23:59:34,429 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 23:59:34,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] [2024-11-06 23:59:34,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-06 23:59:34,430 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 23:59:34,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 23:59:34,430 INFO L85 PathProgramCache]: Analyzing trace with hash -1808186319, now seen corresponding path program 1 times [2024-11-06 23:59:34,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 23:59:34,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875250306] [2024-11-06 23:59:34,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 23:59:34,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 23:59:34,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:34,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-06 23:59:34,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:34,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-06 23:59:34,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:34,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-06 23:59:34,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:34,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-06 23:59:34,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:34,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-06 23:59:34,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:34,546 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-06 23:59:34,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 23:59:34,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875250306] [2024-11-06 23:59:34,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875250306] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 23:59:34,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 23:59:34,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-06 23:59:34,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391070209] [2024-11-06 23:59:34,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 23:59:34,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-06 23:59:34,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 23:59:34,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-06 23:59:34,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-06 23:59:34,549 INFO L87 Difference]: Start difference. First operand 559 states and 783 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-06 23:59:34,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 23:59:34,940 INFO L93 Difference]: Finished difference Result 1199 states and 1705 transitions. [2024-11-06 23:59:34,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-06 23:59:34,941 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 67 [2024-11-06 23:59:34,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 23:59:34,944 INFO L225 Difference]: With dead ends: 1199 [2024-11-06 23:59:34,944 INFO L226 Difference]: Without dead ends: 651 [2024-11-06 23:59:34,945 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-11-06 23:59:34,946 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 139 mSDsluCounter, 428 mSDsCounter, 0 mSdLazyCounter, 530 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 547 SdHoareTripleChecker+Invalid, 560 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 530 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-06 23:59:34,946 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 547 Invalid, 560 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 530 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-06 23:59:34,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 651 states. [2024-11-06 23:59:34,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 651 to 562. [2024-11-06 23:59:34,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 562 states, 474 states have (on average 1.3987341772151898) internal successors, (663), 479 states have internal predecessors, (663), 53 states have call successors, (53), 30 states have call predecessors, (53), 34 states have return successors, (66), 56 states have call predecessors, (66), 53 states have call successors, (66) [2024-11-06 23:59:34,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 782 transitions. [2024-11-06 23:59:34,982 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 782 transitions. Word has length 67 [2024-11-06 23:59:34,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 23:59:34,982 INFO L471 AbstractCegarLoop]: Abstraction has 562 states and 782 transitions. [2024-11-06 23:59:34,982 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-06 23:59:34,982 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 782 transitions. [2024-11-06 23:59:34,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-06 23:59:34,983 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 23:59:34,983 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] [2024-11-06 23:59:34,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-06 23:59:34,983 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 23:59:34,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 23:59:34,984 INFO L85 PathProgramCache]: Analyzing trace with hash -1560039825, now seen corresponding path program 1 times [2024-11-06 23:59:34,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 23:59:34,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220417708] [2024-11-06 23:59:34,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 23:59:34,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 23:59:34,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:35,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-06 23:59:35,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:35,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-06 23:59:35,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:35,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-06 23:59:35,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:35,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-06 23:59:35,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:35,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-06 23:59:35,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:35,082 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-06 23:59:35,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 23:59:35,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220417708] [2024-11-06 23:59:35,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220417708] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 23:59:35,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 23:59:35,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-06 23:59:35,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199465430] [2024-11-06 23:59:35,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 23:59:35,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-06 23:59:35,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 23:59:35,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-06 23:59:35,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-06 23:59:35,084 INFO L87 Difference]: Start difference. First operand 562 states and 782 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-06 23:59:35,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 23:59:35,488 INFO L93 Difference]: Finished difference Result 1220 states and 1723 transitions. [2024-11-06 23:59:35,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-06 23:59:35,489 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 67 [2024-11-06 23:59:35,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 23:59:35,492 INFO L225 Difference]: With dead ends: 1220 [2024-11-06 23:59:35,492 INFO L226 Difference]: Without dead ends: 669 [2024-11-06 23:59:35,495 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2024-11-06 23:59:35,496 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 152 mSDsluCounter, 428 mSDsCounter, 0 mSdLazyCounter, 489 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 547 SdHoareTripleChecker+Invalid, 519 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 489 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-06 23:59:35,497 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 547 Invalid, 519 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 489 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-06 23:59:35,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 669 states. [2024-11-06 23:59:35,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 669 to 577. [2024-11-06 23:59:35,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 577 states, 489 states have (on average 1.3865030674846626) internal successors, (678), 494 states have internal predecessors, (678), 53 states have call successors, (53), 30 states have call predecessors, (53), 34 states have return successors, (66), 56 states have call predecessors, (66), 53 states have call successors, (66) [2024-11-06 23:59:35,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 577 states and 797 transitions. [2024-11-06 23:59:35,539 INFO L78 Accepts]: Start accepts. Automaton has 577 states and 797 transitions. Word has length 67 [2024-11-06 23:59:35,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 23:59:35,540 INFO L471 AbstractCegarLoop]: Abstraction has 577 states and 797 transitions. [2024-11-06 23:59:35,541 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-06 23:59:35,541 INFO L276 IsEmpty]: Start isEmpty. Operand 577 states and 797 transitions. [2024-11-06 23:59:35,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-06 23:59:35,543 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 23:59:35,543 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] [2024-11-06 23:59:35,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-06 23:59:35,544 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 23:59:35,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 23:59:35,544 INFO L85 PathProgramCache]: Analyzing trace with hash -1954406611, now seen corresponding path program 1 times [2024-11-06 23:59:35,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 23:59:35,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824364249] [2024-11-06 23:59:35,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 23:59:35,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 23:59:35,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:35,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-06 23:59:35,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:35,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-06 23:59:35,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:35,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-06 23:59:35,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:35,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-06 23:59:35,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:35,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-06 23:59:35,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:35,669 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-06 23:59:35,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 23:59:35,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824364249] [2024-11-06 23:59:35,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824364249] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 23:59:35,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 23:59:35,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-06 23:59:35,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946647511] [2024-11-06 23:59:35,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 23:59:35,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-06 23:59:35,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 23:59:35,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-06 23:59:35,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-06 23:59:35,671 INFO L87 Difference]: Start difference. First operand 577 states and 797 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-06 23:59:36,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 23:59:36,632 INFO L93 Difference]: Finished difference Result 3071 states and 4399 transitions. [2024-11-06 23:59:36,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-06 23:59:36,633 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 67 [2024-11-06 23:59:36,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 23:59:36,647 INFO L225 Difference]: With dead ends: 3071 [2024-11-06 23:59:36,647 INFO L226 Difference]: Without dead ends: 2505 [2024-11-06 23:59:36,651 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=219, Unknown=0, NotChecked=0, Total=306 [2024-11-06 23:59:36,651 INFO L432 NwaCegarLoop]: 247 mSDtfsCounter, 1038 mSDsluCounter, 523 mSDsCounter, 0 mSdLazyCounter, 829 mSolverCounterSat, 163 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1053 SdHoareTripleChecker+Valid, 770 SdHoareTripleChecker+Invalid, 992 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 163 IncrementalHoareTripleChecker+Valid, 829 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-06 23:59:36,652 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1053 Valid, 770 Invalid, 992 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [163 Valid, 829 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-06 23:59:36,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2505 states. [2024-11-06 23:59:36,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2505 to 1604. [2024-11-06 23:59:36,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1604 states, 1359 states have (on average 1.3855776306107432) internal successors, (1883), 1377 states have internal predecessors, (1883), 144 states have call successors, (144), 88 states have call predecessors, (144), 100 states have return successors, (189), 142 states have call predecessors, (189), 144 states have call successors, (189) [2024-11-06 23:59:36,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1604 states to 1604 states and 2216 transitions. [2024-11-06 23:59:36,767 INFO L78 Accepts]: Start accepts. Automaton has 1604 states and 2216 transitions. Word has length 67 [2024-11-06 23:59:36,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 23:59:36,768 INFO L471 AbstractCegarLoop]: Abstraction has 1604 states and 2216 transitions. [2024-11-06 23:59:36,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-06 23:59:36,768 INFO L276 IsEmpty]: Start isEmpty. Operand 1604 states and 2216 transitions. [2024-11-06 23:59:36,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-06 23:59:36,771 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 23:59:36,771 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 23:59:36,772 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-06 23:59:36,772 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 23:59:36,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 23:59:36,772 INFO L85 PathProgramCache]: Analyzing trace with hash -1592488097, now seen corresponding path program 1 times [2024-11-06 23:59:36,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 23:59:36,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379674972] [2024-11-06 23:59:36,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 23:59:36,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 23:59:36,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:36,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-06 23:59:36,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:36,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-06 23:59:36,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:36,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-06 23:59:36,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:36,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-06 23:59:36,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:36,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-06 23:59:36,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:36,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-06 23:59:36,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:36,857 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-06 23:59:36,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 23:59:36,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379674972] [2024-11-06 23:59:36,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [379674972] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 23:59:36,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 23:59:36,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-06 23:59:36,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893831826] [2024-11-06 23:59:36,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 23:59:36,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-06 23:59:36,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 23:59:36,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-06 23:59:36,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-06 23:59:36,859 INFO L87 Difference]: Start difference. First operand 1604 states and 2216 transitions. Second operand has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-06 23:59:37,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 23:59:37,308 INFO L93 Difference]: Finished difference Result 3504 states and 4917 transitions. [2024-11-06 23:59:37,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-06 23:59:37,309 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 85 [2024-11-06 23:59:37,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 23:59:37,318 INFO L225 Difference]: With dead ends: 3504 [2024-11-06 23:59:37,319 INFO L226 Difference]: Without dead ends: 1911 [2024-11-06 23:59:37,323 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2024-11-06 23:59:37,324 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 154 mSDsluCounter, 428 mSDsCounter, 0 mSdLazyCounter, 467 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 545 SdHoareTripleChecker+Invalid, 498 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 467 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-06 23:59:37,325 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 545 Invalid, 498 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 467 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-06 23:59:37,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1911 states. [2024-11-06 23:59:37,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1911 to 1634. [2024-11-06 23:59:37,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1634 states, 1389 states have (on average 1.3736501079913608) internal successors, (1908), 1407 states have internal predecessors, (1908), 144 states have call successors, (144), 88 states have call predecessors, (144), 100 states have return successors, (189), 142 states have call predecessors, (189), 144 states have call successors, (189) [2024-11-06 23:59:37,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1634 states to 1634 states and 2241 transitions. [2024-11-06 23:59:37,419 INFO L78 Accepts]: Start accepts. Automaton has 1634 states and 2241 transitions. Word has length 85 [2024-11-06 23:59:37,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 23:59:37,419 INFO L471 AbstractCegarLoop]: Abstraction has 1634 states and 2241 transitions. [2024-11-06 23:59:37,420 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-06 23:59:37,420 INFO L276 IsEmpty]: Start isEmpty. Operand 1634 states and 2241 transitions. [2024-11-06 23:59:37,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-06 23:59:37,423 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 23:59:37,424 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 23:59:37,424 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-06 23:59:37,424 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 23:59:37,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 23:59:37,424 INFO L85 PathProgramCache]: Analyzing trace with hash 346673949, now seen corresponding path program 1 times [2024-11-06 23:59:37,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 23:59:37,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576126256] [2024-11-06 23:59:37,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 23:59:37,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 23:59:37,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:37,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-06 23:59:37,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:37,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-06 23:59:37,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:37,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-06 23:59:37,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:37,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-06 23:59:37,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:37,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-06 23:59:37,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:37,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-06 23:59:37,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:37,539 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-06 23:59:37,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 23:59:37,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576126256] [2024-11-06 23:59:37,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [576126256] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 23:59:37,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 23:59:37,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-06 23:59:37,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196445030] [2024-11-06 23:59:37,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 23:59:37,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-06 23:59:37,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 23:59:37,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-06 23:59:37,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-06 23:59:37,542 INFO L87 Difference]: Start difference. First operand 1634 states and 2241 transitions. Second operand has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-06 23:59:37,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 23:59:37,922 INFO L93 Difference]: Finished difference Result 3512 states and 4842 transitions. [2024-11-06 23:59:37,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-06 23:59:37,923 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 85 [2024-11-06 23:59:37,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 23:59:37,931 INFO L225 Difference]: With dead ends: 3512 [2024-11-06 23:59:37,931 INFO L226 Difference]: Without dead ends: 1890 [2024-11-06 23:59:37,935 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-06 23:59:37,936 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 344 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 332 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 354 SdHoareTripleChecker+Valid, 391 SdHoareTripleChecker+Invalid, 371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-06 23:59:37,936 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [354 Valid, 391 Invalid, 371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 332 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-06 23:59:37,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1890 states. [2024-11-06 23:59:38,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1890 to 1622. [2024-11-06 23:59:38,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1622 states, 1377 states have (on average 1.3507625272331154) internal successors, (1860), 1395 states have internal predecessors, (1860), 144 states have call successors, (144), 88 states have call predecessors, (144), 100 states have return successors, (189), 142 states have call predecessors, (189), 144 states have call successors, (189) [2024-11-06 23:59:38,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1622 states to 1622 states and 2193 transitions. [2024-11-06 23:59:38,026 INFO L78 Accepts]: Start accepts. Automaton has 1622 states and 2193 transitions. Word has length 85 [2024-11-06 23:59:38,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 23:59:38,026 INFO L471 AbstractCegarLoop]: Abstraction has 1622 states and 2193 transitions. [2024-11-06 23:59:38,026 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-06 23:59:38,026 INFO L276 IsEmpty]: Start isEmpty. Operand 1622 states and 2193 transitions. [2024-11-06 23:59:38,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-06 23:59:38,028 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 23:59:38,028 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 23:59:38,028 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-06 23:59:38,028 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 23:59:38,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 23:59:38,028 INFO L85 PathProgramCache]: Analyzing trace with hash -550719329, now seen corresponding path program 1 times [2024-11-06 23:59:38,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 23:59:38,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756727145] [2024-11-06 23:59:38,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 23:59:38,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 23:59:38,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:38,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-06 23:59:38,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:38,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-06 23:59:38,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:38,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-06 23:59:38,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:38,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-06 23:59:38,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:38,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-06 23:59:38,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:38,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-06 23:59:38,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:38,134 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-06 23:59:38,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 23:59:38,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756727145] [2024-11-06 23:59:38,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756727145] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 23:59:38,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 23:59:38,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-06 23:59:38,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737576166] [2024-11-06 23:59:38,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 23:59:38,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-06 23:59:38,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 23:59:38,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-06 23:59:38,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-06 23:59:38,136 INFO L87 Difference]: Start difference. First operand 1622 states and 2193 transitions. Second operand has 8 states, 8 states have (on average 7.75) internal successors, (62), 6 states have internal predecessors, (62), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-06 23:59:38,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 23:59:38,781 INFO L93 Difference]: Finished difference Result 2635 states and 3575 transitions. [2024-11-06 23:59:38,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-06 23:59:38,784 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 6 states have internal predecessors, (62), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 85 [2024-11-06 23:59:38,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 23:59:38,790 INFO L225 Difference]: With dead ends: 2635 [2024-11-06 23:59:38,791 INFO L226 Difference]: Without dead ends: 1633 [2024-11-06 23:59:38,793 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=112, Invalid=308, Unknown=0, NotChecked=0, Total=420 [2024-11-06 23:59:38,794 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 616 mSDsluCounter, 407 mSDsCounter, 0 mSdLazyCounter, 685 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 626 SdHoareTripleChecker+Valid, 517 SdHoareTripleChecker+Invalid, 776 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 685 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-06 23:59:38,794 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [626 Valid, 517 Invalid, 776 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 685 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-06 23:59:38,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1633 states. [2024-11-06 23:59:38,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1633 to 1294. [2024-11-06 23:59:38,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1294 states, 1097 states have (on average 1.3381950774840474) internal successors, (1468), 1108 states have internal predecessors, (1468), 119 states have call successors, (119), 71 states have call predecessors, (119), 77 states have return successors, (140), 116 states have call predecessors, (140), 119 states have call successors, (140) [2024-11-06 23:59:38,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1294 states to 1294 states and 1727 transitions. [2024-11-06 23:59:38,872 INFO L78 Accepts]: Start accepts. Automaton has 1294 states and 1727 transitions. Word has length 85 [2024-11-06 23:59:38,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 23:59:38,873 INFO L471 AbstractCegarLoop]: Abstraction has 1294 states and 1727 transitions. [2024-11-06 23:59:38,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 6 states have internal predecessors, (62), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-06 23:59:38,873 INFO L276 IsEmpty]: Start isEmpty. Operand 1294 states and 1727 transitions. [2024-11-06 23:59:38,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-06 23:59:38,876 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 23:59:38,876 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 23:59:38,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-06 23:59:38,876 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 23:59:38,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 23:59:38,877 INFO L85 PathProgramCache]: Analyzing trace with hash -302572835, now seen corresponding path program 1 times [2024-11-06 23:59:38,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 23:59:38,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335723544] [2024-11-06 23:59:38,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 23:59:38,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 23:59:38,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:38,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-06 23:59:38,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:38,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-06 23:59:38,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:38,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-06 23:59:38,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:38,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-06 23:59:38,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:38,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-06 23:59:38,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:38,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-06 23:59:38,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:38,970 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-06 23:59:38,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 23:59:38,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335723544] [2024-11-06 23:59:38,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1335723544] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 23:59:38,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 23:59:38,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-06 23:59:38,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753973136] [2024-11-06 23:59:38,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 23:59:38,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-06 23:59:38,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 23:59:38,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-06 23:59:38,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-06 23:59:38,972 INFO L87 Difference]: Start difference. First operand 1294 states and 1727 transitions. Second operand has 8 states, 8 states have (on average 7.75) internal successors, (62), 6 states have internal predecessors, (62), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-06 23:59:39,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 23:59:39,727 INFO L93 Difference]: Finished difference Result 2846 states and 3801 transitions. [2024-11-06 23:59:39,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-06 23:59:39,728 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 6 states have internal predecessors, (62), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 85 [2024-11-06 23:59:39,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 23:59:39,735 INFO L225 Difference]: With dead ends: 2846 [2024-11-06 23:59:39,736 INFO L226 Difference]: Without dead ends: 1658 [2024-11-06 23:59:39,739 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=134, Invalid=372, Unknown=0, NotChecked=0, Total=506 [2024-11-06 23:59:39,739 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 638 mSDsluCounter, 401 mSDsCounter, 0 mSdLazyCounter, 715 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 646 SdHoareTripleChecker+Valid, 516 SdHoareTripleChecker+Invalid, 811 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 715 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-06 23:59:39,739 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [646 Valid, 516 Invalid, 811 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 715 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-06 23:59:39,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1658 states. [2024-11-06 23:59:39,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1658 to 1282. [2024-11-06 23:59:39,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1282 states, 1088 states have (on average 1.333639705882353) internal successors, (1451), 1096 states have internal predecessors, (1451), 119 states have call successors, (119), 71 states have call predecessors, (119), 74 states have return successors, (133), 115 states have call predecessors, (133), 119 states have call successors, (133) [2024-11-06 23:59:39,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1282 states to 1282 states and 1703 transitions. [2024-11-06 23:59:39,825 INFO L78 Accepts]: Start accepts. Automaton has 1282 states and 1703 transitions. Word has length 85 [2024-11-06 23:59:39,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 23:59:39,825 INFO L471 AbstractCegarLoop]: Abstraction has 1282 states and 1703 transitions. [2024-11-06 23:59:39,825 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 6 states have internal predecessors, (62), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-06 23:59:39,825 INFO L276 IsEmpty]: Start isEmpty. Operand 1282 states and 1703 transitions. [2024-11-06 23:59:39,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-06 23:59:39,826 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 23:59:39,826 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 23:59:39,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-06 23:59:39,827 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 23:59:39,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 23:59:39,827 INFO L85 PathProgramCache]: Analyzing trace with hash -1674380133, now seen corresponding path program 1 times [2024-11-06 23:59:39,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 23:59:39,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6100208] [2024-11-06 23:59:39,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 23:59:39,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 23:59:39,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:39,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-06 23:59:39,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:39,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-06 23:59:39,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:39,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-06 23:59:39,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:39,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-06 23:59:39,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:39,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-06 23:59:39,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:39,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-06 23:59:39,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:39,904 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-06 23:59:39,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 23:59:39,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6100208] [2024-11-06 23:59:39,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6100208] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 23:59:39,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1406857110] [2024-11-06 23:59:39,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 23:59:39,905 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 23:59:39,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 23:59:39,907 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-06 23:59:39,912 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-06 23:59:39,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:39,973 INFO L255 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-06 23:59:39,980 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 23:59:40,026 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 23:59:40,027 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 23:59:40,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1406857110] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 23:59:40,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-06 23:59:40,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-11-06 23:59:40,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550931738] [2024-11-06 23:59:40,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 23:59:40,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 23:59:40,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 23:59:40,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 23:59:40,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-06 23:59:40,028 INFO L87 Difference]: Start difference. First operand 1282 states and 1703 transitions. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-06 23:59:40,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 23:59:40,111 INFO L93 Difference]: Finished difference Result 2967 states and 4010 transitions. [2024-11-06 23:59:40,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 23:59:40,111 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 85 [2024-11-06 23:59:40,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 23:59:40,120 INFO L225 Difference]: With dead ends: 2967 [2024-11-06 23:59:40,120 INFO L226 Difference]: Without dead ends: 2099 [2024-11-06 23:59:40,122 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-06 23:59:40,123 INFO L432 NwaCegarLoop]: 310 mSDtfsCounter, 131 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 23:59:40,124 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 479 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 23:59:40,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2099 states. [2024-11-06 23:59:40,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2099 to 2099. [2024-11-06 23:59:40,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2099 states, 1781 states have (on average 1.3239752947782144) internal successors, (2358), 1791 states have internal predecessors, (2358), 194 states have call successors, (194), 118 states have call predecessors, (194), 123 states have return successors, (258), 190 states have call predecessors, (258), 194 states have call successors, (258) [2024-11-06 23:59:40,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2099 states to 2099 states and 2810 transitions. [2024-11-06 23:59:40,233 INFO L78 Accepts]: Start accepts. Automaton has 2099 states and 2810 transitions. Word has length 85 [2024-11-06 23:59:40,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 23:59:40,234 INFO L471 AbstractCegarLoop]: Abstraction has 2099 states and 2810 transitions. [2024-11-06 23:59:40,234 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-06 23:59:40,234 INFO L276 IsEmpty]: Start isEmpty. Operand 2099 states and 2810 transitions. [2024-11-06 23:59:40,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-06 23:59:40,235 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 23:59:40,236 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 23:59:40,249 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-06 23:59:40,436 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-11-06 23:59:40,437 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 23:59:40,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 23:59:40,437 INFO L85 PathProgramCache]: Analyzing trace with hash 1173937345, now seen corresponding path program 1 times [2024-11-06 23:59:40,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 23:59:40,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669318992] [2024-11-06 23:59:40,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 23:59:40,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 23:59:40,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:40,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-06 23:59:40,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:40,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-06 23:59:40,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:40,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-06 23:59:40,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:40,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-06 23:59:40,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:40,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-06 23:59:40,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:40,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-06 23:59:40,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:40,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-06 23:59:40,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:40,619 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-06 23:59:40,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 23:59:40,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669318992] [2024-11-06 23:59:40,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669318992] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 23:59:40,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 23:59:40,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-06 23:59:40,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787013128] [2024-11-06 23:59:40,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 23:59:40,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-06 23:59:40,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 23:59:40,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-06 23:59:40,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-06 23:59:40,620 INFO L87 Difference]: Start difference. First operand 2099 states and 2810 transitions. Second operand has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 5 states have internal predecessors, (67), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-06 23:59:41,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 23:59:41,261 INFO L93 Difference]: Finished difference Result 6800 states and 9241 transitions. [2024-11-06 23:59:41,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-06 23:59:41,261 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 5 states have internal predecessors, (67), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 100 [2024-11-06 23:59:41,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 23:59:41,279 INFO L225 Difference]: With dead ends: 6800 [2024-11-06 23:59:41,279 INFO L226 Difference]: Without dead ends: 4713 [2024-11-06 23:59:41,285 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2024-11-06 23:59:41,285 INFO L432 NwaCegarLoop]: 163 mSDtfsCounter, 512 mSDsluCounter, 373 mSDsCounter, 0 mSdLazyCounter, 393 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 519 SdHoareTripleChecker+Valid, 536 SdHoareTripleChecker+Invalid, 475 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 393 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-06 23:59:41,285 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [519 Valid, 536 Invalid, 475 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 393 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-06 23:59:41,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4713 states. [2024-11-06 23:59:41,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4713 to 4317. [2024-11-06 23:59:41,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4317 states, 3653 states have (on average 1.300027374760471) internal successors, (4749), 3707 states have internal predecessors, (4749), 366 states have call successors, (366), 230 states have call predecessors, (366), 297 states have return successors, (707), 381 states have call predecessors, (707), 366 states have call successors, (707) [2024-11-06 23:59:41,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4317 states to 4317 states and 5822 transitions. [2024-11-06 23:59:41,542 INFO L78 Accepts]: Start accepts. Automaton has 4317 states and 5822 transitions. Word has length 100 [2024-11-06 23:59:41,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 23:59:41,542 INFO L471 AbstractCegarLoop]: Abstraction has 4317 states and 5822 transitions. [2024-11-06 23:59:41,543 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 5 states have internal predecessors, (67), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-06 23:59:41,543 INFO L276 IsEmpty]: Start isEmpty. Operand 4317 states and 5822 transitions. [2024-11-06 23:59:41,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-06 23:59:41,544 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 23:59:41,544 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 23:59:41,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-06 23:59:41,545 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 23:59:41,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 23:59:41,545 INFO L85 PathProgramCache]: Analyzing trace with hash 1145437055, now seen corresponding path program 1 times [2024-11-06 23:59:41,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 23:59:41,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056919724] [2024-11-06 23:59:41,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 23:59:41,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 23:59:41,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:41,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-06 23:59:41,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:41,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-06 23:59:41,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:41,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-06 23:59:41,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:41,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-06 23:59:41,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:41,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-06 23:59:41,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:41,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-06 23:59:41,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:41,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-06 23:59:41,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:41,600 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-06 23:59:41,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 23:59:41,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056919724] [2024-11-06 23:59:41,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056919724] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 23:59:41,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 23:59:41,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-06 23:59:41,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594726835] [2024-11-06 23:59:41,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 23:59:41,601 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-06 23:59:41,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 23:59:41,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-06 23:59:41,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-06 23:59:41,602 INFO L87 Difference]: Start difference. First operand 4317 states and 5822 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 3 states have internal predecessors, (67), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-06 23:59:42,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 23:59:42,072 INFO L93 Difference]: Finished difference Result 9188 states and 12384 transitions. [2024-11-06 23:59:42,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-06 23:59:42,073 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 3 states have internal predecessors, (67), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 100 [2024-11-06 23:59:42,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 23:59:42,090 INFO L225 Difference]: With dead ends: 9188 [2024-11-06 23:59:42,090 INFO L226 Difference]: Without dead ends: 4882 [2024-11-06 23:59:42,097 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-06 23:59:42,098 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 340 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 361 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-06 23:59:42,098 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [361 Valid, 241 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-06 23:59:42,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4882 states. [2024-11-06 23:59:42,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4882 to 4312. [2024-11-06 23:59:42,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4312 states, 3651 states have (on average 1.2999178307313064) internal successors, (4746), 3704 states have internal predecessors, (4746), 363 states have call successors, (363), 230 states have call predecessors, (363), 297 states have return successors, (703), 378 states have call predecessors, (703), 363 states have call successors, (703) [2024-11-06 23:59:42,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4312 states to 4312 states and 5812 transitions. [2024-11-06 23:59:42,427 INFO L78 Accepts]: Start accepts. Automaton has 4312 states and 5812 transitions. Word has length 100 [2024-11-06 23:59:42,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 23:59:42,427 INFO L471 AbstractCegarLoop]: Abstraction has 4312 states and 5812 transitions. [2024-11-06 23:59:42,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 3 states have internal predecessors, (67), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-06 23:59:42,428 INFO L276 IsEmpty]: Start isEmpty. Operand 4312 states and 5812 transitions. [2024-11-06 23:59:42,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-06 23:59:42,429 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 23:59:42,429 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 23:59:42,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-06 23:59:42,430 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 23:59:42,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 23:59:42,430 INFO L85 PathProgramCache]: Analyzing trace with hash -343505380, now seen corresponding path program 1 times [2024-11-06 23:59:42,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 23:59:42,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995311565] [2024-11-06 23:59:42,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 23:59:42,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 23:59:42,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:42,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-06 23:59:42,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:42,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-06 23:59:42,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:42,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-06 23:59:42,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:42,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-06 23:59:42,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:42,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-06 23:59:42,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:42,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-06 23:59:42,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:42,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-06 23:59:42,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:42,504 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-06 23:59:42,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 23:59:42,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995311565] [2024-11-06 23:59:42,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995311565] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 23:59:42,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 23:59:42,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-06 23:59:42,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720935390] [2024-11-06 23:59:42,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 23:59:42,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-06 23:59:42,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 23:59:42,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-06 23:59:42,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-06 23:59:42,507 INFO L87 Difference]: Start difference. First operand 4312 states and 5812 transitions. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 3 states have internal predecessors, (69), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-06 23:59:43,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 23:59:43,256 INFO L93 Difference]: Finished difference Result 10234 states and 13951 transitions. [2024-11-06 23:59:43,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-06 23:59:43,256 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 3 states have internal predecessors, (69), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 102 [2024-11-06 23:59:43,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 23:59:43,294 INFO L225 Difference]: With dead ends: 10234 [2024-11-06 23:59:43,294 INFO L226 Difference]: Without dead ends: 6733 [2024-11-06 23:59:43,303 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-11-06 23:59:43,304 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 439 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 451 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-06 23:59:43,305 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [451 Valid, 318 Invalid, 315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-06 23:59:43,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6733 states. [2024-11-06 23:59:43,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6733 to 5893. [2024-11-06 23:59:43,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5893 states, 4984 states have (on average 1.2951444622792938) internal successors, (6455), 5049 states have internal predecessors, (6455), 504 states have call successors, (504), 321 states have call predecessors, (504), 404 states have return successors, (923), 523 states have call predecessors, (923), 504 states have call successors, (923) [2024-11-06 23:59:43,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5893 states to 5893 states and 7882 transitions. [2024-11-06 23:59:43,661 INFO L78 Accepts]: Start accepts. Automaton has 5893 states and 7882 transitions. Word has length 102 [2024-11-06 23:59:43,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 23:59:43,661 INFO L471 AbstractCegarLoop]: Abstraction has 5893 states and 7882 transitions. [2024-11-06 23:59:43,661 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 3 states have internal predecessors, (69), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-06 23:59:43,661 INFO L276 IsEmpty]: Start isEmpty. Operand 5893 states and 7882 transitions. [2024-11-06 23:59:43,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-06 23:59:43,665 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 23:59:43,665 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 23:59:43,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-06 23:59:43,665 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 23:59:43,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 23:59:43,665 INFO L85 PathProgramCache]: Analyzing trace with hash 2035116046, now seen corresponding path program 1 times [2024-11-06 23:59:43,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 23:59:43,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395843712] [2024-11-06 23:59:43,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 23:59:43,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 23:59:43,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:43,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-06 23:59:43,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:43,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-06 23:59:43,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:43,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-06 23:59:43,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:43,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-06 23:59:43,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:43,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-06 23:59:43,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:43,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-06 23:59:43,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:43,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-06 23:59:43,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:43,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-06 23:59:43,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:43,759 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 5 proven. 21 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-06 23:59:43,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 23:59:43,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395843712] [2024-11-06 23:59:43,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395843712] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 23:59:43,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1139876968] [2024-11-06 23:59:43,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 23:59:43,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 23:59:43,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 23:59:43,763 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-06 23:59:43,764 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-06 23:59:43,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:43,826 INFO L255 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-06 23:59:43,828 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 23:59:43,908 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-06 23:59:43,909 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 23:59:43,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1139876968] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 23:59:43,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-06 23:59:43,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 7 [2024-11-06 23:59:43,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509391648] [2024-11-06 23:59:43,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 23:59:43,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 23:59:43,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 23:59:43,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 23:59:43,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-06 23:59:43,915 INFO L87 Difference]: Start difference. First operand 5893 states and 7882 transitions. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 2 states have internal predecessors, (95), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-06 23:59:44,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 23:59:44,254 INFO L93 Difference]: Finished difference Result 13842 states and 18528 transitions. [2024-11-06 23:59:44,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 23:59:44,255 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 2 states have internal predecessors, (95), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 120 [2024-11-06 23:59:44,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 23:59:44,278 INFO L225 Difference]: With dead ends: 13842 [2024-11-06 23:59:44,278 INFO L226 Difference]: Without dead ends: 7946 [2024-11-06 23:59:44,291 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-06 23:59:44,291 INFO L432 NwaCegarLoop]: 223 mSDtfsCounter, 87 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 373 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 23:59:44,291 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 373 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 23:59:44,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7946 states. [2024-11-06 23:59:44,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7946 to 7880. [2024-11-06 23:59:44,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7880 states, 6661 states have (on average 1.291697943251764) internal successors, (8604), 6741 states have internal predecessors, (8604), 682 states have call successors, (682), 438 states have call predecessors, (682), 536 states have return successors, (1154), 701 states have call predecessors, (1154), 682 states have call successors, (1154) [2024-11-06 23:59:44,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7880 states to 7880 states and 10440 transitions. [2024-11-06 23:59:44,979 INFO L78 Accepts]: Start accepts. Automaton has 7880 states and 10440 transitions. Word has length 120 [2024-11-06 23:59:44,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 23:59:44,979 INFO L471 AbstractCegarLoop]: Abstraction has 7880 states and 10440 transitions. [2024-11-06 23:59:44,979 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 2 states have internal predecessors, (95), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-06 23:59:44,980 INFO L276 IsEmpty]: Start isEmpty. Operand 7880 states and 10440 transitions. [2024-11-06 23:59:44,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-06 23:59:44,983 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 23:59:44,983 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 23:59:44,995 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-06 23:59:45,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-06 23:59:45,184 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 23:59:45,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 23:59:45,184 INFO L85 PathProgramCache]: Analyzing trace with hash 1086589995, now seen corresponding path program 1 times [2024-11-06 23:59:45,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 23:59:45,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144651499] [2024-11-06 23:59:45,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 23:59:45,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 23:59:45,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:45,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-06 23:59:45,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:45,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-06 23:59:45,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:45,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-06 23:59:45,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:45,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-06 23:59:45,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:45,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-06 23:59:45,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:45,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-06 23:59:45,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:45,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-06 23:59:45,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:45,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-06 23:59:45,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:45,275 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 5 proven. 21 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-06 23:59:45,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 23:59:45,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144651499] [2024-11-06 23:59:45,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144651499] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 23:59:45,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2137257575] [2024-11-06 23:59:45,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 23:59:45,276 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 23:59:45,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 23:59:45,278 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-06 23:59:45,279 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-06 23:59:45,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:45,348 INFO L255 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-06 23:59:45,350 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 23:59:45,414 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-06 23:59:45,414 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 23:59:45,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2137257575] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 23:59:45,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-06 23:59:45,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-11-06 23:59:45,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342306550] [2024-11-06 23:59:45,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 23:59:45,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 23:59:45,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 23:59:45,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 23:59:45,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-06 23:59:45,417 INFO L87 Difference]: Start difference. First operand 7880 states and 10440 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 2 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-06 23:59:45,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 23:59:45,848 INFO L93 Difference]: Finished difference Result 16618 states and 22420 transitions. [2024-11-06 23:59:45,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 23:59:45,848 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 2 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 122 [2024-11-06 23:59:45,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 23:59:45,876 INFO L225 Difference]: With dead ends: 16618 [2024-11-06 23:59:45,877 INFO L226 Difference]: Without dead ends: 9561 [2024-11-06 23:59:45,892 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-06 23:59:45,892 INFO L432 NwaCegarLoop]: 173 mSDtfsCounter, 122 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 23:59:45,893 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 219 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 23:59:45,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9561 states. [2024-11-06 23:59:46,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9561 to 9454. [2024-11-06 23:59:46,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9454 states, 8061 states have (on average 1.2647314229003845) internal successors, (10195), 8157 states have internal predecessors, (10195), 758 states have call successors, (758), 529 states have call predecessors, (758), 634 states have return successors, (1380), 768 states have call predecessors, (1380), 758 states have call successors, (1380) [2024-11-06 23:59:46,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9454 states to 9454 states and 12333 transitions. [2024-11-06 23:59:46,390 INFO L78 Accepts]: Start accepts. Automaton has 9454 states and 12333 transitions. Word has length 122 [2024-11-06 23:59:46,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 23:59:46,390 INFO L471 AbstractCegarLoop]: Abstraction has 9454 states and 12333 transitions. [2024-11-06 23:59:46,391 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 2 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-06 23:59:46,391 INFO L276 IsEmpty]: Start isEmpty. Operand 9454 states and 12333 transitions. [2024-11-06 23:59:46,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-06 23:59:46,393 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 23:59:46,393 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 23:59:46,409 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-06 23:59:46,597 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 23:59:46,598 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 23:59:46,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 23:59:46,599 INFO L85 PathProgramCache]: Analyzing trace with hash -949299769, now seen corresponding path program 1 times [2024-11-06 23:59:46,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 23:59:46,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940395903] [2024-11-06 23:59:46,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 23:59:46,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 23:59:46,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:46,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-06 23:59:46,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:46,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-06 23:59:46,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:46,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-06 23:59:46,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:46,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-06 23:59:46,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:46,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-06 23:59:46,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:46,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-06 23:59:46,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:46,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-06 23:59:46,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:46,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-06 23:59:46,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:46,690 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 5 proven. 21 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-06 23:59:46,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 23:59:46,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940395903] [2024-11-06 23:59:46,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940395903] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 23:59:46,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1981826235] [2024-11-06 23:59:46,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 23:59:46,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 23:59:46,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 23:59:46,692 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-06 23:59:46,694 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-06 23:59:46,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:46,756 INFO L255 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-06 23:59:46,759 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 23:59:46,795 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 23:59:46,796 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 23:59:46,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1981826235] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 23:59:46,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-06 23:59:46,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-11-06 23:59:46,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582426019] [2024-11-06 23:59:46,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 23:59:46,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 23:59:46,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 23:59:46,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 23:59:46,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-06 23:59:46,800 INFO L87 Difference]: Start difference. First operand 9454 states and 12333 transitions. Second operand has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-11-06 23:59:47,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 23:59:47,405 INFO L93 Difference]: Finished difference Result 17326 states and 22550 transitions. [2024-11-06 23:59:47,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 23:59:47,409 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 124 [2024-11-06 23:59:47,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 23:59:47,455 INFO L225 Difference]: With dead ends: 17326 [2024-11-06 23:59:47,455 INFO L226 Difference]: Without dead ends: 10143 [2024-11-06 23:59:47,473 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-06 23:59:47,474 INFO L432 NwaCegarLoop]: 278 mSDtfsCounter, 122 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 440 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 23:59:47,474 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 440 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 23:59:47,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10143 states. [2024-11-06 23:59:48,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10143 to 10056. [2024-11-06 23:59:48,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10056 states, 8636 states have (on average 1.2549791570171376) internal successors, (10838), 8738 states have internal predecessors, (10838), 758 states have call successors, (758), 550 states have call predecessors, (758), 661 states have return successors, (1272), 768 states have call predecessors, (1272), 758 states have call successors, (1272) [2024-11-06 23:59:48,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10056 states to 10056 states and 12868 transitions. [2024-11-06 23:59:48,228 INFO L78 Accepts]: Start accepts. Automaton has 10056 states and 12868 transitions. Word has length 124 [2024-11-06 23:59:48,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 23:59:48,229 INFO L471 AbstractCegarLoop]: Abstraction has 10056 states and 12868 transitions. [2024-11-06 23:59:48,229 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-11-06 23:59:48,229 INFO L276 IsEmpty]: Start isEmpty. Operand 10056 states and 12868 transitions. [2024-11-06 23:59:48,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-06 23:59:48,234 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 23:59:48,234 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 23:59:48,246 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-06 23:59:48,434 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 23:59:48,435 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 23:59:48,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 23:59:48,436 INFO L85 PathProgramCache]: Analyzing trace with hash 1922252635, now seen corresponding path program 1 times [2024-11-06 23:59:48,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 23:59:48,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886006133] [2024-11-06 23:59:48,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 23:59:48,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 23:59:48,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:48,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-06 23:59:48,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:48,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-06 23:59:48,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:48,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-06 23:59:48,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:48,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-06 23:59:48,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:48,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-06 23:59:48,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:48,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-06 23:59:48,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:48,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-06 23:59:48,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:48,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-06 23:59:48,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:48,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-06 23:59:48,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:48,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-06 23:59:48,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:48,550 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 5 proven. 39 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2024-11-06 23:59:48,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 23:59:48,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886006133] [2024-11-06 23:59:48,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1886006133] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 23:59:48,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1921297214] [2024-11-06 23:59:48,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 23:59:48,552 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 23:59:48,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 23:59:48,554 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-06 23:59:48,556 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-06 23:59:48,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:48,634 INFO L255 TraceCheckSpWp]: Trace formula consists of 451 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-06 23:59:48,637 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 23:59:48,654 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-11-06 23:59:48,656 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 23:59:48,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1921297214] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 23:59:48,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-06 23:59:48,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 6 [2024-11-06 23:59:48,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895156252] [2024-11-06 23:59:48,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 23:59:48,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 23:59:48,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 23:59:48,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 23:59:48,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-06 23:59:48,658 INFO L87 Difference]: Start difference. First operand 10056 states and 12868 transitions. Second operand has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-06 23:59:49,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 23:59:49,730 INFO L93 Difference]: Finished difference Result 29339 states and 37985 transitions. [2024-11-06 23:59:49,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 23:59:49,730 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) Word has length 157 [2024-11-06 23:59:49,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 23:59:49,805 INFO L225 Difference]: With dead ends: 29339 [2024-11-06 23:59:49,805 INFO L226 Difference]: Without dead ends: 19295 [2024-11-06 23:59:49,825 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-06 23:59:49,826 INFO L432 NwaCegarLoop]: 216 mSDtfsCounter, 150 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 373 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 23:59:49,826 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 373 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 23:59:49,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19295 states. [2024-11-06 23:59:50,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19295 to 19280. [2024-11-06 23:59:50,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19280 states, 16580 states have (on average 1.244270205066345) internal successors, (20630), 16773 states have internal predecessors, (20630), 1433 states have call successors, (1433), 1059 states have call predecessors, (1433), 1266 states have return successors, (2696), 1449 states have call predecessors, (2696), 1433 states have call successors, (2696) [2024-11-06 23:59:50,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19280 states to 19280 states and 24759 transitions. [2024-11-06 23:59:50,846 INFO L78 Accepts]: Start accepts. Automaton has 19280 states and 24759 transitions. Word has length 157 [2024-11-06 23:59:50,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 23:59:50,846 INFO L471 AbstractCegarLoop]: Abstraction has 19280 states and 24759 transitions. [2024-11-06 23:59:50,846 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-06 23:59:50,846 INFO L276 IsEmpty]: Start isEmpty. Operand 19280 states and 24759 transitions. [2024-11-06 23:59:50,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-06 23:59:50,853 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 23:59:50,853 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 23:59:50,866 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-06 23:59:51,053 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 23:59:51,054 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 23:59:51,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 23:59:51,055 INFO L85 PathProgramCache]: Analyzing trace with hash 806131337, now seen corresponding path program 1 times [2024-11-06 23:59:51,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 23:59:51,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373157649] [2024-11-06 23:59:51,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 23:59:51,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 23:59:51,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:51,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-06 23:59:51,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:51,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-06 23:59:51,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:51,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-06 23:59:51,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:51,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-06 23:59:51,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:51,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-06 23:59:51,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:51,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-06 23:59:51,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:51,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-06 23:59:51,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:51,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-06 23:59:51,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:51,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-06 23:59:51,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:51,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-06 23:59:51,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:51,115 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2024-11-06 23:59:51,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 23:59:51,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373157649] [2024-11-06 23:59:51,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1373157649] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 23:59:51,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 23:59:51,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-06 23:59:51,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143277699] [2024-11-06 23:59:51,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 23:59:51,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-06 23:59:51,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 23:59:51,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-06 23:59:51,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-06 23:59:51,117 INFO L87 Difference]: Start difference. First operand 19280 states and 24759 transitions. Second operand has 5 states, 5 states have (on average 18.2) internal successors, (91), 3 states have internal predecessors, (91), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-11-06 23:59:52,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 23:59:52,454 INFO L93 Difference]: Finished difference Result 39917 states and 51415 transitions. [2024-11-06 23:59:52,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-06 23:59:52,454 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 3 states have internal predecessors, (91), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 158 [2024-11-06 23:59:52,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 23:59:52,523 INFO L225 Difference]: With dead ends: 39917 [2024-11-06 23:59:52,523 INFO L226 Difference]: Without dead ends: 20649 [2024-11-06 23:59:52,550 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-06 23:59:52,550 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 339 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 360 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-06 23:59:52,550 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [360 Valid, 236 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-06 23:59:52,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20649 states. [2024-11-06 23:59:53,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20649 to 18566. [2024-11-06 23:59:53,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18566 states, 16022 states have (on average 1.241792535264012) internal successors, (19896), 16226 states have internal predecessors, (19896), 1328 states have call successors, (1328), 993 states have call predecessors, (1328), 1215 states have return successors, (2569), 1347 states have call predecessors, (2569), 1328 states have call successors, (2569) [2024-11-06 23:59:53,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18566 states to 18566 states and 23793 transitions. [2024-11-06 23:59:53,995 INFO L78 Accepts]: Start accepts. Automaton has 18566 states and 23793 transitions. Word has length 158 [2024-11-06 23:59:53,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 23:59:53,995 INFO L471 AbstractCegarLoop]: Abstraction has 18566 states and 23793 transitions. [2024-11-06 23:59:53,995 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 3 states have internal predecessors, (91), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-11-06 23:59:53,995 INFO L276 IsEmpty]: Start isEmpty. Operand 18566 states and 23793 transitions. [2024-11-06 23:59:54,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-11-06 23:59:54,000 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 23:59:54,000 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 23:59:54,000 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-06 23:59:54,000 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 23:59:54,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 23:59:54,001 INFO L85 PathProgramCache]: Analyzing trace with hash -836659987, now seen corresponding path program 1 times [2024-11-06 23:59:54,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 23:59:54,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595448007] [2024-11-06 23:59:54,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 23:59:54,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 23:59:54,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:54,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-06 23:59:54,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:54,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-06 23:59:54,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:54,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-06 23:59:54,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:54,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-06 23:59:54,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:54,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-06 23:59:54,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:54,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-06 23:59:54,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:54,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-06 23:59:54,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:54,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-06 23:59:54,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:54,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-06 23:59:54,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:54,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-06 23:59:54,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:54,058 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 23 proven. 7 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2024-11-06 23:59:54,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 23:59:54,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595448007] [2024-11-06 23:59:54,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595448007] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 23:59:54,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2117839327] [2024-11-06 23:59:54,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 23:59:54,058 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 23:59:54,058 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 23:59:54,061 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-06 23:59:54,062 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-06 23:59:54,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:54,133 INFO L255 TraceCheckSpWp]: Trace formula consists of 457 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-06 23:59:54,134 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 23:59:54,161 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-06 23:59:54,161 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 23:59:54,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2117839327] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 23:59:54,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-06 23:59:54,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 6 [2024-11-06 23:59:54,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315780045] [2024-11-06 23:59:54,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 23:59:54,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 23:59:54,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 23:59:54,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 23:59:54,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-06 23:59:54,162 INFO L87 Difference]: Start difference. First operand 18566 states and 23793 transitions. Second operand has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2024-11-06 23:59:55,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 23:59:55,025 INFO L93 Difference]: Finished difference Result 29293 states and 38546 transitions. [2024-11-06 23:59:55,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 23:59:55,025 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 159 [2024-11-06 23:59:55,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 23:59:55,084 INFO L225 Difference]: With dead ends: 29293 [2024-11-06 23:59:55,084 INFO L226 Difference]: Without dead ends: 18186 [2024-11-06 23:59:55,108 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-06 23:59:55,110 INFO L432 NwaCegarLoop]: 310 mSDtfsCounter, 120 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 468 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 23:59:55,110 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 468 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 23:59:55,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18186 states. [2024-11-06 23:59:56,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18186 to 18124. [2024-11-06 23:59:56,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18124 states, 15580 states have (on average 1.2297175866495507) internal successors, (19159), 15784 states have internal predecessors, (19159), 1328 states have call successors, (1328), 993 states have call predecessors, (1328), 1215 states have return successors, (2569), 1347 states have call predecessors, (2569), 1328 states have call successors, (2569) [2024-11-06 23:59:56,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18124 states to 18124 states and 23056 transitions. [2024-11-06 23:59:56,102 INFO L78 Accepts]: Start accepts. Automaton has 18124 states and 23056 transitions. Word has length 159 [2024-11-06 23:59:56,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 23:59:56,102 INFO L471 AbstractCegarLoop]: Abstraction has 18124 states and 23056 transitions. [2024-11-06 23:59:56,103 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2024-11-06 23:59:56,103 INFO L276 IsEmpty]: Start isEmpty. Operand 18124 states and 23056 transitions. [2024-11-06 23:59:56,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-06 23:59:56,108 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 23:59:56,108 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 23:59:56,120 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-06 23:59:56,311 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2024-11-06 23:59:56,312 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 23:59:56,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 23:59:56,312 INFO L85 PathProgramCache]: Analyzing trace with hash -1562564278, now seen corresponding path program 1 times [2024-11-06 23:59:56,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 23:59:56,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312934516] [2024-11-06 23:59:56,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 23:59:56,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 23:59:56,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:56,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-06 23:59:56,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:56,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-06 23:59:56,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:56,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-06 23:59:56,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:56,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-06 23:59:56,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:56,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-06 23:59:56,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:56,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-06 23:59:56,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:56,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-06 23:59:56,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:56,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-06 23:59:56,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:56,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-06 23:59:56,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:56,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-06 23:59:56,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:56,393 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2024-11-06 23:59:56,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 23:59:56,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312934516] [2024-11-06 23:59:56,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [312934516] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 23:59:56,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 23:59:56,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-06 23:59:56,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570274586] [2024-11-06 23:59:56,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 23:59:56,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-06 23:59:56,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 23:59:56,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-06 23:59:56,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-06 23:59:56,395 INFO L87 Difference]: Start difference. First operand 18124 states and 23056 transitions. Second operand has 6 states, 6 states have (on average 19.333333333333332) internal successors, (116), 4 states have internal predecessors, (116), 3 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2024-11-06 23:59:57,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 23:59:57,583 INFO L93 Difference]: Finished difference Result 31318 states and 40022 transitions. [2024-11-06 23:59:57,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-06 23:59:57,583 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 19.333333333333332) internal successors, (116), 4 states have internal predecessors, (116), 3 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 160 [2024-11-06 23:59:57,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 23:59:57,628 INFO L225 Difference]: With dead ends: 31318 [2024-11-06 23:59:57,628 INFO L226 Difference]: Without dead ends: 14908 [2024-11-06 23:59:57,648 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2024-11-06 23:59:57,649 INFO L432 NwaCegarLoop]: 184 mSDtfsCounter, 575 mSDsluCounter, 356 mSDsCounter, 0 mSdLazyCounter, 489 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 610 SdHoareTripleChecker+Valid, 540 SdHoareTripleChecker+Invalid, 546 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 489 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-06 23:59:57,650 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [610 Valid, 540 Invalid, 546 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 489 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-06 23:59:57,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14908 states. [2024-11-06 23:59:58,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14908 to 13406. [2024-11-06 23:59:58,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13406 states, 11606 states have (on average 1.2093744614854385) internal successors, (14036), 11756 states have internal predecessors, (14036), 919 states have call successors, (919), 708 states have call predecessors, (919), 880 states have return successors, (1539), 942 states have call predecessors, (1539), 919 states have call successors, (1539) [2024-11-06 23:59:58,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13406 states to 13406 states and 16494 transitions. [2024-11-06 23:59:58,314 INFO L78 Accepts]: Start accepts. Automaton has 13406 states and 16494 transitions. Word has length 160 [2024-11-06 23:59:58,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 23:59:58,314 INFO L471 AbstractCegarLoop]: Abstraction has 13406 states and 16494 transitions. [2024-11-06 23:59:58,314 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.333333333333332) internal successors, (116), 4 states have internal predecessors, (116), 3 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2024-11-06 23:59:58,315 INFO L276 IsEmpty]: Start isEmpty. Operand 13406 states and 16494 transitions. [2024-11-06 23:59:58,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-11-06 23:59:58,318 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 23:59:58,318 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 23:59:58,318 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-06 23:59:58,318 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 23:59:58,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 23:59:58,318 INFO L85 PathProgramCache]: Analyzing trace with hash -1560316271, now seen corresponding path program 1 times [2024-11-06 23:59:58,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 23:59:58,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053075349] [2024-11-06 23:59:58,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 23:59:58,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 23:59:58,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:58,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-06 23:59:58,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:58,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-06 23:59:58,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:58,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-06 23:59:58,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:58,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-06 23:59:58,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:58,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-06 23:59:58,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:58,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-06 23:59:58,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:58,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-06 23:59:58,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:58,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-06 23:59:58,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:58,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-06 23:59:58,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:58,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-06 23:59:58,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:58,384 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 39 proven. 13 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-06 23:59:58,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 23:59:58,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053075349] [2024-11-06 23:59:58,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053075349] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 23:59:58,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [434296057] [2024-11-06 23:59:58,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 23:59:58,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 23:59:58,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 23:59:58,387 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-06 23:59:58,390 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-06 23:59:58,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:59:58,460 INFO L255 TraceCheckSpWp]: Trace formula consists of 461 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-06 23:59:58,462 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 23:59:58,521 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-06 23:59:58,522 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 23:59:58,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [434296057] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 23:59:58,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-06 23:59:58,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 6 [2024-11-06 23:59:58,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974443111] [2024-11-06 23:59:58,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 23:59:58,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 23:59:58,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 23:59:58,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 23:59:58,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-06 23:59:58,524 INFO L87 Difference]: Start difference. First operand 13406 states and 16494 transitions. Second operand has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-06 23:59:59,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 23:59:59,380 INFO L93 Difference]: Finished difference Result 23848 states and 29765 transitions. [2024-11-06 23:59:59,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 23:59:59,381 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) Word has length 161 [2024-11-06 23:59:59,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 23:59:59,424 INFO L225 Difference]: With dead ends: 23848 [2024-11-06 23:59:59,424 INFO L226 Difference]: Without dead ends: 13447 [2024-11-06 23:59:59,441 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-06 23:59:59,442 INFO L432 NwaCegarLoop]: 255 mSDtfsCounter, 90 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 23:59:59,442 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 406 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 23:59:59,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13447 states. [2024-11-07 00:00:00,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13447 to 13394. [2024-11-07 00:00:00,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13394 states, 11594 states have (on average 1.1880282904950836) internal successors, (13774), 11744 states have internal predecessors, (13774), 919 states have call successors, (919), 708 states have call predecessors, (919), 880 states have return successors, (1539), 942 states have call predecessors, (1539), 919 states have call successors, (1539) [2024-11-07 00:00:00,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13394 states to 13394 states and 16232 transitions. [2024-11-07 00:00:00,376 INFO L78 Accepts]: Start accepts. Automaton has 13394 states and 16232 transitions. Word has length 161 [2024-11-07 00:00:00,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:00:00,376 INFO L471 AbstractCegarLoop]: Abstraction has 13394 states and 16232 transitions. [2024-11-07 00:00:00,376 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-07 00:00:00,376 INFO L276 IsEmpty]: Start isEmpty. Operand 13394 states and 16232 transitions. [2024-11-07 00:00:00,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-11-07 00:00:00,380 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:00:00,380 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:00:00,393 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-07 00:00:00,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 00:00:00,581 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:00:00,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:00:00,581 INFO L85 PathProgramCache]: Analyzing trace with hash 1877011828, now seen corresponding path program 2 times [2024-11-07 00:00:00,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:00:00,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443869445] [2024-11-07 00:00:00,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:00:00,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:00:00,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:00,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-07 00:00:00,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:00,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 00:00:00,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:00,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-07 00:00:00,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:00,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-07 00:00:00,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:00,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-07 00:00:00,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:00,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 00:00:00,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:00,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-07 00:00:00,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:00,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-07 00:00:00,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:00,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-07 00:00:00,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:00,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-07 00:00:00,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:00:00,706 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-11-07 00:00:00,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:00:00,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443869445] [2024-11-07 00:00:00,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443869445] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:00:00,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:00:00,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 00:00:00,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734221844] [2024-11-07 00:00:00,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:00:00,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 00:00:00,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:00:00,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 00:00:00,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-07 00:00:00,708 INFO L87 Difference]: Start difference. First operand 13394 states and 16232 transitions. Second operand has 8 states, 8 states have (on average 13.875) internal successors, (111), 6 states have internal predecessors, (111), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2024-11-07 00:00:02,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:00:02,718 INFO L93 Difference]: Finished difference Result 33256 states and 41784 transitions. [2024-11-07 00:00:02,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-07 00:00:02,719 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.875) internal successors, (111), 6 states have internal predecessors, (111), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) Word has length 161 [2024-11-07 00:00:02,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:00:02,803 INFO L225 Difference]: With dead ends: 33256 [2024-11-07 00:00:02,804 INFO L226 Difference]: Without dead ends: 19874 [2024-11-07 00:00:02,832 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=150, Invalid=500, Unknown=0, NotChecked=0, Total=650 [2024-11-07 00:00:02,833 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 966 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 630 mSolverCounterSat, 192 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 978 SdHoareTripleChecker+Valid, 446 SdHoareTripleChecker+Invalid, 822 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 192 IncrementalHoareTripleChecker+Valid, 630 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-07 00:00:02,833 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [978 Valid, 446 Invalid, 822 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [192 Valid, 630 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-07 00:00:02,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19874 states. [2024-11-07 00:00:04,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19874 to 18621. [2024-11-07 00:00:04,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18621 states, 16042 states have (on average 1.1393841166936791) internal successors, (18278), 16321 states have internal predecessors, (18278), 1245 states have call successors, (1245), 1032 states have call predecessors, (1245), 1333 states have return successors, (2280), 1268 states have call predecessors, (2280), 1245 states have call successors, (2280) [2024-11-07 00:00:04,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18621 states to 18621 states and 21803 transitions. [2024-11-07 00:00:04,211 INFO L78 Accepts]: Start accepts. Automaton has 18621 states and 21803 transitions. Word has length 161 [2024-11-07 00:00:04,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:00:04,211 INFO L471 AbstractCegarLoop]: Abstraction has 18621 states and 21803 transitions. [2024-11-07 00:00:04,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.875) internal successors, (111), 6 states have internal predecessors, (111), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2024-11-07 00:00:04,212 INFO L276 IsEmpty]: Start isEmpty. Operand 18621 states and 21803 transitions. [2024-11-07 00:00:04,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-07 00:00:04,216 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:00:04,217 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:00:04,217 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-07 00:00:04,217 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:00:04,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:00:04,217 INFO L85 PathProgramCache]: Analyzing trace with hash -1133842763, now seen corresponding path program 1 times [2024-11-07 00:00:04,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:00:04,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842499947] [2024-11-07 00:00:04,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:00:04,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:00:04,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 00:00:04,232 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 00:00:04,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 00:00:04,285 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 00:00:04,286 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 00:00:04,286 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-07 00:00:04,288 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-07 00:00:04,291 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:00:04,424 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 00:00:04,431 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 12:00:04 BoogieIcfgContainer [2024-11-07 00:00:04,432 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 00:00:04,433 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 00:00:04,433 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 00:00:04,433 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 00:00:04,434 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 11:59:30" (3/4) ... [2024-11-07 00:00:04,435 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-07 00:00:04,562 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-07 00:00:04,562 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 00:00:04,563 INFO L158 Benchmark]: Toolchain (without parser) took 35136.61ms. Allocated memory was 117.4MB in the beginning and 3.7GB in the end (delta: 3.6GB). Free memory was 92.2MB in the beginning and 3.5GB in the end (delta: -3.4GB). Peak memory consumption was 243.4MB. Max. memory is 16.1GB. [2024-11-07 00:00:04,565 INFO L158 Benchmark]: CDTParser took 0.45ms. Allocated memory is still 117.4MB. Free memory is still 81.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 00:00:04,565 INFO L158 Benchmark]: CACSL2BoogieTranslator took 213.82ms. Allocated memory is still 117.4MB. Free memory was 92.2MB in the beginning and 78.6MB in the end (delta: 13.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 00:00:04,566 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.57ms. Allocated memory is still 117.4MB. Free memory was 78.6MB in the beginning and 76.9MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 00:00:04,566 INFO L158 Benchmark]: Boogie Preprocessor took 28.79ms. Allocated memory is still 117.4MB. Free memory was 76.7MB in the beginning and 74.9MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 00:00:04,566 INFO L158 Benchmark]: RCFGBuilder took 396.69ms. Allocated memory is still 117.4MB. Free memory was 74.9MB in the beginning and 54.8MB in the end (delta: 20.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 00:00:04,566 INFO L158 Benchmark]: TraceAbstraction took 34329.87ms. Allocated memory was 117.4MB in the beginning and 3.7GB in the end (delta: 3.6GB). Free memory was 54.3MB in the beginning and 3.5GB in the end (delta: -3.4GB). Peak memory consumption was 201.5MB. Max. memory is 16.1GB. [2024-11-07 00:00:04,567 INFO L158 Benchmark]: Witness Printer took 129.69ms. Allocated memory is still 3.7GB. Free memory was 3.5GB in the beginning and 3.5GB in the end (delta: 12.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 00:00:04,568 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.45ms. Allocated memory is still 117.4MB. Free memory is still 81.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 213.82ms. Allocated memory is still 117.4MB. Free memory was 92.2MB in the beginning and 78.6MB in the end (delta: 13.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.57ms. Allocated memory is still 117.4MB. Free memory was 78.6MB in the beginning and 76.9MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 28.79ms. Allocated memory is still 117.4MB. Free memory was 76.7MB in the beginning and 74.9MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 396.69ms. Allocated memory is still 117.4MB. Free memory was 74.9MB in the beginning and 54.8MB in the end (delta: 20.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 34329.87ms. Allocated memory was 117.4MB in the beginning and 3.7GB in the end (delta: 3.6GB). Free memory was 54.3MB in the beginning and 3.5GB in the end (delta: -3.4GB). Peak memory consumption was 201.5MB. Max. memory is 16.1GB. * Witness Printer took 129.69ms. Allocated memory is still 3.7GB. Free memory was 3.5GB in the beginning and 3.5GB in the end (delta: 12.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 21]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L25] int m_pc = 0; [L26] int t1_pc = 0; [L27] int t2_pc = 0; [L28] int m_st ; [L29] int t1_st ; [L30] int t2_st ; [L31] int m_i ; [L32] int t1_i ; [L33] int t2_i ; [L34] int M_E = 2; [L35] int T1_E = 2; [L36] int T2_E = 2; [L37] int E_1 = 2; [L38] int E_2 = 2; VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, m_i=0, m_pc=0, m_st=0, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0] [L573] int __retres1 ; [L577] CALL init_model() [L487] m_i = 1 [L488] t1_i = 1 [L489] t2_i = 1 VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L577] RET init_model() [L578] CALL start_simulation() [L514] int kernel_st ; [L515] int tmp ; [L516] int tmp___0 ; [L520] kernel_st = 0 VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L521] FCALL update_channels() VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L522] CALL init_threads() [L221] COND TRUE m_i == 1 [L222] m_st = 0 VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L226] COND TRUE t1_i == 1 [L227] t1_st = 0 VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L231] COND TRUE t2_i == 1 [L232] t2_st = 0 VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L522] RET init_threads() [L523] CALL fire_delta_events() VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L334] COND FALSE !(M_E == 0) VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L339] COND FALSE !(T1_E == 0) VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L344] COND FALSE !(T2_E == 0) VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L349] COND FALSE !(E_1 == 0) VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L354] COND FALSE !(E_2 == 0) VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L523] RET fire_delta_events() VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L524] CALL activate_threads() VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L397] int tmp ; [L398] int tmp___0 ; [L399] int tmp___1 ; [L403] CALL, EXPR is_master_triggered() [L153] int __retres1 ; VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L156] COND FALSE !(m_pc == 1) VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L166] __retres1 = 0 VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, __retres1=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L168] return (__retres1); VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \result=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L403] RET, EXPR is_master_triggered() [L403] tmp = is_master_triggered() [L405] COND FALSE !(\read(tmp)) VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L411] CALL, EXPR is_transmit1_triggered() [L172] int __retres1 ; VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L175] COND FALSE !(t1_pc == 1) VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L185] __retres1 = 0 VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, __retres1=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L187] return (__retres1); VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \result=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L411] RET, EXPR is_transmit1_triggered() [L411] tmp___0 = is_transmit1_triggered() [L413] COND FALSE !(\read(tmp___0)) VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L419] CALL, EXPR is_transmit2_triggered() [L191] int __retres1 ; VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L194] COND FALSE !(t2_pc == 1) VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L204] __retres1 = 0 VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, __retres1=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L206] return (__retres1); VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \result=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L419] RET, EXPR is_transmit2_triggered() [L419] tmp___1 = is_transmit2_triggered() [L421] COND FALSE !(\read(tmp___1)) VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L524] RET activate_threads() VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L525] CALL reset_delta_events() VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L367] COND FALSE !(M_E == 1) VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L372] COND FALSE !(T1_E == 1) VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L377] COND FALSE !(T2_E == 1) VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L382] COND FALSE !(E_1 == 1) VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L387] COND FALSE !(E_2 == 1) VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L525] RET reset_delta_events() VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L528] COND TRUE 1 VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L531] kernel_st = 1 [L532] CALL eval() [L267] int tmp ; VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L271] COND TRUE 1 VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L274] CALL, EXPR exists_runnable_thread() VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L241] int __retres1 ; VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L244] COND TRUE m_st == 0 [L245] __retres1 = 1 VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, __retres1=1, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L262] return (__retres1); VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \result=1, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L274] RET, EXPR exists_runnable_thread() VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L274] tmp = exists_runnable_thread() [L276] COND TRUE \read(tmp) VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L281] COND TRUE m_st == 0 [L282] int tmp_ndt_1; [L283] tmp_ndt_1 = __VERIFIER_nondet_int() [L284] COND FALSE !(\read(tmp_ndt_1)) VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0] [L295] COND TRUE t1_st == 0 [L296] int tmp_ndt_2; [L297] tmp_ndt_2 = __VERIFIER_nondet_int() [L298] COND TRUE \read(tmp_ndt_2) [L300] t1_st = 1 [L301] CALL transmit1() [L88] COND TRUE t1_pc == 0 VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=1, t2_i=1, t2_pc=0, t2_st=0] [L99] COND TRUE 1 VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=1, t2_i=1, t2_pc=0, t2_st=0] [L101] t1_pc = 1 [L102] t1_st = 2 VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=0, t2_st=0] [L301] RET transmit1() [L309] COND TRUE t2_st == 0 [L310] int tmp_ndt_3; [L311] tmp_ndt_3 = __VERIFIER_nondet_int() [L312] COND TRUE \read(tmp_ndt_3) [L314] t2_st = 1 [L315] CALL transmit2() [L123] COND TRUE t2_pc == 0 VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=0, t2_st=1] [L134] COND TRUE 1 VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=0, t2_st=1] [L136] t2_pc = 1 [L137] t2_st = 2 VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2] [L315] RET transmit2() [L271] COND TRUE 1 VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2] [L274] CALL, EXPR exists_runnable_thread() VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2] [L241] int __retres1 ; VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2] [L244] COND TRUE m_st == 0 [L245] __retres1 = 1 VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, __retres1=1, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2] [L262] return (__retres1); VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, \result=1, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2] [L274] RET, EXPR exists_runnable_thread() VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2] [L274] tmp = exists_runnable_thread() [L276] COND TRUE \read(tmp) VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2] [L281] COND TRUE m_st == 0 [L282] int tmp_ndt_1; [L283] tmp_ndt_1 = __VERIFIER_nondet_int() [L284] COND TRUE \read(tmp_ndt_1) [L286] m_st = 1 [L287] CALL master() [L47] COND TRUE m_pc == 0 VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2] [L58] COND TRUE 1 VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2] [L61] E_1 = 1 VAL [E_1=1, E_2=2, M_E=2, T1_E=2, T2_E=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2] [L62] CALL immediate_notify() VAL [E_1=1, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2] [L435] CALL activate_threads() VAL [E_1=1, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2] [L397] int tmp ; [L398] int tmp___0 ; [L399] int tmp___1 ; [L403] CALL, EXPR is_master_triggered() [L153] int __retres1 ; VAL [E_1=1, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2] [L156] COND FALSE !(m_pc == 1) VAL [E_1=1, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2] [L166] __retres1 = 0 VAL [E_1=1, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, __retres1=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2] [L168] return (__retres1); VAL [E_1=1, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \result=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2] [L403] RET, EXPR is_master_triggered() [L403] tmp = is_master_triggered() [L405] COND FALSE !(\read(tmp)) VAL [E_1=1, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2] [L411] CALL, EXPR is_transmit1_triggered() [L172] int __retres1 ; VAL [E_1=1, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2] [L175] COND TRUE t1_pc == 1 VAL [E_1=1, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2] [L176] COND TRUE E_1 == 1 [L177] __retres1 = 1 VAL [E_1=1, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, __retres1=1, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2] [L187] return (__retres1); VAL [E_1=1, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \result=1, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2] [L411] RET, EXPR is_transmit1_triggered() [L411] tmp___0 = is_transmit1_triggered() [L413] COND TRUE \read(tmp___0) [L414] t1_st = 0 VAL [E_1=1, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=1, t2_st=2] [L419] CALL, EXPR is_transmit2_triggered() [L191] int __retres1 ; VAL [E_1=1, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=1, t2_st=2] [L194] COND TRUE t2_pc == 1 VAL [E_1=1, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=1, t2_st=2] [L195] COND FALSE !(E_2 == 1) VAL [E_1=1, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=1, t2_st=2] [L204] __retres1 = 0 VAL [E_1=1, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, __retres1=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=1, t2_st=2] [L206] return (__retres1); VAL [E_1=1, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \result=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=1, t2_st=2] [L419] RET, EXPR is_transmit2_triggered() [L419] tmp___1 = is_transmit2_triggered() [L421] COND FALSE !(\read(tmp___1)) VAL [E_1=1, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=1, t2_st=2] [L435] RET activate_threads() VAL [E_1=1, E_2=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=1, t2_st=2] [L62] RET immediate_notify() VAL [E_1=1, E_2=2, M_E=2, T1_E=2, T2_E=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=1, t2_st=2] [L63] E_1 = 2 VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=1, t2_st=2] [L66] COND TRUE 1 VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=1, t2_st=2] [L68] m_pc = 1 [L69] m_st = 2 VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=1, t2_st=2] [L287] RET master() [L295] COND TRUE t1_st == 0 [L296] int tmp_ndt_2; [L297] tmp_ndt_2 = __VERIFIER_nondet_int() [L298] COND TRUE \read(tmp_ndt_2) [L300] t1_st = 1 [L301] CALL transmit1() [L88] COND FALSE !(t1_pc == 0) VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2] [L91] COND TRUE t1_pc == 1 VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2] [L107] E_2 = 1 VAL [E_1=2, E_2=1, M_E=2, T1_E=2, T2_E=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2] [L108] CALL immediate_notify() VAL [E_1=2, E_2=1, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2] [L435] CALL activate_threads() VAL [E_1=2, E_2=1, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2] [L397] int tmp ; [L398] int tmp___0 ; [L399] int tmp___1 ; [L403] CALL, EXPR is_master_triggered() [L153] int __retres1 ; VAL [E_1=2, E_2=1, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2] [L156] COND TRUE m_pc == 1 VAL [E_1=2, E_2=1, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2] [L157] COND FALSE !(M_E == 1) VAL [E_1=2, E_2=1, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2] [L166] __retres1 = 0 VAL [E_1=2, E_2=1, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, __retres1=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2] [L168] return (__retres1); VAL [E_1=2, E_2=1, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \result=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2] [L403] RET, EXPR is_master_triggered() [L403] tmp = is_master_triggered() [L405] COND FALSE !(\read(tmp)) VAL [E_1=2, E_2=1, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2] [L411] CALL, EXPR is_transmit1_triggered() [L172] int __retres1 ; VAL [E_1=2, E_2=1, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2] [L175] COND TRUE t1_pc == 1 VAL [E_1=2, E_2=1, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2] [L176] COND FALSE !(E_1 == 1) VAL [E_1=2, E_2=1, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2] [L185] __retres1 = 0 VAL [E_1=2, E_2=1, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, __retres1=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2] [L187] return (__retres1); VAL [E_1=2, E_2=1, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \result=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2] [L411] RET, EXPR is_transmit1_triggered() [L411] tmp___0 = is_transmit1_triggered() [L413] COND FALSE !(\read(tmp___0)) VAL [E_1=2, E_2=1, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2] [L419] CALL, EXPR is_transmit2_triggered() [L191] int __retres1 ; VAL [E_1=2, E_2=1, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2] [L194] COND TRUE t2_pc == 1 VAL [E_1=2, E_2=1, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2] [L195] COND TRUE E_2 == 1 [L196] __retres1 = 1 VAL [E_1=2, E_2=1, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, __retres1=1, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2] [L206] return (__retres1); VAL [E_1=2, E_2=1, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \result=1, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2] [L419] RET, EXPR is_transmit2_triggered() [L419] tmp___1 = is_transmit2_triggered() [L421] COND TRUE \read(tmp___1) [L422] t2_st = 0 VAL [E_1=2, E_2=1, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=0] [L435] RET activate_threads() VAL [E_1=2, E_2=1, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=0] [L108] RET immediate_notify() VAL [E_1=2, E_2=1, M_E=2, T1_E=2, T2_E=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=0] [L109] E_2 = 2 VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=0] [L99] COND TRUE 1 VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=0] [L101] t1_pc = 1 [L102] t1_st = 2 VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=0] [L301] RET transmit1() [L309] COND TRUE t2_st == 0 [L310] int tmp_ndt_3; [L311] tmp_ndt_3 = __VERIFIER_nondet_int() [L312] COND TRUE \read(tmp_ndt_3) [L314] t2_st = 1 [L315] CALL transmit2() [L123] COND FALSE !(t2_pc == 0) VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1] [L126] COND TRUE t2_pc == 1 VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1] [L142] CALL error() [L21] reach_error() VAL [E_1=2, E_2=2, M_E=2, T1_E=2, T2_E=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 131 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 34.1s, OverallIterations: 26, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 18.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 9047 SdHoareTripleChecker+Valid, 6.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 8848 mSDsluCounter, 11579 SdHoareTripleChecker+Invalid, 5.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7406 mSDsCounter, 1187 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 9464 IncrementalHoareTripleChecker+Invalid, 10651 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1187 mSolverCounterUnsat, 4173 mSDtfsCounter, 9464 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1597 GetRequests, 1349 SyntacticMatches, 0 SemanticMatches, 248 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 592 ImplicationChecksByTransitivity, 2.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=19280occurred in iteration=20, InterpolantAutomatonStates: 229, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 10.0s AutomataMinimizationTime, 25 MinimizatonAttempts, 9858 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 3675 NumberOfCodeBlocks, 3675 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 3481 ConstructedInterpolants, 0 QuantifiedInterpolants, 6929 SizeOfPredicates, 0 NumberOfNonLiveVariables, 2696 ConjunctsInSsa, 18 ConjunctsInUnsatCore, 32 InterpolantComputations, 25 PerfectInterpolantSequences, 964/1089 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-11-07 00:00:04,606 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE